Unnamed: 0 int64 0 350k | level_0 int64 0 351k | ApplicationNumber int64 9.75M 96.1M | ArtUnit int64 1.6k 3.99k | Abstract stringlengths 1 8.37k | Claims stringlengths 3 292k | abstract-claims stringlengths 68 293k | TechCenter int64 1.6k 3.9k |
|---|---|---|---|---|---|---|---|
5,500 | 5,500 | 14,724,857 | 2,163 | A method and system for combining, communicating, storing and/or separating image data and non-image data. The method involves a computer programmed to identify an end-of-file (EOF) marker of an image file, and being programmed to add the non-image data to the image file after the EOF marker. | 1. A method of presenting a combined image and non-image data file comprising the steps of:
receiving a combined image and non-image data file by at least one computer, the combined image and non-image data file having a quantity of image data, and a quantity of non-image data, the non-image data comprising an encrypted data file container containing at least a non-image file, the data file container being the non-image data combined with the image data, and being written to the combined image and non-image file immediately after an end-of-file marker of the quantity of image data; reading the combined image and non-image data file by the at least one computer to identify the image file portion, the reading being performed starting at a beginning of the combined image and non-image file and ending at the end-of-file marker of the quantity of image data; the quantity read from beginning to the end-of-file marker being the image file; reading the combined image and non-image data file by the at least one computer to identify the non-image file portion, the reading being performed starting immediately after the end-of-file marker of the image file, and ending at an end of the combined image and non-image data file; decrypting the encrypted data file container; extracting the non-image file from the data file container based on information contained in the data file container; presenting the image file using a display of the at least one computer; and presenting the non-image file using the at least one computer at the same time as the presenting of the image file. 2. The method of presenting a combined image and non-image data file of claim 1 wherein the non-image data is a data file container comprising a first data file and a second data file, further comprising the steps of:
separating the non-image file into the first data file and the second data file using the at least one computer;
presenting the first data file using the at least one computer; and
presenting the second data file using the at least one computer. 3. The method of presenting a combined image and non-image data file of claim 1 wherein the non-image file is an audio file, and wherein the step of presenting the non-image file using the at least one computer comprises playing the audio file through a speaker in communication with the at least one computer. 4. The method of presenting a combined image and non-image data file of claim 1 wherein the data file container further contains information allowing the computer to later separate the data file container into the first non-image file. 5. The method of presenting a combined image and non-image data file of claim 1 wherein the non-image file is a text file. 6. The method of presenting a combined image and non-image data file of claim 1 wherein the at least one computer is a smart phone. 7. A method of separating a combined image and non-image data file comprising the steps of:
receiving a combined image and non-image data file by a computer, the image and non-image data file having a quantity of image data, and a quantity of non-image data, the non-image data comprising a data file container containing at least a first non-image file, and being written to the image and non-image data file immediately after an end-of-file marker of the image data, at least one of the combined image and non-image data file, quantity of image data, and quantity of non-image data being encrypted; decrypting the encrypted at least one of the combined image and non-image data file, quantity of image data, and quantity of non-image data; reading the combined image and non-image data file by the computer to identify the image file data portion, the reading being performed starting at a beginning of the image and non-image data file and ending at the end-of-file marker of the image data, the quantity read from beginning to the end-of-file marker being identified by the computer as the image file; saving the read and identified image file data as an image file using the computer on a file system of the computer; reading the combined image and non-image data file by the computer to identify the non-image data file portion, the reading being performed starting immediately after the end-of-file marker of the image file, and ending at an end of the combined image and non-image data file; extracting the first non-image file from the data file container based on information contained in the data file container; saving the read and identified first non-image file using the computer on a file system of the computer; and presenting the image file and the first non-image file simultaneously using the computer. 8. The method of separating a combined image and non-image data file of claim 7 wherein the data file container comprises the first non-image file and a second non-image file, and comprising the steps of:
separating the data file container into the first non-image file and the second non-image file using the computer; and
saving the second non-image file using the computer on the file system of the computer. 9. The method of separating a combined image and non-image data file of claim 7 wherein the first non-image file is an audio file, and wherein the step of saving the read and identified non-image file data comprises saving the non-image file data as an audio file using the computer on the file system of the computer. 10. The method of separating a combined image and non-image data file of claim 7 wherein the data file container further contains information allowing the computer to later separate the data file container into the first non-image file. 11. The method of separating a combined image and non-image data file of claim 7 wherein the non-image file is a text file. 12. The method of separating a combined image and non-image data file of claim 7 wherein the computer is a smart phone. 13. A non-transitory computer readable medium comprising a combined image and non-image file, the combined image and non-image file comprising:
a quantity of image data, and a quantity of non-image data, the non-image data comprising a data file container containing at least a first non-image file, and being written to the image and non-image data file immediately after an end-of-file marker of the image data, at least one of the combined image and non-image data file, quantity of image data, and quantity of non-image data being encrypted;
the non-transitory computer readable medium configured to instruct a computer to carry out the steps of:
decrypting the encrypted at least one of the combined image and non-image data file, quantity of image data, and quantity of non-image data; reading the combined image and non-image data file by the computer to identify the image file data portion, the reading being performed starting at a beginning of the image and non-image data file and ending at the end-of-file marker of the image data, the quantity read from beginning to the end-of-file marker being identified by the computer as the image file; saving the read and identified image file data as an image file using the computer on a file system of the computer; reading the combined image and non-image data file by the computer to identify the non-image data file portion, the reading being performed starting immediately after the end-of-file marker of the image file, and ending at an end of the combined image and non-image data file; extracting the first non-image file from the data file container based on information contained in the data file container; and saving the read and identified first non-image file using the computer on a file system of the computer. 14. The non-transitory computer readable medium of claim 13 wherein the non-transitory computer readable medium is further configured to instruct a computer to carry out the step of presenting the image file and the first non-image file simultaneously using the computer. 15. The non-transitory computer readable medium of claim 13 wherein the data file container comprises the first non-image file and a second non-image file. | A method and system for combining, communicating, storing and/or separating image data and non-image data. The method involves a computer programmed to identify an end-of-file (EOF) marker of an image file, and being programmed to add the non-image data to the image file after the EOF marker.1. A method of presenting a combined image and non-image data file comprising the steps of:
receiving a combined image and non-image data file by at least one computer, the combined image and non-image data file having a quantity of image data, and a quantity of non-image data, the non-image data comprising an encrypted data file container containing at least a non-image file, the data file container being the non-image data combined with the image data, and being written to the combined image and non-image file immediately after an end-of-file marker of the quantity of image data; reading the combined image and non-image data file by the at least one computer to identify the image file portion, the reading being performed starting at a beginning of the combined image and non-image file and ending at the end-of-file marker of the quantity of image data; the quantity read from beginning to the end-of-file marker being the image file; reading the combined image and non-image data file by the at least one computer to identify the non-image file portion, the reading being performed starting immediately after the end-of-file marker of the image file, and ending at an end of the combined image and non-image data file; decrypting the encrypted data file container; extracting the non-image file from the data file container based on information contained in the data file container; presenting the image file using a display of the at least one computer; and presenting the non-image file using the at least one computer at the same time as the presenting of the image file. 2. The method of presenting a combined image and non-image data file of claim 1 wherein the non-image data is a data file container comprising a first data file and a second data file, further comprising the steps of:
separating the non-image file into the first data file and the second data file using the at least one computer;
presenting the first data file using the at least one computer; and
presenting the second data file using the at least one computer. 3. The method of presenting a combined image and non-image data file of claim 1 wherein the non-image file is an audio file, and wherein the step of presenting the non-image file using the at least one computer comprises playing the audio file through a speaker in communication with the at least one computer. 4. The method of presenting a combined image and non-image data file of claim 1 wherein the data file container further contains information allowing the computer to later separate the data file container into the first non-image file. 5. The method of presenting a combined image and non-image data file of claim 1 wherein the non-image file is a text file. 6. The method of presenting a combined image and non-image data file of claim 1 wherein the at least one computer is a smart phone. 7. A method of separating a combined image and non-image data file comprising the steps of:
receiving a combined image and non-image data file by a computer, the image and non-image data file having a quantity of image data, and a quantity of non-image data, the non-image data comprising a data file container containing at least a first non-image file, and being written to the image and non-image data file immediately after an end-of-file marker of the image data, at least one of the combined image and non-image data file, quantity of image data, and quantity of non-image data being encrypted; decrypting the encrypted at least one of the combined image and non-image data file, quantity of image data, and quantity of non-image data; reading the combined image and non-image data file by the computer to identify the image file data portion, the reading being performed starting at a beginning of the image and non-image data file and ending at the end-of-file marker of the image data, the quantity read from beginning to the end-of-file marker being identified by the computer as the image file; saving the read and identified image file data as an image file using the computer on a file system of the computer; reading the combined image and non-image data file by the computer to identify the non-image data file portion, the reading being performed starting immediately after the end-of-file marker of the image file, and ending at an end of the combined image and non-image data file; extracting the first non-image file from the data file container based on information contained in the data file container; saving the read and identified first non-image file using the computer on a file system of the computer; and presenting the image file and the first non-image file simultaneously using the computer. 8. The method of separating a combined image and non-image data file of claim 7 wherein the data file container comprises the first non-image file and a second non-image file, and comprising the steps of:
separating the data file container into the first non-image file and the second non-image file using the computer; and
saving the second non-image file using the computer on the file system of the computer. 9. The method of separating a combined image and non-image data file of claim 7 wherein the first non-image file is an audio file, and wherein the step of saving the read and identified non-image file data comprises saving the non-image file data as an audio file using the computer on the file system of the computer. 10. The method of separating a combined image and non-image data file of claim 7 wherein the data file container further contains information allowing the computer to later separate the data file container into the first non-image file. 11. The method of separating a combined image and non-image data file of claim 7 wherein the non-image file is a text file. 12. The method of separating a combined image and non-image data file of claim 7 wherein the computer is a smart phone. 13. A non-transitory computer readable medium comprising a combined image and non-image file, the combined image and non-image file comprising:
a quantity of image data, and a quantity of non-image data, the non-image data comprising a data file container containing at least a first non-image file, and being written to the image and non-image data file immediately after an end-of-file marker of the image data, at least one of the combined image and non-image data file, quantity of image data, and quantity of non-image data being encrypted;
the non-transitory computer readable medium configured to instruct a computer to carry out the steps of:
decrypting the encrypted at least one of the combined image and non-image data file, quantity of image data, and quantity of non-image data; reading the combined image and non-image data file by the computer to identify the image file data portion, the reading being performed starting at a beginning of the image and non-image data file and ending at the end-of-file marker of the image data, the quantity read from beginning to the end-of-file marker being identified by the computer as the image file; saving the read and identified image file data as an image file using the computer on a file system of the computer; reading the combined image and non-image data file by the computer to identify the non-image data file portion, the reading being performed starting immediately after the end-of-file marker of the image file, and ending at an end of the combined image and non-image data file; extracting the first non-image file from the data file container based on information contained in the data file container; and saving the read and identified first non-image file using the computer on a file system of the computer. 14. The non-transitory computer readable medium of claim 13 wherein the non-transitory computer readable medium is further configured to instruct a computer to carry out the step of presenting the image file and the first non-image file simultaneously using the computer. 15. The non-transitory computer readable medium of claim 13 wherein the data file container comprises the first non-image file and a second non-image file. | 2,100 |
5,501 | 5,501 | 13,926,889 | 2,159 | Data is received by a content management system that identifies a first document managed by the content management system. Thereafter, the first document is associated with a first user that authored or edited the first document. Subsequently, the first user is associated with at least one chained document different from the first document that has at least one pre-defined attribute associated with the first user. Data can then be provided that characterizes the at least one chained document. Related apparatus, systems, techniques and articles are also described. | 1. A computer-implemented method comprising:
receiving data, by a content management system, identifying a first document managed by the content management system; first associating, by the content management system, the document with a first user that authored or edited the first document; second associating, by the content management system, the first user with at least one chained document different from the first document, the at least one chained document has at least one pre-defined attribute associated with the first user; and providing data characterizing the at least one chained document. 2. A method as in claim 1, wherein the at least one first attribute comprises the first user having indicated as being a favorite document. 3. A method as in claim 1, wherein the at least one first attribute is selected from a group consisting of: the first user accessed the chained document, the first user edited the chained document, and the first user generated the first document. 4. A method as in claim 1, wherein there are a plurality of chained documents and the chained documents are presented to a user according to a ranking. 5. A method as in claim 4, wherein the ranking is based on a time at which each document was indicated as being a favorite document for the first user. 6. A method as in claim 4, wherein the ranking is based on a time at which each document was generated. 7. A method as in claim 4, wherein the ranking is based on a time at which each document was last accessed. 8. A method as in claim 4, wherein the ranking is based on a number of times that each document was accessed. 9. A method as in claim 4, wherein the ranking is based on a time at which each document was last edited. 10. A method as in claim 1, further comprising:
receiving user-generated input specifying at least one keyword or search filter; and filtering the at least one chained document to include only those documents associated with the at least one keyword or search filter. 11. A method as in claim 1, further comprising:
preventing access to documents for which the user does not have authorization to access. 12. A method as in claim 1, wherein the content management system comprises at least one data processor and at least one database for storing the plurality of documents. 13. A method as in claim 1, wherein providing data comprises one or more of: displaying the data, transmitting the data to a remote server, loading the data into memory, and storing the data. 14. A non-transitory computer program product storing instructions, which when executed by at least one data processor of at least one computing system, result in operations comprising:
receiving data, by a content management system, identifying a first document managed by the content management system; first associating, by the content management system, the document with a first user that authored or edited the first document; second associating, by the content management system, the first user with at least one chained document different from the first document, the at least one chained document has at least one pre-defined attribute associated with the first user; and providing data characterizing the at least one chained document. 15. A computer program product as in claim 14, wherein the at least one first attribute comprises the first user having indicated as being a favorite document. 16. A computer program product as in claim 14, wherein the at least one first attribute is selected from a group consisting of: the first user accessed the chained document, the first user edited the chained document, and the first user generated the first document. 17. A computer program product as in claim 14, wherein there are a plurality of chained documents and the chained documents are presented to a user according to a ranking. 18. A computer program product as in claim 17, wherein the ranking is based on a factor selected from a group consisting of: a time at which each document was indicated as being a favorite document for the first user, a time at which each document was generated, a time at which each document was last accessed, a number of times that each document was accessed, a time at which each document was last edited. 19. A computer program product as in claim 14, further comprising:
receiving user-generated input specifying at least one keyword or search filter; and filtering the at least one chained document to include only those documents associated with the at least one keyword or search filter. 20. A content management system comprising:
at least one data processor; and memory storing instructions, which when executed by the at least one data, result in operations comprising: receiving data identifying a first document managed by the content management system; first associating the document with a first user that authored or edited the first document; second associating the first user with at least one chained document different from the first document, the at least one chained document has at least one pre-defined attribute associated with the first user; and providing data characterizing the at least one chained document. | Data is received by a content management system that identifies a first document managed by the content management system. Thereafter, the first document is associated with a first user that authored or edited the first document. Subsequently, the first user is associated with at least one chained document different from the first document that has at least one pre-defined attribute associated with the first user. Data can then be provided that characterizes the at least one chained document. Related apparatus, systems, techniques and articles are also described.1. A computer-implemented method comprising:
receiving data, by a content management system, identifying a first document managed by the content management system; first associating, by the content management system, the document with a first user that authored or edited the first document; second associating, by the content management system, the first user with at least one chained document different from the first document, the at least one chained document has at least one pre-defined attribute associated with the first user; and providing data characterizing the at least one chained document. 2. A method as in claim 1, wherein the at least one first attribute comprises the first user having indicated as being a favorite document. 3. A method as in claim 1, wherein the at least one first attribute is selected from a group consisting of: the first user accessed the chained document, the first user edited the chained document, and the first user generated the first document. 4. A method as in claim 1, wherein there are a plurality of chained documents and the chained documents are presented to a user according to a ranking. 5. A method as in claim 4, wherein the ranking is based on a time at which each document was indicated as being a favorite document for the first user. 6. A method as in claim 4, wherein the ranking is based on a time at which each document was generated. 7. A method as in claim 4, wherein the ranking is based on a time at which each document was last accessed. 8. A method as in claim 4, wherein the ranking is based on a number of times that each document was accessed. 9. A method as in claim 4, wherein the ranking is based on a time at which each document was last edited. 10. A method as in claim 1, further comprising:
receiving user-generated input specifying at least one keyword or search filter; and filtering the at least one chained document to include only those documents associated with the at least one keyword or search filter. 11. A method as in claim 1, further comprising:
preventing access to documents for which the user does not have authorization to access. 12. A method as in claim 1, wherein the content management system comprises at least one data processor and at least one database for storing the plurality of documents. 13. A method as in claim 1, wherein providing data comprises one or more of: displaying the data, transmitting the data to a remote server, loading the data into memory, and storing the data. 14. A non-transitory computer program product storing instructions, which when executed by at least one data processor of at least one computing system, result in operations comprising:
receiving data, by a content management system, identifying a first document managed by the content management system; first associating, by the content management system, the document with a first user that authored or edited the first document; second associating, by the content management system, the first user with at least one chained document different from the first document, the at least one chained document has at least one pre-defined attribute associated with the first user; and providing data characterizing the at least one chained document. 15. A computer program product as in claim 14, wherein the at least one first attribute comprises the first user having indicated as being a favorite document. 16. A computer program product as in claim 14, wherein the at least one first attribute is selected from a group consisting of: the first user accessed the chained document, the first user edited the chained document, and the first user generated the first document. 17. A computer program product as in claim 14, wherein there are a plurality of chained documents and the chained documents are presented to a user according to a ranking. 18. A computer program product as in claim 17, wherein the ranking is based on a factor selected from a group consisting of: a time at which each document was indicated as being a favorite document for the first user, a time at which each document was generated, a time at which each document was last accessed, a number of times that each document was accessed, a time at which each document was last edited. 19. A computer program product as in claim 14, further comprising:
receiving user-generated input specifying at least one keyword or search filter; and filtering the at least one chained document to include only those documents associated with the at least one keyword or search filter. 20. A content management system comprising:
at least one data processor; and memory storing instructions, which when executed by the at least one data, result in operations comprising: receiving data identifying a first document managed by the content management system; first associating the document with a first user that authored or edited the first document; second associating the first user with at least one chained document different from the first document, the at least one chained document has at least one pre-defined attribute associated with the first user; and providing data characterizing the at least one chained document. | 2,100 |
5,502 | 5,502 | 14,858,725 | 2,143 | Flight deck display systems and methods for generating cockpit displays including dynamic taxi turnoff icons are provided. In one embodiment, the flight deck display system includes a display device, a memory storing an airport map database, and a controller operably coupled to the display device and to the memory. The controller is configured to recall information from the airport map database pertaining to a runway cleared for usage by the aircraft. The controller further identifies a taxi exit along the runway based, at least in part, on the information recalled from the airport map database. The controller then generates a dynamic taxi turnoff icon on the display device including symbology representative of the runway and the location of the taxi exit along the runway. | 1. A flight deck display system for deployment onboard an aircraft, the flight deck display system comprising:
a display device; a memory storing an airport map database; and a controller operably coupled to the display device and to the memory, the controller configured to:
recall information from the airport map database pertaining to a runway cleared for usage by the aircraft;
identify a taxi exit along the runway based, at least in part, on the information recalled from the airport map database; and
generate a dynamic taxi turnoff icon on the display device including symbology representative of the runway and the location of the taxi exit along the runway. 2. The flight deck display system of claim 1 wherein the controller is further configured to generate a perspective view display on the display device over which the dynamic taxi turnoff icon is superimposed. 3. The flight deck display system of claim 2 wherein the perspective display comprises a Primary Flight Display including a movable Flight Path Marker (FPM), and wherein the controller generates the dynamic taxi turnoff icon to have a positioned fixed with respect to the movable FPM. 4. The flight deck display system of claim 3 wherein the controller is further configured to:
generate the dynamic taxi turnoff icon at a position adjacent and generally below the movable FPM when the aircraft is cleared to land at the runway; and
generate the dynamic taxi turnoff icon at a position adjacent and generally above the movable FPM when the aircraft is cleared to takeoff from the runway. 5. The flight deck display system of claim 1 wherein, when the runway cleared for usage by the aircraft includes multiple taxi exits, the controller is further configured to:
identify a planned taxi exit from among the multiple taxi exits; and
generate the dynamic taxi turnoff icon to visually distinguish the planned taxi exit from the other taxi exits included in the multiple taxi exits. 6. The flight deck display system of claim 5 wherein the controller is further configured to:
identify an auxiliary taxi exit from among the multiple taxi exits; and
generate the dynamic taxi turnoff icon to include a symbol representative of the auxiliary taxi exit. 7. The flight deck display system of claim 1 further comprising an ownship data source configured to monitor the position of the aircraft, the controller coupled to the ownship data source and configured to generate the dynamic taxi turnoff icon to further include symbology representative of the current aircraft position along the runway. 8. The flight deck display system of claim 7 wherein the controller generates the symbology representative of the runway, the taxi exit, and the current aircraft position as two dimensional graphics. 9. The flight deck display system of claim 1 wherein the controller is further configured to:
establish a maximum turnoff speed (TSMAX) for the taxi exit; and
generate the dynamic taxi turnoff icon to include a TSMAX marker identifying a point along the runway at which the aircraft speed is projected to decline to TSMAX. 10. The flight deck display system of claim 9 further comprising an autobrake system operably coupled to the controller and to which the controller supplies data indicative of at least one of TSMAX and the position of the TSMAX marker along the runway, the autobrake system configured to slow the aircraft in accordance with the data received from the controller prior to turnoff of the aircraft at the taxi exit. 11. The flight deck display system of claim 9 wherein the controller establishes TSMAX for the taxi exit by recalling from the memory a TSMAX value assigned to the runway cleared for usage by the aircraft. 12. The flight deck display system of claim 9 wherein the controller is configured to alter the appearance of the TSMAX marker if the separation between the point along the runway at which the aircraft speed is projected to decline to TSMAX and the taxi exit exceeds a predetermined threshold. 13. The flight deck display system of claim 9 wherein the controller is further configured to dynamically adjust the position of the TSMAX marker in response to a change in taxi exits at which the aircraft is expected to turn. 14. The flight deck display system of claim 1 wherein the controller is further configured to:
calculate a predicted stopping distance of the aircraft along the runway; and
generate the dynamic taxi turnoff icon to include symbology identifying the predicted stopping distance on the runway graphic. 15. A flight deck display system for deployment onboard an aircraft, the flight deck display system comprising:
a display device; an ownship data source configured to monitor the current position of the aircraft; and a controller coupled to the display device and to the ownship data source, the controller configured to:
generate three dimensional Primary Flight Display (PFD) on the display device; and
superimpose a two dimensional icon on the three dimensional PFD including a runway symbol representing a runway cleared for usage by the aircraft and an aircraft symbol representing the current position of the aircraft on the runway. 16. The flight deck display system of claim 15 wherein the controller is further configured to generate the two dimensional icon to include at least one taxi exit symbol representative of a taxi exit along the runway. 17. The flight deck display system of claim 16 wherein, when the runway has multiple taxi exits, the controller is configured to identify a planned taxi exit and generate the two dimensional icon to visually distinguish the planned taxi exit from the other taxi exits. 18. The flight deck display system of claim 14 wherein the controller generates the three dimensional PFD to include a movable Flight Path Marker (FPM), and wherein the controller generates the two dimensional icon to have a first fixed positioning with respect to the FPM when the aircraft is cleared for takeoff from the runway and to have a second, different fixed positioning with respect to the FPM when the aircraft is cleared for landing at the runway. 19. The flight deck display system of claim 15 wherein the controller is further configured to:
establish a maximum turnoff speed (TSMAX) for the taxi exit; and
generate the two dimensional icon to include a TSMAX marker identifying a point along the runway at which the aircraft speed is projected to decline to TSMAX. 20. A method carried-out by the flight deck display system of an aircraft, the flight deck display system including a display device, a memory storing an airport map database, and a controller operably coupled to the display device and to the memory, the method comprising:
recalling information from the airport map database pertaining to a runway cleared for usage by the aircraft; at the controller, identifying a taxi exit along the runway based on the information recalled from the airport map database; and generating a three dimensional Primary Flight Display (PFD) on the display device; and superimposing a two dimensional dynamic taxi turnoff icon over the three dimensional PFD, the two dimensional dynamic taxi turnoff icon including symbology representative of the runway and the location of the taxi exit along the runway. | Flight deck display systems and methods for generating cockpit displays including dynamic taxi turnoff icons are provided. In one embodiment, the flight deck display system includes a display device, a memory storing an airport map database, and a controller operably coupled to the display device and to the memory. The controller is configured to recall information from the airport map database pertaining to a runway cleared for usage by the aircraft. The controller further identifies a taxi exit along the runway based, at least in part, on the information recalled from the airport map database. The controller then generates a dynamic taxi turnoff icon on the display device including symbology representative of the runway and the location of the taxi exit along the runway.1. A flight deck display system for deployment onboard an aircraft, the flight deck display system comprising:
a display device; a memory storing an airport map database; and a controller operably coupled to the display device and to the memory, the controller configured to:
recall information from the airport map database pertaining to a runway cleared for usage by the aircraft;
identify a taxi exit along the runway based, at least in part, on the information recalled from the airport map database; and
generate a dynamic taxi turnoff icon on the display device including symbology representative of the runway and the location of the taxi exit along the runway. 2. The flight deck display system of claim 1 wherein the controller is further configured to generate a perspective view display on the display device over which the dynamic taxi turnoff icon is superimposed. 3. The flight deck display system of claim 2 wherein the perspective display comprises a Primary Flight Display including a movable Flight Path Marker (FPM), and wherein the controller generates the dynamic taxi turnoff icon to have a positioned fixed with respect to the movable FPM. 4. The flight deck display system of claim 3 wherein the controller is further configured to:
generate the dynamic taxi turnoff icon at a position adjacent and generally below the movable FPM when the aircraft is cleared to land at the runway; and
generate the dynamic taxi turnoff icon at a position adjacent and generally above the movable FPM when the aircraft is cleared to takeoff from the runway. 5. The flight deck display system of claim 1 wherein, when the runway cleared for usage by the aircraft includes multiple taxi exits, the controller is further configured to:
identify a planned taxi exit from among the multiple taxi exits; and
generate the dynamic taxi turnoff icon to visually distinguish the planned taxi exit from the other taxi exits included in the multiple taxi exits. 6. The flight deck display system of claim 5 wherein the controller is further configured to:
identify an auxiliary taxi exit from among the multiple taxi exits; and
generate the dynamic taxi turnoff icon to include a symbol representative of the auxiliary taxi exit. 7. The flight deck display system of claim 1 further comprising an ownship data source configured to monitor the position of the aircraft, the controller coupled to the ownship data source and configured to generate the dynamic taxi turnoff icon to further include symbology representative of the current aircraft position along the runway. 8. The flight deck display system of claim 7 wherein the controller generates the symbology representative of the runway, the taxi exit, and the current aircraft position as two dimensional graphics. 9. The flight deck display system of claim 1 wherein the controller is further configured to:
establish a maximum turnoff speed (TSMAX) for the taxi exit; and
generate the dynamic taxi turnoff icon to include a TSMAX marker identifying a point along the runway at which the aircraft speed is projected to decline to TSMAX. 10. The flight deck display system of claim 9 further comprising an autobrake system operably coupled to the controller and to which the controller supplies data indicative of at least one of TSMAX and the position of the TSMAX marker along the runway, the autobrake system configured to slow the aircraft in accordance with the data received from the controller prior to turnoff of the aircraft at the taxi exit. 11. The flight deck display system of claim 9 wherein the controller establishes TSMAX for the taxi exit by recalling from the memory a TSMAX value assigned to the runway cleared for usage by the aircraft. 12. The flight deck display system of claim 9 wherein the controller is configured to alter the appearance of the TSMAX marker if the separation between the point along the runway at which the aircraft speed is projected to decline to TSMAX and the taxi exit exceeds a predetermined threshold. 13. The flight deck display system of claim 9 wherein the controller is further configured to dynamically adjust the position of the TSMAX marker in response to a change in taxi exits at which the aircraft is expected to turn. 14. The flight deck display system of claim 1 wherein the controller is further configured to:
calculate a predicted stopping distance of the aircraft along the runway; and
generate the dynamic taxi turnoff icon to include symbology identifying the predicted stopping distance on the runway graphic. 15. A flight deck display system for deployment onboard an aircraft, the flight deck display system comprising:
a display device; an ownship data source configured to monitor the current position of the aircraft; and a controller coupled to the display device and to the ownship data source, the controller configured to:
generate three dimensional Primary Flight Display (PFD) on the display device; and
superimpose a two dimensional icon on the three dimensional PFD including a runway symbol representing a runway cleared for usage by the aircraft and an aircraft symbol representing the current position of the aircraft on the runway. 16. The flight deck display system of claim 15 wherein the controller is further configured to generate the two dimensional icon to include at least one taxi exit symbol representative of a taxi exit along the runway. 17. The flight deck display system of claim 16 wherein, when the runway has multiple taxi exits, the controller is configured to identify a planned taxi exit and generate the two dimensional icon to visually distinguish the planned taxi exit from the other taxi exits. 18. The flight deck display system of claim 14 wherein the controller generates the three dimensional PFD to include a movable Flight Path Marker (FPM), and wherein the controller generates the two dimensional icon to have a first fixed positioning with respect to the FPM when the aircraft is cleared for takeoff from the runway and to have a second, different fixed positioning with respect to the FPM when the aircraft is cleared for landing at the runway. 19. The flight deck display system of claim 15 wherein the controller is further configured to:
establish a maximum turnoff speed (TSMAX) for the taxi exit; and
generate the two dimensional icon to include a TSMAX marker identifying a point along the runway at which the aircraft speed is projected to decline to TSMAX. 20. A method carried-out by the flight deck display system of an aircraft, the flight deck display system including a display device, a memory storing an airport map database, and a controller operably coupled to the display device and to the memory, the method comprising:
recalling information from the airport map database pertaining to a runway cleared for usage by the aircraft; at the controller, identifying a taxi exit along the runway based on the information recalled from the airport map database; and generating a three dimensional Primary Flight Display (PFD) on the display device; and superimposing a two dimensional dynamic taxi turnoff icon over the three dimensional PFD, the two dimensional dynamic taxi turnoff icon including symbology representative of the runway and the location of the taxi exit along the runway. | 2,100 |
5,503 | 5,503 | 14,948,438 | 2,152 | Access control list entries are managed as a function of access control list entry metadata for the object and the requesting user, and of an access control list rule applicable to the requesting user and the requested object. The access control list entry metadata for the object and the user is updated in response to request authorizations and denials. The access control list entry metadata for the object and the user is linked to the object and the user. Updating of the access control list entry metadata for the object and the user does not overwrite metadata for another access control list entry that is associated with the object and with another user that is different from the user. | 1. A computer-implemented method for managing access control list entries as a function of user-specific object access data, the method comprising executing on a processor the steps of:
defining, for each of a plurality of different users of a file system object, a plurality of access control list entries that comprises an atime access control list time metadata entry, an mtime access control list modification time metadata entry, a dtime duration constraint metadata entry, a vtime valid time entry metadata entry and an nuse access control list access count metadata entry, wherein an access control list entry is only valid for a specific length of time after a first access time that is indicated by the vtime metadata entry; in response to receiving a request from a requesting user of the plurality of different users to access the file system object, determining whether the request is authorized for access to the file system object as a function of the atime and mtime metadata entries for the file system object and the requesting user; and in response to determining that the request is authorized for access to the file system object as the function of the atime and mtime metadata entries for the object and the requesting user, granting access to the file system object by the requesting user to modify the file system object, updating the date/timestamp field of the atime metadata entry for the file system object and the requesting user to a date and time of granting the request, and incrementing the nuse metadata entry that is applicable to the requesting user and the file system object, without overwriting stored atime or nuse metadata entries that are associated with the file system object and with another user of the plurality of different users that is different from the requesting user. 2. The method of claim 1, further comprising:
integrating computer-readable program code into a computer system comprising a processor, a computer readable memory and a computer readable storage device; and wherein the computer readable program code is embodied on the computer readable storage device and comprises instructions for execution by the processor via the computer readable memory that cause the processor to perform the steps of defining the plurality of access control list entries, determining whether the request is authorized for access to the file system object as the function of the atime and mtime metadata entries for the file system object and the requesting user in response to receiving the request from the requesting user to access the file system object, and in response to determining that the request is authorized for access to the file system object granting access to the file system object by the requesting user to modify the file system object, updating the date/timestamp field of the atime metadata entry for the file system object and the requesting user, and incrementing the nuse metadata entry that is applicable to the requesting user and the file system object. 3. The method of claim 1, further comprising:
in response to determining that the requesting user modifies the object in response to the granted access of the object, updating the date/timestamp field of the mtime access control list metadata entry for the object and the requesting user to indicate a date and time of the object modification; and wherein the step determining whether the request is authorized for access to the object as the function of the atime and mtime metadata entries for the object and the requesting user comprises: determining whether the date and time of the request falls within a begin date and time of the dtime entry for the requesting user and the requested object and an end date and time of the dtime field for the requesting user and the requested object; and determining whether a first-modification time period is elapsed from a date and time of a first modification of the requested object by the requesting user that is indicated by a validity field within the vtime metadata entry for the requesting user and the requested object, to the date and time of the request. 4. The method of claim 3, further comprising:
in response to determining that the date and time of the request falls within a begin date and time of a field and an end date and time of another field of the user access control list dtime entry for the requesting user and the file system object, granting access to the file system object by the requesting user for modification of the object; and in response to determining that the date and time of the request does not fall within a begin date and time of a field and an end date and time of another field of the user access control list dtime entry for the requesting user and the file system object, denying access to the file system object by the requesting user, invalidating the requesting user access control list entries for the file system object, and updating the date/timestamp field of the access control list atime metadata entry for the file system object and the requesting user to indicate the date and time of the request. 5. The method of claim 3, further comprising:
defining an itime inactivity time period metadata entry for the requesting user and the file system object that specifies an inactivity time period wherein a permission for access to the object by the requesting user expires upon an elapse of the inactivity time period; determining a last-modification time period elapsed since a date and time of a last modification of the object by the user that is indicated by the mtime metadata entry for the requesting user and the file system object; comparing the elapsed last-modification time period to the inactivity time period; in response to determining that the elapsed last-modification time period is less than the inactivity time period, granting access to the object by the user, and updating the access control list atime and mtime metadata entries for the requesting user and the file system object to indicate the date and time of the request; and in response to determining that the elapsed last-modification time period is not less than the inactivity time period, denying access to the file system object by the user and updating the access control list atime entry metadata for the file system object and the requesting user to indicate the date and time of the request. 6. The method of claim 3, further comprising:
comparing the elapsed first-modification time period to a validity time period of an access control list rule that is applicable to the requesting user and the file system object; in response to determining that the elapsed first-modification time period is less than the validity time period, granting access to the object by the requesting user for modification of the file system object and updating the access control list atime and mtime metadata entries for the object and the user to indicate the date and time of the request; and in response to determining that the elapsed first-modification time period is not less than the validity time period, denying access to the file system object by the requesting user and updating the access control list atime entry metadata for the file system object and the requesting user to indicate the date and time of the request. 7. The method of claim 3, further comprising:
comparing the incremented total number of accesses of the object by the user indicated by an access count field within the nuse metadata entry for the file system object and the requesting user to a specified threshold number of permitted accesses; in response to determining that the incremented total number of accesses of the object by the user indicated by the access count field within the nuse metadata entry for the requesting user and the object is less than the specified threshold number of permitted accesses, granting access to the object by the user for modification of the object and updating the date/timestamp fields of the access control list atime and mtime metadata entries for the object and the user to indicate the date and time of the request; and in response to determining that the incremented total number of accesses of the object by the user indicated by the access count field within the nuse metadata entry for the requesting user and the object is not less than the specified threshold number of permitted accesses: denying access to the file system object by the requesting user and updating the date/timestamp field of the access control list atime metadata entry for the object and the user to indicate the date and time of the request; or granting access to the file system object by the requesting user for modification of the object and updating the date/timestamp field of the access control list mtime metadata entry for the file system object and the requesting user with the date and time of the request. 8. 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: defines, for each of a plurality of different users of a file system object, a plurality of access control list entries that comprises an atime access control list time metadata entry, an mtime access control list modification time metadata entry, a dtime duration constraint metadata entry, a vtime valid time entry metadata entry and an nuse access control list access count metadata entry, wherein an access control list entry is only valid for a specific length of time after a first access time that is indicated by the vtime metadata entry; in response to receiving a request from a requesting user if the plurality of different users to access the file system object, determines whether the request is authorized for access to the file system object as a function of the atime and mtime metadata entries for the file system object and the requesting user; and in response to determining that the request is authorized for access to the file system object as the function of the atime and mtime metadata entries for the file system object and the requesting user, grants access to the file system object by the requesting user to modify the file system object, updates the date/timestamp field of the atime metadata entry for the file system object and the requesting user to a date and time of granting the request, and increments the nuse metadata entry that is applicable to the requesting user and the file system object, without overwriting stored atime or nuse metadata entries that are associated with the file system object and with another user of the plurality of different users that is different from the requesting user. 9. The system of claim 8, wherein the processor executes the program instructions stored on the computer-readable storage medium via the computer readable memory and thereby:
in response to determining that the requesting user modifies the object in response to the granted access of the object, updates the date/timestamp field of the mtime access control list metadata entry for the object and the requesting user to indicate a date and time of the object modification; and determines whether the request is authorized for access to the object as the function of the atime and mtime metadata entries for the object and the requesting user by: determining whether the date and time of the request falls within a begin date and time of the dtime entry for the requesting user and the requested object and an end date and time of the dtime field for the requesting user and the requested object; and determining whether a first-modification time period is elapsed from a date and time of a first modification of the requested object by the requesting user that is indicated by a validity field within the vtime metadata entry for the requesting user and the requested object, to the date and time of the request. 10. The system of claim 9, wherein the processor executes the program instructions stored on the computer-readable storage medium via the computer readable memory and thereby:
in response to determining that the date and time of the request falls within a begin date and time of a field and an end date and time of another field of the user access control list dtime entry for the requesting user and the file system object, grants access to the file system object by the requesting user for modification of the object; and in response to determining that the date and time of the request does not fall within a begin date and time of a field and an end date and time of another field of the user access control list dtime entry for the requesting user and the file system object, denies access to the file system object by the requesting user, invalidates the requesting user access control list entries for the file system object, and updates the date/timestamp field of the access control list atime metadata entry for the file system object and the requesting user to indicate the date and time of the request. 11. The system of claim 9, wherein the processor executes the program instructions stored on the computer-readable storage medium via the computer readable memory and thereby:
defines an itime inactivity time period metadata entry for the requesting user and the file system object that specifies an inactivity time period wherein a permission for access to the object by the requesting user expires upon an elapse of the inactivity time period; determines a last-modification time period elapsed since a date and time of a last modification of the object by the user that is indicated by the mtime metadata entry for the requesting user and the file system object; compares the elapsed last-modification time period to the inactivity time period; in response to determining that the elapsed last-modification time period is less than the inactivity time period, grants access to the object by the user, and updates the access control list atime and mtime metadata entries for the requesting user and the file system object to indicate the date and time of the request; and in response to determining that the elapsed last-modification time period is not less than the inactivity time period, denies access to the file system object by the user and updates the access control list atime entry metadata for the file system object and the requesting user to indicate the date and time of the request. 12. The system of claim 9, wherein the processor executes the program instructions stored on the computer-readable storage medium via the computer readable memory and thereby:
compares the elapsed first-modification time period to a validity time period of an access control list rule that is applicable to the requesting user and the file system object; in response to determining that the elapsed first-modification time period is less than the validity time period, grants access to the object by the requesting user for modification of the file system object and updates the access control list atime and mtime metadata entries for the object and the user to indicate the date and time of the request; and in response to determining that the elapsed first-modification time period is not less than the validity time period, denies access to the file system object by the requesting user and updates the access control list atime entry metadata for the file system object and the requesting user to indicate the date and time of the request. 13. The system of claim 9, wherein the processor executes the program instructions stored on the computer-readable storage medium via the computer readable memory and thereby:
compares the incremented total number of accesses of the object by the user indicated by an access count field within the nuse metadata entry for the file system object and the requesting user to a specified threshold number of permitted accesses; in response to determining that the incremented total number of accesses of the object by the user indicated by the access count field within the nuse metadata entry for the requesting user and the object is less than the specified threshold number of permitted accesses, grants access to the object by the user for modification of the object and updates the date/timestamp fields of the access control list atime and mtime metadata entries for the object and the user to indicate the date and time of the request; and in response to determining that the incremented total number of accesses of the object by the user indicated by the access count field within the nuse metadata entry for the requesting user and the object is not less than the specified threshold number of permitted accesses: denies access to the file system object by the requesting user and updates the date/timestamp field of the access control list atime metadata entry for the object and the user to indicate the date and time of the request; or grants access to the file system object by the requesting user for modification of the object and updates the date/timestamp field of the access control list mtime metadata entry for the file system object and the requesting user with the date and time of the request. 14. An article of manufacture, comprising:
a computer readable storage device having computer readable program code embodied therewith, the computer readable program code comprising instructions for execution by a computer processor that cause the computer processor to: define, for each of a plurality of different users of a file system object, a plurality of access control list entries that comprises an atime access control list time metadata entry, an mtime access control list modification time metadata entry, a dtime duration constraint metadata entry, a vtime valid time entry metadata entry and an nuse access control list access count metadata entry, wherein an access control list entry is only valid for a specific length of time after a first access time that is indicated by the vtime metadata entry; in response to receiving a request from a requesting user if the plurality of different users to access the file system object, determine whether the request is authorized for access to the file system object as a function of the atime and mtime metadata entries for the file system object and the requesting user; and in response to determining that the request is authorized for access to the file system object as the function of the atime and mtime metadata entries for the file system object and the requesting user, grant access to the file system object by the requesting user to modify the file system object, updates the date/timestamp field of the atime metadata entry for the file system object and the requesting user to a date and time of granting the request, and increment the nuse metadata entry that is applicable to the requesting user and the file system object, without overwriting stored atime or nuse metadata entries that are associated with the file system object and with another user of the plurality of different users that is different from the requesting user. 15. The computer program product of claim 14, wherein the computer readable program code instructions for execution by the processor further cause the processor to:
in response to determining that the requesting user modifies the object in response to the granted access of the object, update the date/timestamp field of the mtime access control list metadata entry for the object and the requesting user to indicate a date and time of the object modification; and determine whether the request is authorized for access to the object as the function of the atime and mtime metadata entries for the object and the requesting user by: determining whether the date and time of the request falls within a begin date and time of the dtime entry for the requesting user and the requested object and an end date and time of the dtime field for the requesting user and the requested object; and determining whether a first-modification time period is elapsed from a date and time of a first modification of the requested object by the requesting user that is indicated by a validity field within the vtime metadata entry for the requesting user and the requested object, to the date and time of the request. 16. The computer program product of claim 15, wherein the computer readable program code instructions for execution by the processor further cause the processor to:
in response to determining that the date and time of the request falls within a begin date and time of a field and an end date and time of another field of the user access control list dtime entry for the requesting user and the file system object, grant access to the file system object by the requesting user for modification of the object; and in response to determining that the date and time of the request does not fall within a begin date and time of a field and an end date and time of another field of the user access control list dtime entry for the requesting user and the file system object, deny access to the file system object by the requesting user, invalidate the requesting user access control list entries for the file system object, and update the date/timestamp field of the access control list atime metadata entry for the file system object and the requesting user to indicate the date and time of the request. 17. The computer program product of claim 15, wherein the computer readable program code instructions for execution by the processor further cause the processor to:
define an itime inactivity time period metadata entry for the requesting user and the file system object that specifies an inactivity time period wherein a permission for access to the object by the requesting user expires upon an elapse of the inactivity time period; determine a last-modification time period elapsed since a date and time of a last modification of the object by the user that is indicated by the mtime metadata entry for the requesting user and the file system object; compare the elapsed last-modification time period to the inactivity time period; in response to determining that the elapsed last-modification time period is less than the inactivity time period, grant access to the object by the user, and update the access control list atime and mtime metadata entries for the requesting user and the file system object to indicate the date and time of the request; and in response to determining that the elapsed last-modification time period is not less than the inactivity time period, deny access to the file system object by the user and update the access control list atime entry metadata for the file system object and the requesting user to indicate the date and time of the request. 18. The computer program product of claim 15, wherein the computer readable program code instructions for execution by the processor further cause the processor to:
compare the elapsed first-modification time period to a validity time period of an access control list rule that is applicable to the requesting user and the file system object; in response to determining that the elapsed first-modification time period is less than the validity time period, grant access to the object by the requesting user for modification of the file system object and update the access control list atime and mtime metadata entries for the object and the user to indicate the date and time of the request; and in response to determining that the elapsed first-modification time period is not less than the validity time period, deny access to the file system object by the requesting user and update the access control list atime entry metadata for the file system object and the requesting user to indicate the date and time of the request. 19. The computer program product of claim 15, wherein the computer readable program code instructions for execution by the processor further cause the processor to:
compare the incremented total number of accesses of the object by the user indicated by an access count field within the nuse metadata entry for the file system object and the requesting user to a specified threshold number of permitted accesses; in response to determining that the incremented total number of accesses of the object by the user indicated by the access count field within the nuse metadata entry for the requesting user and the object is less than the specified threshold number of permitted accesses, grant access to the object by the user for modification of the object and update the date/timestamp fields of the access control list atime and mtime metadata entries for the object and the user to indicate the date and time of the request; and in response to determining that the incremented total number of accesses of the object by the user indicated by the access count field within the nuse metadata entry for the requesting user and the object is not less than the specified threshold number of permitted accesses: deny access to the file system object by the requesting user and update the date/timestamp field of the access control list atime metadata entry for the object and the user to indicate the date and time of the request; or grant access to the file system object by the requesting user for modification of the object and update the date/timestamp field of the access control list mtime metadata entry for the file system object and the requesting user with the date and time of the request. | Access control list entries are managed as a function of access control list entry metadata for the object and the requesting user, and of an access control list rule applicable to the requesting user and the requested object. The access control list entry metadata for the object and the user is updated in response to request authorizations and denials. The access control list entry metadata for the object and the user is linked to the object and the user. Updating of the access control list entry metadata for the object and the user does not overwrite metadata for another access control list entry that is associated with the object and with another user that is different from the user.1. A computer-implemented method for managing access control list entries as a function of user-specific object access data, the method comprising executing on a processor the steps of:
defining, for each of a plurality of different users of a file system object, a plurality of access control list entries that comprises an atime access control list time metadata entry, an mtime access control list modification time metadata entry, a dtime duration constraint metadata entry, a vtime valid time entry metadata entry and an nuse access control list access count metadata entry, wherein an access control list entry is only valid for a specific length of time after a first access time that is indicated by the vtime metadata entry; in response to receiving a request from a requesting user of the plurality of different users to access the file system object, determining whether the request is authorized for access to the file system object as a function of the atime and mtime metadata entries for the file system object and the requesting user; and in response to determining that the request is authorized for access to the file system object as the function of the atime and mtime metadata entries for the object and the requesting user, granting access to the file system object by the requesting user to modify the file system object, updating the date/timestamp field of the atime metadata entry for the file system object and the requesting user to a date and time of granting the request, and incrementing the nuse metadata entry that is applicable to the requesting user and the file system object, without overwriting stored atime or nuse metadata entries that are associated with the file system object and with another user of the plurality of different users that is different from the requesting user. 2. The method of claim 1, further comprising:
integrating computer-readable program code into a computer system comprising a processor, a computer readable memory and a computer readable storage device; and wherein the computer readable program code is embodied on the computer readable storage device and comprises instructions for execution by the processor via the computer readable memory that cause the processor to perform the steps of defining the plurality of access control list entries, determining whether the request is authorized for access to the file system object as the function of the atime and mtime metadata entries for the file system object and the requesting user in response to receiving the request from the requesting user to access the file system object, and in response to determining that the request is authorized for access to the file system object granting access to the file system object by the requesting user to modify the file system object, updating the date/timestamp field of the atime metadata entry for the file system object and the requesting user, and incrementing the nuse metadata entry that is applicable to the requesting user and the file system object. 3. The method of claim 1, further comprising:
in response to determining that the requesting user modifies the object in response to the granted access of the object, updating the date/timestamp field of the mtime access control list metadata entry for the object and the requesting user to indicate a date and time of the object modification; and wherein the step determining whether the request is authorized for access to the object as the function of the atime and mtime metadata entries for the object and the requesting user comprises: determining whether the date and time of the request falls within a begin date and time of the dtime entry for the requesting user and the requested object and an end date and time of the dtime field for the requesting user and the requested object; and determining whether a first-modification time period is elapsed from a date and time of a first modification of the requested object by the requesting user that is indicated by a validity field within the vtime metadata entry for the requesting user and the requested object, to the date and time of the request. 4. The method of claim 3, further comprising:
in response to determining that the date and time of the request falls within a begin date and time of a field and an end date and time of another field of the user access control list dtime entry for the requesting user and the file system object, granting access to the file system object by the requesting user for modification of the object; and in response to determining that the date and time of the request does not fall within a begin date and time of a field and an end date and time of another field of the user access control list dtime entry for the requesting user and the file system object, denying access to the file system object by the requesting user, invalidating the requesting user access control list entries for the file system object, and updating the date/timestamp field of the access control list atime metadata entry for the file system object and the requesting user to indicate the date and time of the request. 5. The method of claim 3, further comprising:
defining an itime inactivity time period metadata entry for the requesting user and the file system object that specifies an inactivity time period wherein a permission for access to the object by the requesting user expires upon an elapse of the inactivity time period; determining a last-modification time period elapsed since a date and time of a last modification of the object by the user that is indicated by the mtime metadata entry for the requesting user and the file system object; comparing the elapsed last-modification time period to the inactivity time period; in response to determining that the elapsed last-modification time period is less than the inactivity time period, granting access to the object by the user, and updating the access control list atime and mtime metadata entries for the requesting user and the file system object to indicate the date and time of the request; and in response to determining that the elapsed last-modification time period is not less than the inactivity time period, denying access to the file system object by the user and updating the access control list atime entry metadata for the file system object and the requesting user to indicate the date and time of the request. 6. The method of claim 3, further comprising:
comparing the elapsed first-modification time period to a validity time period of an access control list rule that is applicable to the requesting user and the file system object; in response to determining that the elapsed first-modification time period is less than the validity time period, granting access to the object by the requesting user for modification of the file system object and updating the access control list atime and mtime metadata entries for the object and the user to indicate the date and time of the request; and in response to determining that the elapsed first-modification time period is not less than the validity time period, denying access to the file system object by the requesting user and updating the access control list atime entry metadata for the file system object and the requesting user to indicate the date and time of the request. 7. The method of claim 3, further comprising:
comparing the incremented total number of accesses of the object by the user indicated by an access count field within the nuse metadata entry for the file system object and the requesting user to a specified threshold number of permitted accesses; in response to determining that the incremented total number of accesses of the object by the user indicated by the access count field within the nuse metadata entry for the requesting user and the object is less than the specified threshold number of permitted accesses, granting access to the object by the user for modification of the object and updating the date/timestamp fields of the access control list atime and mtime metadata entries for the object and the user to indicate the date and time of the request; and in response to determining that the incremented total number of accesses of the object by the user indicated by the access count field within the nuse metadata entry for the requesting user and the object is not less than the specified threshold number of permitted accesses: denying access to the file system object by the requesting user and updating the date/timestamp field of the access control list atime metadata entry for the object and the user to indicate the date and time of the request; or granting access to the file system object by the requesting user for modification of the object and updating the date/timestamp field of the access control list mtime metadata entry for the file system object and the requesting user with the date and time of the request. 8. 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: defines, for each of a plurality of different users of a file system object, a plurality of access control list entries that comprises an atime access control list time metadata entry, an mtime access control list modification time metadata entry, a dtime duration constraint metadata entry, a vtime valid time entry metadata entry and an nuse access control list access count metadata entry, wherein an access control list entry is only valid for a specific length of time after a first access time that is indicated by the vtime metadata entry; in response to receiving a request from a requesting user if the plurality of different users to access the file system object, determines whether the request is authorized for access to the file system object as a function of the atime and mtime metadata entries for the file system object and the requesting user; and in response to determining that the request is authorized for access to the file system object as the function of the atime and mtime metadata entries for the file system object and the requesting user, grants access to the file system object by the requesting user to modify the file system object, updates the date/timestamp field of the atime metadata entry for the file system object and the requesting user to a date and time of granting the request, and increments the nuse metadata entry that is applicable to the requesting user and the file system object, without overwriting stored atime or nuse metadata entries that are associated with the file system object and with another user of the plurality of different users that is different from the requesting user. 9. The system of claim 8, wherein the processor executes the program instructions stored on the computer-readable storage medium via the computer readable memory and thereby:
in response to determining that the requesting user modifies the object in response to the granted access of the object, updates the date/timestamp field of the mtime access control list metadata entry for the object and the requesting user to indicate a date and time of the object modification; and determines whether the request is authorized for access to the object as the function of the atime and mtime metadata entries for the object and the requesting user by: determining whether the date and time of the request falls within a begin date and time of the dtime entry for the requesting user and the requested object and an end date and time of the dtime field for the requesting user and the requested object; and determining whether a first-modification time period is elapsed from a date and time of a first modification of the requested object by the requesting user that is indicated by a validity field within the vtime metadata entry for the requesting user and the requested object, to the date and time of the request. 10. The system of claim 9, wherein the processor executes the program instructions stored on the computer-readable storage medium via the computer readable memory and thereby:
in response to determining that the date and time of the request falls within a begin date and time of a field and an end date and time of another field of the user access control list dtime entry for the requesting user and the file system object, grants access to the file system object by the requesting user for modification of the object; and in response to determining that the date and time of the request does not fall within a begin date and time of a field and an end date and time of another field of the user access control list dtime entry for the requesting user and the file system object, denies access to the file system object by the requesting user, invalidates the requesting user access control list entries for the file system object, and updates the date/timestamp field of the access control list atime metadata entry for the file system object and the requesting user to indicate the date and time of the request. 11. The system of claim 9, wherein the processor executes the program instructions stored on the computer-readable storage medium via the computer readable memory and thereby:
defines an itime inactivity time period metadata entry for the requesting user and the file system object that specifies an inactivity time period wherein a permission for access to the object by the requesting user expires upon an elapse of the inactivity time period; determines a last-modification time period elapsed since a date and time of a last modification of the object by the user that is indicated by the mtime metadata entry for the requesting user and the file system object; compares the elapsed last-modification time period to the inactivity time period; in response to determining that the elapsed last-modification time period is less than the inactivity time period, grants access to the object by the user, and updates the access control list atime and mtime metadata entries for the requesting user and the file system object to indicate the date and time of the request; and in response to determining that the elapsed last-modification time period is not less than the inactivity time period, denies access to the file system object by the user and updates the access control list atime entry metadata for the file system object and the requesting user to indicate the date and time of the request. 12. The system of claim 9, wherein the processor executes the program instructions stored on the computer-readable storage medium via the computer readable memory and thereby:
compares the elapsed first-modification time period to a validity time period of an access control list rule that is applicable to the requesting user and the file system object; in response to determining that the elapsed first-modification time period is less than the validity time period, grants access to the object by the requesting user for modification of the file system object and updates the access control list atime and mtime metadata entries for the object and the user to indicate the date and time of the request; and in response to determining that the elapsed first-modification time period is not less than the validity time period, denies access to the file system object by the requesting user and updates the access control list atime entry metadata for the file system object and the requesting user to indicate the date and time of the request. 13. The system of claim 9, wherein the processor executes the program instructions stored on the computer-readable storage medium via the computer readable memory and thereby:
compares the incremented total number of accesses of the object by the user indicated by an access count field within the nuse metadata entry for the file system object and the requesting user to a specified threshold number of permitted accesses; in response to determining that the incremented total number of accesses of the object by the user indicated by the access count field within the nuse metadata entry for the requesting user and the object is less than the specified threshold number of permitted accesses, grants access to the object by the user for modification of the object and updates the date/timestamp fields of the access control list atime and mtime metadata entries for the object and the user to indicate the date and time of the request; and in response to determining that the incremented total number of accesses of the object by the user indicated by the access count field within the nuse metadata entry for the requesting user and the object is not less than the specified threshold number of permitted accesses: denies access to the file system object by the requesting user and updates the date/timestamp field of the access control list atime metadata entry for the object and the user to indicate the date and time of the request; or grants access to the file system object by the requesting user for modification of the object and updates the date/timestamp field of the access control list mtime metadata entry for the file system object and the requesting user with the date and time of the request. 14. An article of manufacture, comprising:
a computer readable storage device having computer readable program code embodied therewith, the computer readable program code comprising instructions for execution by a computer processor that cause the computer processor to: define, for each of a plurality of different users of a file system object, a plurality of access control list entries that comprises an atime access control list time metadata entry, an mtime access control list modification time metadata entry, a dtime duration constraint metadata entry, a vtime valid time entry metadata entry and an nuse access control list access count metadata entry, wherein an access control list entry is only valid for a specific length of time after a first access time that is indicated by the vtime metadata entry; in response to receiving a request from a requesting user if the plurality of different users to access the file system object, determine whether the request is authorized for access to the file system object as a function of the atime and mtime metadata entries for the file system object and the requesting user; and in response to determining that the request is authorized for access to the file system object as the function of the atime and mtime metadata entries for the file system object and the requesting user, grant access to the file system object by the requesting user to modify the file system object, updates the date/timestamp field of the atime metadata entry for the file system object and the requesting user to a date and time of granting the request, and increment the nuse metadata entry that is applicable to the requesting user and the file system object, without overwriting stored atime or nuse metadata entries that are associated with the file system object and with another user of the plurality of different users that is different from the requesting user. 15. The computer program product of claim 14, wherein the computer readable program code instructions for execution by the processor further cause the processor to:
in response to determining that the requesting user modifies the object in response to the granted access of the object, update the date/timestamp field of the mtime access control list metadata entry for the object and the requesting user to indicate a date and time of the object modification; and determine whether the request is authorized for access to the object as the function of the atime and mtime metadata entries for the object and the requesting user by: determining whether the date and time of the request falls within a begin date and time of the dtime entry for the requesting user and the requested object and an end date and time of the dtime field for the requesting user and the requested object; and determining whether a first-modification time period is elapsed from a date and time of a first modification of the requested object by the requesting user that is indicated by a validity field within the vtime metadata entry for the requesting user and the requested object, to the date and time of the request. 16. The computer program product of claim 15, wherein the computer readable program code instructions for execution by the processor further cause the processor to:
in response to determining that the date and time of the request falls within a begin date and time of a field and an end date and time of another field of the user access control list dtime entry for the requesting user and the file system object, grant access to the file system object by the requesting user for modification of the object; and in response to determining that the date and time of the request does not fall within a begin date and time of a field and an end date and time of another field of the user access control list dtime entry for the requesting user and the file system object, deny access to the file system object by the requesting user, invalidate the requesting user access control list entries for the file system object, and update the date/timestamp field of the access control list atime metadata entry for the file system object and the requesting user to indicate the date and time of the request. 17. The computer program product of claim 15, wherein the computer readable program code instructions for execution by the processor further cause the processor to:
define an itime inactivity time period metadata entry for the requesting user and the file system object that specifies an inactivity time period wherein a permission for access to the object by the requesting user expires upon an elapse of the inactivity time period; determine a last-modification time period elapsed since a date and time of a last modification of the object by the user that is indicated by the mtime metadata entry for the requesting user and the file system object; compare the elapsed last-modification time period to the inactivity time period; in response to determining that the elapsed last-modification time period is less than the inactivity time period, grant access to the object by the user, and update the access control list atime and mtime metadata entries for the requesting user and the file system object to indicate the date and time of the request; and in response to determining that the elapsed last-modification time period is not less than the inactivity time period, deny access to the file system object by the user and update the access control list atime entry metadata for the file system object and the requesting user to indicate the date and time of the request. 18. The computer program product of claim 15, wherein the computer readable program code instructions for execution by the processor further cause the processor to:
compare the elapsed first-modification time period to a validity time period of an access control list rule that is applicable to the requesting user and the file system object; in response to determining that the elapsed first-modification time period is less than the validity time period, grant access to the object by the requesting user for modification of the file system object and update the access control list atime and mtime metadata entries for the object and the user to indicate the date and time of the request; and in response to determining that the elapsed first-modification time period is not less than the validity time period, deny access to the file system object by the requesting user and update the access control list atime entry metadata for the file system object and the requesting user to indicate the date and time of the request. 19. The computer program product of claim 15, wherein the computer readable program code instructions for execution by the processor further cause the processor to:
compare the incremented total number of accesses of the object by the user indicated by an access count field within the nuse metadata entry for the file system object and the requesting user to a specified threshold number of permitted accesses; in response to determining that the incremented total number of accesses of the object by the user indicated by the access count field within the nuse metadata entry for the requesting user and the object is less than the specified threshold number of permitted accesses, grant access to the object by the user for modification of the object and update the date/timestamp fields of the access control list atime and mtime metadata entries for the object and the user to indicate the date and time of the request; and in response to determining that the incremented total number of accesses of the object by the user indicated by the access count field within the nuse metadata entry for the requesting user and the object is not less than the specified threshold number of permitted accesses: deny access to the file system object by the requesting user and update the date/timestamp field of the access control list atime metadata entry for the object and the user to indicate the date and time of the request; or grant access to the file system object by the requesting user for modification of the object and update the date/timestamp field of the access control list mtime metadata entry for the file system object and the requesting user with the date and time of the request. | 2,100 |
5,504 | 5,504 | 14,616,155 | 2,169 | In one embodiment, a method includes accessing a first set of posts that includes a number of posts of the online social network posted within a first timeframe. In particular embodiments, each post is associated with one or more topics of a number of topics of the online social network. The method also includes determining a trending topic from the plurality of topics of the online social network; and generating a news-event object associated with the trending topic. In particular embodiments, the news-event object includes a seed post from the first set of posts and a tagging-algorithm for identifying posts matching the trending topic. The method also includes identifying, by the tagging-algorithm, one or more posts from the first set of posts that match the trending topic; and generating one or more search-results modules. In particular embodiments, each search-results module includes one or more search results. | 1. A method comprising, by one or more computing devices of an online social network:
accessing a first set of posts comprising a plurality of posts of the online social network posted within a first timeframe, each post being associated with one or more topics of a plurality of topics of the online social network; determining a trending topic from the plurality of topics of the online social network; generating a news-event object associated with the trending topic, the news-event object comprising a seed post from the first set of posts and a tagging-algorithm for identifying posts matching the trending topic; identifying, by the tagging-algorithm, one or more posts from the first set of posts that match the trending topic; generating one or more search-results modules, each search-results module comprising one or more search results, each search result comprising a reference to an identified post that matches the trending topic; and sending, to a client device of a user for display, a search-results page comprising one or more of the search-results modules. 2. The method of claim 1, wherein determining the trending topic from the plurality of topics is based on an increase in a number or frequency of posts, likes, mentions, or shares on the online social network that are associated with the trending topic within the second timeframe. 3. The method of claim 1, wherein generating the news-event object comprises generating the tagging-algorithm by:
parsing a content of the seed post into one or more n-grams; and determining one or more key topics based on one or more of the n-grams that match names of entities associated with the online social network. 4. The method of claim 1, wherein generating the news-event object comprises generating the tagging-algorithm by determining one or more co-visited topics based on identifying one or more topics having activity subsequent to activity associated with the trending topic within a second timeframe associated with the trending topic, wherein the activity comprises a click-through, like, mention, or share, and wherein the second timeframe is a subset of the first timeframe. 5. The method of claim 1, wherein generating the news-event object comprises generating the tagging-algorithm by:
determining a location of the trending topic; and identifying one or more posts within a second timeframe based on a location of each post matching the location of the trending topic, wherein the second timeframe is a subset of the first timeframe. 6. The method of claim 1, wherein generating the news-event object comprises generating the tagging-algorithm by:
accessing a social graph comprising a plurality of nodes and a plurality of edges connecting the nodes, each of the edges between two of the nodes representing a single degree of separation between them, and each node corresponding to an object associated with the online social network; and identifying one or more topics based on identifying an entity corresponding to a node that is connected by an edge to a node associated with the trending topic. 7. The method of claim 1, further comprising storing references to the identified posts with the news-event object and the tagging-algorithm. 8. The method of claim 1, wherein the one or more posts from the first set of posts are posts made within a second timeframe associated with the trending topic, the second timeframe being a subset of the first timeframe. 9. The method of claim 1, wherein identifying one or more of the posts comprises searching one or more verticals to identify one or more posts stored by the verticals that match the trending topic. 10. The method of claim 1, further comprising sending a reference to the news-event object to a search frontend. 11. The method of claim 1, wherein the news-event object further comprises references to one or more of the identified posts. 12. The method of claim 1, wherein one or more of the search results further comprise references to one or more comments, news articles, photos, videos, events, applications, or web pages stored on the online social network. 13. The method of claim 1, further comprising calculating an relevance score for each of the identified posts based at least in part on a relevance of each identified post to the trending topic. 14. The method of claim 13, wherein each reference in one or more of the search-results modules corresponds to the identified post with the relevance score greater than a threshold score. 15. The method of claim 1, further comprising storing a reference to the seed post with the news-event object. 16. The method of claim 1, wherein the generation of the search-results modules is responsive to receiving a search query from the client device of the user. 17. The method of claim 1, wherein the generation of the search-results modules is responsive to receiving a selection a link from the client device of the user. 18. The method of claim 1, further comprising:
associating the news-event object with a search query; and sending the search results with the search query to a ranking backend. 19. One or more computer-readable non-transitory storage media embodying software that is operable when executed to:
access a first set of posts comprising a plurality of posts of the online social network posted within a first timeframe, each post being associated with one or more topics of a plurality of topics of the online social network; determine a trending topic from the plurality of topics of the online social network; generate a news-event object associated with the trending topic, the news-event object comprising a seed post from the first set of posts and a tagging-algorithm for identifying posts matching the trending topic; identify, by the tagging-algorithm, one or more posts from the first set of posts that match the trending topic; generate one or more search-results modules, each search-results module comprising one or more search results, each search result comprising a reference to an identified post matching the trending topic; and send, to a client device of a user for display, a search-results page comprising one or more of the search-results modules. 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 posts comprising a plurality of posts of the online social network posted within a first timeframe, each post being associated with one or more topics of a plurality of topics of the online social network; determine a trending topic from the plurality of topics of the online social network; generate a news-event object associated with the trending topic, the news-event object comprising a seed post from the first set of posts and a tagging-algorithm for identifying posts matching the trending topic; identify, by the tagging-algorithm, one or more posts from the first set of posts that match the trending topic; generate one or more search-results modules, each search-results module comprising one or more search results, each search result comprising a reference to an identified post matching the trending topic; and send, to a client device of a user for display, a search-results page comprising one or more of the search-results modules. | In one embodiment, a method includes accessing a first set of posts that includes a number of posts of the online social network posted within a first timeframe. In particular embodiments, each post is associated with one or more topics of a number of topics of the online social network. The method also includes determining a trending topic from the plurality of topics of the online social network; and generating a news-event object associated with the trending topic. In particular embodiments, the news-event object includes a seed post from the first set of posts and a tagging-algorithm for identifying posts matching the trending topic. The method also includes identifying, by the tagging-algorithm, one or more posts from the first set of posts that match the trending topic; and generating one or more search-results modules. In particular embodiments, each search-results module includes one or more search results.1. A method comprising, by one or more computing devices of an online social network:
accessing a first set of posts comprising a plurality of posts of the online social network posted within a first timeframe, each post being associated with one or more topics of a plurality of topics of the online social network; determining a trending topic from the plurality of topics of the online social network; generating a news-event object associated with the trending topic, the news-event object comprising a seed post from the first set of posts and a tagging-algorithm for identifying posts matching the trending topic; identifying, by the tagging-algorithm, one or more posts from the first set of posts that match the trending topic; generating one or more search-results modules, each search-results module comprising one or more search results, each search result comprising a reference to an identified post that matches the trending topic; and sending, to a client device of a user for display, a search-results page comprising one or more of the search-results modules. 2. The method of claim 1, wherein determining the trending topic from the plurality of topics is based on an increase in a number or frequency of posts, likes, mentions, or shares on the online social network that are associated with the trending topic within the second timeframe. 3. The method of claim 1, wherein generating the news-event object comprises generating the tagging-algorithm by:
parsing a content of the seed post into one or more n-grams; and determining one or more key topics based on one or more of the n-grams that match names of entities associated with the online social network. 4. The method of claim 1, wherein generating the news-event object comprises generating the tagging-algorithm by determining one or more co-visited topics based on identifying one or more topics having activity subsequent to activity associated with the trending topic within a second timeframe associated with the trending topic, wherein the activity comprises a click-through, like, mention, or share, and wherein the second timeframe is a subset of the first timeframe. 5. The method of claim 1, wherein generating the news-event object comprises generating the tagging-algorithm by:
determining a location of the trending topic; and identifying one or more posts within a second timeframe based on a location of each post matching the location of the trending topic, wherein the second timeframe is a subset of the first timeframe. 6. The method of claim 1, wherein generating the news-event object comprises generating the tagging-algorithm by:
accessing a social graph comprising a plurality of nodes and a plurality of edges connecting the nodes, each of the edges between two of the nodes representing a single degree of separation between them, and each node corresponding to an object associated with the online social network; and identifying one or more topics based on identifying an entity corresponding to a node that is connected by an edge to a node associated with the trending topic. 7. The method of claim 1, further comprising storing references to the identified posts with the news-event object and the tagging-algorithm. 8. The method of claim 1, wherein the one or more posts from the first set of posts are posts made within a second timeframe associated with the trending topic, the second timeframe being a subset of the first timeframe. 9. The method of claim 1, wherein identifying one or more of the posts comprises searching one or more verticals to identify one or more posts stored by the verticals that match the trending topic. 10. The method of claim 1, further comprising sending a reference to the news-event object to a search frontend. 11. The method of claim 1, wherein the news-event object further comprises references to one or more of the identified posts. 12. The method of claim 1, wherein one or more of the search results further comprise references to one or more comments, news articles, photos, videos, events, applications, or web pages stored on the online social network. 13. The method of claim 1, further comprising calculating an relevance score for each of the identified posts based at least in part on a relevance of each identified post to the trending topic. 14. The method of claim 13, wherein each reference in one or more of the search-results modules corresponds to the identified post with the relevance score greater than a threshold score. 15. The method of claim 1, further comprising storing a reference to the seed post with the news-event object. 16. The method of claim 1, wherein the generation of the search-results modules is responsive to receiving a search query from the client device of the user. 17. The method of claim 1, wherein the generation of the search-results modules is responsive to receiving a selection a link from the client device of the user. 18. The method of claim 1, further comprising:
associating the news-event object with a search query; and sending the search results with the search query to a ranking backend. 19. One or more computer-readable non-transitory storage media embodying software that is operable when executed to:
access a first set of posts comprising a plurality of posts of the online social network posted within a first timeframe, each post being associated with one or more topics of a plurality of topics of the online social network; determine a trending topic from the plurality of topics of the online social network; generate a news-event object associated with the trending topic, the news-event object comprising a seed post from the first set of posts and a tagging-algorithm for identifying posts matching the trending topic; identify, by the tagging-algorithm, one or more posts from the first set of posts that match the trending topic; generate one or more search-results modules, each search-results module comprising one or more search results, each search result comprising a reference to an identified post matching the trending topic; and send, to a client device of a user for display, a search-results page comprising one or more of the search-results modules. 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 posts comprising a plurality of posts of the online social network posted within a first timeframe, each post being associated with one or more topics of a plurality of topics of the online social network; determine a trending topic from the plurality of topics of the online social network; generate a news-event object associated with the trending topic, the news-event object comprising a seed post from the first set of posts and a tagging-algorithm for identifying posts matching the trending topic; identify, by the tagging-algorithm, one or more posts from the first set of posts that match the trending topic; generate one or more search-results modules, each search-results module comprising one or more search results, each search result comprising a reference to an identified post matching the trending topic; and send, to a client device of a user for display, a search-results page comprising one or more of the search-results modules. | 2,100 |
5,505 | 5,505 | 15,051,892 | 2,154 | Some aspects of this disclosure include systems, methods, and/or computed readable media that may be used to generate crowd-based results based on measurements of affective response of users. In some embodiments described herein, sensors are used to take measurements of affective response of at least ten users who have a certain experience. The measurements may include various values indicative of physiological signals and/or behavioral cues of the at least ten users. Some examples of experiences mentioned herein include going on vacations, eating in restaurants, and utilizing various products. User interfaces are configured to receive data describing a score computed based on the measurements of the at least ten users, which represents the affective response of the at least ten users to having the certain experience. The user interfaces may be used to report the score (e.g., to a user who may be interested in having the certain experience). | 1. A system configured to report a score for a certain experience based on measurements of affective response, comprising:
sensors configured to take measurements of affective response of users; the measurements comprising measurements of affective response of at least ten users taken at most ten minutes after the users had the certain experience; and user interfaces configured to receive data describing the score; wherein the score is computed based on the measurements of the at least ten users and represents the affective response of the at least ten users to having the certain experience; and wherein the user interfaces are further configured to report the score. 2. The system of claim 1, wherein a user having the certain experience involves the user doing at least one of the following: visiting a certain location, visiting a certain virtual environment, partaking in a certain activity, having a social interaction, receiving a certain service, utilizing a certain product, dining at a certain restaurant, traveling in vehicle of a certain type, utilizing an electronic device of a certain type, and wearing an apparel item of a certain type. 3. The system of claim 1, wherein the at least ten users consist a number of users that falls into one of the following ranges: 10 to 24, 25-99, 100-999, 1000-9999, 10000-99999, 100000-1000000, and more than one million. 4. The system of claim 1, wherein the sensors comprise a sensor implanted in a body of a user from among the at least ten users. 5. The system of claim 1, wherein the sensors comprise a sensor embedded in a device used by a user from among the at least ten users. 6. The system of claim 1, wherein at least some of the sensors are embedded in at least one of: clothing items, footwear, jewelry items, and wearable artifacts. 7. The system of claim 1, wherein the sensors comprise a sensor that is not in physical contact with the user of whom the sensor takes a measurement of affective response. 8. The system of claim 7, wherein the sensor is an image capturing device used to take a measurement of affective response of a user comprising one or more images of the user. 9. The system of claim 1, wherein at least some of the sensors are configured to take measurements of physiological signals of the at least ten users. 10. The system of claim 1, wherein at least some of the sensors are configured to take measurements of behavioral cues of the at least ten users. 11. The system of claim 1, wherein the at least ten users comprise a user that receives an indication of the scores via a user interface from among the user interfaces. 12. The system of claim 1, further comprising a device coupled to a sensor from among the sensors and to a user interface from among the user interfaces; wherein the device is configured to receive a measurement taken with the sensor, and to transmit the measurement; and wherein the device is further configured to receive data describing the score and to forward it for presentation via the user interface. 13. The system of claim 1, wherein the measurements of the at least ten users comprise first and second measurements, such that the first measurement is taken at least 24 hours before the second measurement is taken. 14. A method for reporting a score for a certain experience based on measurements of affective response, comprising:
taking measurements of affective response of users with sensors; the measurements comprising measurements of affective response of at least ten users taken at most ten minutes after the users had the certain experience; receiving data describing the score; wherein the score is computed based on the measurements of the at least ten users and represents the affective response of the at least ten users to having the certain experience; and reporting the score via user interfaces. 15. The method of claim 14, further comprising taking the measurements of affective response of the at least ten users while the at least ten users have the certain experience. 16. The method of claim 14, further comprising computing the score based on the measurements. 17. The method of claim 14, further comprising receiving baseline affective response value for at least some of the at least ten users, measurements of affective response of the at least some of the at least ten users, and normalizing the measurements of the at least some of the at least ten users with respect to the baseline affective response values. 18. A non-transitory computer-readable medium having instructions stored thereon that, in response to execution by a system including a processor and memory, cause the system to perform operations comprising:
taking measurements of affective response of users with sensors; the measurements comprising measurements of affective response of at least ten users taken at most ten minutes after the users had a certain experience; receiving data describing a score; wherein the score is computed based on the measurements of the at least ten users and represents the affective response of the at least ten users to having the certain experience; and reporting the score via user interfaces. 19. The non-transitory computer-readable medium of claim 18, further comprising additional instructions that, in response to execution, cause the system to perform operations comprising: receiving baseline affective response value for at least some of the at least ten users, measurements of affective response of the at least some of the at least ten users, and normalizing the measurements of the at least some of the at least ten users with respect to the baseline affective response values. 20. The non-transitory computer-readable medium of claim 18, further comprising instructions defining the step of computing the score based on the measurements. | Some aspects of this disclosure include systems, methods, and/or computed readable media that may be used to generate crowd-based results based on measurements of affective response of users. In some embodiments described herein, sensors are used to take measurements of affective response of at least ten users who have a certain experience. The measurements may include various values indicative of physiological signals and/or behavioral cues of the at least ten users. Some examples of experiences mentioned herein include going on vacations, eating in restaurants, and utilizing various products. User interfaces are configured to receive data describing a score computed based on the measurements of the at least ten users, which represents the affective response of the at least ten users to having the certain experience. The user interfaces may be used to report the score (e.g., to a user who may be interested in having the certain experience).1. A system configured to report a score for a certain experience based on measurements of affective response, comprising:
sensors configured to take measurements of affective response of users; the measurements comprising measurements of affective response of at least ten users taken at most ten minutes after the users had the certain experience; and user interfaces configured to receive data describing the score; wherein the score is computed based on the measurements of the at least ten users and represents the affective response of the at least ten users to having the certain experience; and wherein the user interfaces are further configured to report the score. 2. The system of claim 1, wherein a user having the certain experience involves the user doing at least one of the following: visiting a certain location, visiting a certain virtual environment, partaking in a certain activity, having a social interaction, receiving a certain service, utilizing a certain product, dining at a certain restaurant, traveling in vehicle of a certain type, utilizing an electronic device of a certain type, and wearing an apparel item of a certain type. 3. The system of claim 1, wherein the at least ten users consist a number of users that falls into one of the following ranges: 10 to 24, 25-99, 100-999, 1000-9999, 10000-99999, 100000-1000000, and more than one million. 4. The system of claim 1, wherein the sensors comprise a sensor implanted in a body of a user from among the at least ten users. 5. The system of claim 1, wherein the sensors comprise a sensor embedded in a device used by a user from among the at least ten users. 6. The system of claim 1, wherein at least some of the sensors are embedded in at least one of: clothing items, footwear, jewelry items, and wearable artifacts. 7. The system of claim 1, wherein the sensors comprise a sensor that is not in physical contact with the user of whom the sensor takes a measurement of affective response. 8. The system of claim 7, wherein the sensor is an image capturing device used to take a measurement of affective response of a user comprising one or more images of the user. 9. The system of claim 1, wherein at least some of the sensors are configured to take measurements of physiological signals of the at least ten users. 10. The system of claim 1, wherein at least some of the sensors are configured to take measurements of behavioral cues of the at least ten users. 11. The system of claim 1, wherein the at least ten users comprise a user that receives an indication of the scores via a user interface from among the user interfaces. 12. The system of claim 1, further comprising a device coupled to a sensor from among the sensors and to a user interface from among the user interfaces; wherein the device is configured to receive a measurement taken with the sensor, and to transmit the measurement; and wherein the device is further configured to receive data describing the score and to forward it for presentation via the user interface. 13. The system of claim 1, wherein the measurements of the at least ten users comprise first and second measurements, such that the first measurement is taken at least 24 hours before the second measurement is taken. 14. A method for reporting a score for a certain experience based on measurements of affective response, comprising:
taking measurements of affective response of users with sensors; the measurements comprising measurements of affective response of at least ten users taken at most ten minutes after the users had the certain experience; receiving data describing the score; wherein the score is computed based on the measurements of the at least ten users and represents the affective response of the at least ten users to having the certain experience; and reporting the score via user interfaces. 15. The method of claim 14, further comprising taking the measurements of affective response of the at least ten users while the at least ten users have the certain experience. 16. The method of claim 14, further comprising computing the score based on the measurements. 17. The method of claim 14, further comprising receiving baseline affective response value for at least some of the at least ten users, measurements of affective response of the at least some of the at least ten users, and normalizing the measurements of the at least some of the at least ten users with respect to the baseline affective response values. 18. A non-transitory computer-readable medium having instructions stored thereon that, in response to execution by a system including a processor and memory, cause the system to perform operations comprising:
taking measurements of affective response of users with sensors; the measurements comprising measurements of affective response of at least ten users taken at most ten minutes after the users had a certain experience; receiving data describing a score; wherein the score is computed based on the measurements of the at least ten users and represents the affective response of the at least ten users to having the certain experience; and reporting the score via user interfaces. 19. The non-transitory computer-readable medium of claim 18, further comprising additional instructions that, in response to execution, cause the system to perform operations comprising: receiving baseline affective response value for at least some of the at least ten users, measurements of affective response of the at least some of the at least ten users, and normalizing the measurements of the at least some of the at least ten users with respect to the baseline affective response values. 20. The non-transitory computer-readable medium of claim 18, further comprising instructions defining the step of computing the score based on the measurements. | 2,100 |
5,506 | 5,506 | 14,521,194 | 2,121 | Methods, systems and computer program products to evaluate or assess strategies for operating and designing complex systems, including systems of systems, are disclosed. The methods, systems and computer program products provide describe and evaluate the behavior of systems in real-world environments where future conditions are highly uncertain are disclosed. The present disclosure identifies a set of important strategies, a set of concomitant actions, and a set of environmental conditions that form the basis of strategic change rules. These rules can be incorporated in a simulation to modify the behavior of the simulated system. These methods, systems and computer program products offers a capability, which has not been previously available, to evaluate the adaptability of complex systems | 1. A method for providing an informed strategy for determining the composition of a system of system, comprising:
a) define a problem having a design and a scenario; b) choose one or more performance metrics; c) select one or more measures for the one or more chosen performance metrics; d) evaluate the one or more measures for the design and scenario; e) redefine design; f) repeat steps a through e to create one or more designs; g) compare the one or more designs based on the evaluation of the evaluated performance metrics; and h) provide a final design from the one or more designs based on the evaluation of the evaluated performance metrics. 2. The method of claim 1, wherein the one or more performance metrics is selected from a group consisting essentially of cost, availability, efficiency, sustainability, and survivability. 3. The method of claim 1, wherein the performance metric is availability and availability is measured by the following formula:
A
SoS
=
1
t
tot
∑
i
=
1
N
times
Δ
t
i
max
j
=
possible
“
success
-
path
”
combinations
[
min
k
=
SP
requirements
(
N
operating
|
operable
k
,
j
,
i
N
required
k
,
j
,
i
)
]
. 4. The method of claim 1, wherein the performance metric is efficiency and efficiency is measured by the following formula:
excess_power
_ratio
=
∑
i
=
1
N
times
Δ
t
i
∑
j
=
1
N
gen
Q
j
,
i
∑
i
=
1
N
times
Δ
t
i
∑
j
=
1
N
gen
Q
j
,
i
tot
. 5. The method of claim 1, wherein the performance metric is survivability and survivability is measured by the following formula:
combat_damage
_downtime
_frac
=
∑
j
=
1
N
sys
t
j
damaged
∑
j
=
1
N
sys
t
j
tot
. 6. A system comprising a non-transitory computer readable storage medium encoded with programming for evaluating strategies for operating and designing complex systems, the non-transitory computer readable medium with programming configured to:
a) define a problem having a design and a scenario; b) choose one or more performance metrics; c) select one or more measures for the one or more chosen performance metrics; d) evaluate the one or more measures for the design and scenario; e) redefine design; f) repeat steps a through e to create one or more designs; g) compare the one or more designs based on the evaluation of the evaluated performance metrics; and h) provide a final design from the one or more designs based on the evaluation of the evaluated performance metrics. 7. The system of claim 6, wherein one or more performance metrics is selected from a group consisting essentially of cost, availability, efficiency, sustainability, and survivability. 8. The system of claim 7, wherein the performance metric is availability and availability is measured by the following formula:
A
SoS
=
1
t
tot
∑
i
=
1
N
times
Δ
t
i
max
j
=
possible
“
success
-
path
”
combinations
[
min
k
=
SP
requirements
(
N
operating
|
operable
k
,
j
,
i
N
required
k
,
j
,
i
)
]
. 9. The system of claim 7, wherein the performance metric is efficiency and efficiency is measured by the following formula:
excess_power
_ratio
=
∑
i
=
1
N
times
Δ
t
i
∑
j
=
1
N
gen
Q
j
,
i
∑
i
=
1
N
times
Δ
t
i
∑
j
=
1
N
gen
Q
j
,
i
tot
. 10. The system of claim 7, wherein the performance metric is survivability and survivability is measured by the following formula:
combat_damage
_downtime
_frac
=
∑
j
=
1
N
sys
t
j
damaged
∑
j
=
1
N
sys
t
j
tot
. 11. A computer program product stored on a non-transitory computer readable medium, wherein executed by a process, the computer program product configured to:
a) define a problem having a design and a scenario; b) choose one or more performance metrics; c) select one or more measures for the one or more chosen performance metrics; d) evaluate the one or more measures for the design and scenario; e) redefine design; f) repeat steps a through e to create one or more designs; g) compare the one or more designs based on the evaluation of the evaluated performance metrics; and h) provide a final design from the one or more designs based on the evaluation of the evaluated performance metrics. 12. The computer program product of claim 8, wherein one or more performance metrics is selected from a group consisting essentially of cost, availability, efficiency, sustainability, and survivability. 13. The computer program product of claim 12, wherein the performance metric is availability and availability is measured by the following formula:
A
SoS
=
1
t
tot
∑
i
=
1
N
times
Δ
t
i
max
j
=
possible
“
success
-
path
”
combinations
[
min
k
=
SP
requirements
(
N
operating
|
operable
k
,
j
,
i
N
required
k
,
j
,
i
)
]
. 14. The computer program product of claim 12, wherein the performance metric is efficiency and efficiency is measured by the following formula:
excess_power
_ratio
=
∑
i
=
1
N
times
Δ
t
i
∑
j
=
1
N
gen
Q
j
,
i
∑
i
=
1
N
times
Δ
t
i
∑
j
=
1
N
gen
Q
j
,
i
tot
. 15. The computer program product of claim 12, wherein the performance metric is survivability and survivability is measured by the following formula:
combat_damage
_downtime
_frac
=
∑
j
=
1
N
sys
t
j
damaged
∑
j
=
1
N
sys
t
j
tot
. | Methods, systems and computer program products to evaluate or assess strategies for operating and designing complex systems, including systems of systems, are disclosed. The methods, systems and computer program products provide describe and evaluate the behavior of systems in real-world environments where future conditions are highly uncertain are disclosed. The present disclosure identifies a set of important strategies, a set of concomitant actions, and a set of environmental conditions that form the basis of strategic change rules. These rules can be incorporated in a simulation to modify the behavior of the simulated system. These methods, systems and computer program products offers a capability, which has not been previously available, to evaluate the adaptability of complex systems1. A method for providing an informed strategy for determining the composition of a system of system, comprising:
a) define a problem having a design and a scenario; b) choose one or more performance metrics; c) select one or more measures for the one or more chosen performance metrics; d) evaluate the one or more measures for the design and scenario; e) redefine design; f) repeat steps a through e to create one or more designs; g) compare the one or more designs based on the evaluation of the evaluated performance metrics; and h) provide a final design from the one or more designs based on the evaluation of the evaluated performance metrics. 2. The method of claim 1, wherein the one or more performance metrics is selected from a group consisting essentially of cost, availability, efficiency, sustainability, and survivability. 3. The method of claim 1, wherein the performance metric is availability and availability is measured by the following formula:
A
SoS
=
1
t
tot
∑
i
=
1
N
times
Δ
t
i
max
j
=
possible
“
success
-
path
”
combinations
[
min
k
=
SP
requirements
(
N
operating
|
operable
k
,
j
,
i
N
required
k
,
j
,
i
)
]
. 4. The method of claim 1, wherein the performance metric is efficiency and efficiency is measured by the following formula:
excess_power
_ratio
=
∑
i
=
1
N
times
Δ
t
i
∑
j
=
1
N
gen
Q
j
,
i
∑
i
=
1
N
times
Δ
t
i
∑
j
=
1
N
gen
Q
j
,
i
tot
. 5. The method of claim 1, wherein the performance metric is survivability and survivability is measured by the following formula:
combat_damage
_downtime
_frac
=
∑
j
=
1
N
sys
t
j
damaged
∑
j
=
1
N
sys
t
j
tot
. 6. A system comprising a non-transitory computer readable storage medium encoded with programming for evaluating strategies for operating and designing complex systems, the non-transitory computer readable medium with programming configured to:
a) define a problem having a design and a scenario; b) choose one or more performance metrics; c) select one or more measures for the one or more chosen performance metrics; d) evaluate the one or more measures for the design and scenario; e) redefine design; f) repeat steps a through e to create one or more designs; g) compare the one or more designs based on the evaluation of the evaluated performance metrics; and h) provide a final design from the one or more designs based on the evaluation of the evaluated performance metrics. 7. The system of claim 6, wherein one or more performance metrics is selected from a group consisting essentially of cost, availability, efficiency, sustainability, and survivability. 8. The system of claim 7, wherein the performance metric is availability and availability is measured by the following formula:
A
SoS
=
1
t
tot
∑
i
=
1
N
times
Δ
t
i
max
j
=
possible
“
success
-
path
”
combinations
[
min
k
=
SP
requirements
(
N
operating
|
operable
k
,
j
,
i
N
required
k
,
j
,
i
)
]
. 9. The system of claim 7, wherein the performance metric is efficiency and efficiency is measured by the following formula:
excess_power
_ratio
=
∑
i
=
1
N
times
Δ
t
i
∑
j
=
1
N
gen
Q
j
,
i
∑
i
=
1
N
times
Δ
t
i
∑
j
=
1
N
gen
Q
j
,
i
tot
. 10. The system of claim 7, wherein the performance metric is survivability and survivability is measured by the following formula:
combat_damage
_downtime
_frac
=
∑
j
=
1
N
sys
t
j
damaged
∑
j
=
1
N
sys
t
j
tot
. 11. A computer program product stored on a non-transitory computer readable medium, wherein executed by a process, the computer program product configured to:
a) define a problem having a design and a scenario; b) choose one or more performance metrics; c) select one or more measures for the one or more chosen performance metrics; d) evaluate the one or more measures for the design and scenario; e) redefine design; f) repeat steps a through e to create one or more designs; g) compare the one or more designs based on the evaluation of the evaluated performance metrics; and h) provide a final design from the one or more designs based on the evaluation of the evaluated performance metrics. 12. The computer program product of claim 8, wherein one or more performance metrics is selected from a group consisting essentially of cost, availability, efficiency, sustainability, and survivability. 13. The computer program product of claim 12, wherein the performance metric is availability and availability is measured by the following formula:
A
SoS
=
1
t
tot
∑
i
=
1
N
times
Δ
t
i
max
j
=
possible
“
success
-
path
”
combinations
[
min
k
=
SP
requirements
(
N
operating
|
operable
k
,
j
,
i
N
required
k
,
j
,
i
)
]
. 14. The computer program product of claim 12, wherein the performance metric is efficiency and efficiency is measured by the following formula:
excess_power
_ratio
=
∑
i
=
1
N
times
Δ
t
i
∑
j
=
1
N
gen
Q
j
,
i
∑
i
=
1
N
times
Δ
t
i
∑
j
=
1
N
gen
Q
j
,
i
tot
. 15. The computer program product of claim 12, wherein the performance metric is survivability and survivability is measured by the following formula:
combat_damage
_downtime
_frac
=
∑
j
=
1
N
sys
t
j
damaged
∑
j
=
1
N
sys
t
j
tot
. | 2,100 |
5,507 | 5,507 | 14,755,179 | 2,192 | Changes in application topology can be determined, stored, analyzed and presented for evaluation as event journals. The information about inter-component calls can be recorded at multiple time instances, and then the component call information can be aggregated in different ranges or windows of time. Each aggregation of component call information can be used to determine different states of application topology, and the different states can be analyzed to determine changes between the application topology states and their relationship with performance degradations. | 1. A method comprising:
determining a plurality of application topology states, each of the plurality of application topology states corresponding to a different time window; determining changes between the plurality of application topology states in chronological order; and indicating the changes between the plurality of application topology states. 2. The method of claim 1, wherein determining the plurality of application topology states comprises determining each of the plurality of application topology states with a different set of application component call data entries, wherein each application component call data entry indicates a time instant, a caller application component, and a callee application component, wherein the time instants indicated in each different set of application component call data entries are within a corresponding one of the different time windows. 3. The method of claim 2 further comprising:
determining a time instant for either a first or a last application component call data entry of a set of component call data entries;
determining a window size for a number of application component call data entries to determine an application topology state;
wherein a first set of application component data entries includes a first application component data entry corresponding to the time instant,
wherein each set of application component data entries includes a number of entries according to the window size. 4. The method of claim 2, wherein each component call data entry also indicates an agent associated with an application corresponding to at least one of the caller application component and the callee application component. 5. The method of claim 1, wherein each of the plurality of application topology states indicates calls between application components that occurred within the corresponding time window. 6. The method of claim 1, wherein determining the plurality of application topology states comprises generating a data representation of a directed graph for each of a plurality of sets of component call data entries, wherein each of the plurality of sets of component call data entries correspond to the different time window. 7. The method of claim 1, wherein determining the changes between the plurality of application topology states comprises determining application component calls indicated in a first of the plurality of application topology states but not indicated in a second of the plurality of application topology states, wherein the second application topology state corresponds to a second time window that is earlier than a first time window that corresponds to the first application topology state. 8. The method of claim 1 further comprising recording first indications of application component calls into a repository. 9. The method of claim 8 further comprising determining a filtering time window and filtering second indications of application component calls based, at least in part, on the filtering time window to yield the first indications. 10. The method of claim 9, wherein filtering based, at least in part, on the filtering time window comprises discarding repeat application component calls that occur within the time window. 11. The method of claim 1, wherein indicating the changes between the plurality of application topology states comprises supplying indications of the changes for graphical depiction. 12. A machine-readable storage medium having program code stored therein, the program code to:
obtain a plurality of sets of application component call indications with each set corresponding to a different time window, wherein each of the application component call indications indicates a time instant, a caller application component, and a callee application component; for each set of the plurality of sets of application component call indications, generate a data representation of application topology state based, at least in part, on the set of application component call indications; determine differences between the generated data representations of the application topology states in chronological order; and indicate the determined differences. 13. An apparatus comprising:
a processing unit; and a machine-readable medium having program code stored therein, the program code executable by the processor to cause the apparatus to, determine a plurality of application topology states, each of the plurality of application topology states corresponding to a different time window; determine changes between the plurality of application topology states in chronological order; and indicate the changes between the plurality of application topology states. 14. The apparatus of claim 13, wherein the program code to determine the plurality of application topology states comprises program code to determine each of the plurality of application topology states with a different set of application component call data entries, wherein each application component call data entry indicates a time instant, a caller application component, and a callee application component, wherein the time instants indicated in each different set of application component call data entries are within a corresponding one of the different time windows. 15. The apparatus of claim 14, wherein the machine-readable medium further has stored therein program code executable by the processing unit to cause the apparatus to:
determine a time instant for either a first or a last application component call data entry of a set of component call data entries; determine a window size for a number of application component call data entries to determine an application topology state; wherein a first set of application component data entries includes a first application component data entry corresponding to the time instant, wherein each set of application component data entries includes a number of entries according to the window size. 16. The apparatus of claim 14, wherein each component call data entry also indicates an agent associated with an application corresponding to at least one of the caller application component and the callee application component. 17. The apparatus of claim 13, wherein each of the plurality of application topology states indicates calls between application components that occurred within the corresponding time window. 18. The apparatus of claim 13, wherein the program code to determine the plurality of application topology states comprises program code to generate a data representation of a directed graph for each set of a plurality of sets of component call data entries, wherein each set of the plurality of sets of component call data entries corresponds to a different time window. 19. The apparatus of claim 13, wherein the program code to determine the changes between the plurality of application topology states comprises the program code to determine application component calls indicated in a first of the plurality of application topology states but not indicated in a second of the plurality of application topology states, wherein the second application topology state corresponds to a second time window that is earlier than a first time window that corresponds to the first application topology state. 20. The apparatus of claim 13, wherein the program code to indicate the changes between the plurality of application topology states comprises program code to supply indications of the changes for graphical depiction. | Changes in application topology can be determined, stored, analyzed and presented for evaluation as event journals. The information about inter-component calls can be recorded at multiple time instances, and then the component call information can be aggregated in different ranges or windows of time. Each aggregation of component call information can be used to determine different states of application topology, and the different states can be analyzed to determine changes between the application topology states and their relationship with performance degradations.1. A method comprising:
determining a plurality of application topology states, each of the plurality of application topology states corresponding to a different time window; determining changes between the plurality of application topology states in chronological order; and indicating the changes between the plurality of application topology states. 2. The method of claim 1, wherein determining the plurality of application topology states comprises determining each of the plurality of application topology states with a different set of application component call data entries, wherein each application component call data entry indicates a time instant, a caller application component, and a callee application component, wherein the time instants indicated in each different set of application component call data entries are within a corresponding one of the different time windows. 3. The method of claim 2 further comprising:
determining a time instant for either a first or a last application component call data entry of a set of component call data entries;
determining a window size for a number of application component call data entries to determine an application topology state;
wherein a first set of application component data entries includes a first application component data entry corresponding to the time instant,
wherein each set of application component data entries includes a number of entries according to the window size. 4. The method of claim 2, wherein each component call data entry also indicates an agent associated with an application corresponding to at least one of the caller application component and the callee application component. 5. The method of claim 1, wherein each of the plurality of application topology states indicates calls between application components that occurred within the corresponding time window. 6. The method of claim 1, wherein determining the plurality of application topology states comprises generating a data representation of a directed graph for each of a plurality of sets of component call data entries, wherein each of the plurality of sets of component call data entries correspond to the different time window. 7. The method of claim 1, wherein determining the changes between the plurality of application topology states comprises determining application component calls indicated in a first of the plurality of application topology states but not indicated in a second of the plurality of application topology states, wherein the second application topology state corresponds to a second time window that is earlier than a first time window that corresponds to the first application topology state. 8. The method of claim 1 further comprising recording first indications of application component calls into a repository. 9. The method of claim 8 further comprising determining a filtering time window and filtering second indications of application component calls based, at least in part, on the filtering time window to yield the first indications. 10. The method of claim 9, wherein filtering based, at least in part, on the filtering time window comprises discarding repeat application component calls that occur within the time window. 11. The method of claim 1, wherein indicating the changes between the plurality of application topology states comprises supplying indications of the changes for graphical depiction. 12. A machine-readable storage medium having program code stored therein, the program code to:
obtain a plurality of sets of application component call indications with each set corresponding to a different time window, wherein each of the application component call indications indicates a time instant, a caller application component, and a callee application component; for each set of the plurality of sets of application component call indications, generate a data representation of application topology state based, at least in part, on the set of application component call indications; determine differences between the generated data representations of the application topology states in chronological order; and indicate the determined differences. 13. An apparatus comprising:
a processing unit; and a machine-readable medium having program code stored therein, the program code executable by the processor to cause the apparatus to, determine a plurality of application topology states, each of the plurality of application topology states corresponding to a different time window; determine changes between the plurality of application topology states in chronological order; and indicate the changes between the plurality of application topology states. 14. The apparatus of claim 13, wherein the program code to determine the plurality of application topology states comprises program code to determine each of the plurality of application topology states with a different set of application component call data entries, wherein each application component call data entry indicates a time instant, a caller application component, and a callee application component, wherein the time instants indicated in each different set of application component call data entries are within a corresponding one of the different time windows. 15. The apparatus of claim 14, wherein the machine-readable medium further has stored therein program code executable by the processing unit to cause the apparatus to:
determine a time instant for either a first or a last application component call data entry of a set of component call data entries; determine a window size for a number of application component call data entries to determine an application topology state; wherein a first set of application component data entries includes a first application component data entry corresponding to the time instant, wherein each set of application component data entries includes a number of entries according to the window size. 16. The apparatus of claim 14, wherein each component call data entry also indicates an agent associated with an application corresponding to at least one of the caller application component and the callee application component. 17. The apparatus of claim 13, wherein each of the plurality of application topology states indicates calls between application components that occurred within the corresponding time window. 18. The apparatus of claim 13, wherein the program code to determine the plurality of application topology states comprises program code to generate a data representation of a directed graph for each set of a plurality of sets of component call data entries, wherein each set of the plurality of sets of component call data entries corresponds to a different time window. 19. The apparatus of claim 13, wherein the program code to determine the changes between the plurality of application topology states comprises the program code to determine application component calls indicated in a first of the plurality of application topology states but not indicated in a second of the plurality of application topology states, wherein the second application topology state corresponds to a second time window that is earlier than a first time window that corresponds to the first application topology state. 20. The apparatus of claim 13, wherein the program code to indicate the changes between the plurality of application topology states comprises program code to supply indications of the changes for graphical depiction. | 2,100 |
5,508 | 5,508 | 12,945,596 | 2,158 | In a system and method for user identification and verification using reputation data, a processor-implemented feedback component receives feedback data pertaining to a user of a network-based community in response to a transaction in which the user is a party. A processor-implemented tracking component tracks transaction data and metadata associated with the transaction data and the feedback data. A processor-implemented aggregation component aggregates the received feedback data and the tracked data and metadata to yield an aggregated set of data pertaining to the user. A processor-implemented reputation component generates a reputation value for the user from the aggregated set of data. If the reputation value is greater than a predetermined threshold value, the user is considered trustworthy, and if the reputation value is not greater than the predetermined threshold value, the user is not considered trustworthy. | 1. A system, comprising:
a processor-implemented feedback module configured to receive feedback data in response to a transaction, the feedback data directed to a user of a network-based community involved in the transaction; a processor-implemented tracking module configured to track and store data concerning the transaction and metadata associated with the transaction and the received feedback data; a processor-implemented aggregation module configured to aggregate the received feedback data and the tracked data and metadata to yield an aggregated set of data, the aggregated set of data associated with the user; and a processor-implemented reputation module configured to generate a reputation value for the user based on the aggregated set of user data, wherein the user is trustworthy if the user reputation value is greater than a predetermined threshold value, and wherein the user is not trustworthy if the user reputation value is not greater than the predetermined threshold value. 2. The system of claim 1, further comprising a processor-implemented query module configured to receive a query to analyze the aggregated set of data, the received query including one of a user attribute query and a contextual category query. 3. The system of claim 1, further comprising a processor-implemented claims module configured to store claim records relating to the user,
wherein the processor-implemented reputation module uses the claim records with the aggregated set of user data to generate the reputation value. 4. The system of claim 3, further comprising a processor-implemented analysis module configured to:
responsive to the user attribute query, provide to the user a first subset of data of the aggregated set of data having the user attribute specified in the user attribute query; and responsive to the contextual category query,
categorize the aggregated set of data using the tracked metadata; and
provide to the user a second subset of data of the aggregated set of data conforming to a category specified in the contextual category query. 5. The system of claim 1, wherein the processor-implemented reputation module is further configured to provide the user reputation value to a third party system in response to an application programming interface (API) call received by the reputation module. 6. The system of claim 1, wherein the processor-implemented reputation module is further configured to:
receive an API call from a third party system seeking to determine the trustworthiness of the user; generate, based on the user reputation value, a degree of trust determination; and provide the degree of trust determination to the third party system as a response to the API call. 7. The system of claim 3, wherein the processor-implemented reputation module is further configured to adjust the user reputation value based on a determination that at least one of the feedback data and the claim records is one of maliciously submitted and submitted by an untrustworthy user. 8. The system of claim 1, wherein the user reputation value is calculated by applying a formula to a set of weighted user attributes. 9. The system of claim 8, wherein the weighted user attributes used in calculating the user reputation value are selected based on a role of the user in the network-based community. 10. A computer-implemented method, comprising:
receiving, at a networked system, feedback data pertaining to a user of a network-based community, the feedback data received in response to a transaction; tracking, at the networked system, transaction data and metadata associated with the transaction data and the feedback data; aggregating the feedback data and the tracked data and metadata to obtain an aggregated set of data; generating, by a processor, a reputation value for the user from the aggregated set of data, wherein the reputation value indicates a trustworthiness of the user, wherein a user is trustworthy if the generated reputation value is greater than a predetermined threshold value, and wherein the user is not trustworthy if the generated reputation value is not greater than the predetermined value. 11. The computer-implemented method of claim 10, further comprising receiving a query from the user to analyze the aggregated set of data, the query specifying one of a user attribute and a contextual category to narrow the aggregated set of data. 12. The computer-implemented method of claim 11, further comprising:
responsive to a user attribute query:
searching the aggregated set of data using the user attribute; and
providing to the user a first subset of data of the aggregated set of data containing the user attribute; and
responsive to a contextual category query:
categorizing the aggregated set of data into categories using the tracked metadata; and
providing to the user a second subset of data of the aggregated set of data conforming to the contextual category specified in the query. 13. The computer-implemented method of claim 10, further comprising:
receiving an application programming interface (API) call from an external third party system, the API call requesting access to the reputation value of the user; and providing the reputation value of the user to the third party system in response to the API call. 14. The computer-implemented method of claim 10, further comprising:
receiving an API call from an external third party system, the API call requesting a determination of trustworthiness of the user; responsive to the API call, retrieving the reputation value of the user; generating a trustworthiness determination based on the reputation value of the user; and providing the trustworthiness determination to the external third party system as a response to the API call. 15. The computer-implemented method of claim 10, wherein the reputation value is generated by applying a formula to selectively weighted data and metadata of the aggregated set of results. 16. The computer-implemented method of claim 15, wherein the selectively weighted data and metadata of the aggregated set of results are selected based on a role of the user in the network-based community. 17. The computer-implemented method of claim 10, further comprising storing claim records relating to the user, wherein the reputation value of the user is generated from the claim records and the aggregated set of data. 18. The computer-implemented method of claim 17, further comprising adjusting the user reputation value based on a determination that at least one of the feedback data and the claim records is one of maliciously submitted and submitted by an untrustworthy user. 19. A non-transitory machine-readable storage medium storing a set of instructions that, when executed by a processor, causes the processor to perform operations, comprising:
receiving, at a networked system, feedback data pertaining to a user of a network-based community, the feedback data received in response to a transaction; tracking, at the networked system, transaction data and metadata associated with the transaction data and the feedback data; aggregating the feedback data and the tracked data and metadata to obtain an aggregated set of data; generating a reputation value for the user from the aggregated set of data, wherein the reputation value indicates a trustworthiness of the user, wherein a user is trustworthy if the generated reputation value is greater than a predetermined threshold value, and wherein the user is not trustworthy if the generated reputation value is not greater than the predetermined value. 20. The non-transitory machine-readable storage medium of claim 19, further comprising receiving a query from the user to analyze the aggregated set of data, the query specifying one of a user attribute and a contextual category to narrow the aggregated set of data. 21. The non-transitory machine-readable storage medium of claim 20, further comprising:
responsive to a user attribute query:
searching the aggregated set of data using the user attribute; and
providing to the user a first subset of data of the aggregated set of data containing the user attribute; and
responsive to a contextual category query:
categorizing the aggregated set of data into categories using the tracked metadata; and
providing to the user a second subset of data of the aggregated set of data conforming to the contextual category specified in the query. 22. The non-transitory machine-readable storage medium of claim 19, further comprising:
receiving an application programming interface (API) call from an external third party system, the API call requesting access to the reputation value of the user; and providing the reputation value of the user to the third party system in response to the API call. 23. The non-transitory machine-readable storage medium of claim 19, further comprising:
receiving an API call from an external third party system, the API call requesting a determination of trustworthiness of the user; responsive to the API call, retrieving the reputation value of the user; generating a trustworthiness determination based on the reputation value of the user; and providing the trustworthiness determination to the external third party system as a response to the API call. 24. The non-transitory machine-readable storage medium of claim 19, wherein the reputation value is generated by applying a formula to selectively weighted data and metadata of the aggregated set of results, wherein the selectively weighted data and metadata of the aggregated set of results are selected based on a role of the user in the network-based community. 25. The non-transitory machine-readable storage medium of claim 19, further comprising storing claim records relating to the user, wherein the reputation value of the user is generated from the claim records and the aggregated set of data. 26. The non-transitory machine-readable storage medium of claim 25, further comprising adjusting the user reputation value based on a determination that at least one of the feedback data and the claim records is one of maliciously submitted and submitted by an untrustworthy user. | In a system and method for user identification and verification using reputation data, a processor-implemented feedback component receives feedback data pertaining to a user of a network-based community in response to a transaction in which the user is a party. A processor-implemented tracking component tracks transaction data and metadata associated with the transaction data and the feedback data. A processor-implemented aggregation component aggregates the received feedback data and the tracked data and metadata to yield an aggregated set of data pertaining to the user. A processor-implemented reputation component generates a reputation value for the user from the aggregated set of data. If the reputation value is greater than a predetermined threshold value, the user is considered trustworthy, and if the reputation value is not greater than the predetermined threshold value, the user is not considered trustworthy.1. A system, comprising:
a processor-implemented feedback module configured to receive feedback data in response to a transaction, the feedback data directed to a user of a network-based community involved in the transaction; a processor-implemented tracking module configured to track and store data concerning the transaction and metadata associated with the transaction and the received feedback data; a processor-implemented aggregation module configured to aggregate the received feedback data and the tracked data and metadata to yield an aggregated set of data, the aggregated set of data associated with the user; and a processor-implemented reputation module configured to generate a reputation value for the user based on the aggregated set of user data, wherein the user is trustworthy if the user reputation value is greater than a predetermined threshold value, and wherein the user is not trustworthy if the user reputation value is not greater than the predetermined threshold value. 2. The system of claim 1, further comprising a processor-implemented query module configured to receive a query to analyze the aggregated set of data, the received query including one of a user attribute query and a contextual category query. 3. The system of claim 1, further comprising a processor-implemented claims module configured to store claim records relating to the user,
wherein the processor-implemented reputation module uses the claim records with the aggregated set of user data to generate the reputation value. 4. The system of claim 3, further comprising a processor-implemented analysis module configured to:
responsive to the user attribute query, provide to the user a first subset of data of the aggregated set of data having the user attribute specified in the user attribute query; and responsive to the contextual category query,
categorize the aggregated set of data using the tracked metadata; and
provide to the user a second subset of data of the aggregated set of data conforming to a category specified in the contextual category query. 5. The system of claim 1, wherein the processor-implemented reputation module is further configured to provide the user reputation value to a third party system in response to an application programming interface (API) call received by the reputation module. 6. The system of claim 1, wherein the processor-implemented reputation module is further configured to:
receive an API call from a third party system seeking to determine the trustworthiness of the user; generate, based on the user reputation value, a degree of trust determination; and provide the degree of trust determination to the third party system as a response to the API call. 7. The system of claim 3, wherein the processor-implemented reputation module is further configured to adjust the user reputation value based on a determination that at least one of the feedback data and the claim records is one of maliciously submitted and submitted by an untrustworthy user. 8. The system of claim 1, wherein the user reputation value is calculated by applying a formula to a set of weighted user attributes. 9. The system of claim 8, wherein the weighted user attributes used in calculating the user reputation value are selected based on a role of the user in the network-based community. 10. A computer-implemented method, comprising:
receiving, at a networked system, feedback data pertaining to a user of a network-based community, the feedback data received in response to a transaction; tracking, at the networked system, transaction data and metadata associated with the transaction data and the feedback data; aggregating the feedback data and the tracked data and metadata to obtain an aggregated set of data; generating, by a processor, a reputation value for the user from the aggregated set of data, wherein the reputation value indicates a trustworthiness of the user, wherein a user is trustworthy if the generated reputation value is greater than a predetermined threshold value, and wherein the user is not trustworthy if the generated reputation value is not greater than the predetermined value. 11. The computer-implemented method of claim 10, further comprising receiving a query from the user to analyze the aggregated set of data, the query specifying one of a user attribute and a contextual category to narrow the aggregated set of data. 12. The computer-implemented method of claim 11, further comprising:
responsive to a user attribute query:
searching the aggregated set of data using the user attribute; and
providing to the user a first subset of data of the aggregated set of data containing the user attribute; and
responsive to a contextual category query:
categorizing the aggregated set of data into categories using the tracked metadata; and
providing to the user a second subset of data of the aggregated set of data conforming to the contextual category specified in the query. 13. The computer-implemented method of claim 10, further comprising:
receiving an application programming interface (API) call from an external third party system, the API call requesting access to the reputation value of the user; and providing the reputation value of the user to the third party system in response to the API call. 14. The computer-implemented method of claim 10, further comprising:
receiving an API call from an external third party system, the API call requesting a determination of trustworthiness of the user; responsive to the API call, retrieving the reputation value of the user; generating a trustworthiness determination based on the reputation value of the user; and providing the trustworthiness determination to the external third party system as a response to the API call. 15. The computer-implemented method of claim 10, wherein the reputation value is generated by applying a formula to selectively weighted data and metadata of the aggregated set of results. 16. The computer-implemented method of claim 15, wherein the selectively weighted data and metadata of the aggregated set of results are selected based on a role of the user in the network-based community. 17. The computer-implemented method of claim 10, further comprising storing claim records relating to the user, wherein the reputation value of the user is generated from the claim records and the aggregated set of data. 18. The computer-implemented method of claim 17, further comprising adjusting the user reputation value based on a determination that at least one of the feedback data and the claim records is one of maliciously submitted and submitted by an untrustworthy user. 19. A non-transitory machine-readable storage medium storing a set of instructions that, when executed by a processor, causes the processor to perform operations, comprising:
receiving, at a networked system, feedback data pertaining to a user of a network-based community, the feedback data received in response to a transaction; tracking, at the networked system, transaction data and metadata associated with the transaction data and the feedback data; aggregating the feedback data and the tracked data and metadata to obtain an aggregated set of data; generating a reputation value for the user from the aggregated set of data, wherein the reputation value indicates a trustworthiness of the user, wherein a user is trustworthy if the generated reputation value is greater than a predetermined threshold value, and wherein the user is not trustworthy if the generated reputation value is not greater than the predetermined value. 20. The non-transitory machine-readable storage medium of claim 19, further comprising receiving a query from the user to analyze the aggregated set of data, the query specifying one of a user attribute and a contextual category to narrow the aggregated set of data. 21. The non-transitory machine-readable storage medium of claim 20, further comprising:
responsive to a user attribute query:
searching the aggregated set of data using the user attribute; and
providing to the user a first subset of data of the aggregated set of data containing the user attribute; and
responsive to a contextual category query:
categorizing the aggregated set of data into categories using the tracked metadata; and
providing to the user a second subset of data of the aggregated set of data conforming to the contextual category specified in the query. 22. The non-transitory machine-readable storage medium of claim 19, further comprising:
receiving an application programming interface (API) call from an external third party system, the API call requesting access to the reputation value of the user; and providing the reputation value of the user to the third party system in response to the API call. 23. The non-transitory machine-readable storage medium of claim 19, further comprising:
receiving an API call from an external third party system, the API call requesting a determination of trustworthiness of the user; responsive to the API call, retrieving the reputation value of the user; generating a trustworthiness determination based on the reputation value of the user; and providing the trustworthiness determination to the external third party system as a response to the API call. 24. The non-transitory machine-readable storage medium of claim 19, wherein the reputation value is generated by applying a formula to selectively weighted data and metadata of the aggregated set of results, wherein the selectively weighted data and metadata of the aggregated set of results are selected based on a role of the user in the network-based community. 25. The non-transitory machine-readable storage medium of claim 19, further comprising storing claim records relating to the user, wherein the reputation value of the user is generated from the claim records and the aggregated set of data. 26. The non-transitory machine-readable storage medium of claim 25, further comprising adjusting the user reputation value based on a determination that at least one of the feedback data and the claim records is one of maliciously submitted and submitted by an untrustworthy user. | 2,100 |
5,509 | 5,509 | 14,912,023 | 2,199 | The present disclosure provides a method and system for dynamically updating an application functionality in a secure and constrained manner comprising a cloud service for generating dynamic code fragments and receiving reports, an agent manager in communication with the cloud service receiving code fragments from the cloud service and passing reports thereto, and an in-application agent in communication with the agent manager for receiving dynamic code fragments therefrom and passing reports thereto for dynamically updating the application functionality in which the in-application agent is embedded. | 1. A system for dynamically updating application functionality, the system comprising:
an in-application agent for executing code fragments for dynamically updating the application functionality in which the in-application agent is embedded and for generating reports characterizing the application functionality; a cloud service for generating dynamic code fragments and receiving the reports; an agent manager in communication with the cloud service for receiving the dynamic code fragments from the cloud service and passing the dynamic code fragments received to the in-application agent and for receiving reports from the in-application agent and passing the reports received to the cloud service. 2. The system of claim 1 wherein the in-application agent includes a link manager for communications with the agent manager. 3. The system of claim 1 wherein the in-application agent includes hooks into the web application. 4. The system of claim 1 wherein the cloud service generates and updates the dynamic code fragments in response to application level and external data sources. 5. The system of claim 1 wherein upon receiving the new dynamic code fragments, the in-application agent updates a configuration to use the new dynamic code fragments. 6. The system of claim 1 wherein the in-application agent uses hooks to execute the code fragments. 7. The system of claim 1 wherein the in-application agent generates the reports locally. 8. A method of dynamically updating an application functionality, the method comprising:
embedding an in-application agent into an application; generating dynamic code fragments in a cloud service; providing these generated fragments to the in-application agent; the in-application agent receiving these fragments for updating the functionality in which the in-application agent is embedded. 9. The method of claim 8 further comprising:
the in-application agent executing new code fragments;
generating a report; and
sending it to the cloud service. 10. The method of claim 9 further comprising the step of the cloud service, upon receiving the report, having the possibility of generating a new code fragment and sending the new code fragment to the in-application agent. 11. The method of claim 8 further comprising:
the cloud service receiving new information;
generating new code fragments; and
sending the new code fragments to the in-application agent; and
the in-application agent executing the new code fragment. 12. A non-transitory computer readable medium comprising instructions in code which when stored in a memory of a computing device and executed by a processor of the computing device cause the computing device to:
execute an in-application agent embedded in an application, the in-application agent including: an in-app library for storing dynamic code fragments; a fragment processor for adding the dynamic code fragments to the application and for generating one or more reports; a link manager for receiving new dynamic code fragments from a cloud service generated in response to the one or more reports; one or more hooks in the application enabling the processor to inject the new dynamic code fragments into the web application. 13. The computer readable medium of claim 12 wherein the link manager communicates with the cloud service by communicating via an encrypted link with an agent manager. | The present disclosure provides a method and system for dynamically updating an application functionality in a secure and constrained manner comprising a cloud service for generating dynamic code fragments and receiving reports, an agent manager in communication with the cloud service receiving code fragments from the cloud service and passing reports thereto, and an in-application agent in communication with the agent manager for receiving dynamic code fragments therefrom and passing reports thereto for dynamically updating the application functionality in which the in-application agent is embedded.1. A system for dynamically updating application functionality, the system comprising:
an in-application agent for executing code fragments for dynamically updating the application functionality in which the in-application agent is embedded and for generating reports characterizing the application functionality; a cloud service for generating dynamic code fragments and receiving the reports; an agent manager in communication with the cloud service for receiving the dynamic code fragments from the cloud service and passing the dynamic code fragments received to the in-application agent and for receiving reports from the in-application agent and passing the reports received to the cloud service. 2. The system of claim 1 wherein the in-application agent includes a link manager for communications with the agent manager. 3. The system of claim 1 wherein the in-application agent includes hooks into the web application. 4. The system of claim 1 wherein the cloud service generates and updates the dynamic code fragments in response to application level and external data sources. 5. The system of claim 1 wherein upon receiving the new dynamic code fragments, the in-application agent updates a configuration to use the new dynamic code fragments. 6. The system of claim 1 wherein the in-application agent uses hooks to execute the code fragments. 7. The system of claim 1 wherein the in-application agent generates the reports locally. 8. A method of dynamically updating an application functionality, the method comprising:
embedding an in-application agent into an application; generating dynamic code fragments in a cloud service; providing these generated fragments to the in-application agent; the in-application agent receiving these fragments for updating the functionality in which the in-application agent is embedded. 9. The method of claim 8 further comprising:
the in-application agent executing new code fragments;
generating a report; and
sending it to the cloud service. 10. The method of claim 9 further comprising the step of the cloud service, upon receiving the report, having the possibility of generating a new code fragment and sending the new code fragment to the in-application agent. 11. The method of claim 8 further comprising:
the cloud service receiving new information;
generating new code fragments; and
sending the new code fragments to the in-application agent; and
the in-application agent executing the new code fragment. 12. A non-transitory computer readable medium comprising instructions in code which when stored in a memory of a computing device and executed by a processor of the computing device cause the computing device to:
execute an in-application agent embedded in an application, the in-application agent including: an in-app library for storing dynamic code fragments; a fragment processor for adding the dynamic code fragments to the application and for generating one or more reports; a link manager for receiving new dynamic code fragments from a cloud service generated in response to the one or more reports; one or more hooks in the application enabling the processor to inject the new dynamic code fragments into the web application. 13. The computer readable medium of claim 12 wherein the link manager communicates with the cloud service by communicating via an encrypted link with an agent manager. | 2,100 |
5,510 | 5,510 | 14,961,990 | 2,128 | First and second simulated processing of a stream-based computing application using respective first and second simulation conditions may be performed. The first and second simulation conditions may specify first and second operator graph configurations. Each simulated processing may include inputting a stream of test tuples to the stream-based computing application, which may operate on one or more compute nodes. Each compute node may have one or more computer processors and a memory to store one or more processing elements. Each simulated processing may be monitored to determine one or more performance metrics. The first and second simulated processings may be sorted based on a first performance metric to identify a simulated processing having a first rank. An operator graph configuration associated with the simulated processing having the first rank may be selected if the first performance metric for the simulated processing having the first rank is within a processing constraint. | 1. A computer program product for selecting an operator graph configuration for a stream-based computing application, the computer program product comprising a computer readable storage medium having program code embodied therewith, the program code comprising computer readable program code configured to:
perform a first simulated processing of the stream-based computing application using a first simulation condition, the first simulation condition specifying a first operator graph configuration; perform a second simulated processing of the stream-based computing application using a second simulation condition, the second simulation condition specifying a second operator graph configuration, the second simulation condition being distinct from the first simulation condition; each simulated processing including inputting a stream of test tuples to the stream-based computing application, the stream-based computing application operating on one or more compute nodes, each compute node having one or more computer processors and a memory to store one or more processing elements, each processing element having one or more stream operators; monitor each simulated processing to determine one or more performance metrics; sort the first and second simulated processings based on a first performance metric to identify a simulated processing having a first rank; and select an operator graph configuration associated with the simulated processing having the first rank if the first performance metric for the simulated processing having the first rank is within a processing constraint. 2. A stream-based computing system, comprising:
one or more compute nodes, each compute node having one or more computer processors and a memory to store one or more processing elements, each processing element having one or more stream operators, the compute nodes being configured to: perform a first simulated processing of the stream-based computing application using a first simulation condition, the first simulation condition specifying a first operator graph configuration; perform a second simulated processing of the stream-based computing application using a second simulation condition, the second simulation condition specifying a second operator graph configuration, the second simulation condition being distinct from the first simulation condition; and a management system operating on a compute node, the compute node having one or more computer processors and a memory to store an application verifier, the application verifier being configured to: monitor each simulated processing to determine one or more performance metrics; sort the first and second simulated processings based on a first performance metric to identify a simulated processing having a first rank; and select an operator graph configuration associated with the simulated processing having the first rank if the first performance metric for the simulated processing having the first rank is within a processing constraint. 3. The stream-based computing system of claim 2, wherein, if the first performance metric for the simulated processing having the first rank is outside of the processing constraint, the compute nodes are further configured to perform a third simulated processing of the stream-based computing application using a third simulation condition, the third simulation condition specifying a third operator graph configuration and being distinct from the first and second simulation conditions. 4. The stream-based computing system of claim 2, wherein the one or more performance metrics includes a processing time and the processing constraint is a processing time constraint. 5. The stream-based computing system of claim 2, wherein the first simulation condition includes deactivating one of the compute nodes. 6. The stream-based computing system of claim 2, wherein the first simulation condition includes configuring a stream operator to initiate an extra stream-based computing application communication. 7. The stream-based computing system of claim 2, wherein the first simulation condition includes configuring a stream operator to group two or more tuples for transmission. | First and second simulated processing of a stream-based computing application using respective first and second simulation conditions may be performed. The first and second simulation conditions may specify first and second operator graph configurations. Each simulated processing may include inputting a stream of test tuples to the stream-based computing application, which may operate on one or more compute nodes. Each compute node may have one or more computer processors and a memory to store one or more processing elements. Each simulated processing may be monitored to determine one or more performance metrics. The first and second simulated processings may be sorted based on a first performance metric to identify a simulated processing having a first rank. An operator graph configuration associated with the simulated processing having the first rank may be selected if the first performance metric for the simulated processing having the first rank is within a processing constraint.1. A computer program product for selecting an operator graph configuration for a stream-based computing application, the computer program product comprising a computer readable storage medium having program code embodied therewith, the program code comprising computer readable program code configured to:
perform a first simulated processing of the stream-based computing application using a first simulation condition, the first simulation condition specifying a first operator graph configuration; perform a second simulated processing of the stream-based computing application using a second simulation condition, the second simulation condition specifying a second operator graph configuration, the second simulation condition being distinct from the first simulation condition; each simulated processing including inputting a stream of test tuples to the stream-based computing application, the stream-based computing application operating on one or more compute nodes, each compute node having one or more computer processors and a memory to store one or more processing elements, each processing element having one or more stream operators; monitor each simulated processing to determine one or more performance metrics; sort the first and second simulated processings based on a first performance metric to identify a simulated processing having a first rank; and select an operator graph configuration associated with the simulated processing having the first rank if the first performance metric for the simulated processing having the first rank is within a processing constraint. 2. A stream-based computing system, comprising:
one or more compute nodes, each compute node having one or more computer processors and a memory to store one or more processing elements, each processing element having one or more stream operators, the compute nodes being configured to: perform a first simulated processing of the stream-based computing application using a first simulation condition, the first simulation condition specifying a first operator graph configuration; perform a second simulated processing of the stream-based computing application using a second simulation condition, the second simulation condition specifying a second operator graph configuration, the second simulation condition being distinct from the first simulation condition; and a management system operating on a compute node, the compute node having one or more computer processors and a memory to store an application verifier, the application verifier being configured to: monitor each simulated processing to determine one or more performance metrics; sort the first and second simulated processings based on a first performance metric to identify a simulated processing having a first rank; and select an operator graph configuration associated with the simulated processing having the first rank if the first performance metric for the simulated processing having the first rank is within a processing constraint. 3. The stream-based computing system of claim 2, wherein, if the first performance metric for the simulated processing having the first rank is outside of the processing constraint, the compute nodes are further configured to perform a third simulated processing of the stream-based computing application using a third simulation condition, the third simulation condition specifying a third operator graph configuration and being distinct from the first and second simulation conditions. 4. The stream-based computing system of claim 2, wherein the one or more performance metrics includes a processing time and the processing constraint is a processing time constraint. 5. The stream-based computing system of claim 2, wherein the first simulation condition includes deactivating one of the compute nodes. 6. The stream-based computing system of claim 2, wherein the first simulation condition includes configuring a stream operator to initiate an extra stream-based computing application communication. 7. The stream-based computing system of claim 2, wherein the first simulation condition includes configuring a stream operator to group two or more tuples for transmission. | 2,100 |
5,511 | 5,511 | 14,743,460 | 2,121 | Semantic information that describes data sets is inferred based upon a semantic analysis performed on data sets retained within a data repository. The semantic analysis can include a determination of formats associated with fields of the data sets and a comparison of values of the fields against reference data sets having predetermined semantic types. Correlations are inferred between data sets based upon respective semantic information. The correlations are incorporated into visualizations displayed in connection with a graphical user interface. | 1. A method, comprising:
selecting a subset of data from a data set stored in a data repository; identifying a format in which values in the subset of data are represented by comparing a structure of at least one value in the subset of data to a plurality of known data patterns; inferring a candidate semantic type of data in the data set based on the identified format; validating values of the data in the data set against a set of domain rules, the set of domain rules establishing valid data values for the candidate semantic type; and presenting invalid values to a user, the invalid values representing values of the data in the data set that are disallowed by the set of domain rules; at least one of the selecting, identifying, inferring, validating and presenting steps being performed by at least one processor. 2. The method of claim 1, further comprising:
enabling the user to correct one or more of the invalid values. 3. The method of claim 1, further comprising:
enabling the user to accept one or more of the invalid values. 4. The method of claim 1, where validating the values of the data in the data set against the set of domain rules comprises:
determining if each of the values of the data in the data set is within a range of valid numeric values. 5. The method of claim 1, wherein the selecting the subset of data comprises selecting an entirety of the data set. 6. The method of claim 1, wherein the selecting the subset of data comprises selecting, at random, values of the data set. 7. The method of claim 1, wherein the selecting the subset of data comprises selecting a pre-determined number of values from at least one of a beginning of the data set, a middle of the data set, or an end of the data set. 8. The method of claim 1, wherein the inferring the candidate semantic type of data in the data set based on the identified format comprises:
inferring the candidate semantic type when it is determined that a number of values in the subset of data having a structure that matches the identified format exceeds a predetermined threshold. 9. The method of claim 1, wherein inferring the candidate semantic type of the data in the data set based on the identified format comprises:
selecting at least one reference data set based upon the identified format, wherein the at least one reference data set is associated with a known semantic type; comparing values of the subset of data against the at least one reference data set; and inferring the candidate semantic type of the data in the data set based upon at least one result of the comparing. 10. The method of claim 9, wherein the comparing the values of the subset of data against the at least one reference data set comprises:
selecting a value from the subset of data; querying the at least one reference data set with the selected value; and counting a valid hit when a result of the query with the selected value is returned. 11. The method of claim 1, further comprising:
identifying a second data set including at least one field corresponding to the candidate semantic type of the data in the data set; and generating relationship information that associates the data set with the second data set, wherein the relationship information specifies a correlation between the data set and the second data set. 12. The method of claim 11, further comprising:
displaying a visualization of the relationship information as part of a graphical user interface. 13. The method of claim 12, further comprising:
receiving input via the graphical user interface; and updating the relationship information based upon the input. 14. The method of claim 1, further comprising outputting the candidate semantic type for external confirmation. 15. A semantic analysis system, comprising:
one or more processors; a semantic analysis component executed by at least one of the one or more processors, the semantic analysis component being configured to infer semantic information about data in the data set, the semantic information including a candidate semantic type of the data in a data set; and a domain check component executed by at least one of the one or more processors, the domain check component being configured to validate values of the data in the data set against a set of domain rules, the set of domain rules establishing valid data values for the candidate semantic type, and to present invalid values to a user, the invalid values representing values of the data in the data set that are disallowed by the set of domain rules. 16. The semantic analysis system of claim 15, wherein the semantic analysis component comprises:
a format check component configured to identify a format of sample data extracted from the data set and to select one or more reference data sets based upon the format; and a value check component configured to check values of the sample data against the one or more reference data sets to identify a semantic type of the sample data, wherein the semantic analysis component is further configured to infer the candidate semantic type of the data in the data set based upon the identified semantic type of the sample data. 17. The semantic analysis system of claim 15, wherein the domain check component is further configured to enable a user to correct or accept one or more of the invalid values. 18. The semantic analysis system of claim 15, further comprising:
a linking component configured to correlate a plurality of disparate data sets based upon respective semantic information associated therewith. 19. The semantic analysis system of claim 15, further comprising:
a visualization component configured to generate a visualization of correlations between data sets, wherein the visualization comprises a graph display where nodes represent the data sets and edges represent correlations between the data sets. 20. A computer-readable memory device comprising computer-executable instructions that, in response to execution, cause a computing device to perform operations, the operations including:
identifying a format in which a subset of data selected from a data set stored in a data repository is represented by comparing a structure of at least one value in the subset of data to a plurality of known data patterns; inferring a candidate semantic type of data in the data set based on the identified format; validating values of the data in the data set against a set of domain rules, the set of domain rules establishing valid data values for the candidate semantic type; and presenting invalid values to a user, the invalid values representing values of the data in the data set that are disallowed by the set of domain rules. | Semantic information that describes data sets is inferred based upon a semantic analysis performed on data sets retained within a data repository. The semantic analysis can include a determination of formats associated with fields of the data sets and a comparison of values of the fields against reference data sets having predetermined semantic types. Correlations are inferred between data sets based upon respective semantic information. The correlations are incorporated into visualizations displayed in connection with a graphical user interface.1. A method, comprising:
selecting a subset of data from a data set stored in a data repository; identifying a format in which values in the subset of data are represented by comparing a structure of at least one value in the subset of data to a plurality of known data patterns; inferring a candidate semantic type of data in the data set based on the identified format; validating values of the data in the data set against a set of domain rules, the set of domain rules establishing valid data values for the candidate semantic type; and presenting invalid values to a user, the invalid values representing values of the data in the data set that are disallowed by the set of domain rules; at least one of the selecting, identifying, inferring, validating and presenting steps being performed by at least one processor. 2. The method of claim 1, further comprising:
enabling the user to correct one or more of the invalid values. 3. The method of claim 1, further comprising:
enabling the user to accept one or more of the invalid values. 4. The method of claim 1, where validating the values of the data in the data set against the set of domain rules comprises:
determining if each of the values of the data in the data set is within a range of valid numeric values. 5. The method of claim 1, wherein the selecting the subset of data comprises selecting an entirety of the data set. 6. The method of claim 1, wherein the selecting the subset of data comprises selecting, at random, values of the data set. 7. The method of claim 1, wherein the selecting the subset of data comprises selecting a pre-determined number of values from at least one of a beginning of the data set, a middle of the data set, or an end of the data set. 8. The method of claim 1, wherein the inferring the candidate semantic type of data in the data set based on the identified format comprises:
inferring the candidate semantic type when it is determined that a number of values in the subset of data having a structure that matches the identified format exceeds a predetermined threshold. 9. The method of claim 1, wherein inferring the candidate semantic type of the data in the data set based on the identified format comprises:
selecting at least one reference data set based upon the identified format, wherein the at least one reference data set is associated with a known semantic type; comparing values of the subset of data against the at least one reference data set; and inferring the candidate semantic type of the data in the data set based upon at least one result of the comparing. 10. The method of claim 9, wherein the comparing the values of the subset of data against the at least one reference data set comprises:
selecting a value from the subset of data; querying the at least one reference data set with the selected value; and counting a valid hit when a result of the query with the selected value is returned. 11. The method of claim 1, further comprising:
identifying a second data set including at least one field corresponding to the candidate semantic type of the data in the data set; and generating relationship information that associates the data set with the second data set, wherein the relationship information specifies a correlation between the data set and the second data set. 12. The method of claim 11, further comprising:
displaying a visualization of the relationship information as part of a graphical user interface. 13. The method of claim 12, further comprising:
receiving input via the graphical user interface; and updating the relationship information based upon the input. 14. The method of claim 1, further comprising outputting the candidate semantic type for external confirmation. 15. A semantic analysis system, comprising:
one or more processors; a semantic analysis component executed by at least one of the one or more processors, the semantic analysis component being configured to infer semantic information about data in the data set, the semantic information including a candidate semantic type of the data in a data set; and a domain check component executed by at least one of the one or more processors, the domain check component being configured to validate values of the data in the data set against a set of domain rules, the set of domain rules establishing valid data values for the candidate semantic type, and to present invalid values to a user, the invalid values representing values of the data in the data set that are disallowed by the set of domain rules. 16. The semantic analysis system of claim 15, wherein the semantic analysis component comprises:
a format check component configured to identify a format of sample data extracted from the data set and to select one or more reference data sets based upon the format; and a value check component configured to check values of the sample data against the one or more reference data sets to identify a semantic type of the sample data, wherein the semantic analysis component is further configured to infer the candidate semantic type of the data in the data set based upon the identified semantic type of the sample data. 17. The semantic analysis system of claim 15, wherein the domain check component is further configured to enable a user to correct or accept one or more of the invalid values. 18. The semantic analysis system of claim 15, further comprising:
a linking component configured to correlate a plurality of disparate data sets based upon respective semantic information associated therewith. 19. The semantic analysis system of claim 15, further comprising:
a visualization component configured to generate a visualization of correlations between data sets, wherein the visualization comprises a graph display where nodes represent the data sets and edges represent correlations between the data sets. 20. A computer-readable memory device comprising computer-executable instructions that, in response to execution, cause a computing device to perform operations, the operations including:
identifying a format in which a subset of data selected from a data set stored in a data repository is represented by comparing a structure of at least one value in the subset of data to a plurality of known data patterns; inferring a candidate semantic type of data in the data set based on the identified format; validating values of the data in the data set against a set of domain rules, the set of domain rules establishing valid data values for the candidate semantic type; and presenting invalid values to a user, the invalid values representing values of the data in the data set that are disallowed by the set of domain rules. | 2,100 |
5,512 | 5,512 | 13,751,940 | 2,173 | Techniques are disclosed for facilitating the use of an electronic device having a user interface that is sensitive to a user's gestures. An “eyes-free” mode is provided in which the user can control the device without looking at the device display. Once the eyes-free mode is engaged, the user can control the device by performing gestures that are detected by the device, wherein a gesture is interpreted by the device without regard to a specific location where the gesture is made. The eyes-free mode can be used, for example, to look up a dictionary definition of a word in an e-book or to navigate through and select options from a hierarchical menu of settings on a tablet. The eyes-free mode advantageously allows a user to interact with the user interface in situations where the user has little or no ability to establish concentrated visual contact with the device display. | 1. A device comprising:
a touch sensitive surface for detecting gestures made by a user; and a user interface including a manual mode in which the user interface is configured to respond to a content selection gesture by selecting a segment of displayed digital content, wherein the content selection gesture is responded to without regard to a particular location on the touch sensitive surface where said gesture is detected. 2. The device of claim 1, wherein the content selection gesture comprises a horizontal fling gesture. 3. The device of claim 1, wherein the selected segment of the displayed digital content is chosen from the group consisting of a selected word, a selected sentence and a selected paragraph. 4. The device of claim 1, further comprising a speaker, wherein the user interface is further configured to respond to the content selection gesture by aurally presenting the selected segment of the displayed digital content using the speaker. 5. The device of claim 1, further comprising a text-to-speech module, wherein the user interface is further configured to respond to the content selection gesture by generating an audio signal corresponding to the selected segment of the displayed digital content using the text-to-speech module. 6. The device of claim 1, wherein:
the user interface further includes an options overlay in which a plurality of command options are displayed on a display; the user interface further includes a control overlay corresponding to a selected one of the plurality of command options displayed in the options overlay; and the selected one of the plurality of command options is applied to the selected segment of the displayed digital content. 7. The device of claim 1, wherein:
the user interface further includes an options overlay in which a plurality of command options are displayed on a display; the user interface further includes a control overlay corresponding to a selected one of the plurality of command options displayed in the options overlay; detection of a forward transition gesture causes the user interface to transition (a) from the manual mode to the options overlay when the manual mode is active, and (b) from the options overlay to the control overlay when the options overlay is active; and the forward transition gesture is responded to without regard to a particular location on the touch sensitive surface where said gesture is detected. 8. The device of claim 1, wherein:
the selected segment of the displayed digital content is a selected word; and the user interface further includes (a) an options overlay in which a word definition function is displayed on a display, and (b) a control overlay in which a definition of the selected word is displayed on the display. 9. The device of claim 1, further comprising a speaker, wherein:
the selected segment of the displayed digital content is a selected word; and the user interface further includes (a) an options overlay in which a word spelling function is displayed on a display, and (b) a control overlay in which the selected word is spelled aloud using the speaker. 10. The device of claim 1, wherein:
the device is selected from the group consisting of an e-reader, a tablet computer and a smartphone; and the touch sensitive surface is a touch sensitive display. 11. The device of claim 1, further comprising:
a speaker; and a text-to-speech module, wherein:
the user interface further includes a reading mode in which the text-to-speech module converts the displayed digital content into an audio signal that is aurally presented using the speaker,
detection of a transition command gesture causes the user interface to toggle back-and-forth between the reading and manual modes, and
the transition command gesture is responded to without regard to a particular location on the touch sensitive display where said gesture is detected. 12. A mobile electronic device comprising:
a touch sensitive display for displaying digital content and detecting gestures made by a user; a speaker; a text-to-speech module; and a user interface including (a) a reading mode in which the text-to-speech module converts the displayed digital content into an audio signal that is aurally presented using the speaker, and (b) a manual mode in which the playing of the audio signal generated by the text-to-speech module is paused, wherein:
detection of a transition command gesture causes the user interface to toggle back-and-forth between the reading and manual modes,
the user interface is configured to respond to a content selection gesture that is detected by the touch sensitive display while the user interface is in the manual mode by selecting a segment of the displayed digital content, and
the transition command gesture and the content selection gesture are responded to without regard to a particular location on the touch sensitive display where such gestures are detected. 13. The mobile electronic device of claim 12, wherein the content selection gesture is a multi-finger horizontal fling that results in selection of a selected word from the displayed digital content. 14. The mobile electronic device of claim 12, wherein the user interface is configured to not respond to the content selection gesture when the user interface is in the reading mode. 15. The mobile electronic device of claim 12, wherein the user interface is configured to only respond to the transition command gesture when in the reading mode. 16. The mobile electronic device of claim 12, wherein detection of the transition command gesture causes the user interface to play a mode transition announcement using the speaker. 17. The mobile electronic device of claim 12, wherein the user interface is configured to further respond to the content selection gesture by causing the selected segment of digital content to be aurally presented using the speaker. 18. A non-transitory computer readable medium encoded with instructions that, when executed by at least one processor, cause a content selection process to be carried out, the process comprising:
displaying digital content on a display; detecting a content selection gesture made on a touch sensitive surface; responding to the content selection gesture by selecting a segment of displayed digital content, wherein the content selection gesture is responded to without regard to a particular location on the touch sensitive surface where said gesture is detected. 19. The non-transitory computer readable medium of claim 18, wherein the content selection process further comprises responding to the content selection gesture by highlighting the selected segment of the displayed digital content. 20. The non-transitory computer readable medium of claim 18, wherein the content selection process further comprises responding to the content selection gesture by aurally presenting the selected segment of the displayed digital content using a text-to-speech module and a speaker. | Techniques are disclosed for facilitating the use of an electronic device having a user interface that is sensitive to a user's gestures. An “eyes-free” mode is provided in which the user can control the device without looking at the device display. Once the eyes-free mode is engaged, the user can control the device by performing gestures that are detected by the device, wherein a gesture is interpreted by the device without regard to a specific location where the gesture is made. The eyes-free mode can be used, for example, to look up a dictionary definition of a word in an e-book or to navigate through and select options from a hierarchical menu of settings on a tablet. The eyes-free mode advantageously allows a user to interact with the user interface in situations where the user has little or no ability to establish concentrated visual contact with the device display.1. A device comprising:
a touch sensitive surface for detecting gestures made by a user; and a user interface including a manual mode in which the user interface is configured to respond to a content selection gesture by selecting a segment of displayed digital content, wherein the content selection gesture is responded to without regard to a particular location on the touch sensitive surface where said gesture is detected. 2. The device of claim 1, wherein the content selection gesture comprises a horizontal fling gesture. 3. The device of claim 1, wherein the selected segment of the displayed digital content is chosen from the group consisting of a selected word, a selected sentence and a selected paragraph. 4. The device of claim 1, further comprising a speaker, wherein the user interface is further configured to respond to the content selection gesture by aurally presenting the selected segment of the displayed digital content using the speaker. 5. The device of claim 1, further comprising a text-to-speech module, wherein the user interface is further configured to respond to the content selection gesture by generating an audio signal corresponding to the selected segment of the displayed digital content using the text-to-speech module. 6. The device of claim 1, wherein:
the user interface further includes an options overlay in which a plurality of command options are displayed on a display; the user interface further includes a control overlay corresponding to a selected one of the plurality of command options displayed in the options overlay; and the selected one of the plurality of command options is applied to the selected segment of the displayed digital content. 7. The device of claim 1, wherein:
the user interface further includes an options overlay in which a plurality of command options are displayed on a display; the user interface further includes a control overlay corresponding to a selected one of the plurality of command options displayed in the options overlay; detection of a forward transition gesture causes the user interface to transition (a) from the manual mode to the options overlay when the manual mode is active, and (b) from the options overlay to the control overlay when the options overlay is active; and the forward transition gesture is responded to without regard to a particular location on the touch sensitive surface where said gesture is detected. 8. The device of claim 1, wherein:
the selected segment of the displayed digital content is a selected word; and the user interface further includes (a) an options overlay in which a word definition function is displayed on a display, and (b) a control overlay in which a definition of the selected word is displayed on the display. 9. The device of claim 1, further comprising a speaker, wherein:
the selected segment of the displayed digital content is a selected word; and the user interface further includes (a) an options overlay in which a word spelling function is displayed on a display, and (b) a control overlay in which the selected word is spelled aloud using the speaker. 10. The device of claim 1, wherein:
the device is selected from the group consisting of an e-reader, a tablet computer and a smartphone; and the touch sensitive surface is a touch sensitive display. 11. The device of claim 1, further comprising:
a speaker; and a text-to-speech module, wherein:
the user interface further includes a reading mode in which the text-to-speech module converts the displayed digital content into an audio signal that is aurally presented using the speaker,
detection of a transition command gesture causes the user interface to toggle back-and-forth between the reading and manual modes, and
the transition command gesture is responded to without regard to a particular location on the touch sensitive display where said gesture is detected. 12. A mobile electronic device comprising:
a touch sensitive display for displaying digital content and detecting gestures made by a user; a speaker; a text-to-speech module; and a user interface including (a) a reading mode in which the text-to-speech module converts the displayed digital content into an audio signal that is aurally presented using the speaker, and (b) a manual mode in which the playing of the audio signal generated by the text-to-speech module is paused, wherein:
detection of a transition command gesture causes the user interface to toggle back-and-forth between the reading and manual modes,
the user interface is configured to respond to a content selection gesture that is detected by the touch sensitive display while the user interface is in the manual mode by selecting a segment of the displayed digital content, and
the transition command gesture and the content selection gesture are responded to without regard to a particular location on the touch sensitive display where such gestures are detected. 13. The mobile electronic device of claim 12, wherein the content selection gesture is a multi-finger horizontal fling that results in selection of a selected word from the displayed digital content. 14. The mobile electronic device of claim 12, wherein the user interface is configured to not respond to the content selection gesture when the user interface is in the reading mode. 15. The mobile electronic device of claim 12, wherein the user interface is configured to only respond to the transition command gesture when in the reading mode. 16. The mobile electronic device of claim 12, wherein detection of the transition command gesture causes the user interface to play a mode transition announcement using the speaker. 17. The mobile electronic device of claim 12, wherein the user interface is configured to further respond to the content selection gesture by causing the selected segment of digital content to be aurally presented using the speaker. 18. A non-transitory computer readable medium encoded with instructions that, when executed by at least one processor, cause a content selection process to be carried out, the process comprising:
displaying digital content on a display; detecting a content selection gesture made on a touch sensitive surface; responding to the content selection gesture by selecting a segment of displayed digital content, wherein the content selection gesture is responded to without regard to a particular location on the touch sensitive surface where said gesture is detected. 19. The non-transitory computer readable medium of claim 18, wherein the content selection process further comprises responding to the content selection gesture by highlighting the selected segment of the displayed digital content. 20. The non-transitory computer readable medium of claim 18, wherein the content selection process further comprises responding to the content selection gesture by aurally presenting the selected segment of the displayed digital content using a text-to-speech module and a speaker. | 2,100 |
5,513 | 5,513 | 15,612,027 | 2,122 | A load control device may be configured to control multiple characteristics of one or more electrical loads such as the intensity and color of a lighting load. The load control device may switch from controlling one characteristic of the electrical loads to controlling another characteristic of the electrical loads based on the position and/or orientation of one or more components of the load control device. Such a position and/or orientation may be manipulated by moving the one or more components relative to a base portion of the load control device. The load control device may be a wall-mounted device or a battery-powered remote control device. | 1. A control device configured for use in a load control system to control one or more electrical loads external to the control device, the control device comprising:
a base portion configured to be mounted to an electrical wallbox or over a mechanical switch; a rotating portion rotatable with respect to the base portion; an actuation portion comprising a front surface; and a control circuit configured to generate first control data for changing a first characteristic of the one or more electrical loads in response to rotations of the rotating portion when the front surface of the actuation portion is located in a first plane along an axis perpendicular to the base portion, and generate second control data for changing a second characteristic of the one or more electrical loads in response to rotations of the rotating portion when the front surface of the actuation portion is located in a second plane parallel to the first plane. 2. The control device of claim 1, wherein the control circuit is configured to generate the first control data for adjusting an intensity of the one or more electrical loads in response to rotations of the rotating portion when the front surface of the actuation portion is located in the first plane, and generate the second control data for changing a color of the one or more electrical loads in response to rotations of the rotating portion when the front surface of the actuation portion is located in the second plane. 3. The control device of claim 2, further comprising:
one or more visual indicators configured to be illuminated by one or more light sources. 4. The control device of claim 3, wherein, when the rotating portion is being rotated to adjust the intensity of the one or more electrical loads, the control circuit is configured to illuminate the one or more visual indicators to display feedback information regarding a present intensity of the one or more electrical loads. 5. The control device of claim 3, wherein, when the rotating portion is being rotated to adjust the color of the one or more electrical loads, the control circuit is configured to illuminate the one or more visual indicators to display feedback information regarding a present color of the one or more electrical loads. 6. The control device of claim 1, wherein the second plane is located closer to the base portion than the first plane, and the front surface of the actuation portion is configured to be moved from the first plane to the second plane when the rotating portion is pushed in towards the base portion. 7. The control device of claim 1, further comprising an internal switch coupled to the control circuit, wherein the actuation portion is configured to actuate the internal switch when the front surface of the actuation portion is in the second plane, and the control circuit is configured to generate second control data for changing the second characteristic of the one or more electrical loads in response to rotations of the rotating portion while the internal switch is actuated. 8. The control device of claim 1, wherein the second plane is located farther away from the base portion than the first plane, and the front surface of the actuation portion is configured to be moved from the first plane to the second plane when the rotating portion is pulled away from the base portion. 9. The control device of claim 1, wherein, once in the second plane, the front surface of the actuation portion is configured to be maintained in the second plane without an external force. 10. The control device of claim 1, wherein, once in the second plane, the front surface of the actuation portion is configured to be biased back towards the first plane without an external force and to stay in the second plane while the external force is applied. 11. The control device of claim 1, wherein the actuation portion is attached to the rotating portion. 12. The control device of claim 1, wherein the actuation portion is separate from the rotating portion and received in a central opening of the rotating portion. 13. The control device of claim 1, further comprising:
a communication circuit configured to transmit a first control signal associated with the first control data and a second control signal associated with the second control data. 14. The control device of claim 1, further comprising:
a load control circuit adapted to be electrically coupled in series between an AC power source and the one or more electrical loads for controlling power delivered to the one or more electrical loads. 15. The control device of claim 1, wherein the control device is configured to be mounted over a toggle actuator of the mechanical switch that controls whether power is delivered to the one or more electrical loads. 16. A control device configured for use in a load control system to control one or more electrical loads external to the control device, the control device comprising:
a base portion configured to be mounted to an electrical wallbox or over a mechanical switch; a rotating portion rotatable with respect to the base portion, the rotating portion comprising a front area; and a control circuit configured to generate first control data for changing an intensity of the one or more electrical loads in response to rotations of the rotating portion when the front area of the rotating portion is located in a first plane along an axis perpendicular to the base portion, and generate second control data for changing a color of the one or more electrical loads in response to rotations of the rotating portion when the front area of the rotating portion is located in a second plane parallel to the first plane. 17. The control device of claim 16, further comprising:
an actuation portion comprising a front surface that defines the front area of the rotating portion. 18. The control device of claim 17, wherein the actuation portion is attached to the rotating portion. 19. The control device of claim 17, wherein the actuation portion is separate from the rotating portion and received in a central opening of the rotating portion. 20. The control device of claim 16, wherein the second plane is located closer to the base portion than the first plane, and the front area of the rotating portion is capable of being moved from the first plane to the second plane when the rotating portion is pushed in towards the base portion. 21. The control device of claim 16, wherein the second plane is located farther away from the base portion than the first plane, and the front area of the rotating portion is capable of being moved from the first plane to the second plane when the rotating portion is pulled away from the base portion. 22. A control device for controlling an electrical load in a load control system, the control device comprising:
a base portion configured to be mounted over an actuator of a mechanical switch that controls power delivered to the electrical load; a rotating portion rotatable with respect to the base portion; an actuation portion having a front surface; and a control circuit configured to generate first control data for changing an intensity of the electrical load in response to rotations of the rotating portion when the front surface of the actuation portion is located in a first plane along an axis perpendicular to the base portion, and generate second control data for changing a color of the electrical load in response to rotations of the rotating portion when the front surface of the actuation portion is located in a second plane parallel to the first plane. | A load control device may be configured to control multiple characteristics of one or more electrical loads such as the intensity and color of a lighting load. The load control device may switch from controlling one characteristic of the electrical loads to controlling another characteristic of the electrical loads based on the position and/or orientation of one or more components of the load control device. Such a position and/or orientation may be manipulated by moving the one or more components relative to a base portion of the load control device. The load control device may be a wall-mounted device or a battery-powered remote control device.1. A control device configured for use in a load control system to control one or more electrical loads external to the control device, the control device comprising:
a base portion configured to be mounted to an electrical wallbox or over a mechanical switch; a rotating portion rotatable with respect to the base portion; an actuation portion comprising a front surface; and a control circuit configured to generate first control data for changing a first characteristic of the one or more electrical loads in response to rotations of the rotating portion when the front surface of the actuation portion is located in a first plane along an axis perpendicular to the base portion, and generate second control data for changing a second characteristic of the one or more electrical loads in response to rotations of the rotating portion when the front surface of the actuation portion is located in a second plane parallel to the first plane. 2. The control device of claim 1, wherein the control circuit is configured to generate the first control data for adjusting an intensity of the one or more electrical loads in response to rotations of the rotating portion when the front surface of the actuation portion is located in the first plane, and generate the second control data for changing a color of the one or more electrical loads in response to rotations of the rotating portion when the front surface of the actuation portion is located in the second plane. 3. The control device of claim 2, further comprising:
one or more visual indicators configured to be illuminated by one or more light sources. 4. The control device of claim 3, wherein, when the rotating portion is being rotated to adjust the intensity of the one or more electrical loads, the control circuit is configured to illuminate the one or more visual indicators to display feedback information regarding a present intensity of the one or more electrical loads. 5. The control device of claim 3, wherein, when the rotating portion is being rotated to adjust the color of the one or more electrical loads, the control circuit is configured to illuminate the one or more visual indicators to display feedback information regarding a present color of the one or more electrical loads. 6. The control device of claim 1, wherein the second plane is located closer to the base portion than the first plane, and the front surface of the actuation portion is configured to be moved from the first plane to the second plane when the rotating portion is pushed in towards the base portion. 7. The control device of claim 1, further comprising an internal switch coupled to the control circuit, wherein the actuation portion is configured to actuate the internal switch when the front surface of the actuation portion is in the second plane, and the control circuit is configured to generate second control data for changing the second characteristic of the one or more electrical loads in response to rotations of the rotating portion while the internal switch is actuated. 8. The control device of claim 1, wherein the second plane is located farther away from the base portion than the first plane, and the front surface of the actuation portion is configured to be moved from the first plane to the second plane when the rotating portion is pulled away from the base portion. 9. The control device of claim 1, wherein, once in the second plane, the front surface of the actuation portion is configured to be maintained in the second plane without an external force. 10. The control device of claim 1, wherein, once in the second plane, the front surface of the actuation portion is configured to be biased back towards the first plane without an external force and to stay in the second plane while the external force is applied. 11. The control device of claim 1, wherein the actuation portion is attached to the rotating portion. 12. The control device of claim 1, wherein the actuation portion is separate from the rotating portion and received in a central opening of the rotating portion. 13. The control device of claim 1, further comprising:
a communication circuit configured to transmit a first control signal associated with the first control data and a second control signal associated with the second control data. 14. The control device of claim 1, further comprising:
a load control circuit adapted to be electrically coupled in series between an AC power source and the one or more electrical loads for controlling power delivered to the one or more electrical loads. 15. The control device of claim 1, wherein the control device is configured to be mounted over a toggle actuator of the mechanical switch that controls whether power is delivered to the one or more electrical loads. 16. A control device configured for use in a load control system to control one or more electrical loads external to the control device, the control device comprising:
a base portion configured to be mounted to an electrical wallbox or over a mechanical switch; a rotating portion rotatable with respect to the base portion, the rotating portion comprising a front area; and a control circuit configured to generate first control data for changing an intensity of the one or more electrical loads in response to rotations of the rotating portion when the front area of the rotating portion is located in a first plane along an axis perpendicular to the base portion, and generate second control data for changing a color of the one or more electrical loads in response to rotations of the rotating portion when the front area of the rotating portion is located in a second plane parallel to the first plane. 17. The control device of claim 16, further comprising:
an actuation portion comprising a front surface that defines the front area of the rotating portion. 18. The control device of claim 17, wherein the actuation portion is attached to the rotating portion. 19. The control device of claim 17, wherein the actuation portion is separate from the rotating portion and received in a central opening of the rotating portion. 20. The control device of claim 16, wherein the second plane is located closer to the base portion than the first plane, and the front area of the rotating portion is capable of being moved from the first plane to the second plane when the rotating portion is pushed in towards the base portion. 21. The control device of claim 16, wherein the second plane is located farther away from the base portion than the first plane, and the front area of the rotating portion is capable of being moved from the first plane to the second plane when the rotating portion is pulled away from the base portion. 22. A control device for controlling an electrical load in a load control system, the control device comprising:
a base portion configured to be mounted over an actuator of a mechanical switch that controls power delivered to the electrical load; a rotating portion rotatable with respect to the base portion; an actuation portion having a front surface; and a control circuit configured to generate first control data for changing an intensity of the electrical load in response to rotations of the rotating portion when the front surface of the actuation portion is located in a first plane along an axis perpendicular to the base portion, and generate second control data for changing a color of the electrical load in response to rotations of the rotating portion when the front surface of the actuation portion is located in a second plane parallel to the first plane. | 2,100 |
5,514 | 5,514 | 14,239,836 | 2,158 | An electronic device and method for automatic generation of a sorted list of items related to a seed item comprises a relatedness determinator to compare the seed item with a plurality of further items and to determine a relatedness value for each further item with respect to the seed item. The device also has a clustering engine to cluster the further items by determining a relative relatedness between (among) the further items. Each further item is assigned to one cluster. The device also has a list generator to generate a sorted result list by sorting the further items according to both, their relatedness value and their belonging (or membership) to a cluster in that once an item is added to the sorted list, the relatedness value depending ranking of the further items in that cluster is at least momentary lowered so as to promote adding items of further clusters. | 1. An electronic device for automatic generation of a sorted list of items related to a seed item,
said electronic device comprising a relatedness determinator configured to compare said seed item with a plurality of further items and to thus determine a relatedness value for each further item with respect to said seed item, said device further comprising a clustering engine configured to cluster said further items by determining a relative relatedness among said further items, each further item thus being assigned to one cluster, and said device further comprising a list generator configured to generate a sorted result list by sorting the further items according to both, their relatedness value and their belonging to a cluster in that once an item is added to the sorted list, the relatedness value depending ranking of the further items in that cluster is at least momentary lowered relative to the other clusters. 2. The electronic device of claim 1, wherein said list generator comprises a cluster creditor being configured
to initially assign credits to said clusters depending on the relatedness value of the item having the highest relatedness value in each one of said clusters and in further iterative steps: to update the credits by adding added credit to said clusters, said added credit depending on the relatedness value of the item having the highest relatedness value in a respective one of said clusters in relation to the relatedness value of the item having the highest relatedness value in the other clusters, and to decrease the credit of the cluster from which a selected item that was added to the list was removed, and an item selector being configured to select an item that is to be added to said list that has the highest relatedness value in a cluster having the highest credit, and to add the selected item to said list and to remove said selected item from the cluster it belonged to. 3. The electronic device of claim 2, wherein the cluster creditor is configured to update credits only for those clusters that comprise at least one item with a relatedness value that exceeds a predetermined fraction of the highest relatedness values of all items that have not yet been added to the list and removed from the clusters. 4. The electronic device of claim 3, wherein a threshold adjustment user interface is provided that allows for entering a threshold value that determines said fraction. 5. The electronic device of claim 4, further comprising a query generator for generating queries to be sent to item repositories and that are based on a seed item and to receive results from said queries representing items to be sorted. 6. A sorting device for automatically sorting items according to relatedness to a seed item, the sorting device comprising a relatedness based sorting means and a diversity promoting means and an adjustment means connected to an input of the device, said adjustment means configured to promote diversity of a result list diverging from a strict relatedness determined order of the result list depending on a diversity factor entered by a user. 7. The sorting device of claim 6, wherein the diversity factor preferably is defined by a threshold for electing clusters of items that qualify for a selection of items added to a sorted list of items. 8. A method for sorting items by creating a sorted list, said method including the steps of
providing a seed item, comparing a plurality of further items to said reference item (seed item) and determining a relatedness value for each further item, said relatedness value reflecting a degree of similarity of said further item from said plurality of items with the reference item, clustering said further items into a number of clusters by comparing said further items with each other to determine degrees of mutual similarity among said further items and grouping said further items in clusters so that each item belongs to one cluster that contains items with relatively high degree of similarity among them compared to items in other clusters, and generating a sorted list from said further items by scheduling said further items depending on their relatedness value and their membership to a certain cluster in an iterative manner, wherein items are added to said list one-by-one and initially a) initial credits are assigned to said clusters and in each iterative step, b) credits are updated by adding added credit to said clusters while not amending the relatedness value of the items in the clusters, c) an item that is to be added to said list is selected that has the highest relatedness value in a cluster having the highest credit, d) the selected item is added to said list and removed from said cluster, and e) the credit of the cluster from which the added item was removed is decreased, and repeating steps b) to e) until all or a predetermined number of said further items are added to said list. 9. The method of claim 8, wherein step b) “updating credits” is performed only with those clusters including items that have a relatedness value that is higher than a predetermined fraction of the highest relatedness value of all further items in any cluster. 10. The method of claim 9, wherein the step of clustering the further items comprises
starting with N clusters, where each cluster contains a unique single item, merging the two most similar clusters, where similarity between two clusters can be defined by the minimum or average similarity between its items, and repeating the merging of clusters until a predetermined number of clusters is obtained. 11. The method of claim 8, wherein the step of clustering the further items comprises
starting with N clusters, where each cluster contains a unique single item, merging the two most similar clusters, where similarity between two clusters can be defined by the minimum or average similarity between its items, and repeating the merging of clusters until a predetermined number of clusters is obtained. 12. The electronic device of claim 1, wherein the cluster creditor is configured to update credits only for those clusters that comprise at least one item with a relatedness value that exceeds a predetermined fraction of the highest relatedness values of all items that have not yet been added to the list and removed from the clusters. 13. The electronic device of claim 12, wherein a threshold adjustment user interface is provided that allows for entering a threshold value that determines said fraction. 14. The electronic device of claim 1, further comprising a query generator for generating queries to be sent to item repositories and that are based on a seed item and to receive results from said queries representing items to be sorted. | An electronic device and method for automatic generation of a sorted list of items related to a seed item comprises a relatedness determinator to compare the seed item with a plurality of further items and to determine a relatedness value for each further item with respect to the seed item. The device also has a clustering engine to cluster the further items by determining a relative relatedness between (among) the further items. Each further item is assigned to one cluster. The device also has a list generator to generate a sorted result list by sorting the further items according to both, their relatedness value and their belonging (or membership) to a cluster in that once an item is added to the sorted list, the relatedness value depending ranking of the further items in that cluster is at least momentary lowered so as to promote adding items of further clusters.1. An electronic device for automatic generation of a sorted list of items related to a seed item,
said electronic device comprising a relatedness determinator configured to compare said seed item with a plurality of further items and to thus determine a relatedness value for each further item with respect to said seed item, said device further comprising a clustering engine configured to cluster said further items by determining a relative relatedness among said further items, each further item thus being assigned to one cluster, and said device further comprising a list generator configured to generate a sorted result list by sorting the further items according to both, their relatedness value and their belonging to a cluster in that once an item is added to the sorted list, the relatedness value depending ranking of the further items in that cluster is at least momentary lowered relative to the other clusters. 2. The electronic device of claim 1, wherein said list generator comprises a cluster creditor being configured
to initially assign credits to said clusters depending on the relatedness value of the item having the highest relatedness value in each one of said clusters and in further iterative steps: to update the credits by adding added credit to said clusters, said added credit depending on the relatedness value of the item having the highest relatedness value in a respective one of said clusters in relation to the relatedness value of the item having the highest relatedness value in the other clusters, and to decrease the credit of the cluster from which a selected item that was added to the list was removed, and an item selector being configured to select an item that is to be added to said list that has the highest relatedness value in a cluster having the highest credit, and to add the selected item to said list and to remove said selected item from the cluster it belonged to. 3. The electronic device of claim 2, wherein the cluster creditor is configured to update credits only for those clusters that comprise at least one item with a relatedness value that exceeds a predetermined fraction of the highest relatedness values of all items that have not yet been added to the list and removed from the clusters. 4. The electronic device of claim 3, wherein a threshold adjustment user interface is provided that allows for entering a threshold value that determines said fraction. 5. The electronic device of claim 4, further comprising a query generator for generating queries to be sent to item repositories and that are based on a seed item and to receive results from said queries representing items to be sorted. 6. A sorting device for automatically sorting items according to relatedness to a seed item, the sorting device comprising a relatedness based sorting means and a diversity promoting means and an adjustment means connected to an input of the device, said adjustment means configured to promote diversity of a result list diverging from a strict relatedness determined order of the result list depending on a diversity factor entered by a user. 7. The sorting device of claim 6, wherein the diversity factor preferably is defined by a threshold for electing clusters of items that qualify for a selection of items added to a sorted list of items. 8. A method for sorting items by creating a sorted list, said method including the steps of
providing a seed item, comparing a plurality of further items to said reference item (seed item) and determining a relatedness value for each further item, said relatedness value reflecting a degree of similarity of said further item from said plurality of items with the reference item, clustering said further items into a number of clusters by comparing said further items with each other to determine degrees of mutual similarity among said further items and grouping said further items in clusters so that each item belongs to one cluster that contains items with relatively high degree of similarity among them compared to items in other clusters, and generating a sorted list from said further items by scheduling said further items depending on their relatedness value and their membership to a certain cluster in an iterative manner, wherein items are added to said list one-by-one and initially a) initial credits are assigned to said clusters and in each iterative step, b) credits are updated by adding added credit to said clusters while not amending the relatedness value of the items in the clusters, c) an item that is to be added to said list is selected that has the highest relatedness value in a cluster having the highest credit, d) the selected item is added to said list and removed from said cluster, and e) the credit of the cluster from which the added item was removed is decreased, and repeating steps b) to e) until all or a predetermined number of said further items are added to said list. 9. The method of claim 8, wherein step b) “updating credits” is performed only with those clusters including items that have a relatedness value that is higher than a predetermined fraction of the highest relatedness value of all further items in any cluster. 10. The method of claim 9, wherein the step of clustering the further items comprises
starting with N clusters, where each cluster contains a unique single item, merging the two most similar clusters, where similarity between two clusters can be defined by the minimum or average similarity between its items, and repeating the merging of clusters until a predetermined number of clusters is obtained. 11. The method of claim 8, wherein the step of clustering the further items comprises
starting with N clusters, where each cluster contains a unique single item, merging the two most similar clusters, where similarity between two clusters can be defined by the minimum or average similarity between its items, and repeating the merging of clusters until a predetermined number of clusters is obtained. 12. The electronic device of claim 1, wherein the cluster creditor is configured to update credits only for those clusters that comprise at least one item with a relatedness value that exceeds a predetermined fraction of the highest relatedness values of all items that have not yet been added to the list and removed from the clusters. 13. The electronic device of claim 12, wherein a threshold adjustment user interface is provided that allows for entering a threshold value that determines said fraction. 14. The electronic device of claim 1, further comprising a query generator for generating queries to be sent to item repositories and that are based on a seed item and to receive results from said queries representing items to be sorted. | 2,100 |
5,515 | 5,515 | 15,420,697 | 2,177 | A system includes a personal device in communication with a vehicle component and an on-board server and including a processor programmed to receive, from the component, an advertisement defining a low-footprint interface template and a unique identifier indicative of a corresponding rich content interface template, send, to the server, a request including the identifier to provide the corresponding template, and, upon receipt of the corresponding template, render a rich content user interface based on the corresponding template. | 1. A system comprising:
a personal device, in communication with a vehicle component and an on-board server, including a processor programmed to:
receive, from the component, an advertisement defining a low-footprint interface template of component functions and a unique identifier of a rich content interface template of the functions,
send, to the server, a request including the identifier to provide the corresponding template, and
render a rich content user interface according to the corresponding template. 2. The system of claim 1, wherein the user interface derived from the low-footprint interface template defines a plurality of selectable controls, each indicating a component function, and the user interface derived from the rich content interface template defines a graphic generated using a markup format and indicating the functions. 3. The system of claim 1, wherein the personal device further includes a storage configured to store a plurality of unique identifiers and the corresponding rich content interface templates, and wherein the processor is further configured to send the request to the server in response to detecting that the rich content interface template corresponding to the advertised unique identifier is unavailable in the storage. 4. The system of claim 3, wherein the stored unique identifiers and the corresponding rich content interface templates originate from one of a prior request to the server, an initial installation of a software application for processing the low-footprint interface templates and the rich content interface templates to render the corresponding user interfaces, or a download of an add-on data file for supplementing the software application. 5. The system of claim 1, wherein the personal device is further configured to communicate with an interface template server located off-board and configured to store a plurality of unique identifiers and the corresponding rich content interface templates, and wherein the processor is further configured to send, to the interface template server, a request including the identifier to provide the corresponding template in response to receiving a notification from the on-board server that the corresponding template is unavailable. 6. The system of claim 5, wherein the processor is further configured to send, to the vehicle component, a request to provide an intermediate content interface template in response to the corresponding template being unavailable from the interface template server. 7. The system of claim 6, wherein the user interface derived from the intermediate content interface template defines selectable controls of the low-footprint interface template supplemented with vector-based graphic icons and images. 8. The system of claim 6, wherein the processor is further configured to render the user interface derived from the low-footprint interface template in response to the intermediate content interface template being unavailable. 9. A method for a personal device comprising:
receiving, from a vehicle component, an advertisement defining a low-footprint interface template of component functions and a unique identifier of a corresponding rich content interface template of the functions, in response to respective notifications from an on-hoard server and a vehicle component interface template server indicating that the corresponding rich content interface template being requested is unavailable, sending, to the vehicle component, a request to provide an intermediate content interface template of the functions, and rendering an intermediate content user interface according to the received template. 10. The method of claim 9, wherein the user interface derived from the intermediate content interface template defines selectable controls of the low-footprint template, each control indicating a component function, supplemented with vector-based graphic icons and images. 11. The method of claim 9, wherein the user interface derived from the rich content interface template defines graphics generated using a markup format and indicating the functions. 12. The method of claim 9 further comprising rendering a low-footprint content interface derived from the low-footprint interface template in response to a notification, from the vehicle component, indicating that the intermediate content interface template is unavailable. 13. The method of claim 9 further comprising detecting from an internal storage query using the unique identifier that the corresponding rich content interface template is unavailable prior to sending the intermediate content interface template request to the vehicle component. 14. A vehicle system comprising:
an on-board server including a data store and a wireless transceiver configured to establish communication with a personal device, the server being configured to, in response to a request from the personal device, query the data store to identify a rich content interface template of component functions that corresponds to a unique identifier received with the request and, upon identification, send the corresponding template to the personal device. 15. The system of claim 14, wherein a user interface derived from the rich content interface template defines graphics generated using a markup format and indicating the functions. 16. The system of claim 14, wherein the data store includes a plurality of the unique identifiers and the corresponding rich content interface templates as a result of sending, to an interface template server located off-board, a prior request including the identifier to provide the corresponding template. 17. The system of claim 14, wherein the wireless transceiver is further configured to establish communication with an in-vehicle component and an interface template server and wherein the on-board server is further configured to, in response to detecting an advertisement, from the vehicle component, including the unique identifier and the query returning zero results, send, to the interface template server, a request including the identifier to provide the corresponding template and, upon receipt, send the corresponding template to the personal device. 18. The system of claim 17, wherein the advertisement further includes a low-footprint interface template defining a low-footprint user interface including a plurality of selectable controls, each control indicating a different one of the functions. 19. The system of claim 17, wherein the on-board server is further configured to store the corresponding, template in the data store. | A system includes a personal device in communication with a vehicle component and an on-board server and including a processor programmed to receive, from the component, an advertisement defining a low-footprint interface template and a unique identifier indicative of a corresponding rich content interface template, send, to the server, a request including the identifier to provide the corresponding template, and, upon receipt of the corresponding template, render a rich content user interface based on the corresponding template.1. A system comprising:
a personal device, in communication with a vehicle component and an on-board server, including a processor programmed to:
receive, from the component, an advertisement defining a low-footprint interface template of component functions and a unique identifier of a rich content interface template of the functions,
send, to the server, a request including the identifier to provide the corresponding template, and
render a rich content user interface according to the corresponding template. 2. The system of claim 1, wherein the user interface derived from the low-footprint interface template defines a plurality of selectable controls, each indicating a component function, and the user interface derived from the rich content interface template defines a graphic generated using a markup format and indicating the functions. 3. The system of claim 1, wherein the personal device further includes a storage configured to store a plurality of unique identifiers and the corresponding rich content interface templates, and wherein the processor is further configured to send the request to the server in response to detecting that the rich content interface template corresponding to the advertised unique identifier is unavailable in the storage. 4. The system of claim 3, wherein the stored unique identifiers and the corresponding rich content interface templates originate from one of a prior request to the server, an initial installation of a software application for processing the low-footprint interface templates and the rich content interface templates to render the corresponding user interfaces, or a download of an add-on data file for supplementing the software application. 5. The system of claim 1, wherein the personal device is further configured to communicate with an interface template server located off-board and configured to store a plurality of unique identifiers and the corresponding rich content interface templates, and wherein the processor is further configured to send, to the interface template server, a request including the identifier to provide the corresponding template in response to receiving a notification from the on-board server that the corresponding template is unavailable. 6. The system of claim 5, wherein the processor is further configured to send, to the vehicle component, a request to provide an intermediate content interface template in response to the corresponding template being unavailable from the interface template server. 7. The system of claim 6, wherein the user interface derived from the intermediate content interface template defines selectable controls of the low-footprint interface template supplemented with vector-based graphic icons and images. 8. The system of claim 6, wherein the processor is further configured to render the user interface derived from the low-footprint interface template in response to the intermediate content interface template being unavailable. 9. A method for a personal device comprising:
receiving, from a vehicle component, an advertisement defining a low-footprint interface template of component functions and a unique identifier of a corresponding rich content interface template of the functions, in response to respective notifications from an on-hoard server and a vehicle component interface template server indicating that the corresponding rich content interface template being requested is unavailable, sending, to the vehicle component, a request to provide an intermediate content interface template of the functions, and rendering an intermediate content user interface according to the received template. 10. The method of claim 9, wherein the user interface derived from the intermediate content interface template defines selectable controls of the low-footprint template, each control indicating a component function, supplemented with vector-based graphic icons and images. 11. The method of claim 9, wherein the user interface derived from the rich content interface template defines graphics generated using a markup format and indicating the functions. 12. The method of claim 9 further comprising rendering a low-footprint content interface derived from the low-footprint interface template in response to a notification, from the vehicle component, indicating that the intermediate content interface template is unavailable. 13. The method of claim 9 further comprising detecting from an internal storage query using the unique identifier that the corresponding rich content interface template is unavailable prior to sending the intermediate content interface template request to the vehicle component. 14. A vehicle system comprising:
an on-board server including a data store and a wireless transceiver configured to establish communication with a personal device, the server being configured to, in response to a request from the personal device, query the data store to identify a rich content interface template of component functions that corresponds to a unique identifier received with the request and, upon identification, send the corresponding template to the personal device. 15. The system of claim 14, wherein a user interface derived from the rich content interface template defines graphics generated using a markup format and indicating the functions. 16. The system of claim 14, wherein the data store includes a plurality of the unique identifiers and the corresponding rich content interface templates as a result of sending, to an interface template server located off-board, a prior request including the identifier to provide the corresponding template. 17. The system of claim 14, wherein the wireless transceiver is further configured to establish communication with an in-vehicle component and an interface template server and wherein the on-board server is further configured to, in response to detecting an advertisement, from the vehicle component, including the unique identifier and the query returning zero results, send, to the interface template server, a request including the identifier to provide the corresponding template and, upon receipt, send the corresponding template to the personal device. 18. The system of claim 17, wherein the advertisement further includes a low-footprint interface template defining a low-footprint user interface including a plurality of selectable controls, each control indicating a different one of the functions. 19. The system of claim 17, wherein the on-board server is further configured to store the corresponding, template in the data store. | 2,100 |
5,516 | 5,516 | 14,504,415 | 2,179 | Systems, methods, and software to facilitate simulating machines used in industrial automation are disclosed herein. In at least one implementation, a machine model is processed to generate a simulation model of a machine. A load to apply to the simulation model of the machine is then simulated. The simulation model of the machine is executed under the load, and characteristics of mechanical components of the machine are selected to handle the load. | 1. One or more computer-readable storage media having program instructions stored thereon to facilitate simulating machines used in industrial automation, wherein the program instructions, when executed by a computing system, direct the computing system to at least:
process a machine model to generate a simulation model of a machine; simulate a load to apply to the simulation model of the machine; execute the simulation model of the machine under the load; and select characteristics of mechanical components of the machine to handle the load. 2. The one or more computer readable media of claim 1 wherein, to process the machine model to generate the simulation model of the machine, the program instructions direct the computing system to analyze a motion profile of the machine model to generate the simulation model of the machine. 3. The one or more computer readable media of claim 1 wherein the program instructions further direct the computing system to generate the machine model based on analyzing motion of a physical model of the machine operating in physical space. 4. The one or more computer readable media of claim 1 wherein, to execute the simulation model of the machine under the load, the program instructions direct the computing system to execute an industrial controller system to control an operation of the simulation model of the machine under the load. 5. The one or more computer readable media of claim 4 wherein the industrial controller system comprises an emulated industrial controller implemented in software. 6. The one or more computer readable media of claim 1 wherein the load comprises inertia and friction. 7. The one or more computer readable media of claim 1 wherein the characteristics of the mechanical components of the machine comprise a power level of a motor. 8. A method of operating a computing system to facilitate simulating machines used in industrial automation, the method comprising:
processing a machine model to generate a simulation model of a machine; simulating a load to apply to the simulation model of the machine; executing the simulation model of the machine under the load; and selecting characteristics of mechanical components of the machine to handle the load. 9. The method of claim 8 wherein processing the machine model to generate the simulation model of the machine comprises analyzing a motion profile of the machine model to generate the simulation model of the machine. 10. The method of claim 8 further comprising generating the machine model based on analyzing motion of a physical model of the machine operating in physical space. 11. The method of claim 8 wherein executing the simulation model of the machine under the load comprises executing an industrial controller system to control an operation of the simulation model of the machine under the load. 12. The method of claim 11 wherein the industrial controller system comprises an emulated industrial controller implemented in software. 13. The method of claim 8 wherein the load comprises inertia and friction. 14. The method of claim 8 wherein the characteristics of the mechanical components of the machine comprise a power level of a motor. 15. A computer apparatus to operate a computing system to facilitate simulating machines used in industrial automation, the apparatus comprising:
software instructions configured, when executed by the computing system, to direct the computing system to process a machine model to generate a simulation model of a machine, simulate a load to apply to the simulation model of the machine, execute the simulation model of the machine under the load, and select characteristics of mechanical components of the machine to handle the load; and at least one non-transitory computer-readable storage medium storing the software instructions. 16. The computer apparatus of claim 15 wherein the software instructions configured to direct the computing system to process the machine model to generate the simulation model of the machine comprises the software instructions configured to direct the computing system to analyze a motion profile of the machine model to generate the simulation model of the machine. 17. The computer apparatus of claim 15 wherein the software instructions further direct the computing system to generate the machine model based on analyzing motion of a physical model of the machine operating in physical space. 18. The computer apparatus of claim 15 wherein the software instructions configured to direct the computing system to execute the simulation model of the machine under the load comprises the software instructions configured to direct the computing system to execute an industrial controller system to control an operation of the simulation model of the machine under the load. 19. The computer apparatus of claim 15 wherein the load comprises inertia and friction. 20. The computer apparatus of claim 15 wherein the characteristics of the mechanical components of the machine comprise a power level of a motor. | Systems, methods, and software to facilitate simulating machines used in industrial automation are disclosed herein. In at least one implementation, a machine model is processed to generate a simulation model of a machine. A load to apply to the simulation model of the machine is then simulated. The simulation model of the machine is executed under the load, and characteristics of mechanical components of the machine are selected to handle the load.1. One or more computer-readable storage media having program instructions stored thereon to facilitate simulating machines used in industrial automation, wherein the program instructions, when executed by a computing system, direct the computing system to at least:
process a machine model to generate a simulation model of a machine; simulate a load to apply to the simulation model of the machine; execute the simulation model of the machine under the load; and select characteristics of mechanical components of the machine to handle the load. 2. The one or more computer readable media of claim 1 wherein, to process the machine model to generate the simulation model of the machine, the program instructions direct the computing system to analyze a motion profile of the machine model to generate the simulation model of the machine. 3. The one or more computer readable media of claim 1 wherein the program instructions further direct the computing system to generate the machine model based on analyzing motion of a physical model of the machine operating in physical space. 4. The one or more computer readable media of claim 1 wherein, to execute the simulation model of the machine under the load, the program instructions direct the computing system to execute an industrial controller system to control an operation of the simulation model of the machine under the load. 5. The one or more computer readable media of claim 4 wherein the industrial controller system comprises an emulated industrial controller implemented in software. 6. The one or more computer readable media of claim 1 wherein the load comprises inertia and friction. 7. The one or more computer readable media of claim 1 wherein the characteristics of the mechanical components of the machine comprise a power level of a motor. 8. A method of operating a computing system to facilitate simulating machines used in industrial automation, the method comprising:
processing a machine model to generate a simulation model of a machine; simulating a load to apply to the simulation model of the machine; executing the simulation model of the machine under the load; and selecting characteristics of mechanical components of the machine to handle the load. 9. The method of claim 8 wherein processing the machine model to generate the simulation model of the machine comprises analyzing a motion profile of the machine model to generate the simulation model of the machine. 10. The method of claim 8 further comprising generating the machine model based on analyzing motion of a physical model of the machine operating in physical space. 11. The method of claim 8 wherein executing the simulation model of the machine under the load comprises executing an industrial controller system to control an operation of the simulation model of the machine under the load. 12. The method of claim 11 wherein the industrial controller system comprises an emulated industrial controller implemented in software. 13. The method of claim 8 wherein the load comprises inertia and friction. 14. The method of claim 8 wherein the characteristics of the mechanical components of the machine comprise a power level of a motor. 15. A computer apparatus to operate a computing system to facilitate simulating machines used in industrial automation, the apparatus comprising:
software instructions configured, when executed by the computing system, to direct the computing system to process a machine model to generate a simulation model of a machine, simulate a load to apply to the simulation model of the machine, execute the simulation model of the machine under the load, and select characteristics of mechanical components of the machine to handle the load; and at least one non-transitory computer-readable storage medium storing the software instructions. 16. The computer apparatus of claim 15 wherein the software instructions configured to direct the computing system to process the machine model to generate the simulation model of the machine comprises the software instructions configured to direct the computing system to analyze a motion profile of the machine model to generate the simulation model of the machine. 17. The computer apparatus of claim 15 wherein the software instructions further direct the computing system to generate the machine model based on analyzing motion of a physical model of the machine operating in physical space. 18. The computer apparatus of claim 15 wherein the software instructions configured to direct the computing system to execute the simulation model of the machine under the load comprises the software instructions configured to direct the computing system to execute an industrial controller system to control an operation of the simulation model of the machine under the load. 19. The computer apparatus of claim 15 wherein the load comprises inertia and friction. 20. The computer apparatus of claim 15 wherein the characteristics of the mechanical components of the machine comprise a power level of a motor. | 2,100 |
5,517 | 5,517 | 14,327,006 | 2,191 | A system, method, and computer-readable medium are disclosed for automating the identification and classification of virtual machines (VMs) into VM generation classifications. VM utilization data associated with a target VM is processed to identify a corresponding VM generation classification (GC) value, which is then associated with the target VM. | 1. A computer-implementable method for automating the classification of virtual machines (VMs) into VM generation classifications, comprising:
processing data associated with the utilization of a target VM to generate VM utilization data; processing the VM utilization data to identify a corresponding VM generation classification (GC) value; and associating the corresponding VM GC value with the target VM. 2. The method of claim 1, wherein:
the VM GC value is associated with a set of VM utilization parameters. 3. The method of claim 2, wherein a first VM GC value indicates that the target VM comprises at least one member of the set of:
is not currently in use; is currently underutilized; is marked for suspension; is marked for termination; and is marked for deletion. 4. The method of claim 2, wherein a second VM GC value indicates that the target VM comprises at least one member of the set of:
is newly initiated; has been in operation for at least a predetermined minimum period of time; exceeds a predetermined minimum level of VM resource utilization; and has an associated high mortality rate. 5. The method of claim 2, wherein a third VM GC value indicates that the target VM comprises at least one member of the set of:
has been in operation for a period of time that is greater than a predetermined minimum period of time and less than a predetermined maximum period of time; and has a level of VM resource utilization that is greater than a predetermined minimum level of VM resource utilization and less than a predetermined maximum level of VM resource utilization. 6. The method of claim 2, wherein a fourth VM GC value indicates that the target VM comprises at least one member of the set of:
has been in operation exceeding a predetermined maximum period of time; exceeds a predetermined maximum level of VM resource utilization; is designated a permanent VM; and is designated as a prioritized VM. 7. A system comprising:
a processor; a data bus coupled to the processor; and a non-transitory, computer-readable storage medium embodying computer program code, the non-transitory, computer-readable storage medium being coupled to the data bus, the computer program code interacting with a plurality of computer operations for automating the classification of virtual machines (VMs) into VM generation classifications and comprising instructions executable by the processor and configured for:
processing data associated with the utilization of a target VM to generate VM utilization data;
processing the VM utilization data to identify a corresponding VM classification (GC) value; and
associating the corresponding VM GC value with the target VM. 8. The system of claim 7, wherein:
the VM GC value is associated with a set of VM utilization parameters. 9. The system of claim 8, wherein a first VM GC value indicates that the target VM comprises at least one member of the set of:
is not currently in use; is currently underutilized; is marked for suspension; is marked for termination; and is marked for deletion. 10. The system of claim 8, wherein a second VM GC value indicates that the target VM comprises at least one member of the set of:
is newly initiated; has been in operation for at least a predetermined minimum period of time; exceeds a predetermined minimum level of VM resource utilization; and has an associated high mortality rate. 11. The system of claim 8, wherein a third VM GC value indicates that the target VM comprises at least one member of the set of:
has been in operation for a period of time that is greater than a predetermined minimum period of time and less than a predetermined maximum period of time; and has a level of VM resource utilization that is greater than a predetermined minimum level of VM resource utilization and less than a predetermined maximum level of VM resource utilization. 12. The system of claim 8, wherein a fourth VM GC value indicates that the target VM comprises at least one member of the set of:
has been in operation exceeding a predetermined maximum period of time; exceeds a predetermined maximum level of VM resource utilization; is designated a permanent VM; and is designated as a prioritized VM. 13. A non-transitory, computer-readable storage medium embodying computer program code, the computer program code comprising computer executable instructions configured for:
processing data associated with the utilization of a target VM to generate VM utilization data; processing the VM utilization data to identify a corresponding VM generation classification (GC) value; and associating the corresponding VM GC value with the target VM. 14. The non-transitory, computer-readable storage medium of claim 13, wherein:
the VM GC value is associated with a set of VM utilization parameters. 15. The non-transitory, computer-readable storage medium of claim 14, wherein a first VM GC value indicates that the target VM comprises at least one member of the set of:
is not currently in use; is currently underutilized; is marked for suspension; is marked for termination; is marked for deletion. 16. The non-transitory, computer-readable storage medium of claim 14, wherein a second VM GC value indicates that the target VM comprises at least one member of the set of:
is newly initiated; has been in operation for at least a predetermined minimum period of time; exceeds a predetermined minimum level of VM resource utilization; and has an associated high mortality rate. 17. The non-transitory, computer-readable storage medium of claim 14, wherein a third VM GC value indicates that the target VM comprises at least one member of the set of:
has been in operation for a period of time that is greater than a predetermined minimum period of time and less than a predetermined maximum period of time; and has a level of VM resource utilization that is greater than a predetermined minimum level of VM resource utilization and less than a predetermined maximum level of VM resource utilization. 18. The non-transitory, computer-readable storage medium of claim 14, wherein a forth the VM GC value indicates that the target VM comprises at least one member of the set of:
has been in operation exceeding a predetermined maximum period of time; exceeds a predetermined maximum level of VM resource utilization; is designated a permanent VM; and is designated as a prioritized VM. | A system, method, and computer-readable medium are disclosed for automating the identification and classification of virtual machines (VMs) into VM generation classifications. VM utilization data associated with a target VM is processed to identify a corresponding VM generation classification (GC) value, which is then associated with the target VM.1. A computer-implementable method for automating the classification of virtual machines (VMs) into VM generation classifications, comprising:
processing data associated with the utilization of a target VM to generate VM utilization data; processing the VM utilization data to identify a corresponding VM generation classification (GC) value; and associating the corresponding VM GC value with the target VM. 2. The method of claim 1, wherein:
the VM GC value is associated with a set of VM utilization parameters. 3. The method of claim 2, wherein a first VM GC value indicates that the target VM comprises at least one member of the set of:
is not currently in use; is currently underutilized; is marked for suspension; is marked for termination; and is marked for deletion. 4. The method of claim 2, wherein a second VM GC value indicates that the target VM comprises at least one member of the set of:
is newly initiated; has been in operation for at least a predetermined minimum period of time; exceeds a predetermined minimum level of VM resource utilization; and has an associated high mortality rate. 5. The method of claim 2, wherein a third VM GC value indicates that the target VM comprises at least one member of the set of:
has been in operation for a period of time that is greater than a predetermined minimum period of time and less than a predetermined maximum period of time; and has a level of VM resource utilization that is greater than a predetermined minimum level of VM resource utilization and less than a predetermined maximum level of VM resource utilization. 6. The method of claim 2, wherein a fourth VM GC value indicates that the target VM comprises at least one member of the set of:
has been in operation exceeding a predetermined maximum period of time; exceeds a predetermined maximum level of VM resource utilization; is designated a permanent VM; and is designated as a prioritized VM. 7. A system comprising:
a processor; a data bus coupled to the processor; and a non-transitory, computer-readable storage medium embodying computer program code, the non-transitory, computer-readable storage medium being coupled to the data bus, the computer program code interacting with a plurality of computer operations for automating the classification of virtual machines (VMs) into VM generation classifications and comprising instructions executable by the processor and configured for:
processing data associated with the utilization of a target VM to generate VM utilization data;
processing the VM utilization data to identify a corresponding VM classification (GC) value; and
associating the corresponding VM GC value with the target VM. 8. The system of claim 7, wherein:
the VM GC value is associated with a set of VM utilization parameters. 9. The system of claim 8, wherein a first VM GC value indicates that the target VM comprises at least one member of the set of:
is not currently in use; is currently underutilized; is marked for suspension; is marked for termination; and is marked for deletion. 10. The system of claim 8, wherein a second VM GC value indicates that the target VM comprises at least one member of the set of:
is newly initiated; has been in operation for at least a predetermined minimum period of time; exceeds a predetermined minimum level of VM resource utilization; and has an associated high mortality rate. 11. The system of claim 8, wherein a third VM GC value indicates that the target VM comprises at least one member of the set of:
has been in operation for a period of time that is greater than a predetermined minimum period of time and less than a predetermined maximum period of time; and has a level of VM resource utilization that is greater than a predetermined minimum level of VM resource utilization and less than a predetermined maximum level of VM resource utilization. 12. The system of claim 8, wherein a fourth VM GC value indicates that the target VM comprises at least one member of the set of:
has been in operation exceeding a predetermined maximum period of time; exceeds a predetermined maximum level of VM resource utilization; is designated a permanent VM; and is designated as a prioritized VM. 13. A non-transitory, computer-readable storage medium embodying computer program code, the computer program code comprising computer executable instructions configured for:
processing data associated with the utilization of a target VM to generate VM utilization data; processing the VM utilization data to identify a corresponding VM generation classification (GC) value; and associating the corresponding VM GC value with the target VM. 14. The non-transitory, computer-readable storage medium of claim 13, wherein:
the VM GC value is associated with a set of VM utilization parameters. 15. The non-transitory, computer-readable storage medium of claim 14, wherein a first VM GC value indicates that the target VM comprises at least one member of the set of:
is not currently in use; is currently underutilized; is marked for suspension; is marked for termination; is marked for deletion. 16. The non-transitory, computer-readable storage medium of claim 14, wherein a second VM GC value indicates that the target VM comprises at least one member of the set of:
is newly initiated; has been in operation for at least a predetermined minimum period of time; exceeds a predetermined minimum level of VM resource utilization; and has an associated high mortality rate. 17. The non-transitory, computer-readable storage medium of claim 14, wherein a third VM GC value indicates that the target VM comprises at least one member of the set of:
has been in operation for a period of time that is greater than a predetermined minimum period of time and less than a predetermined maximum period of time; and has a level of VM resource utilization that is greater than a predetermined minimum level of VM resource utilization and less than a predetermined maximum level of VM resource utilization. 18. The non-transitory, computer-readable storage medium of claim 14, wherein a forth the VM GC value indicates that the target VM comprises at least one member of the set of:
has been in operation exceeding a predetermined maximum period of time; exceeds a predetermined maximum level of VM resource utilization; is designated a permanent VM; and is designated as a prioritized VM. | 2,100 |
5,518 | 5,518 | 14,643,109 | 2,163 | A method and system for combining, communicating, storing and/or separating image data and non-image data. The method involves a computer programmed to identify an end-of-file (EOF) marker of an image file, and being programmed to add the non-image data to the image file after the EOF marker. | 1. A method of presenting a combined image and non-image data file comprising the steps of:
receiving a combined image and non-image data file by at least one computer, the combined image and non-image data file having a quantity of image data, and a quantity of non-image data, the non-image data comprising a data file container containing at least a non-image file, the data file container being the non-image data combined with the image data, and being written to the combined image and non-image file immediately after an end-of-file marker of the quantity of image data; reading the combined image and non-image data file by the at least one computer to identify the image file portion, the reading being performed starting at a beginning of the combined image and non-image file and ending at the end-of-file marker of the quantity of image data; the quantity read from beginning to the end-of-file marker being the image file; reading the combined image and non-image data file by the at least one computer to identify the non-image file portion, the reading being performed starting immediately after the end-of-file marker of the image file, and ending at an end of the combined image and non-image data file; extracting the non-image file from the data file container based on information contained in the data file container; presenting the image file using a display of the at least one computer; and presenting the non-image file using the at least one computer at the same time as the presenting of the image file. 2. The method of presenting a combined image and non-image data file of claim 1 wherein the non-image data is a data file container comprising a first data file and a second data file, further comprising the steps of:
separating the non-image file into the first data file and the second data file using the at least one computer;
presenting the first data file using the at least one computer; and
presenting the second data file using the at least one computer. 3. The method of presenting a combined image and non-image data file of claim 1 wherein the non-image file is an audio file, and wherein the step of presenting the non-image file using the at least one computer comprises playing the audio file through a speaker in communication with the at least one computer. 4. The method of presenting a combined image and non-image data file of claim 1 wherein the data file container further contains information allowing the computer to later separate the data file container into the first non-image file. 5. The method of presenting a combined image and non-image data file of claim 1 wherein the non-image file is a text file. 6. The method of presenting a combined image and non-image data file of claim 1 wherein the at least one computer is a smart phone. 7. A method of separating a combined image and non-image data file comprising the steps of:
receiving a combined image and non-image data file by a computer, the image and non-image data file having a quantity of image data, and a quantity of non-image data, the non-image data comprising a data file container containing at least a first non-image file, and being written to the image and non-image data file immediately after an end-of-file marker of the image data;
reading the combined image and non-image data file by the computer to identify the image file data portion, the reading being performed starting at a beginning of the image and non-image data file and ending at the end-of-file marker of the image data, the quantity read from beginning to the end-of-file marker being identified by the computer as the image file;
saving the read and identified image file data as an image file using the computer on a file system of the computer;
reading the combined image and non-image data file by the computer to identify the non-image data file portion, the reading being performed starting immediately after the end-of-file marker of the image file, and ending at an end of the combined image and non-image data file;
extracting the first non-image file from the data file container based on information contained in the data file container;
saving the read and identified first non-image file using the computer on a file system of the computer; and
presenting the image file and the first non-image file simultaneously using the computer. 8. The method of separating a combined image and non-image data file of claim 7 wherein the data file container comprises the first non-image file and a second non-image file, and comprising the steps of:
separating the data file container into the first non-image file and the second non-image file using the computer; and
saving the second non-image file using the computer on the file system of the computer. 9. The method of separating a combined image and non-image data file of claim 7 wherein the first non-image file is an audio file, and wherein the step of saving the read and identified non-image file data comprises saving the non-image file data as an audio file using the computer on the file system of the computer. 10. The method of separating a combined image and non-image data file of claim 7 wherein the data file container further contains information allowing the computer to later separate the data file container into the first non-image file. 11. The method of separating a combined image and non-image data file of claim 7 wherein the non-image file is a text file. 12. The method of separating a combined image and non-image data file of claim 7 wherein the computer is a smart phone. 13. A method of combining an image file with a non-image file comprising the steps of:
identifying an image file accessible to at least one computer; identifying a non-image file accessible to the at least one computer; reading the image file using the at least one computer, using the at least one computer to identify an end-of-file marker of the image file; attaching the non-image file to the image file using the at least one computer, wherein the image file remains unchanged during the attaching step, the attaching comprising the steps of:
forming a single data file container containing at least a first non-image file, the data file container being the non-image file to be attached with the image file;
writing the single data file container containing to the non-image file immediately after the end-of-file marker of the image file, thereby creating a combined image and non-image data file;
saving the combined image and non-image data file to a file system of the at least one computer;
reading the combined image and non-image data file using the at least one computer configured to present both the image and non-image files; and
presenting the image file and the non-image file simultaneously using the at least one computer. 14. The method of combining an image file with a non-image file of claim 13 further comprising the step of reading the combined image and non-image data file using a second computer configured to display image files only, the second computer program presenting only the image file, and the computer ignoring the non-image file portion of the combined image and non-image data file. 15. The method of combining an image file with a non-image file of claim 13 wherein the step of attaching the non-image file to the image file using the at least one computer comprises writing the non-image file byte by byte immediately after the end-of-file marker until the non-image file is written in its entirety. 16. The method of combining an image file with a non-image file of claim 13 further comprising the step of taking a photograph using a digital camera in communication with the at least one computer, and storing the photograph as the image file. 17. The method of combining an image file with a non-image file of claim 13 wherein the non-image file is an audio file, and further comprising the step of recording audio with an audio recording device in communication with the at least one computer, and storing the recorded audio as an audio data file on the at least one computer. 18. The method of combining an image file with a non-image file of claim 13 wherein the non-image file is a text file. 19. The method of combining an image file with a non-image file of claim 13 wherein the at least one computer is a smart phone. 20. The method of combining an image file with a non-image file of claim 13 wherein the data file container further comprises information allowing the at least one computer to later separate the data file container into the first non-image file. | A method and system for combining, communicating, storing and/or separating image data and non-image data. The method involves a computer programmed to identify an end-of-file (EOF) marker of an image file, and being programmed to add the non-image data to the image file after the EOF marker.1. A method of presenting a combined image and non-image data file comprising the steps of:
receiving a combined image and non-image data file by at least one computer, the combined image and non-image data file having a quantity of image data, and a quantity of non-image data, the non-image data comprising a data file container containing at least a non-image file, the data file container being the non-image data combined with the image data, and being written to the combined image and non-image file immediately after an end-of-file marker of the quantity of image data; reading the combined image and non-image data file by the at least one computer to identify the image file portion, the reading being performed starting at a beginning of the combined image and non-image file and ending at the end-of-file marker of the quantity of image data; the quantity read from beginning to the end-of-file marker being the image file; reading the combined image and non-image data file by the at least one computer to identify the non-image file portion, the reading being performed starting immediately after the end-of-file marker of the image file, and ending at an end of the combined image and non-image data file; extracting the non-image file from the data file container based on information contained in the data file container; presenting the image file using a display of the at least one computer; and presenting the non-image file using the at least one computer at the same time as the presenting of the image file. 2. The method of presenting a combined image and non-image data file of claim 1 wherein the non-image data is a data file container comprising a first data file and a second data file, further comprising the steps of:
separating the non-image file into the first data file and the second data file using the at least one computer;
presenting the first data file using the at least one computer; and
presenting the second data file using the at least one computer. 3. The method of presenting a combined image and non-image data file of claim 1 wherein the non-image file is an audio file, and wherein the step of presenting the non-image file using the at least one computer comprises playing the audio file through a speaker in communication with the at least one computer. 4. The method of presenting a combined image and non-image data file of claim 1 wherein the data file container further contains information allowing the computer to later separate the data file container into the first non-image file. 5. The method of presenting a combined image and non-image data file of claim 1 wherein the non-image file is a text file. 6. The method of presenting a combined image and non-image data file of claim 1 wherein the at least one computer is a smart phone. 7. A method of separating a combined image and non-image data file comprising the steps of:
receiving a combined image and non-image data file by a computer, the image and non-image data file having a quantity of image data, and a quantity of non-image data, the non-image data comprising a data file container containing at least a first non-image file, and being written to the image and non-image data file immediately after an end-of-file marker of the image data;
reading the combined image and non-image data file by the computer to identify the image file data portion, the reading being performed starting at a beginning of the image and non-image data file and ending at the end-of-file marker of the image data, the quantity read from beginning to the end-of-file marker being identified by the computer as the image file;
saving the read and identified image file data as an image file using the computer on a file system of the computer;
reading the combined image and non-image data file by the computer to identify the non-image data file portion, the reading being performed starting immediately after the end-of-file marker of the image file, and ending at an end of the combined image and non-image data file;
extracting the first non-image file from the data file container based on information contained in the data file container;
saving the read and identified first non-image file using the computer on a file system of the computer; and
presenting the image file and the first non-image file simultaneously using the computer. 8. The method of separating a combined image and non-image data file of claim 7 wherein the data file container comprises the first non-image file and a second non-image file, and comprising the steps of:
separating the data file container into the first non-image file and the second non-image file using the computer; and
saving the second non-image file using the computer on the file system of the computer. 9. The method of separating a combined image and non-image data file of claim 7 wherein the first non-image file is an audio file, and wherein the step of saving the read and identified non-image file data comprises saving the non-image file data as an audio file using the computer on the file system of the computer. 10. The method of separating a combined image and non-image data file of claim 7 wherein the data file container further contains information allowing the computer to later separate the data file container into the first non-image file. 11. The method of separating a combined image and non-image data file of claim 7 wherein the non-image file is a text file. 12. The method of separating a combined image and non-image data file of claim 7 wherein the computer is a smart phone. 13. A method of combining an image file with a non-image file comprising the steps of:
identifying an image file accessible to at least one computer; identifying a non-image file accessible to the at least one computer; reading the image file using the at least one computer, using the at least one computer to identify an end-of-file marker of the image file; attaching the non-image file to the image file using the at least one computer, wherein the image file remains unchanged during the attaching step, the attaching comprising the steps of:
forming a single data file container containing at least a first non-image file, the data file container being the non-image file to be attached with the image file;
writing the single data file container containing to the non-image file immediately after the end-of-file marker of the image file, thereby creating a combined image and non-image data file;
saving the combined image and non-image data file to a file system of the at least one computer;
reading the combined image and non-image data file using the at least one computer configured to present both the image and non-image files; and
presenting the image file and the non-image file simultaneously using the at least one computer. 14. The method of combining an image file with a non-image file of claim 13 further comprising the step of reading the combined image and non-image data file using a second computer configured to display image files only, the second computer program presenting only the image file, and the computer ignoring the non-image file portion of the combined image and non-image data file. 15. The method of combining an image file with a non-image file of claim 13 wherein the step of attaching the non-image file to the image file using the at least one computer comprises writing the non-image file byte by byte immediately after the end-of-file marker until the non-image file is written in its entirety. 16. The method of combining an image file with a non-image file of claim 13 further comprising the step of taking a photograph using a digital camera in communication with the at least one computer, and storing the photograph as the image file. 17. The method of combining an image file with a non-image file of claim 13 wherein the non-image file is an audio file, and further comprising the step of recording audio with an audio recording device in communication with the at least one computer, and storing the recorded audio as an audio data file on the at least one computer. 18. The method of combining an image file with a non-image file of claim 13 wherein the non-image file is a text file. 19. The method of combining an image file with a non-image file of claim 13 wherein the at least one computer is a smart phone. 20. The method of combining an image file with a non-image file of claim 13 wherein the data file container further comprises information allowing the at least one computer to later separate the data file container into the first non-image file. | 2,100 |
5,519 | 5,519 | 15,163,953 | 2,184 | A data storage device includes a memory used to store device identification information, wherein the data storage device is operable to communication with an electronic device to receive the device identification information sent from the electronic device and to store the device identification information in the memory, and wherein the data storage device is operable to provide a hardware-switching device with the device identification information from the memory. A method for identifying multiple electronic devices includes providing, for each electronic device, a corresponding data storage device communicating with a hardware-switching device and storing device identification information related to each electronic device in the corresponding data storage device. Furthermore, in relation to communication between the data storage device and the hardware-switching device, the hardware-switching device receiving corresponding device identification information, so as to identify a corresponding electronic device based on the device identification information received by the hardware-switching device. | 1. A data storage device for storing device identification information related to an electronic device, the data storage device comprising:
a memory for storing the device identification information, wherein the data storage device is operable to communicate with an electronic device to receive the device identification information sent from the electronic device and to store the device identification information in the memory, and wherein the data storage device is operable to communicate with a hardware-switching device so that the hardware-switching device receives the device identification information from the memory. 2. The data storage device of claim 1, further comprising:
a first data interface and a second data interface, wherein the first data interface is operable to be connected to the electronic device for communication, and the second data interface is operable to be connected to the hardware-switching device for communication. 3. The data storage device of claim 2, wherein the memory is non-volatile memory. 4. The data storage device of claim 3, wherein the first data interface and the second data interfaces are universal serial bus interfaces. 5. The data storage device of claim 4, further comprising:
a universal serial bus communication device class device coupled between the first data interface and the second data interfaces. 6. The data storage device of claim 1, wherein the memory is operable to store the device identification information in response to starting the electronic device or updating the device identification information of the electronic device. 7. An electronic device, comprising:
a data storage device including a memory for storing device identification information related to the electronic device, wherein the data storage device is operable to communicate with the electronic device to receive the device identification information and to store the device identification information in the memory, and wherein the data storage device is operable to communicate with a hardware-switching device so that the hardware-switching device receives the device identification information from the memory; and a controller operable to write the device identification information related to the electronic device into the memory of the data storage device. 8. The electronic device of claim 7, wherein the data storage device comprises a first data interface, and wherein the electronic device includes a corresponding data interface connected to the first data interface and configured for communication with the first data interface. 9. The electronic device of claim 8, wherein the first data interface of the data storage device and the corresponding data interface of the electronic device are universal serial bus interfaces, and wherein the controller is a universal serial bus controller. 10. The electronic device of claim 7, wherein the device identification information includes system information of the electronic device, wherein the system information is selected from a system name, a product name, a system type, a serial number, an IP address, and combinations thereof. 11. The electronic device of claim 10, wherein the device identification information further includes information of an operating system installed in the electronic device, wherein the information of the operating system is selected from a name of the operating system, a version of the operating system, a level name of the operating system, an IP address of the operating system level, and combinations thereof. 12. The electronic device of claim 7, wherein the electronic device is a server. 13. A hardware-switching device, comprising:
a controller; and a plurality of data storage devices operable to communicate with the controller, each data storage device including a memory for storing device identification information related to a corresponding electronic device coupled to the data storage device, wherein each data storage device is operable to communicate with the corresponding electronic device to receive the device identification information sent from the corresponding electronic device and to store the device identification information in the memory, and wherein each data storage device is operable to communicate with the controller so that the controller receives the device identification information from the memory to identify an electronic device communicating with each data storage device. 14. The hardware-switching device of claim 13, further comprising:
a corresponding data interface connected to a second data interface of the data storage device and configured for communication with the data storage device. 15. The hardware-switching device of claim 13, wherein the data storage device is operable to store the device identification information in response to starting the electronic device or updating the device identification information of the electronic device. 16. The hardware-switching device of claim 13, wherein the device identification information includes system information of the electronic device, wherein the system information is selected from a system name, a product name, a system type, a serial number, an IP address, and combinations thereof. 17. The hardware-switching device of claim 16, wherein the device identification information further includes information of an operating system installed in the electronic device, wherein the information of the operating system is selected from a name of the operating system, a version of the operating system, a level name of an operating system, an IP address of the operating system level, and combinations thereof. 18. The hardware-switching device of claim 13, wherein the controller is operable to control a selected one of the electronic devices. 19. The hardware-switching device of claim 13, wherein the hardware-switching device is a keyboard video mouse switch. 20. The hardware-switching device of claim 13, wherein the hardware-switching device stores a data table identifying a plurality of connection relations, each connection relation identifying an interface and an electronic device coupled to the interface. | A data storage device includes a memory used to store device identification information, wherein the data storage device is operable to communication with an electronic device to receive the device identification information sent from the electronic device and to store the device identification information in the memory, and wherein the data storage device is operable to provide a hardware-switching device with the device identification information from the memory. A method for identifying multiple electronic devices includes providing, for each electronic device, a corresponding data storage device communicating with a hardware-switching device and storing device identification information related to each electronic device in the corresponding data storage device. Furthermore, in relation to communication between the data storage device and the hardware-switching device, the hardware-switching device receiving corresponding device identification information, so as to identify a corresponding electronic device based on the device identification information received by the hardware-switching device.1. A data storage device for storing device identification information related to an electronic device, the data storage device comprising:
a memory for storing the device identification information, wherein the data storage device is operable to communicate with an electronic device to receive the device identification information sent from the electronic device and to store the device identification information in the memory, and wherein the data storage device is operable to communicate with a hardware-switching device so that the hardware-switching device receives the device identification information from the memory. 2. The data storage device of claim 1, further comprising:
a first data interface and a second data interface, wherein the first data interface is operable to be connected to the electronic device for communication, and the second data interface is operable to be connected to the hardware-switching device for communication. 3. The data storage device of claim 2, wherein the memory is non-volatile memory. 4. The data storage device of claim 3, wherein the first data interface and the second data interfaces are universal serial bus interfaces. 5. The data storage device of claim 4, further comprising:
a universal serial bus communication device class device coupled between the first data interface and the second data interfaces. 6. The data storage device of claim 1, wherein the memory is operable to store the device identification information in response to starting the electronic device or updating the device identification information of the electronic device. 7. An electronic device, comprising:
a data storage device including a memory for storing device identification information related to the electronic device, wherein the data storage device is operable to communicate with the electronic device to receive the device identification information and to store the device identification information in the memory, and wherein the data storage device is operable to communicate with a hardware-switching device so that the hardware-switching device receives the device identification information from the memory; and a controller operable to write the device identification information related to the electronic device into the memory of the data storage device. 8. The electronic device of claim 7, wherein the data storage device comprises a first data interface, and wherein the electronic device includes a corresponding data interface connected to the first data interface and configured for communication with the first data interface. 9. The electronic device of claim 8, wherein the first data interface of the data storage device and the corresponding data interface of the electronic device are universal serial bus interfaces, and wherein the controller is a universal serial bus controller. 10. The electronic device of claim 7, wherein the device identification information includes system information of the electronic device, wherein the system information is selected from a system name, a product name, a system type, a serial number, an IP address, and combinations thereof. 11. The electronic device of claim 10, wherein the device identification information further includes information of an operating system installed in the electronic device, wherein the information of the operating system is selected from a name of the operating system, a version of the operating system, a level name of the operating system, an IP address of the operating system level, and combinations thereof. 12. The electronic device of claim 7, wherein the electronic device is a server. 13. A hardware-switching device, comprising:
a controller; and a plurality of data storage devices operable to communicate with the controller, each data storage device including a memory for storing device identification information related to a corresponding electronic device coupled to the data storage device, wherein each data storage device is operable to communicate with the corresponding electronic device to receive the device identification information sent from the corresponding electronic device and to store the device identification information in the memory, and wherein each data storage device is operable to communicate with the controller so that the controller receives the device identification information from the memory to identify an electronic device communicating with each data storage device. 14. The hardware-switching device of claim 13, further comprising:
a corresponding data interface connected to a second data interface of the data storage device and configured for communication with the data storage device. 15. The hardware-switching device of claim 13, wherein the data storage device is operable to store the device identification information in response to starting the electronic device or updating the device identification information of the electronic device. 16. The hardware-switching device of claim 13, wherein the device identification information includes system information of the electronic device, wherein the system information is selected from a system name, a product name, a system type, a serial number, an IP address, and combinations thereof. 17. The hardware-switching device of claim 16, wherein the device identification information further includes information of an operating system installed in the electronic device, wherein the information of the operating system is selected from a name of the operating system, a version of the operating system, a level name of an operating system, an IP address of the operating system level, and combinations thereof. 18. The hardware-switching device of claim 13, wherein the controller is operable to control a selected one of the electronic devices. 19. The hardware-switching device of claim 13, wherein the hardware-switching device is a keyboard video mouse switch. 20. The hardware-switching device of claim 13, wherein the hardware-switching device stores a data table identifying a plurality of connection relations, each connection relation identifying an interface and an electronic device coupled to the interface. | 2,100 |
5,520 | 5,520 | 14,298,981 | 2,191 | Machines, systems and methods for deploying virtual machines (VMs), the method comprises maintaining N message queues corresponding to N VM flavors, wherein the N VM flavors are associated with N distinguishable configuration requirements for supporting placement of at least a first VM on at least a first host with limited resources; wherein a first host from among a plurality of hosts subscribes to a first message queue from among the N message queues, in response to determining that the first host has the resources that match the respective configuration requirements for supporting the first VM placed on the first message queue; receiving a VM placement request for the first VM, wherein the VM placement request comprises information indicating a first VM flavor associated with a first message queue; communicating arrival of the VM request to one or more hosts subscribing to the first message queue. | 1. A computer implemented method for deploying virtual machines (VMs) over a communications network, the method comprising:
maintaining N message queues corresponding to N VM flavors, wherein the N VM flavors are associated with N distinguishable configuration requirements for supporting placement of at least a first VM on at least a first host with limited resources; wherein a first host from among a plurality of hosts subscribes to a first message queue from among the N message queues, in response to determining that the first host has the resources that match the respective configuration requirements for supporting the first VM placed on the first message queue; receiving a VM placement request for the first VM, wherein the VM placement request comprises information indicating a first VM flavor associated with a first message queue; communicating arrival of the VM request to one or more hosts subscribing to the first message queue; and forwarding the VM placement request to a responding host to deploy the VM. 2. The method of claim 1, wherein a first available host subscribing to the first message queue responds upon determining that the first available host has sufficient resources for deploying the first VM. 3. The method of claim 1, wherein hosts subscribing to the first message queue respond and compete on a merit-based model to become the responding host for the VM placement request. 4. The method of claim 1, wherein the first VM flavor is identified by querying a scheduler in communication with a plurality of hosts on the communication network, wherein the scheduler responds by providing a list of VM flavors. 5. The method of claim 1, wherein when a new host is added to the communications network, the new host determines to which messages queues to subscribe. 6. The method of claim 1, wherein before a source host is removed from the communications network, the source host submits, to the message queues, VM migration requests to cause the currently hosted VMs to migrate to other hosts. 7. The method of claim 1, further comprising allowing the responding host to update subscriptions to the message queues after the deployment of the VM. 8. The method of claim 6, wherein after a target host accepts a migration request, the source host and the target host update their subscriptions to the message queues. 9. The method of claim 1, wherein when a last instance of a VM with a VM flavor is removed, a message queue associated with the VM flavor is deleted. 10. The method of claim 1, wherein a first available host subscribing to the first message queue in response to determining that the first available host has sufficient resources for the VM placement request, reserves the resources on the first available host and forwards the indication to the scheduler. 11. A system for deploying virtual machines (VMs) over a communications network, the system comprising:
a logic unit for maintaining N message queues corresponding to N VM flavors, wherein the N VM flavors are associated with N distinguishable configuration requirements for supporting placement of at least a first VM on at least a first host with limited resources; wherein a first host from among a plurality of hosts subscribes to a first message queue from among the N message queues, in response to determining that the first host has the resources that match the respective configuration requirements for supporting the first VM placed on the first message queue; a logic unit for receiving a VM placement request for the first VM, wherein the VM placement request comprises information indicating a first VM flavor associated with a first message queue; a logic unit for communicating arrival of the VM request to one or more hosts subscribing to the first message queue; and a logic unit for forwarding the VM placement request to a responding host to deploy the VM. 12. The system of claim 11, wherein a first available host subscribing to the first message queue responds upon determining that the first available host has sufficient resources for deploying the first VM. 13. The system of claim 11, wherein hosts subscribing to the first message queue respond and compete on a merit-based model to become the responding host for the VM placement request. 14. The system of claim 11, wherein the first VM flavor is identified by querying a scheduler in communication with a plurality of hosts on the communication network, wherein the scheduler responds by providing a list of VM flavors. 15. The system of claim 11, wherein when a new host is added to the communications network, the new host determines to which messages queues to subscribe. 16. A computer program product comprising a computer readable storage medium having a computer readable program for deploying virtual machines (VMs) over a communications network, wherein the computer readable program when executed on a computer causes the computer to:
maintain N message queues corresponding to N VM flavors, wherein the N VM flavors are associated with N distinguishable configuration requirements for supporting placement of at least a first VM on at least a first host with limited resources; wherein a first host from among a plurality of hosts subscribes to a first message queue from among the N message queues, in response to determining that the first host has the resources that match the respective configuration requirements for supporting the first VM placed on the first message queue; receive a VM placement request for the first VM, wherein the VM placement request comprises information indicating a first VM flavor associated with a first message queue; communicate arrival of the VM request to one or more hosts subscribing to the first message queue; and forward the VM placement request to a responding host to deploy the VM. 17. The computer program product of claim 16, wherein a first available host subscribing to the first message queue responds upon determining that the first available host has sufficient resources for deploying the first VM. 18. The computer program product of claim 16, wherein hosts subscribing to the first message queue respond and compete on a merit-based model to become the responding host for the VM placement request. 19. The computer program product of claim 16, wherein the first VM flavor is identified by querying a scheduler in communication with a plurality of hosts on the communication network, wherein the scheduler responds by providing a list of VM flavors. 20. The computer program product of claim 16, wherein when a new host is added to the communications network, the new host determines to which messages queues to subscribe. | Machines, systems and methods for deploying virtual machines (VMs), the method comprises maintaining N message queues corresponding to N VM flavors, wherein the N VM flavors are associated with N distinguishable configuration requirements for supporting placement of at least a first VM on at least a first host with limited resources; wherein a first host from among a plurality of hosts subscribes to a first message queue from among the N message queues, in response to determining that the first host has the resources that match the respective configuration requirements for supporting the first VM placed on the first message queue; receiving a VM placement request for the first VM, wherein the VM placement request comprises information indicating a first VM flavor associated with a first message queue; communicating arrival of the VM request to one or more hosts subscribing to the first message queue.1. A computer implemented method for deploying virtual machines (VMs) over a communications network, the method comprising:
maintaining N message queues corresponding to N VM flavors, wherein the N VM flavors are associated with N distinguishable configuration requirements for supporting placement of at least a first VM on at least a first host with limited resources; wherein a first host from among a plurality of hosts subscribes to a first message queue from among the N message queues, in response to determining that the first host has the resources that match the respective configuration requirements for supporting the first VM placed on the first message queue; receiving a VM placement request for the first VM, wherein the VM placement request comprises information indicating a first VM flavor associated with a first message queue; communicating arrival of the VM request to one or more hosts subscribing to the first message queue; and forwarding the VM placement request to a responding host to deploy the VM. 2. The method of claim 1, wherein a first available host subscribing to the first message queue responds upon determining that the first available host has sufficient resources for deploying the first VM. 3. The method of claim 1, wherein hosts subscribing to the first message queue respond and compete on a merit-based model to become the responding host for the VM placement request. 4. The method of claim 1, wherein the first VM flavor is identified by querying a scheduler in communication with a plurality of hosts on the communication network, wherein the scheduler responds by providing a list of VM flavors. 5. The method of claim 1, wherein when a new host is added to the communications network, the new host determines to which messages queues to subscribe. 6. The method of claim 1, wherein before a source host is removed from the communications network, the source host submits, to the message queues, VM migration requests to cause the currently hosted VMs to migrate to other hosts. 7. The method of claim 1, further comprising allowing the responding host to update subscriptions to the message queues after the deployment of the VM. 8. The method of claim 6, wherein after a target host accepts a migration request, the source host and the target host update their subscriptions to the message queues. 9. The method of claim 1, wherein when a last instance of a VM with a VM flavor is removed, a message queue associated with the VM flavor is deleted. 10. The method of claim 1, wherein a first available host subscribing to the first message queue in response to determining that the first available host has sufficient resources for the VM placement request, reserves the resources on the first available host and forwards the indication to the scheduler. 11. A system for deploying virtual machines (VMs) over a communications network, the system comprising:
a logic unit for maintaining N message queues corresponding to N VM flavors, wherein the N VM flavors are associated with N distinguishable configuration requirements for supporting placement of at least a first VM on at least a first host with limited resources; wherein a first host from among a plurality of hosts subscribes to a first message queue from among the N message queues, in response to determining that the first host has the resources that match the respective configuration requirements for supporting the first VM placed on the first message queue; a logic unit for receiving a VM placement request for the first VM, wherein the VM placement request comprises information indicating a first VM flavor associated with a first message queue; a logic unit for communicating arrival of the VM request to one or more hosts subscribing to the first message queue; and a logic unit for forwarding the VM placement request to a responding host to deploy the VM. 12. The system of claim 11, wherein a first available host subscribing to the first message queue responds upon determining that the first available host has sufficient resources for deploying the first VM. 13. The system of claim 11, wherein hosts subscribing to the first message queue respond and compete on a merit-based model to become the responding host for the VM placement request. 14. The system of claim 11, wherein the first VM flavor is identified by querying a scheduler in communication with a plurality of hosts on the communication network, wherein the scheduler responds by providing a list of VM flavors. 15. The system of claim 11, wherein when a new host is added to the communications network, the new host determines to which messages queues to subscribe. 16. A computer program product comprising a computer readable storage medium having a computer readable program for deploying virtual machines (VMs) over a communications network, wherein the computer readable program when executed on a computer causes the computer to:
maintain N message queues corresponding to N VM flavors, wherein the N VM flavors are associated with N distinguishable configuration requirements for supporting placement of at least a first VM on at least a first host with limited resources; wherein a first host from among a plurality of hosts subscribes to a first message queue from among the N message queues, in response to determining that the first host has the resources that match the respective configuration requirements for supporting the first VM placed on the first message queue; receive a VM placement request for the first VM, wherein the VM placement request comprises information indicating a first VM flavor associated with a first message queue; communicate arrival of the VM request to one or more hosts subscribing to the first message queue; and forward the VM placement request to a responding host to deploy the VM. 17. The computer program product of claim 16, wherein a first available host subscribing to the first message queue responds upon determining that the first available host has sufficient resources for deploying the first VM. 18. The computer program product of claim 16, wherein hosts subscribing to the first message queue respond and compete on a merit-based model to become the responding host for the VM placement request. 19. The computer program product of claim 16, wherein the first VM flavor is identified by querying a scheduler in communication with a plurality of hosts on the communication network, wherein the scheduler responds by providing a list of VM flavors. 20. The computer program product of claim 16, wherein when a new host is added to the communications network, the new host determines to which messages queues to subscribe. | 2,100 |
5,521 | 5,521 | 14,728,497 | 2,139 | Example apparatus and methods concern selective adaptive predictive data placement to improve the operating and/or electrical efficiency of a data storage apparatus. A future input/output operation is predicted from a current input/output operation, the state of the data storage apparatus, relationships between data currently being processed and data previously processed, environmental factors, or other factors. The apparatus and methods may improve data storage efficiency by selectively pre-fetching data, relocating data on the data storage apparatus or within a plurality of data storage apparatus, speculatively producing erasure codes or other error correction codes, speculatively deduplicating data, or other adaptive functions. Relocation and pre-fetching may be configured to achieve different policies focused on electrical efficiency, operating efficiency, use spreading, or other considerations. | 1. A non-transitory computer-readable storage medium storing computer-executable instructions that when executed by a computer cause the computer to perform a method, the method comprising:
identifying electronic data to be processed for a data storage apparatus accessible to the computer; determining a value for one or first more properties of the electronic data; determining a value for one or more first properties of the data storage apparatus; generating a prediction about the electronic data using a probabilistic model that considers the value for the one or more first properties of the electronic data, the value for the one or more first properties of the data storage apparatus, and previously observed behavior for the electronic data with respect to the data storage apparatus; and controlling the computer to selectively perform an adaptive predictive data placement for the electronic data or the data storage apparatus based, at least in part, on the prediction. 2. The non-transitory computer-readable storage medium of claim 1, where the adaptive predictive data placement includes pre-fetching additional electronic data. 3. The non-transitory computer-readable storage medium of claim 1, where the adaptive predictive data placement includes pre-fetching additional electronic data from a device other than the data storage apparatus. 4. The non-transitory computer-readable storage medium of claim 1, where the adaptive predictive data placement includes aggregating the electronic data or additional electronic data, replicating a portion of the electronic data or additional electronic data, distributing the electronic data or additional electronic data, or relocating the electronic data or additional electronic data. 5. The non-transitory computer-readable storage medium of claim 1, where the adaptive predictive data placement includes selectively pre-fetching an erasure code or error correction data for the electronic data. 6. The non-transitory computer-readable storage medium of claim 1, where the adaptive predictive data placement includes selectively pre-fetching an erasure code or error correction data for the electronic data from a device other than the data storage apparatus. 7. The non-transitory computer-readable storage medium of claim 1, where the adaptive predictive data placement includes relocating an erasure code or error correction data for the electronic data. 8. The non-transitory computer-readable storage medium of claim 1, the method comprising:
generating a plurality of predictions about the electronic data, and controlling the computer to selectively perform two or more adaptive predictive data placements in parallel based, at least in part, on the plurality of predictions. 9. The non-transitory computer-readable storage medium of claim 1, where the prediction concerns the likelihood of a delay being produced during a current or anticipated input/output operation and where the adaptive predictive data placement relocates data or reorders the order in which data will be read to prevent the delay. 10. The non-transitory computer-readable storage medium of claim 1, where the adaptive predictive data placement includes speculatively producing an erasure code or error correction data for the electronic data, or speculatively deduplicating the electronic data. 11. The non-transitory computer-readable storage medium of claim 1, where the adaptive predictive data placement includes targeting the electronic data for a selected data storage apparatus. 12. The non-transitory computer-readable storage medium of claim 1, where the prediction identifies additional electronic data to be read and where the electronic data is data that is being read from the data storage apparatus. 13. The non-transitory computer-readable storage medium of claim 1, where the prediction identifies additional electronic data to be read and where the electronic data is data that is being ingested by the computer. 14. The non-transitory computer-readable storage medium of claim 1, where the prediction identifies additional electronic data to be ingested by the computer and where the electronic data is data that is being ingested by the computer. 15. The non-transitory computer-readable storage medium of claim 1, where the prediction identifies additional electronic data to be ingested by the computer and where the electronic data is data that is being read from the data storage apparatus. 16. The non-transitory computer-readable storage medium of claim 1, where the adaptive predictive data placement includes spinning up a disk drive. 17. The non-transitory computer-readable storage medium of claim 1, where the one or more first properties of the electronic data include a data size, a data type, a data owner, a data source, a data destination, a data name, or a data organization. 18. The non-transitory computer-readable storage medium of claim 1, where the one or more first properties of the electronic data include a byte-stream pattern associated with the data. 19. The non-transitory computer-readable storage medium of claim 1, where the one or more first properties of the electronic data include an identifier of whether the data fits in an input buffer associated with the computer. 20. The non-transitory computer-readable storage medium of claim 1, where the one or more first properties of the data storage system include a total capacity, an unused capacity, a subscription level, a dollar cost for a data storage operation, an electrical cost for a data storage operation, a read time, a write time, a security level, and a state of the data storage apparatus. 21. The non-transitory computer-readable storage medium of claim 20, where the state includes a spinning state, a not spinning state, a powered up state, a not powered up state, a busy state, a not busy state, an on state, or an off state. 22. The non-transitory computer-readable storage medium of claim 1, where the probabilistic model is a Markov Chain model. 23. The non-transitory computer-readable storage medium of claim 1, where second properties of the electronic data include a history of encountering data from a source, a history of encountering data of the size of the electronic data, a history of encountering data of the type of the electronic data, or a history of encountering data from the owner of the electronic data. 24. The non-transitory computer-readable storage medium of claim 1, where third properties of the electronic data include a spatial relationship between the electronic data and other electronic data, or a temporal relationship between the electronic data and other electronic data. 25. The non-transitory computer-readable storage medium of claim 1, where the adaptive predictive data placement includes storing the electronic data to a temporary location and then moving the electronic data from the temporary location to an ultimate destination. 26. The non-transitory computer-readable storage medium of claim 1, the method comprising relocating electronic data in the data storage apparatus as a function of an environmental factor associated with the data storage apparatus. 27. The non-transitory computer-readable storage medium of claim 26, the environmental factor being an error rate associated with the data storage apparatus. 28. An apparatus, comprising:
a processor; a memory that stores metadata about data being processed by the apparatus for a data storage device in a data storage system or information about an access pattern, a trend, a relationship, or a prediction concerning the data being processed by the apparatus for the data storage device; a set of logics; and an interface that connects the processor, the memory, and the set of logics; the set of logics comprising:
a first logic that processes a current read request associated with the data being processed for the data storage device and updates observed input/output behavior for the data being processed and for the data storage device;
a second logic that makes a prediction about a future input/output request based, at least in part, on the current read request and the observed input/output behavior, and
a third logic that pre-fetches data from the data storage system or relocates data in the data storage system based, at least in part, on the prediction. 29. The apparatus of claim 28, where the first logic updates the observed input/output behavior with respect to the temporal or spatial proximity of the data being processed and data previously processed for the data storage system. 30. The apparatus of claim 29, where the second logic makes the prediction based, at least in part, on the temporal or spatial proximity of the data being processed and additional electronic data in the data storage system. 31. The apparatus of claim 28, where the third logic relocates the electronic data and the additional electronic data to the same data storage device in the data storage system. 32. The apparatus of claim 28, where the third logic relocates the electronic data and the additional electronic data to different data storage devices in the data storage system. 33. The apparatus of claim 28, comprising a fourth logic that ingests newly arrived electronic data and targets the newly arrived electronic data to a location in the data storage system based, at least in part, on an attribute of the newly arrived electronic data or on a relationship between the newly arrived electronic data and previously processed electronic data in the data storage system. 34. The apparatus of claim 33, where the fourth logic performs speculative erasure code production, speculative error correction code production, or speculative data deduplication based, at least in part, on an attribute of the newly arrived electronic data or on a relationship between the newly arrived electronic data and previously processed electronic data in the data storage system. 35. A system, comprising:
a computer that runs a predictive data placement process for a data storage device, where the process predicts a future input/output operation based on as-encountered data and historical data associated with a current input/output operation associated with the data storage device, and a data storage efficiency apparatus that selectively relocates data on the data storage device based, at least in part, on the future input/output operation. 36. An application specific integrated circuit (ASIC) that controls data movement for a data storage device other than input/output based data movement, where the ASIC includes gates configured to selectively relocate data stored on a medium associated with the data storage device based, at least in part, on a relationship between a current input/output operation and a predicted future input/output operation. | Example apparatus and methods concern selective adaptive predictive data placement to improve the operating and/or electrical efficiency of a data storage apparatus. A future input/output operation is predicted from a current input/output operation, the state of the data storage apparatus, relationships between data currently being processed and data previously processed, environmental factors, or other factors. The apparatus and methods may improve data storage efficiency by selectively pre-fetching data, relocating data on the data storage apparatus or within a plurality of data storage apparatus, speculatively producing erasure codes or other error correction codes, speculatively deduplicating data, or other adaptive functions. Relocation and pre-fetching may be configured to achieve different policies focused on electrical efficiency, operating efficiency, use spreading, or other considerations.1. A non-transitory computer-readable storage medium storing computer-executable instructions that when executed by a computer cause the computer to perform a method, the method comprising:
identifying electronic data to be processed for a data storage apparatus accessible to the computer; determining a value for one or first more properties of the electronic data; determining a value for one or more first properties of the data storage apparatus; generating a prediction about the electronic data using a probabilistic model that considers the value for the one or more first properties of the electronic data, the value for the one or more first properties of the data storage apparatus, and previously observed behavior for the electronic data with respect to the data storage apparatus; and controlling the computer to selectively perform an adaptive predictive data placement for the electronic data or the data storage apparatus based, at least in part, on the prediction. 2. The non-transitory computer-readable storage medium of claim 1, where the adaptive predictive data placement includes pre-fetching additional electronic data. 3. The non-transitory computer-readable storage medium of claim 1, where the adaptive predictive data placement includes pre-fetching additional electronic data from a device other than the data storage apparatus. 4. The non-transitory computer-readable storage medium of claim 1, where the adaptive predictive data placement includes aggregating the electronic data or additional electronic data, replicating a portion of the electronic data or additional electronic data, distributing the electronic data or additional electronic data, or relocating the electronic data or additional electronic data. 5. The non-transitory computer-readable storage medium of claim 1, where the adaptive predictive data placement includes selectively pre-fetching an erasure code or error correction data for the electronic data. 6. The non-transitory computer-readable storage medium of claim 1, where the adaptive predictive data placement includes selectively pre-fetching an erasure code or error correction data for the electronic data from a device other than the data storage apparatus. 7. The non-transitory computer-readable storage medium of claim 1, where the adaptive predictive data placement includes relocating an erasure code or error correction data for the electronic data. 8. The non-transitory computer-readable storage medium of claim 1, the method comprising:
generating a plurality of predictions about the electronic data, and controlling the computer to selectively perform two or more adaptive predictive data placements in parallel based, at least in part, on the plurality of predictions. 9. The non-transitory computer-readable storage medium of claim 1, where the prediction concerns the likelihood of a delay being produced during a current or anticipated input/output operation and where the adaptive predictive data placement relocates data or reorders the order in which data will be read to prevent the delay. 10. The non-transitory computer-readable storage medium of claim 1, where the adaptive predictive data placement includes speculatively producing an erasure code or error correction data for the electronic data, or speculatively deduplicating the electronic data. 11. The non-transitory computer-readable storage medium of claim 1, where the adaptive predictive data placement includes targeting the electronic data for a selected data storage apparatus. 12. The non-transitory computer-readable storage medium of claim 1, where the prediction identifies additional electronic data to be read and where the electronic data is data that is being read from the data storage apparatus. 13. The non-transitory computer-readable storage medium of claim 1, where the prediction identifies additional electronic data to be read and where the electronic data is data that is being ingested by the computer. 14. The non-transitory computer-readable storage medium of claim 1, where the prediction identifies additional electronic data to be ingested by the computer and where the electronic data is data that is being ingested by the computer. 15. The non-transitory computer-readable storage medium of claim 1, where the prediction identifies additional electronic data to be ingested by the computer and where the electronic data is data that is being read from the data storage apparatus. 16. The non-transitory computer-readable storage medium of claim 1, where the adaptive predictive data placement includes spinning up a disk drive. 17. The non-transitory computer-readable storage medium of claim 1, where the one or more first properties of the electronic data include a data size, a data type, a data owner, a data source, a data destination, a data name, or a data organization. 18. The non-transitory computer-readable storage medium of claim 1, where the one or more first properties of the electronic data include a byte-stream pattern associated with the data. 19. The non-transitory computer-readable storage medium of claim 1, where the one or more first properties of the electronic data include an identifier of whether the data fits in an input buffer associated with the computer. 20. The non-transitory computer-readable storage medium of claim 1, where the one or more first properties of the data storage system include a total capacity, an unused capacity, a subscription level, a dollar cost for a data storage operation, an electrical cost for a data storage operation, a read time, a write time, a security level, and a state of the data storage apparatus. 21. The non-transitory computer-readable storage medium of claim 20, where the state includes a spinning state, a not spinning state, a powered up state, a not powered up state, a busy state, a not busy state, an on state, or an off state. 22. The non-transitory computer-readable storage medium of claim 1, where the probabilistic model is a Markov Chain model. 23. The non-transitory computer-readable storage medium of claim 1, where second properties of the electronic data include a history of encountering data from a source, a history of encountering data of the size of the electronic data, a history of encountering data of the type of the electronic data, or a history of encountering data from the owner of the electronic data. 24. The non-transitory computer-readable storage medium of claim 1, where third properties of the electronic data include a spatial relationship between the electronic data and other electronic data, or a temporal relationship between the electronic data and other electronic data. 25. The non-transitory computer-readable storage medium of claim 1, where the adaptive predictive data placement includes storing the electronic data to a temporary location and then moving the electronic data from the temporary location to an ultimate destination. 26. The non-transitory computer-readable storage medium of claim 1, the method comprising relocating electronic data in the data storage apparatus as a function of an environmental factor associated with the data storage apparatus. 27. The non-transitory computer-readable storage medium of claim 26, the environmental factor being an error rate associated with the data storage apparatus. 28. An apparatus, comprising:
a processor; a memory that stores metadata about data being processed by the apparatus for a data storage device in a data storage system or information about an access pattern, a trend, a relationship, or a prediction concerning the data being processed by the apparatus for the data storage device; a set of logics; and an interface that connects the processor, the memory, and the set of logics; the set of logics comprising:
a first logic that processes a current read request associated with the data being processed for the data storage device and updates observed input/output behavior for the data being processed and for the data storage device;
a second logic that makes a prediction about a future input/output request based, at least in part, on the current read request and the observed input/output behavior, and
a third logic that pre-fetches data from the data storage system or relocates data in the data storage system based, at least in part, on the prediction. 29. The apparatus of claim 28, where the first logic updates the observed input/output behavior with respect to the temporal or spatial proximity of the data being processed and data previously processed for the data storage system. 30. The apparatus of claim 29, where the second logic makes the prediction based, at least in part, on the temporal or spatial proximity of the data being processed and additional electronic data in the data storage system. 31. The apparatus of claim 28, where the third logic relocates the electronic data and the additional electronic data to the same data storage device in the data storage system. 32. The apparatus of claim 28, where the third logic relocates the electronic data and the additional electronic data to different data storage devices in the data storage system. 33. The apparatus of claim 28, comprising a fourth logic that ingests newly arrived electronic data and targets the newly arrived electronic data to a location in the data storage system based, at least in part, on an attribute of the newly arrived electronic data or on a relationship between the newly arrived electronic data and previously processed electronic data in the data storage system. 34. The apparatus of claim 33, where the fourth logic performs speculative erasure code production, speculative error correction code production, or speculative data deduplication based, at least in part, on an attribute of the newly arrived electronic data or on a relationship between the newly arrived electronic data and previously processed electronic data in the data storage system. 35. A system, comprising:
a computer that runs a predictive data placement process for a data storage device, where the process predicts a future input/output operation based on as-encountered data and historical data associated with a current input/output operation associated with the data storage device, and a data storage efficiency apparatus that selectively relocates data on the data storage device based, at least in part, on the future input/output operation. 36. An application specific integrated circuit (ASIC) that controls data movement for a data storage device other than input/output based data movement, where the ASIC includes gates configured to selectively relocate data stored on a medium associated with the data storage device based, at least in part, on a relationship between a current input/output operation and a predicted future input/output operation. | 2,100 |
5,522 | 5,522 | 14,292,721 | 2,194 | Technology is disclosed for processing in a computer program a request received by a service virtual machine (SVM). The technology can receive a request in either a first form or a second form, wherein the first form includes a target textual identifier, a reply-to textual identifier, and a parameter, and the second form includes a target textual identifier and a parameter, but not a reply-to textual identifier; identify, based on the received target textual identifier, a procedure; invoke the identified procedure and providing a value of the received parameter to the invoked procedure; in an event the received request is in the first form: receive a result from the invoked procedure; form a reply-to request in the second form, the second form including as a target textual identifier the reply-to textual identifier in the received request, and as a parameter the result received from the invoked procedure, further wherein the second form does not include a reply-to textual identifier; and send, to the SVM, the formed reply-to request. | 1. A method for processing in a computer program a request received by a service virtual machine (SVM), comprising:
receiving a request in either a first form or a second form, wherein the first form includes a target textual identifier, a reply-to textual identifier, and a parameter, and the second form includes a target textual identifier and a parameter, but not a reply-to textual identifier; identifying, based on the received target textual identifier, a procedure; invoking the identified procedure and providing a value of the received parameter to the invoked procedure; in an event the received request is in the first form:
receiving a result from the invoked procedure;
forming a reply-to request in the second form, the second form including as a target textual identifier the reply-to textual identifier in the received request, and as a parameter the result received from the invoked procedure, further wherein the second form does not include a reply-to textual identifier; and
sending, to the SVM, the formed reply-to request. 2. The method of claim 1, wherein the identified procedure is a standalone procedure or a global procedure. 3. The method of claim 1, wherein the identified procedure is a method provided by an object. 4. The method of claim 1, wherein the identified procedure is a method provided by a class. 5. The method of claim 1, further comprising:
in an event the received request does not include a target SVM textual identifier or the included target SVM textual identifier is the same as a textual identifier associated with the SVM, processing the received request; in an event the received request includes a target SVM textual identifier and the included target SVM textual identifier is not the same as a textual identifier associated with the SVM and in an event it is determined that the included target SVM textual identifier identifies a neighbor SVM, submitting the received request to the identified neighbor SVM; and in an event the received request includes a target SVM textual identifier and the included target SVM textual identifier is not the same as a textual identifier associated with the SVM and in an event it is determined that the included target SVM textual identifier does not identify a neighbor SVM, receiving a neighbor SVM textual identifier, and then submitting the received request to the neighbor SVM identified by the received neighbor SVM textual identifier. 6. The method of claim 5, wherein the received neighbor SVM textual identifier is a result of the SVM performing a routing algorithm. 7. The method of claim 5, wherein the received neighbor SVM textual identifier is a result of the SVM reading a memory configuration. 8. The method of claim 5, wherein the received neighbor SVM textual identifier is a result of the SVM reading a configuration file. 9. The method of claim 5, wherein the received neighbor SVM textual identifier is received by the SVM from outside the SVM. 10. The method of claim 1, wherein the target textual identifier includes an object textual identifier and a method textual identifier identifying a procedure. 11. The method of claim 10, further comprising identifying an object based on the object textual identifier. 12. The method of claim 11, further comprising identifying a method in the identified object based on the method textual identifier, wherein the identified procedure is the identified method. 13. The method of claim 12, further comprising invoking the identified method based on the identified object not being invoked. 14. The method of claim 10, further comprising identifying multiple objects based on the object textual identifier. 15. The method of claim 14, further comprising identifying a single object from the multiple objects based on the object not being invoked. 16. The method of claim 15, further comprising identifying a method in the identified object based on the method textual identifier, wherein the identified procedure is the identified method. 17. The method of claim 11, further comprising allowing only one thread at a time to invoke a method in the object. 18. The method of claim 1, further comprising:
receiving a request using a first thread; and invoking the identified procedure using a second thread. 19. The method of claim 18, wherein the first thread is asynchronous of the second thread. 20. The method of claim 19, wherein the first thread and the second thread are two different threads. 21. The method of claim 20, wherein the first thread and the second thread are the same thread, but are asynchronous to each other due to thread scheduling. 22. A computer-readable storage medium storing instructions for performing a method for processing in a computer program a request received by a service virtual machine (SVM), comprising:
instructions for receiving a request in either a first form or a second form, wherein the first form includes a target textual identifier, a reply-to textual identifier, and a parameter, and the second form includes a target textual identifier and a parameter, but not a reply-to textual identifier; instructions for identifying, based on the received target textual identifier, a procedure; instructions for invoking the identified procedure and providing a value of the received parameter to the invoked procedure; instructions for, in an event the received request is in the first form:
receiving a result from the invoked procedure;
forming a reply-to request in the second form, the second form including as a target textual identifier the reply-to textual identifier in the received request, and as a parameter the result received from the invoked procedure, further wherein the second form does not include a reply-to textual identifier; and
sending, to the SVM, the formed reply-to request. 23. A system for processing in a computer program a request received by a service virtual machine (SVM), comprising:
a component configured to receive a request in either a first form or a second form, wherein the first form includes a target textual identifier, a reply-to textual identifier, and a parameter, and the second form includes a target textual identifier and a parameter, but not a reply-to textual identifier; a component configured to identify, based on the received target textual identifier, a procedure; a component configured to invoke the identified procedure and providing a value of the received parameter to the invoked procedure; a component configured to, in an event the received request is in the first form:
receive a result from the invoked procedure;
form a reply-to request in the second form, the second form including as a target textual identifier the reply-to textual identifier in the received request, and as a parameter the result received from the invoked procedure, further wherein the second form does not include a reply-to textual identifier; and
send, to the SVM, the formed reply-to request. | Technology is disclosed for processing in a computer program a request received by a service virtual machine (SVM). The technology can receive a request in either a first form or a second form, wherein the first form includes a target textual identifier, a reply-to textual identifier, and a parameter, and the second form includes a target textual identifier and a parameter, but not a reply-to textual identifier; identify, based on the received target textual identifier, a procedure; invoke the identified procedure and providing a value of the received parameter to the invoked procedure; in an event the received request is in the first form: receive a result from the invoked procedure; form a reply-to request in the second form, the second form including as a target textual identifier the reply-to textual identifier in the received request, and as a parameter the result received from the invoked procedure, further wherein the second form does not include a reply-to textual identifier; and send, to the SVM, the formed reply-to request.1. A method for processing in a computer program a request received by a service virtual machine (SVM), comprising:
receiving a request in either a first form or a second form, wherein the first form includes a target textual identifier, a reply-to textual identifier, and a parameter, and the second form includes a target textual identifier and a parameter, but not a reply-to textual identifier; identifying, based on the received target textual identifier, a procedure; invoking the identified procedure and providing a value of the received parameter to the invoked procedure; in an event the received request is in the first form:
receiving a result from the invoked procedure;
forming a reply-to request in the second form, the second form including as a target textual identifier the reply-to textual identifier in the received request, and as a parameter the result received from the invoked procedure, further wherein the second form does not include a reply-to textual identifier; and
sending, to the SVM, the formed reply-to request. 2. The method of claim 1, wherein the identified procedure is a standalone procedure or a global procedure. 3. The method of claim 1, wherein the identified procedure is a method provided by an object. 4. The method of claim 1, wherein the identified procedure is a method provided by a class. 5. The method of claim 1, further comprising:
in an event the received request does not include a target SVM textual identifier or the included target SVM textual identifier is the same as a textual identifier associated with the SVM, processing the received request; in an event the received request includes a target SVM textual identifier and the included target SVM textual identifier is not the same as a textual identifier associated with the SVM and in an event it is determined that the included target SVM textual identifier identifies a neighbor SVM, submitting the received request to the identified neighbor SVM; and in an event the received request includes a target SVM textual identifier and the included target SVM textual identifier is not the same as a textual identifier associated with the SVM and in an event it is determined that the included target SVM textual identifier does not identify a neighbor SVM, receiving a neighbor SVM textual identifier, and then submitting the received request to the neighbor SVM identified by the received neighbor SVM textual identifier. 6. The method of claim 5, wherein the received neighbor SVM textual identifier is a result of the SVM performing a routing algorithm. 7. The method of claim 5, wherein the received neighbor SVM textual identifier is a result of the SVM reading a memory configuration. 8. The method of claim 5, wherein the received neighbor SVM textual identifier is a result of the SVM reading a configuration file. 9. The method of claim 5, wherein the received neighbor SVM textual identifier is received by the SVM from outside the SVM. 10. The method of claim 1, wherein the target textual identifier includes an object textual identifier and a method textual identifier identifying a procedure. 11. The method of claim 10, further comprising identifying an object based on the object textual identifier. 12. The method of claim 11, further comprising identifying a method in the identified object based on the method textual identifier, wherein the identified procedure is the identified method. 13. The method of claim 12, further comprising invoking the identified method based on the identified object not being invoked. 14. The method of claim 10, further comprising identifying multiple objects based on the object textual identifier. 15. The method of claim 14, further comprising identifying a single object from the multiple objects based on the object not being invoked. 16. The method of claim 15, further comprising identifying a method in the identified object based on the method textual identifier, wherein the identified procedure is the identified method. 17. The method of claim 11, further comprising allowing only one thread at a time to invoke a method in the object. 18. The method of claim 1, further comprising:
receiving a request using a first thread; and invoking the identified procedure using a second thread. 19. The method of claim 18, wherein the first thread is asynchronous of the second thread. 20. The method of claim 19, wherein the first thread and the second thread are two different threads. 21. The method of claim 20, wherein the first thread and the second thread are the same thread, but are asynchronous to each other due to thread scheduling. 22. A computer-readable storage medium storing instructions for performing a method for processing in a computer program a request received by a service virtual machine (SVM), comprising:
instructions for receiving a request in either a first form or a second form, wherein the first form includes a target textual identifier, a reply-to textual identifier, and a parameter, and the second form includes a target textual identifier and a parameter, but not a reply-to textual identifier; instructions for identifying, based on the received target textual identifier, a procedure; instructions for invoking the identified procedure and providing a value of the received parameter to the invoked procedure; instructions for, in an event the received request is in the first form:
receiving a result from the invoked procedure;
forming a reply-to request in the second form, the second form including as a target textual identifier the reply-to textual identifier in the received request, and as a parameter the result received from the invoked procedure, further wherein the second form does not include a reply-to textual identifier; and
sending, to the SVM, the formed reply-to request. 23. A system for processing in a computer program a request received by a service virtual machine (SVM), comprising:
a component configured to receive a request in either a first form or a second form, wherein the first form includes a target textual identifier, a reply-to textual identifier, and a parameter, and the second form includes a target textual identifier and a parameter, but not a reply-to textual identifier; a component configured to identify, based on the received target textual identifier, a procedure; a component configured to invoke the identified procedure and providing a value of the received parameter to the invoked procedure; a component configured to, in an event the received request is in the first form:
receive a result from the invoked procedure;
form a reply-to request in the second form, the second form including as a target textual identifier the reply-to textual identifier in the received request, and as a parameter the result received from the invoked procedure, further wherein the second form does not include a reply-to textual identifier; and
send, to the SVM, the formed reply-to request. | 2,100 |
5,523 | 5,523 | 15,051,486 | 2,177 | A system and method for content management are disclosed. The system can be used to manage any type of digital and a system and method for generating, delivering, measuring, and managing media apps to showcase content, such as videos, documents, blogs, and slides, using a web-based portal are provided. | 1. A method, comprising:
receiving a plurality of pieces of content, each piece of the plurality of different pieces of content having a different format; managing, using a computer based media portal system, the plurality of received pieces of content, the media portal system having a plurality of media components wherein each media component is used to manage a piece of content having a particular format; and wherein managing the plurality of received pieces of content further comprising using a particular media component of the computer based media portal system to manage each received piece of content having a particular format. 2. The method of claim 1, wherein managing the plurality of received pieces of content further comprises extracting a piece of content from a webinar. 3. The method of claim 2, wherein the extracted piece of content is one of a video, a document and a Powerpoint. 4. The method of claim 2, wherein managing the plurality of received pieces of content further comprises managing the piece of content extracted from the webinar. 5. The method of claim 1 further comprising reconfiguring at least one of the media components. 6. The method of claim 5, wherein reconfiguring at least one of the media components further comprises changing a behavior of the media component. 7. The method of claim 1, wherein the plurality of pieces of content are a video, a document, a blog post and a slide deck. 8. The method of claim 1, wherein managing the plurality of received pieces of content further comprises manipulating the piece of content using the media components. 9. The method of claim 1 further comprising tracking, using each media component, engagement of a user using the media component for the piece of media. 10. An apparatus, comprising:
a computer system having a processor and a memory; a media portal executed by the processor and resident in the memory′ the media portal having a plurality of lines of code that are executed by the processor and the processor is configured to receive a plurality of pieces of content, each piece of the plurality of different pieces of content having a different format, manage the plurality of received pieces of content, the media portal system having a plurality of media components wherein each media component is used to manage a piece of content having a particular format and use a particular media component to manage each received piece of content having a particular format. 11. The apparatus of claim 10, wherein the processor is configured to extract a piece of content from a webinar. 12. The apparatus of claim 11, wherein the extracted piece of content is one of a video, a document and a Powerpoint. 13. The apparatus of claim 11, wherein the processor is configured to manage the piece of content extracted from the webinar. 14. The apparatus of claim 10, wherein the processor is configured to reconfigure at least one of the media components. 15. The apparatus of claim 14, wherein the processor is configured to change a behavior of the media component. 16. The apparatus of claim 10, wherein the plurality of pieces of content are a video, a document, a blog post and a slide deck. 17. The apparatus of claim 10, wherein the processor is configured to manipulate the piece of content using the media components. 18. The apparatus of claim 10, wherein the processor is configured to track, using each media component, engagement of a user using the media component for the piece of media. | A system and method for content management are disclosed. The system can be used to manage any type of digital and a system and method for generating, delivering, measuring, and managing media apps to showcase content, such as videos, documents, blogs, and slides, using a web-based portal are provided.1. A method, comprising:
receiving a plurality of pieces of content, each piece of the plurality of different pieces of content having a different format; managing, using a computer based media portal system, the plurality of received pieces of content, the media portal system having a plurality of media components wherein each media component is used to manage a piece of content having a particular format; and wherein managing the plurality of received pieces of content further comprising using a particular media component of the computer based media portal system to manage each received piece of content having a particular format. 2. The method of claim 1, wherein managing the plurality of received pieces of content further comprises extracting a piece of content from a webinar. 3. The method of claim 2, wherein the extracted piece of content is one of a video, a document and a Powerpoint. 4. The method of claim 2, wherein managing the plurality of received pieces of content further comprises managing the piece of content extracted from the webinar. 5. The method of claim 1 further comprising reconfiguring at least one of the media components. 6. The method of claim 5, wherein reconfiguring at least one of the media components further comprises changing a behavior of the media component. 7. The method of claim 1, wherein the plurality of pieces of content are a video, a document, a blog post and a slide deck. 8. The method of claim 1, wherein managing the plurality of received pieces of content further comprises manipulating the piece of content using the media components. 9. The method of claim 1 further comprising tracking, using each media component, engagement of a user using the media component for the piece of media. 10. An apparatus, comprising:
a computer system having a processor and a memory; a media portal executed by the processor and resident in the memory′ the media portal having a plurality of lines of code that are executed by the processor and the processor is configured to receive a plurality of pieces of content, each piece of the plurality of different pieces of content having a different format, manage the plurality of received pieces of content, the media portal system having a plurality of media components wherein each media component is used to manage a piece of content having a particular format and use a particular media component to manage each received piece of content having a particular format. 11. The apparatus of claim 10, wherein the processor is configured to extract a piece of content from a webinar. 12. The apparatus of claim 11, wherein the extracted piece of content is one of a video, a document and a Powerpoint. 13. The apparatus of claim 11, wherein the processor is configured to manage the piece of content extracted from the webinar. 14. The apparatus of claim 10, wherein the processor is configured to reconfigure at least one of the media components. 15. The apparatus of claim 14, wherein the processor is configured to change a behavior of the media component. 16. The apparatus of claim 10, wherein the plurality of pieces of content are a video, a document, a blog post and a slide deck. 17. The apparatus of claim 10, wherein the processor is configured to manipulate the piece of content using the media components. 18. The apparatus of claim 10, wherein the processor is configured to track, using each media component, engagement of a user using the media component for the piece of media. | 2,100 |
5,524 | 5,524 | 14,731,516 | 2,176 | A system and computer implemented method for managing a workload in an environment is disclosed. The method may include establishing a set of criteria for providing a document preview, wherein the set of criteria includes a predetermined qualitative user-input feature. The method may also include detecting a first criterion of the set of criteria using a content recognition system configured to analyze user-generated data associated with the document. The first criterion may be correlated with a portion of the document. The method may also include generating, based on the first criterion, a document preview for the portion of the document. The method may also include presenting, in response to a triggering event for a display preview, the document preview. | 1. A computer implemented method for providing a document preview for a document, the method comprising:
establishing a set of criteria for providing a document preview, wherein the set of criteria includes a predetermined qualitative user-input feature; detecting a first criterion of the set of criteria using a content recognition system configured to analyze user-generated data associated with the document, wherein the first criterion is correlated with a portion of the document; generating, based on the first criterion, a document preview for the portion of the document; and presenting, in response to a triggering event for a display preview, the document preview. 2. The method of claim 1, wherein the triggering event for a display preview is one or more selected from a group consisting of a cursor hover, file selection, or related category selection. 3. The method of claim 1, wherein the predetermined qualitative user-input feature includes one or more of a set of factors supplemental to the content of the document and defined based on a relationship between an intended audience for the document and a subject matter of the document. 4. The method of claim 1, wherein the predetermined qualitative user-input feature includes one or more of a set of factors defined based on a subjective evaluation of the quality and substantiveness of textual content. 5. The method of claim 1, wherein the predetermined qualitative user-input feature includes one or more of a set of factors defined at least partially by user-generated data configured to be accessible to the content recognition system. 6. The method of claim 3, wherein the content recognition system is configured to use a natural language processing algorithm to parse textual content associated with the document revision, social dialogue, or area of expertise of a user to detect the first criterion of the set of criteria. 7. The method of claim 1, wherein the first criterion is one or more selected from a group consisting of a document revision, social dialogue, or area of expertise of a viewer of the first document. 8. The method of claim 7:
wherein the first criterion is a document revision of the document, the document revision including an amendment to a portion of the document; and wherein detecting the first criterion includes:
analyzing, by the content recognition system, an edit history log of the document; and
selecting, based on the edit history log, a first portion of the document as the document preview, wherein the first portion of the document has a revision count higher than a revision threshold value. 9. The method of claim 7:
wherein the first criterion is a social dialogue coupled to the document, the social dialogue including a conversation thread having a plurality of comments; and wherein detecting the first criterion includes:
analyzing, by the content recognition system using a natural language processing algorithm, the social dialogue coupled with the document;
identifying a second portion of the document referenced within the social dialogue; and
selecting, in response to identifying a second portion of the document referenced within the social dialogue, the second portion as the document preview. 10. The method of claim 9, wherein the second portion of the document has a reference value greater than a reference threshold within the social dialogue. 11. The method of claim 9, further comprising:
identifying a third portion of the document referenced within the social dialogue; determining that the third portion of the document has a reference frequency higher than a reference frequency value within the social dialogue; and changing the document preview from the second portion of the document to the third portion of the document. 12. The method of claim 7:
wherein the first criterion is an area of expertise of a viewer, the area of expertise including an academic discipline, area of concentration, knowledge field, or acquired proficiency; and wherein detecting the first criterion includes:
analyzing, by the content recognition system, a first user profile of a first user;
identifying, based on the first user profile, a first area of expertise; and
selecting, in response to identifying the first area of expertise, a third portion of the document corresponding to the first area of expertise. 13. The method of claim 12, wherein identifying the first area of expertise includes:
examining, by the content recognition system, profile metadata of the first user profile; comparing the profile metadata with document metadata coupled with the document; and determining, in response to comparing the profile metadata with the document metadata, that the profile data and document metadata have a relevance value above a relevance value threshold. 14. The method of claim 12, further comprising:
analyzing, by the content recognition system, a second user profile of a second user; identifying, based on the second user profile, a second area of expertise; selecting, in response to identifying the second area of expertise, a fourth portion of the document corresponding to the second area of expertise; generating a third document preview for the third portion of the document; generating a fourth document preview for the fourth portion of the document; and presenting, during substantially the same time period, the third document preview to the first user and the fourth document preview to the second user. 15. The method of claim 7, further comprising:
determining, by the content recognition system in response to analyzing an edit history log coupled with the document, the document revision as the first criterion of the set of criteria; selecting, based on the edit history log, a first portion of the document as a first document preview; determining, by the content recognition system in response to analyzing a conversation thread coupled with the document, the social dialogue as the second criteria of the set of criteria; selecting, based on the conversation thread, a second portion of the document as a second document preview; generating the first document preview using the first portion of the document and the second document preview using the second portion of the document; determining, by the content recognition system in response to analyzing a first user profile of a first user, the area of expertise as the third criterion of the set of criteria; identifying, based on the first user profile, a first area of expertise corresponding with the second portion of the document; and presenting, in response to identifying the first area of expertise corresponding with the second portion of the document, the second document preview to the first user. | A system and computer implemented method for managing a workload in an environment is disclosed. The method may include establishing a set of criteria for providing a document preview, wherein the set of criteria includes a predetermined qualitative user-input feature. The method may also include detecting a first criterion of the set of criteria using a content recognition system configured to analyze user-generated data associated with the document. The first criterion may be correlated with a portion of the document. The method may also include generating, based on the first criterion, a document preview for the portion of the document. The method may also include presenting, in response to a triggering event for a display preview, the document preview.1. A computer implemented method for providing a document preview for a document, the method comprising:
establishing a set of criteria for providing a document preview, wherein the set of criteria includes a predetermined qualitative user-input feature; detecting a first criterion of the set of criteria using a content recognition system configured to analyze user-generated data associated with the document, wherein the first criterion is correlated with a portion of the document; generating, based on the first criterion, a document preview for the portion of the document; and presenting, in response to a triggering event for a display preview, the document preview. 2. The method of claim 1, wherein the triggering event for a display preview is one or more selected from a group consisting of a cursor hover, file selection, or related category selection. 3. The method of claim 1, wherein the predetermined qualitative user-input feature includes one or more of a set of factors supplemental to the content of the document and defined based on a relationship between an intended audience for the document and a subject matter of the document. 4. The method of claim 1, wherein the predetermined qualitative user-input feature includes one or more of a set of factors defined based on a subjective evaluation of the quality and substantiveness of textual content. 5. The method of claim 1, wherein the predetermined qualitative user-input feature includes one or more of a set of factors defined at least partially by user-generated data configured to be accessible to the content recognition system. 6. The method of claim 3, wherein the content recognition system is configured to use a natural language processing algorithm to parse textual content associated with the document revision, social dialogue, or area of expertise of a user to detect the first criterion of the set of criteria. 7. The method of claim 1, wherein the first criterion is one or more selected from a group consisting of a document revision, social dialogue, or area of expertise of a viewer of the first document. 8. The method of claim 7:
wherein the first criterion is a document revision of the document, the document revision including an amendment to a portion of the document; and wherein detecting the first criterion includes:
analyzing, by the content recognition system, an edit history log of the document; and
selecting, based on the edit history log, a first portion of the document as the document preview, wherein the first portion of the document has a revision count higher than a revision threshold value. 9. The method of claim 7:
wherein the first criterion is a social dialogue coupled to the document, the social dialogue including a conversation thread having a plurality of comments; and wherein detecting the first criterion includes:
analyzing, by the content recognition system using a natural language processing algorithm, the social dialogue coupled with the document;
identifying a second portion of the document referenced within the social dialogue; and
selecting, in response to identifying a second portion of the document referenced within the social dialogue, the second portion as the document preview. 10. The method of claim 9, wherein the second portion of the document has a reference value greater than a reference threshold within the social dialogue. 11. The method of claim 9, further comprising:
identifying a third portion of the document referenced within the social dialogue; determining that the third portion of the document has a reference frequency higher than a reference frequency value within the social dialogue; and changing the document preview from the second portion of the document to the third portion of the document. 12. The method of claim 7:
wherein the first criterion is an area of expertise of a viewer, the area of expertise including an academic discipline, area of concentration, knowledge field, or acquired proficiency; and wherein detecting the first criterion includes:
analyzing, by the content recognition system, a first user profile of a first user;
identifying, based on the first user profile, a first area of expertise; and
selecting, in response to identifying the first area of expertise, a third portion of the document corresponding to the first area of expertise. 13. The method of claim 12, wherein identifying the first area of expertise includes:
examining, by the content recognition system, profile metadata of the first user profile; comparing the profile metadata with document metadata coupled with the document; and determining, in response to comparing the profile metadata with the document metadata, that the profile data and document metadata have a relevance value above a relevance value threshold. 14. The method of claim 12, further comprising:
analyzing, by the content recognition system, a second user profile of a second user; identifying, based on the second user profile, a second area of expertise; selecting, in response to identifying the second area of expertise, a fourth portion of the document corresponding to the second area of expertise; generating a third document preview for the third portion of the document; generating a fourth document preview for the fourth portion of the document; and presenting, during substantially the same time period, the third document preview to the first user and the fourth document preview to the second user. 15. The method of claim 7, further comprising:
determining, by the content recognition system in response to analyzing an edit history log coupled with the document, the document revision as the first criterion of the set of criteria; selecting, based on the edit history log, a first portion of the document as a first document preview; determining, by the content recognition system in response to analyzing a conversation thread coupled with the document, the social dialogue as the second criteria of the set of criteria; selecting, based on the conversation thread, a second portion of the document as a second document preview; generating the first document preview using the first portion of the document and the second document preview using the second portion of the document; determining, by the content recognition system in response to analyzing a first user profile of a first user, the area of expertise as the third criterion of the set of criteria; identifying, based on the first user profile, a first area of expertise corresponding with the second portion of the document; and presenting, in response to identifying the first area of expertise corresponding with the second portion of the document, the second document preview to the first user. | 2,100 |
5,525 | 5,525 | 10,866,433 | 2,159 | A query result set is an example of a type of body of data whose content is defined by a query. Modifications to a database can change the result of a query and therefore what the content of such a body of data, such as a result set, should be. Active Queries is an approach that enables a database server to detect database changes that alter the result of a query registered for a client and to notify a client of those changes. The notifications may be sent to, for example, a cache manager responsible for maintaining coherency of a result set cache generated by the query. The notification notifies the cache manager of when and/or what changes are needed to maintain the coherency of the cache. | 1. A method for detecting changes to the result of a query that may be processed by a database server, comprising the steps of:
generating filter conditions that are used to detect changes to a database that change the result of the query; wherein the filter conditions specify values stored in a database object to which said query requires access; and wherein the step of generating filter conditions includes accessing said database object to extract said values specified by said filter conditions. 2. The method of claim 1, wherein said values are not explicitly specified by said query. 3. The method of claim 1, further including the steps of:
said database server executing at least portion of an execution plan; and extracting said values during execution of the execution plan. 4. The method of claim 3, wherein:
said execution plan includes one or more row sources; execution of a row source of said one or more row sources captures at least a portion of said values. 5. The method of claim 4, wherein said row source performs a join between the database object and another databases object. 6. The method of claim 5, wherein at least one filter condition of said filter conditions is based on a column of an inner table, said column being referenced by a join predicate associated with said join. 7. The method of claim 1, wherein:
said query requires access to multiple tables, and wherein said filter conditions specify values from at least one table of said multiple tables. 8. The method of claim 7, wherein said query specifies a join operation between said multiple tables. 9. The method of claim 7, wherein:
said filter conditions include a first set of one or more filter conditions and a second set of one or more filter conditions; said first set of one or more filter conditions are based on one or more first columns from a first table of said multiple tables; and said second set of one or more filter conditions are based on one or more second columns from a second table of said multiple tables. 10. The method of claim 9, wherein:
the first set of one or more filter conditions correspond to a row source associated with a first level in the hierarchy of a row source tree; the second one or more columns are joined by said join operation to a corresponding column in said first table; and a row source corresponding to said join operation is associated with a second level in the hierarchy. 11. The method of claim 10, wherein said hierarchy includes a third level higher than said second level. 12. The method of claim 10, wherein the steps further include:
detecting a change to said first table; and in response to detecting said change, changing said first set of one or more filter conditions; and wherein changing said first set of one or more filter condition causes recursive changes to one or more filter conditions corresponding to one or more levels higher than said first level. 13. The method of claim 9, wherein the steps further include:
detecting a change to said first table; and determining, based on the first set of filter conditions, whether said change alters said result. 14. A computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 1. 15. A computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 2. 16. A computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 3. 17. A computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 4. 18. A computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 5. 19. A computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 6. 20. A computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 7. 21. A computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 8. 22. A computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 9. 23. A computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 10. 24. A computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 11. 25. A computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 12. 26. A computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 13. | A query result set is an example of a type of body of data whose content is defined by a query. Modifications to a database can change the result of a query and therefore what the content of such a body of data, such as a result set, should be. Active Queries is an approach that enables a database server to detect database changes that alter the result of a query registered for a client and to notify a client of those changes. The notifications may be sent to, for example, a cache manager responsible for maintaining coherency of a result set cache generated by the query. The notification notifies the cache manager of when and/or what changes are needed to maintain the coherency of the cache.1. A method for detecting changes to the result of a query that may be processed by a database server, comprising the steps of:
generating filter conditions that are used to detect changes to a database that change the result of the query; wherein the filter conditions specify values stored in a database object to which said query requires access; and wherein the step of generating filter conditions includes accessing said database object to extract said values specified by said filter conditions. 2. The method of claim 1, wherein said values are not explicitly specified by said query. 3. The method of claim 1, further including the steps of:
said database server executing at least portion of an execution plan; and extracting said values during execution of the execution plan. 4. The method of claim 3, wherein:
said execution plan includes one or more row sources; execution of a row source of said one or more row sources captures at least a portion of said values. 5. The method of claim 4, wherein said row source performs a join between the database object and another databases object. 6. The method of claim 5, wherein at least one filter condition of said filter conditions is based on a column of an inner table, said column being referenced by a join predicate associated with said join. 7. The method of claim 1, wherein:
said query requires access to multiple tables, and wherein said filter conditions specify values from at least one table of said multiple tables. 8. The method of claim 7, wherein said query specifies a join operation between said multiple tables. 9. The method of claim 7, wherein:
said filter conditions include a first set of one or more filter conditions and a second set of one or more filter conditions; said first set of one or more filter conditions are based on one or more first columns from a first table of said multiple tables; and said second set of one or more filter conditions are based on one or more second columns from a second table of said multiple tables. 10. The method of claim 9, wherein:
the first set of one or more filter conditions correspond to a row source associated with a first level in the hierarchy of a row source tree; the second one or more columns are joined by said join operation to a corresponding column in said first table; and a row source corresponding to said join operation is associated with a second level in the hierarchy. 11. The method of claim 10, wherein said hierarchy includes a third level higher than said second level. 12. The method of claim 10, wherein the steps further include:
detecting a change to said first table; and in response to detecting said change, changing said first set of one or more filter conditions; and wherein changing said first set of one or more filter condition causes recursive changes to one or more filter conditions corresponding to one or more levels higher than said first level. 13. The method of claim 9, wherein the steps further include:
detecting a change to said first table; and determining, based on the first set of filter conditions, whether said change alters said result. 14. A computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 1. 15. A computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 2. 16. A computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 3. 17. A computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 4. 18. A computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 5. 19. A computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 6. 20. A computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 7. 21. A computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 8. 22. A computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 9. 23. A computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 10. 24. A computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 11. 25. A computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 12. 26. A computer-readable medium carrying one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 13. | 2,100 |
5,526 | 5,526 | 15,008,569 | 2,132 | An apparatus for generating a trace stream, a method for generating a trace stream, an apparatus for receiving a trace stream and a method of receiving a trace stream are provided. Header items and payload items in the trace stream are respectively grouped together into a contiguous sequence of header items and a contiguous sequence of payload items. This can for example facilitate the production of a trace stream in which the trace stream is aligned to a predetermined length (e.g. corresponding to an alignment of a memory in which the trace stream is to be stored) thus facilitating its interpretation. | 1. Apparatus for generating a trace stream indicative of data processing activities of a data processing apparatus, the apparatus comprising:
trace stream generation circuitry to generate the trace stream, wherein the trace stream comprises header items and payload items, wherein each payload item is associated with a header item and the header item provides interpretation information for the payload item, and the trace stream generation circuitry is capable of grouping a set of header items together into a contiguous sequence of header items in the trace stream and grouping a set of payload items together into a contiguous sequence of payload items in the trace stream. 2. The apparatus as claimed in claim 1, wherein the trace stream generation circuitry is capable of generating the trace stream comprising a group start header item as a first header item in the contiguous sequence of header items. 3. The apparatus as claimed in claim 2, wherein an encoding of the group start header item is indicative of the number of header items in the contiguous sequence of header items. 4. The apparatus as claimed in claim 2, wherein the trace stream generation circuitry is capable of generating the trace stream comprising a length indication header item adjacent to the group start header item, wherein the length indication header item is indicative of the number of header items in the contiguous sequence of header items. 5. The apparatus as claimed in claim 2, wherein the trace stream generation circuitry is capable of generating the trace stream comprising a group end header item as a last header item in the contiguous sequence of header items. 6. The apparatus as claimed in claim 5, wherein the group start header item and the group end header item are identical. 7. The apparatus as claimed in claim 1, wherein the trace stream generation circuitry is capable of adding at least one dummy header item to the contiguous sequence of header items, such that the contiguous sequence of header items has a length which is a multiple of a predetermined length. 8. The apparatus as claimed in claim 1, wherein the trace stream generation circuitry is capable of adding at least one dummy payload item to the contiguous sequence of payload items, such that the contiguous sequence of payload items has a length which is a multiple of a predetermined length. 9. The apparatus as claimed in claim 1, wherein the trace stream generation circuitry is capable of generating the contiguous sequence of payload items comprising at least one unspecified portion, such that the contiguous sequence of payload items has a length which is a multiple of a predetermined length. 10. The apparatus as claimed in claim 1, wherein the trace stream generation circuitry is capable of adding at least one dummy payload item to the contiguous sequence of payload items or generating the contiguous sequence of payload items comprising at least one unspecified payload item, such that the contiguous sequence of header items and the contiguous sequence of payload items together have a predetermined length. 11. The apparatus as claimed in claim 1, wherein the trace stream generation circuitry is capable of generating the trace stream comprising an alignment header item, wherein the alignment header item follows a last header item in the contiguous sequence of header items which provides interpretation information for at least one referenced payload item in the contiguous sequence of payload items, and wherein the alignment header item is indicative that header items or payload items which follow the at least one referenced payload item up to a length of header items and payload items together which is an multiple of a predetermined length are not indicative of the data processing activities of the data processing apparatus. 12. The apparatus as claimed in claim 1, wherein the trace stream generation circuitry further comprises buffer circuitry and reorder circuitry,
the buffer circuitry to buffer header items and payload items, and the reorder circuitry to reorder header items and payload items buffered in the buffer circuitry for inclusion in the trace stream. 13. The apparatus as claimed in claim 12, wherein the reorder circuitry is capable of reordering the header items and payload items such that a largest payload item of the contiguous sequence of payload items is first in the contiguous sequence of payload items. 14. The apparatus as claimed in claim 1, wherein the trace stream generation circuitry is capable of including a prefix header item in the contiguous sequence of header items, wherein presence of the prefix header item in the contiguous sequence of header items modifies a meaning of the header item which follows the prefix header item. 15. The apparatus as claimed in claim 1, wherein the trace stream generation circuitry further comprises compression circuitry for applying a compression to the contiguous sequence of header items in the trace stream. 16. The apparatus as claimed in claim 15, wherein the compression circuitry is further capable of applying the compression to the contiguous sequence of payload items in the trace stream. 17. The apparatus as claimed in claim 1, wherein the header items are branch indicators and each branch indicator indicates whether the data processing apparatus has taken a branch when performing the data processing activities. 18. The apparatus as claimed in claim 17, wherein at least one payload item represents a memory address at which an instruction is stored, wherein the data processing apparatus has taken the branch to the instruction when performing the data processing activities. 19. The apparatus as claimed in claim 1, wherein the trace stream generation circuitry is capable of generating the contiguous sequence of payload items wherein a starting position of at least one payload item is delayed in the contiguous sequence of payload items so that the starting position of the at least one payload item is aligned with a multiple of a predetermined offset from a start of the contiguous sequence of payload items. 20. The apparatus as claimed in claim 19, wherein the trace stream generation circuitry is capable of delaying the starting position of the at least one payload item in the contiguous sequence of payload items by adding at least one unspecified portion prior to the at least one payload item. 21. A data processing system comprising an apparatus as claimed in claim 1. 22. A data processing system comprising an apparatus as claimed in claim 7, comprising a data storage device having a configuration in which access to stored data is made in units of the predetermined length. 23. A method of generating a trace stream indicative of data processing activities of a data processing apparatus, the method comprising the steps of:
receiving information related to the data processing activities of a data processing apparatus; generating header items and payload items from the received information, wherein each payload item is associated with a header item and the header item provides interpretation information for the payload item; and grouping a set of header items together into a contiguous sequence of header items in the trace stream and to group a set of payload items together into a contiguous sequence of payload items in the trace stream. 24. Apparatus for receiving a trace stream indicative of data processing activities of a data processing apparatus, the apparatus comprising:
trace stream reception circuitry to receive the trace stream, wherein the trace stream comprises header items and payload items; and trace stream processing circuitry to identify a contiguous sequence of header items and a contiguous sequence of payload items in the trace stream, and to identify a header item for each payload item and process each payload item in dependence on the header item. 25. A method of receiving a trace stream indicative of data processing activities of a data processing apparatus, comprising the steps of:
receiving the trace stream, wherein the trace stream comprises header items and payload items; identifying a contiguous sequence of header items and a contiguous sequence of payload items in the trace stream; identifying a header item for each payload item; and processing each payload item in dependence on the header item. | An apparatus for generating a trace stream, a method for generating a trace stream, an apparatus for receiving a trace stream and a method of receiving a trace stream are provided. Header items and payload items in the trace stream are respectively grouped together into a contiguous sequence of header items and a contiguous sequence of payload items. This can for example facilitate the production of a trace stream in which the trace stream is aligned to a predetermined length (e.g. corresponding to an alignment of a memory in which the trace stream is to be stored) thus facilitating its interpretation.1. Apparatus for generating a trace stream indicative of data processing activities of a data processing apparatus, the apparatus comprising:
trace stream generation circuitry to generate the trace stream, wherein the trace stream comprises header items and payload items, wherein each payload item is associated with a header item and the header item provides interpretation information for the payload item, and the trace stream generation circuitry is capable of grouping a set of header items together into a contiguous sequence of header items in the trace stream and grouping a set of payload items together into a contiguous sequence of payload items in the trace stream. 2. The apparatus as claimed in claim 1, wherein the trace stream generation circuitry is capable of generating the trace stream comprising a group start header item as a first header item in the contiguous sequence of header items. 3. The apparatus as claimed in claim 2, wherein an encoding of the group start header item is indicative of the number of header items in the contiguous sequence of header items. 4. The apparatus as claimed in claim 2, wherein the trace stream generation circuitry is capable of generating the trace stream comprising a length indication header item adjacent to the group start header item, wherein the length indication header item is indicative of the number of header items in the contiguous sequence of header items. 5. The apparatus as claimed in claim 2, wherein the trace stream generation circuitry is capable of generating the trace stream comprising a group end header item as a last header item in the contiguous sequence of header items. 6. The apparatus as claimed in claim 5, wherein the group start header item and the group end header item are identical. 7. The apparatus as claimed in claim 1, wherein the trace stream generation circuitry is capable of adding at least one dummy header item to the contiguous sequence of header items, such that the contiguous sequence of header items has a length which is a multiple of a predetermined length. 8. The apparatus as claimed in claim 1, wherein the trace stream generation circuitry is capable of adding at least one dummy payload item to the contiguous sequence of payload items, such that the contiguous sequence of payload items has a length which is a multiple of a predetermined length. 9. The apparatus as claimed in claim 1, wherein the trace stream generation circuitry is capable of generating the contiguous sequence of payload items comprising at least one unspecified portion, such that the contiguous sequence of payload items has a length which is a multiple of a predetermined length. 10. The apparatus as claimed in claim 1, wherein the trace stream generation circuitry is capable of adding at least one dummy payload item to the contiguous sequence of payload items or generating the contiguous sequence of payload items comprising at least one unspecified payload item, such that the contiguous sequence of header items and the contiguous sequence of payload items together have a predetermined length. 11. The apparatus as claimed in claim 1, wherein the trace stream generation circuitry is capable of generating the trace stream comprising an alignment header item, wherein the alignment header item follows a last header item in the contiguous sequence of header items which provides interpretation information for at least one referenced payload item in the contiguous sequence of payload items, and wherein the alignment header item is indicative that header items or payload items which follow the at least one referenced payload item up to a length of header items and payload items together which is an multiple of a predetermined length are not indicative of the data processing activities of the data processing apparatus. 12. The apparatus as claimed in claim 1, wherein the trace stream generation circuitry further comprises buffer circuitry and reorder circuitry,
the buffer circuitry to buffer header items and payload items, and the reorder circuitry to reorder header items and payload items buffered in the buffer circuitry for inclusion in the trace stream. 13. The apparatus as claimed in claim 12, wherein the reorder circuitry is capable of reordering the header items and payload items such that a largest payload item of the contiguous sequence of payload items is first in the contiguous sequence of payload items. 14. The apparatus as claimed in claim 1, wherein the trace stream generation circuitry is capable of including a prefix header item in the contiguous sequence of header items, wherein presence of the prefix header item in the contiguous sequence of header items modifies a meaning of the header item which follows the prefix header item. 15. The apparatus as claimed in claim 1, wherein the trace stream generation circuitry further comprises compression circuitry for applying a compression to the contiguous sequence of header items in the trace stream. 16. The apparatus as claimed in claim 15, wherein the compression circuitry is further capable of applying the compression to the contiguous sequence of payload items in the trace stream. 17. The apparatus as claimed in claim 1, wherein the header items are branch indicators and each branch indicator indicates whether the data processing apparatus has taken a branch when performing the data processing activities. 18. The apparatus as claimed in claim 17, wherein at least one payload item represents a memory address at which an instruction is stored, wherein the data processing apparatus has taken the branch to the instruction when performing the data processing activities. 19. The apparatus as claimed in claim 1, wherein the trace stream generation circuitry is capable of generating the contiguous sequence of payload items wherein a starting position of at least one payload item is delayed in the contiguous sequence of payload items so that the starting position of the at least one payload item is aligned with a multiple of a predetermined offset from a start of the contiguous sequence of payload items. 20. The apparatus as claimed in claim 19, wherein the trace stream generation circuitry is capable of delaying the starting position of the at least one payload item in the contiguous sequence of payload items by adding at least one unspecified portion prior to the at least one payload item. 21. A data processing system comprising an apparatus as claimed in claim 1. 22. A data processing system comprising an apparatus as claimed in claim 7, comprising a data storage device having a configuration in which access to stored data is made in units of the predetermined length. 23. A method of generating a trace stream indicative of data processing activities of a data processing apparatus, the method comprising the steps of:
receiving information related to the data processing activities of a data processing apparatus; generating header items and payload items from the received information, wherein each payload item is associated with a header item and the header item provides interpretation information for the payload item; and grouping a set of header items together into a contiguous sequence of header items in the trace stream and to group a set of payload items together into a contiguous sequence of payload items in the trace stream. 24. Apparatus for receiving a trace stream indicative of data processing activities of a data processing apparatus, the apparatus comprising:
trace stream reception circuitry to receive the trace stream, wherein the trace stream comprises header items and payload items; and trace stream processing circuitry to identify a contiguous sequence of header items and a contiguous sequence of payload items in the trace stream, and to identify a header item for each payload item and process each payload item in dependence on the header item. 25. A method of receiving a trace stream indicative of data processing activities of a data processing apparatus, comprising the steps of:
receiving the trace stream, wherein the trace stream comprises header items and payload items; identifying a contiguous sequence of header items and a contiguous sequence of payload items in the trace stream; identifying a header item for each payload item; and processing each payload item in dependence on the header item. | 2,100 |
5,527 | 5,527 | 15,277,385 | 2,169 | In one embodiment, a method includes sending, by a client device, a request to a computer server system for a target structured document. In a first response phase, a first response portion from the computer server system is sent in response to the request. The first response portion includes a first resource associated with the target structured document, wherein a likelihood that the first resource will be included in a response to a future request for the target structured document exceeds a first predetermined threshold. Further in a second response phase, a second response portion from the computer server system is sent in response to the request. The second response portion includes a second resource associated with the target structured document, wherein a likelihood that the second resource will be included in a response to a future request for the target structured document exceeds a second predetermined threshold. | 1. A method comprising:
sending, by a client device, a request to a computer server system for a target structured document; in a first response phase:
a first response portion from the computer server system is sent in response to the request from the client device, wherein the first response portion comprises:
one or more first resources associated with the target structured document or references to the one or more first resources, wherein for each of the one or more first resources, a likelihood that the first resource will be included in a response to a future request for the target structured document exceeds a first predetermined threshold; and
further in a second response phase taking place after the first response phase:
a second response portion from the computer server system is sent in response to the request from the client device, wherein the second response portion comprises:
one or more second resources associated with the target structured document or references to the one or more second resources, wherein for each of the one or more second resources, a likelihood that the second resource will be included in a response to a future request for the target structured document exceeds a second predetermined threshold. 2. The method of claim 1, wherein:
the target structured document comprises a Hyper Text Markup Language (HTML) document; the HTML document comprises a head element and one or more other HTML elements; the first response portion comprises a first portion of the head element; and the second response portion comprises the remainder of the HTML document including a second portion of the head element. 3. The method of claim 1, wherein none of the second resources are identical to any of the first resources. 4. The method of claim 1, wherein one or more of the first resources or one or more of the second resources each comprise a JavaScript script, a Cascading Style Sheet (CSS) resource, a web application resource, an image resource, a video resource, or an audio resource. 5. The method of claim 1, wherein one or more of the first resources have been previously determined to have at least a predetermined probability to be included in a response to a future request for the target structured document that exceeds a predetermined threshold value. 6. The method of claim 1, wherein the first response portion and the second response portion are received by the client device over a persistent network connection. 7. A client device comprising:
one or more processors; and a memory coupled by the processors comprising instructions executable by the processors, the processors being operable when executing the instructions to:
send a request to a computer server system for a target structured document;
in a first response phase:
a first response portion from the computer server system is sent in response to the request from the client device, wherein the first response portion comprises:
one or more first resources associated with the target structured document or references to the one or more first resources, wherein for each of the one or more first resources, a likelihood that the first resource will be included in a response to a future request for the target structured document exceeds a first predetermined threshold; and
further in a second response phase taking place after the first response phase:
a second response portion from the computer server system is sent in response to the request from the client device, wherein the second response portion comprises:
one or more second resources associated with the target structured document or references to the one or more second resources, wherein for each of the one or more second resources, a likelihood that the second resource will be included in a response to a future request for the target structured document exceeds a second predetermined threshold. 8. The client device of claim 7, wherein:
the target structured document comprises a Hyper Text Markup Language (HTML) document; the HTML document comprises a head element and one or more other HTML elements; the first response portion comprises a first portion of the head element; and the second response portion comprises the remainder of the HTML document including a second portion of the head element. 9. The client device of claim 7, wherein none of the second resources are identical to any of the first resources. 10. The client device of claim 7, wherein one or more of the first resources or one or more of the second resources each comprise a JavaScript script, a Cascading Style Sheet (CSS) resource, a web application resource, an image resource, a video resource, or an audio resource. 11. The client device of claim 7, wherein one or more of the first resources have been previously determined to have at least a predetermined probability to be included in a response to a future request for the target structured document that exceeds a predetermined threshold value. 12. The client device of claim 7, wherein the first response portion and the second response portion are received by the client device over a persistent network connection. 13. One or more computer-readable non-transitory storage media embodying software operable when executed to:
send, by a client device, a request to a computer server system for a target structured document; in a first response phase:
a first response portion from the computer server system is sent in response to the request from the client device, wherein the first response portion comprises:
one or more first resources associated with the target structured document or references to the one or more first resources, wherein for each of the one or more first resources, a likelihood that the first resource will be included in a response to a future request for the target structured document exceeds a first predetermined threshold; and
further in a second response phase taking place after the first response phase:
a second response portion from the computer server system is sent in response to the request from the client device, wherein the second response portion comprises:
one or more second resources associated with the target structured document or references to the one or more second resources, wherein for each of the one or more second resources, a likelihood that the second resource will be included in a response to a future request for the target structured document exceeds a second predetermined threshold. 14. The media of claim 13, wherein:
the target structured document comprises a Hyper Text Markup Language (HTML) document; the HTML document comprises a head element and one or more other HTML elements; the first response portion comprises a first portion of the head element; and the second response portion comprises the remainder of the HTML document including a second portion of the head element. 15. The media of claim 13, wherein none of the second resources are identical to any of the first resources. 16. The media of claim 13, wherein one or more of the first resources or one or more of the second resources each comprise a JavaScript script, a Cascading Style Sheet (CSS) resource, a web application resource, an image resource, a video resource, or an audio resource. 17. The media of claim 13, wherein one or more of the first resources have been previously determined to have at least a predetermined probability to be included in a response to a future request for the target structured document that exceeds a predetermined threshold value. 18. The media of claim 13, wherein the first response portion and the second response portion are received by the client device over a persistent network connection. | In one embodiment, a method includes sending, by a client device, a request to a computer server system for a target structured document. In a first response phase, a first response portion from the computer server system is sent in response to the request. The first response portion includes a first resource associated with the target structured document, wherein a likelihood that the first resource will be included in a response to a future request for the target structured document exceeds a first predetermined threshold. Further in a second response phase, a second response portion from the computer server system is sent in response to the request. The second response portion includes a second resource associated with the target structured document, wherein a likelihood that the second resource will be included in a response to a future request for the target structured document exceeds a second predetermined threshold.1. A method comprising:
sending, by a client device, a request to a computer server system for a target structured document; in a first response phase:
a first response portion from the computer server system is sent in response to the request from the client device, wherein the first response portion comprises:
one or more first resources associated with the target structured document or references to the one or more first resources, wherein for each of the one or more first resources, a likelihood that the first resource will be included in a response to a future request for the target structured document exceeds a first predetermined threshold; and
further in a second response phase taking place after the first response phase:
a second response portion from the computer server system is sent in response to the request from the client device, wherein the second response portion comprises:
one or more second resources associated with the target structured document or references to the one or more second resources, wherein for each of the one or more second resources, a likelihood that the second resource will be included in a response to a future request for the target structured document exceeds a second predetermined threshold. 2. The method of claim 1, wherein:
the target structured document comprises a Hyper Text Markup Language (HTML) document; the HTML document comprises a head element and one or more other HTML elements; the first response portion comprises a first portion of the head element; and the second response portion comprises the remainder of the HTML document including a second portion of the head element. 3. The method of claim 1, wherein none of the second resources are identical to any of the first resources. 4. The method of claim 1, wherein one or more of the first resources or one or more of the second resources each comprise a JavaScript script, a Cascading Style Sheet (CSS) resource, a web application resource, an image resource, a video resource, or an audio resource. 5. The method of claim 1, wherein one or more of the first resources have been previously determined to have at least a predetermined probability to be included in a response to a future request for the target structured document that exceeds a predetermined threshold value. 6. The method of claim 1, wherein the first response portion and the second response portion are received by the client device over a persistent network connection. 7. A client device comprising:
one or more processors; and a memory coupled by the processors comprising instructions executable by the processors, the processors being operable when executing the instructions to:
send a request to a computer server system for a target structured document;
in a first response phase:
a first response portion from the computer server system is sent in response to the request from the client device, wherein the first response portion comprises:
one or more first resources associated with the target structured document or references to the one or more first resources, wherein for each of the one or more first resources, a likelihood that the first resource will be included in a response to a future request for the target structured document exceeds a first predetermined threshold; and
further in a second response phase taking place after the first response phase:
a second response portion from the computer server system is sent in response to the request from the client device, wherein the second response portion comprises:
one or more second resources associated with the target structured document or references to the one or more second resources, wherein for each of the one or more second resources, a likelihood that the second resource will be included in a response to a future request for the target structured document exceeds a second predetermined threshold. 8. The client device of claim 7, wherein:
the target structured document comprises a Hyper Text Markup Language (HTML) document; the HTML document comprises a head element and one or more other HTML elements; the first response portion comprises a first portion of the head element; and the second response portion comprises the remainder of the HTML document including a second portion of the head element. 9. The client device of claim 7, wherein none of the second resources are identical to any of the first resources. 10. The client device of claim 7, wherein one or more of the first resources or one or more of the second resources each comprise a JavaScript script, a Cascading Style Sheet (CSS) resource, a web application resource, an image resource, a video resource, or an audio resource. 11. The client device of claim 7, wherein one or more of the first resources have been previously determined to have at least a predetermined probability to be included in a response to a future request for the target structured document that exceeds a predetermined threshold value. 12. The client device of claim 7, wherein the first response portion and the second response portion are received by the client device over a persistent network connection. 13. One or more computer-readable non-transitory storage media embodying software operable when executed to:
send, by a client device, a request to a computer server system for a target structured document; in a first response phase:
a first response portion from the computer server system is sent in response to the request from the client device, wherein the first response portion comprises:
one or more first resources associated with the target structured document or references to the one or more first resources, wherein for each of the one or more first resources, a likelihood that the first resource will be included in a response to a future request for the target structured document exceeds a first predetermined threshold; and
further in a second response phase taking place after the first response phase:
a second response portion from the computer server system is sent in response to the request from the client device, wherein the second response portion comprises:
one or more second resources associated with the target structured document or references to the one or more second resources, wherein for each of the one or more second resources, a likelihood that the second resource will be included in a response to a future request for the target structured document exceeds a second predetermined threshold. 14. The media of claim 13, wherein:
the target structured document comprises a Hyper Text Markup Language (HTML) document; the HTML document comprises a head element and one or more other HTML elements; the first response portion comprises a first portion of the head element; and the second response portion comprises the remainder of the HTML document including a second portion of the head element. 15. The media of claim 13, wherein none of the second resources are identical to any of the first resources. 16. The media of claim 13, wherein one or more of the first resources or one or more of the second resources each comprise a JavaScript script, a Cascading Style Sheet (CSS) resource, a web application resource, an image resource, a video resource, or an audio resource. 17. The media of claim 13, wherein one or more of the first resources have been previously determined to have at least a predetermined probability to be included in a response to a future request for the target structured document that exceeds a predetermined threshold value. 18. The media of claim 13, wherein the first response portion and the second response portion are received by the client device over a persistent network connection. | 2,100 |
5,528 | 5,528 | 14,755,833 | 2,143 | A display device has a processor and a memory connected to the processor. The memory stores instructions executed by the processor to make a first determination that an internal display device speaker is disabled. A second determination that an external sound system is unavailable is established. A prompt is provided in response to the first determination and the second determination. The prompt includes an option to enable the internal display device speaker. | 1. A display device, comprising:
a processor; and a memory connected to the processor, the memory storing instructions executed by the processor to:
make a first determination that an internal display device speaker is disabled,
establish a second determination that an external sound system is unavailable, and
provide a prompt in response to the first determination and the second determination, wherein the prompt includes an option to enable the internal display device speaker. 2. The display device of claim 1, wherein the memory stores instructions executed by the processor to enable the internal display device speaker in response to a selection of the option. 3. The display device of claim 1, wherein the prompt is provided in response to a command to change volume of the display device. 4. The display device of claim 1, wherein the prompt is supplied on a display of the display device. 5. The display device of claim 1, wherein the prompt is supplied to a display of a remote control associated with the display device. 6. The display device of claim 5, wherein the remote control is a mobile telephone running an application that controls the display device. 7. The display device of claim 1, wherein the memory stores a field that specifies whether the internal display device speaker is disabled. 8. The display device of claim 1, further comprising an external sound system port and wherein the processor determines a state of the external sound system via the external sound system port. 9. A tangible computer-readable device having instructions stored thereon that, when executed by at least one computing device, causes the at least one computing device to perform operations comprising:
making a first determination that an internal display device speaker is disabled; establishing a second determination that an external sound system is unavailable; and providing a prompt in response to the first determination and the second determination, wherein the prompt includes an option to enable the internal display device speaker. 10. The computer-readable device of claim 9, the operations further comprising:
enabling the internal display device speaker in response to a selection of the option. 11. The computer-readable device of claim 9, wherein the prompt is provided in response to a command to change volume of the display device. 12. The computer-readable device of claim 9, wherein the providing a prompt comprises providing the prompt on a display of a display device. 13. The computer-readable device of claim 9, wherein the providing a prompt comprises providing the prompt on a display of a remote control associated with a display device. 14. The computer-readable device of claim 13, wherein the remote control is a mobile telephone running an application that controls the display device. 15. A method comprising:
making a first determination that an internal display device speaker is disabled; establishing a second determination that an external sound system is unavailable; and providing a prompt in response to the first determination and the second determination, wherein the prompt includes an option to enable the internal display device speaker. 16. The method of claim 15, further comprising:
enabling the internal display device speaker in response to a selection of the option. 17. The method of claim 15, wherein the prompt is provided in response to a command to change volume of the display device. 18. The method of claim 15, wherein the providing a prompt comprises providing the prompt on a display of a display device. 19. The method of claim 15, wherein the providing a prompt comprises providing the prompt on a display of a remote control associated with a display device. 20. The method of claim 19, wherein the remote control is a mobile telephone running an application that controls the display device. | A display device has a processor and a memory connected to the processor. The memory stores instructions executed by the processor to make a first determination that an internal display device speaker is disabled. A second determination that an external sound system is unavailable is established. A prompt is provided in response to the first determination and the second determination. The prompt includes an option to enable the internal display device speaker.1. A display device, comprising:
a processor; and a memory connected to the processor, the memory storing instructions executed by the processor to:
make a first determination that an internal display device speaker is disabled,
establish a second determination that an external sound system is unavailable, and
provide a prompt in response to the first determination and the second determination, wherein the prompt includes an option to enable the internal display device speaker. 2. The display device of claim 1, wherein the memory stores instructions executed by the processor to enable the internal display device speaker in response to a selection of the option. 3. The display device of claim 1, wherein the prompt is provided in response to a command to change volume of the display device. 4. The display device of claim 1, wherein the prompt is supplied on a display of the display device. 5. The display device of claim 1, wherein the prompt is supplied to a display of a remote control associated with the display device. 6. The display device of claim 5, wherein the remote control is a mobile telephone running an application that controls the display device. 7. The display device of claim 1, wherein the memory stores a field that specifies whether the internal display device speaker is disabled. 8. The display device of claim 1, further comprising an external sound system port and wherein the processor determines a state of the external sound system via the external sound system port. 9. A tangible computer-readable device having instructions stored thereon that, when executed by at least one computing device, causes the at least one computing device to perform operations comprising:
making a first determination that an internal display device speaker is disabled; establishing a second determination that an external sound system is unavailable; and providing a prompt in response to the first determination and the second determination, wherein the prompt includes an option to enable the internal display device speaker. 10. The computer-readable device of claim 9, the operations further comprising:
enabling the internal display device speaker in response to a selection of the option. 11. The computer-readable device of claim 9, wherein the prompt is provided in response to a command to change volume of the display device. 12. The computer-readable device of claim 9, wherein the providing a prompt comprises providing the prompt on a display of a display device. 13. The computer-readable device of claim 9, wherein the providing a prompt comprises providing the prompt on a display of a remote control associated with a display device. 14. The computer-readable device of claim 13, wherein the remote control is a mobile telephone running an application that controls the display device. 15. A method comprising:
making a first determination that an internal display device speaker is disabled; establishing a second determination that an external sound system is unavailable; and providing a prompt in response to the first determination and the second determination, wherein the prompt includes an option to enable the internal display device speaker. 16. The method of claim 15, further comprising:
enabling the internal display device speaker in response to a selection of the option. 17. The method of claim 15, wherein the prompt is provided in response to a command to change volume of the display device. 18. The method of claim 15, wherein the providing a prompt comprises providing the prompt on a display of a display device. 19. The method of claim 15, wherein the providing a prompt comprises providing the prompt on a display of a remote control associated with a display device. 20. The method of claim 19, wherein the remote control is a mobile telephone running an application that controls the display device. | 2,100 |
5,529 | 5,529 | 14,681,911 | 2,176 | Various aspects of the disclosure are directed to content rendition generation. Sets of disparately-formatted media content are reformatted into corresponding renditions of media content having a common format. The common format includes device-indeterminate ID linking data that links respective portions (e.g., assets or a structural component including the assets) of each rendition with the common format to corresponding portions of the disparately-formatted media content. For each rendition, reformatted assets are generated in which each reformatted is specific to one of a plurality of disparate types of devices, based upon characteristics of the disparate device types. Access to the portions of disparately-formatted media content and/or the assets within the portions of disparately-formatted media content is tracked, based on the linking data. | 1. A method comprising:
reformatting sets of disparately-formatted media content into corresponding renditions of media content having a common format, the common format including device-indeterminate ID linking data that links respective portions of each rendition with the common format to corresponding portions of the disparately-formatted media content, the respective portions being at least one of assets and a structural component of the media content that includes the assets; for each rendition, generating respective reformatted assets, each reformatted asset being specific to one of a plurality of disparate types of devices, based upon characteristics of the disparate device types; and tracking access to at least one of the portions of the disparately-formatted media content and the assets within the portions of the disparately-formatted media content, based on the linking data. 2. The method of claim 1, wherein generating respective reformatted assets includes scaling each of a plurality of assets in a particular rendition in to a scaled version, storing the scaled version of each asset in association with metadata that correlates the scaled version with the asset from which it is scaled, therein providing multiple versions of each asset for access by respective devices having different display or other characteristics for presenting media content. 3. The method of claim 1, wherein:
reformatting the sets of disparately-formatted media content into corresponding sets of media content having a common format includes reformatting digital magazine content, from each of different magazine sources having disparate digital publication formats, having a format and respective pages upon which text and images are concurrently displayed, into a corresponding set of media content having the common format; generating the respective reformatted assets of the media content includes generating, for one of the sets of media content having a common format, reformatted assets for a rendition having a different arrangement of pages upon which different portions of the text and images are concurrently displayed, relative to the disparately-formatted media content; and generating the linking data includes generating linking data that links assets corresponding to at least one of text or an image from a page in the rendition, with a corresponding at least one of the text or the image on a different page in a corresponding set of disparately-formatted media content. 4. The method of claim 3, wherein generating the respective reformatted renditions of the media content includes generating renditions of the media content in which pages in the media content are modified by at least one of reordering pages, removing pages and inserting pages. 5. The method of claim 1, wherein generating the respective reformatted assets of the media content includes, in response to a remote user device request for access to a portion of the media content, reformatting an asset of the media content into a reformatted asset that is specific to at least one of an operating system, a software application for displaying the media content, and a display size of the remote user device. 6. The method of claim 1,
wherein tracking the access includes tracking a current asset or portion of the media content accessed at a remote user device, and further including, in response to a user of the remote user device requesting access to the same asset from a different remote user device:
generating a new reformatted asset by reformatting an asset in a corresponding one of the sets of disparately-formatted media content according to at least one of an operating system, software application for displaying the media content, and display size of the different remote user device, and
delivering the reformatted asset to the different remote user device, based on a most recently accessed asset of the media content as indicated via the tracked current asset. 7. The method of claim 1, wherein tracking access includes:
tracking access to at least one of the portions or assets at a remote user device by communicating, from the remote user device, data corresponding to the linking data and indicative of at least one of an article, text or images that are displayed on the remote user device, and correlating the at least one of an article, text or images to corresponding text or images in the disparately-formatted media content, tracking access to a corresponding one of the article, text or images in the disparately-formatted media content by other remote devices using different reformatted assets, and combining the tracking to provide an indication of access to the corresponding one of the article, text or images by all of the remote devices. 8. The method of claim 1, wherein tracking access includes tracking user interactions with the portions or assets. 9. The method of claim 1, wherein generating the reformatted assets includes generating at least two physical assets for each logical asset pertaining to the rendition, further including providing access to the physical assets by, using a client module at a remote media content access device, selecting one of available reformatted physical assets pertaining to a logical asset to be accessed based on characteristics of the remote media content access device, and communicating the selected reformatted physical assets in response to the selecting. 10. The method of claim 1, wherein generating the linking data includes operating a content recognition engine to automatically match reformatted assets in the renditions with assets in the disparately-formatted media content, generating data that links the matched assets, and storing the assets for each rendition with the generated linking data. 11. The method of claim 1, wherein the device-indeterminate ID linking data identifies digital media content including at least one of articles, images, text and rich media content displayed on a user device, independent from the type of device upon which the at least one of images and text is displayed and independent from a page upon which the digital media content is displayed. 12. The method of claim 1, wherein generating the reformatted assets includes generating both navigational data and page layout data for the display of text and/or images for each rendition in association with the assets, and wherein generating the linking data includes generating data that links each page in each rendition to at least one article or page in the set of disparately-formatted media content from which the rendition was generated. 13. The method of claim 1, wherein
the disparately-formatted media content includes respective sets of media content data having different content editing formats that are exclusive to different software-based processing systems, each of which being operable to process content according to protocols specific to the content editing format, and reformatting the sets of disparately-formatted media content into corresponding renditions of media content having a common format includes accessing the respective sets according to the protocols specific to the content editing format of the media content set being accessed, and converting the format of the media content set into the common format, all of the converted media content sets being accessible using common protocols corresponding to the common format. 14. The method of claim 1, wherein the disparately-formatted media content includes respective sets of media content data employing different page-display formats specifying one or more of text location, image location, video location and audio location on respective pages representing the content, and wherein reformatting the sets of disparately-formatted media content into corresponding renditions having a common format includes modifying the different page-display formats to provide a common page-display format usable on a plurality of devices. 15. The method of claim 1, further including mapping portions of the renditions to portions of reformatted media content and corresponding device-indeterminate ID data, therein providing a link between characteristics of disparate renditions that correspond to a common portion of the reformatted media content. 16. The method of claim 1, wherein reformatting the sets of disparately-formatted media content includes generating layout and navigational data for displaying text and/or image content on respective pages, the generated data including one or more of page layout for the display of text and/or images, page location, navigational information, linking information that links the text and/or images to other media content. 17. The method of claim 16, wherein reformatting the sets of disparately-formatted media content includes generating data for reproduction on a device having a display type and/or processing system that is different than another device for which the layout and navigational data was generated, by converting the layout and navigational data for use with the device for which the generated data is configured and using the converted layout and navigational data to generate structural views for the content on the device for which the generated data is configured, which is consistent with structural views of the content on the device for which the layout and navigational data was generated. 18. An apparatus comprising:
a content generation circuit configured and arranged to
access media content from disparate content providers and in disparate formats,
reformat accessed media content of disparate formats into a common scalable content format that is different than the disparate formats, and
store assets corresponding to an original version of the reformatted media content in association with device-indeterminate metadata that identifies the media content;
a content reformatting circuit configured and arranged to
communicate with a plurality of different types of remote user devices including devices having disparate electronic interface characteristics relating to a format of the media content provided via the device,
for each remote device, identify a format type for that device from one of a plurality of format types for different devices, based on communications with the device,
for each identified format type, access the stored assets corresponding to the original version of the reformatted media content and generate scaled versions of the assets in a format that complies with the identified format type and that includes metadata identifying the media content,
a communication circuit configured and arranged to communicate each respective scaled asset to a remote device for which the scaled asset has been generated, thereby providing access to the media content of disparate formats at disparate remote devices having disparate electronic interface characteristics, using a single rendition for each set of media content. 19. The apparatus of claim 18, wherein the content reformatting circuit is configured and arranged to
generate each scaled asset by linking the scaled asset back to an identifier for assets in an accessed original version of the content, and in response to a request for sharing or accessing a particular asset at a second remote device having an electronic interface characteristic that relates to a format that is different than a format of available scaled assets,
identify a stored original version of the reformatted media content via the identifier in the particular asset,
generate another scaled asset corresponding to the request, which complies with an identified format type of the second remote device. 20. The apparatus of claim 18, wherein
the media content includes a plurality of portions that represent pages within the content in which each page has assets corresponding to items displayed via the page, and the content reformatting circuit is configured and arranged to generate different assets for different ones of the disparate electronic interface characteristics, with the different assets corresponding to a redefined page format suited to the display characteristics of the respective devices, and each page having an identifier that specifies a portion of a stored original version of the reformatted data that corresponds to the page, whereby a user reading a page of media content in a first format on a first type of remote device can access articles, pages or assets for that page of media content as included on a different page for a second format and a second different type of remote device, facilitating bookmarking of a page in the media content that the user is accessing on the first type of remote device and subsequent access to bookmarked pages from the second different type of remote device. | Various aspects of the disclosure are directed to content rendition generation. Sets of disparately-formatted media content are reformatted into corresponding renditions of media content having a common format. The common format includes device-indeterminate ID linking data that links respective portions (e.g., assets or a structural component including the assets) of each rendition with the common format to corresponding portions of the disparately-formatted media content. For each rendition, reformatted assets are generated in which each reformatted is specific to one of a plurality of disparate types of devices, based upon characteristics of the disparate device types. Access to the portions of disparately-formatted media content and/or the assets within the portions of disparately-formatted media content is tracked, based on the linking data.1. A method comprising:
reformatting sets of disparately-formatted media content into corresponding renditions of media content having a common format, the common format including device-indeterminate ID linking data that links respective portions of each rendition with the common format to corresponding portions of the disparately-formatted media content, the respective portions being at least one of assets and a structural component of the media content that includes the assets; for each rendition, generating respective reformatted assets, each reformatted asset being specific to one of a plurality of disparate types of devices, based upon characteristics of the disparate device types; and tracking access to at least one of the portions of the disparately-formatted media content and the assets within the portions of the disparately-formatted media content, based on the linking data. 2. The method of claim 1, wherein generating respective reformatted assets includes scaling each of a plurality of assets in a particular rendition in to a scaled version, storing the scaled version of each asset in association with metadata that correlates the scaled version with the asset from which it is scaled, therein providing multiple versions of each asset for access by respective devices having different display or other characteristics for presenting media content. 3. The method of claim 1, wherein:
reformatting the sets of disparately-formatted media content into corresponding sets of media content having a common format includes reformatting digital magazine content, from each of different magazine sources having disparate digital publication formats, having a format and respective pages upon which text and images are concurrently displayed, into a corresponding set of media content having the common format; generating the respective reformatted assets of the media content includes generating, for one of the sets of media content having a common format, reformatted assets for a rendition having a different arrangement of pages upon which different portions of the text and images are concurrently displayed, relative to the disparately-formatted media content; and generating the linking data includes generating linking data that links assets corresponding to at least one of text or an image from a page in the rendition, with a corresponding at least one of the text or the image on a different page in a corresponding set of disparately-formatted media content. 4. The method of claim 3, wherein generating the respective reformatted renditions of the media content includes generating renditions of the media content in which pages in the media content are modified by at least one of reordering pages, removing pages and inserting pages. 5. The method of claim 1, wherein generating the respective reformatted assets of the media content includes, in response to a remote user device request for access to a portion of the media content, reformatting an asset of the media content into a reformatted asset that is specific to at least one of an operating system, a software application for displaying the media content, and a display size of the remote user device. 6. The method of claim 1,
wherein tracking the access includes tracking a current asset or portion of the media content accessed at a remote user device, and further including, in response to a user of the remote user device requesting access to the same asset from a different remote user device:
generating a new reformatted asset by reformatting an asset in a corresponding one of the sets of disparately-formatted media content according to at least one of an operating system, software application for displaying the media content, and display size of the different remote user device, and
delivering the reformatted asset to the different remote user device, based on a most recently accessed asset of the media content as indicated via the tracked current asset. 7. The method of claim 1, wherein tracking access includes:
tracking access to at least one of the portions or assets at a remote user device by communicating, from the remote user device, data corresponding to the linking data and indicative of at least one of an article, text or images that are displayed on the remote user device, and correlating the at least one of an article, text or images to corresponding text or images in the disparately-formatted media content, tracking access to a corresponding one of the article, text or images in the disparately-formatted media content by other remote devices using different reformatted assets, and combining the tracking to provide an indication of access to the corresponding one of the article, text or images by all of the remote devices. 8. The method of claim 1, wherein tracking access includes tracking user interactions with the portions or assets. 9. The method of claim 1, wherein generating the reformatted assets includes generating at least two physical assets for each logical asset pertaining to the rendition, further including providing access to the physical assets by, using a client module at a remote media content access device, selecting one of available reformatted physical assets pertaining to a logical asset to be accessed based on characteristics of the remote media content access device, and communicating the selected reformatted physical assets in response to the selecting. 10. The method of claim 1, wherein generating the linking data includes operating a content recognition engine to automatically match reformatted assets in the renditions with assets in the disparately-formatted media content, generating data that links the matched assets, and storing the assets for each rendition with the generated linking data. 11. The method of claim 1, wherein the device-indeterminate ID linking data identifies digital media content including at least one of articles, images, text and rich media content displayed on a user device, independent from the type of device upon which the at least one of images and text is displayed and independent from a page upon which the digital media content is displayed. 12. The method of claim 1, wherein generating the reformatted assets includes generating both navigational data and page layout data for the display of text and/or images for each rendition in association with the assets, and wherein generating the linking data includes generating data that links each page in each rendition to at least one article or page in the set of disparately-formatted media content from which the rendition was generated. 13. The method of claim 1, wherein
the disparately-formatted media content includes respective sets of media content data having different content editing formats that are exclusive to different software-based processing systems, each of which being operable to process content according to protocols specific to the content editing format, and reformatting the sets of disparately-formatted media content into corresponding renditions of media content having a common format includes accessing the respective sets according to the protocols specific to the content editing format of the media content set being accessed, and converting the format of the media content set into the common format, all of the converted media content sets being accessible using common protocols corresponding to the common format. 14. The method of claim 1, wherein the disparately-formatted media content includes respective sets of media content data employing different page-display formats specifying one or more of text location, image location, video location and audio location on respective pages representing the content, and wherein reformatting the sets of disparately-formatted media content into corresponding renditions having a common format includes modifying the different page-display formats to provide a common page-display format usable on a plurality of devices. 15. The method of claim 1, further including mapping portions of the renditions to portions of reformatted media content and corresponding device-indeterminate ID data, therein providing a link between characteristics of disparate renditions that correspond to a common portion of the reformatted media content. 16. The method of claim 1, wherein reformatting the sets of disparately-formatted media content includes generating layout and navigational data for displaying text and/or image content on respective pages, the generated data including one or more of page layout for the display of text and/or images, page location, navigational information, linking information that links the text and/or images to other media content. 17. The method of claim 16, wherein reformatting the sets of disparately-formatted media content includes generating data for reproduction on a device having a display type and/or processing system that is different than another device for which the layout and navigational data was generated, by converting the layout and navigational data for use with the device for which the generated data is configured and using the converted layout and navigational data to generate structural views for the content on the device for which the generated data is configured, which is consistent with structural views of the content on the device for which the layout and navigational data was generated. 18. An apparatus comprising:
a content generation circuit configured and arranged to
access media content from disparate content providers and in disparate formats,
reformat accessed media content of disparate formats into a common scalable content format that is different than the disparate formats, and
store assets corresponding to an original version of the reformatted media content in association with device-indeterminate metadata that identifies the media content;
a content reformatting circuit configured and arranged to
communicate with a plurality of different types of remote user devices including devices having disparate electronic interface characteristics relating to a format of the media content provided via the device,
for each remote device, identify a format type for that device from one of a plurality of format types for different devices, based on communications with the device,
for each identified format type, access the stored assets corresponding to the original version of the reformatted media content and generate scaled versions of the assets in a format that complies with the identified format type and that includes metadata identifying the media content,
a communication circuit configured and arranged to communicate each respective scaled asset to a remote device for which the scaled asset has been generated, thereby providing access to the media content of disparate formats at disparate remote devices having disparate electronic interface characteristics, using a single rendition for each set of media content. 19. The apparatus of claim 18, wherein the content reformatting circuit is configured and arranged to
generate each scaled asset by linking the scaled asset back to an identifier for assets in an accessed original version of the content, and in response to a request for sharing or accessing a particular asset at a second remote device having an electronic interface characteristic that relates to a format that is different than a format of available scaled assets,
identify a stored original version of the reformatted media content via the identifier in the particular asset,
generate another scaled asset corresponding to the request, which complies with an identified format type of the second remote device. 20. The apparatus of claim 18, wherein
the media content includes a plurality of portions that represent pages within the content in which each page has assets corresponding to items displayed via the page, and the content reformatting circuit is configured and arranged to generate different assets for different ones of the disparate electronic interface characteristics, with the different assets corresponding to a redefined page format suited to the display characteristics of the respective devices, and each page having an identifier that specifies a portion of a stored original version of the reformatted data that corresponds to the page, whereby a user reading a page of media content in a first format on a first type of remote device can access articles, pages or assets for that page of media content as included on a different page for a second format and a second different type of remote device, facilitating bookmarking of a page in the media content that the user is accessing on the first type of remote device and subsequent access to bookmarked pages from the second different type of remote device. | 2,100 |
5,530 | 5,530 | 14,508,678 | 2,126 | A technique for caching evidence for answering questions in a cache memory of a data processing system (that is configured to answer questions) includes receiving a first question. The first question is analyzed to identify a first set of characteristics of the first question. A first set of evidence for answering the first question is loaded into the cache memory. A second question is received. The second question is analyzed to identify a second set of characteristics of the second question. A portion of the first set of evidence, whose expected usage in answering the second question is below a determined threshold, is unloaded from the cache memory. | 1. A method for caching evidence for answering questions in a cache memory of a data processing system that is configured to answer questions, comprising:
receiving, by the data processing system, a first question; analyzing, by the data processing system, the first question to identify a first set of characteristics of the first question; loading, by the data processing system, a first set of evidence into the cache memory of the data processing system for answering the first question; receiving, by the data processing system, a second question; analyzing, by the data processing system, the second question to identify a second set of characteristics of the second question; and unloading from the cache memory, by the data processing system, a portion of the first set of evidence whose expected usage in answering the second question is below a determined threshold. 2. The method of claim 1, wherein the unloading, by the data processing system, a portion of the first set of evidence is performed at a rate that is based on a relevance of the first set of characteristics to the second set of characteristics. 3. The method of claim 1, wherein the first set of characteristics and the second set of characteristics each include a question type, an evidence size, primary search attributes, and an evidence score that are respectively associated with the first and second questions. 4. The method of claim 1, further comprising:
loading additional evidence for a hypothesis related to one of the first and second questions into the cache memory when another question is not received. 5. The method of claim 1, further comprising comparing the first set of characteristics to the second set of characteristics to determine the expected usage for the first set of evidence. 6. The method of claim 1, wherein the cache memory is shared between processors of a node and the data processing system is a high performance computing system that includes multiple nodes. 7. The method of claim 1, wherein the unloading, by the data processing system, a portion of the first set of evidence is performed at a rate that is based on a relevance of the first set of characteristics to subsequent question characteristics. 8. A computer program product for managing cache memory of a question answering system, the computer program product comprising:
a computer-readable storage device; and computer-readable program code embodied on the computer-readable storage device, wherein the computer-readable program code, when executed by a data processing system, causes the data processing system to:
receive a first question;
analyze the first question to identify a first set of characteristics of the first question;
load a first set of evidence into the cache memory of the data processing system for answering the first question;
receive a second question;
analyze the second question to identify a second set of characteristics of the second question; and
unload from the cache memory a portion of the first set of evidence whose expected usage in answering the second question is below a determined level. 9. The computer program product of claim 8, wherein the unloading a portion of the first set of evidence is performed at a rate that is based on a relevance of the first set of characteristics to the second set of characteristics. 10. The computer program product of claim 8, wherein the first set of characteristics and the second set of characteristics each include a question type, an evidence size, primary search attributes, and an evidence score that are respectively associated with the first and second questions. 11. The computer program product of claim 8, wherein the computer-readable program code, when executed by the data processing system, is further configured to cause the data processing system to load additional evidence for a hypothesis related to one of the first and second questions into the cache memory when another question is not received. 12. The computer program product of claim 8, further comprising comparing the first set of characteristics to the second set of characteristics to determine the expected usage for the first set of evidence. 13. The computer program product of claim 8, wherein the cache memory is shared between processors of a node of a high performance computing system that includes multiple nodes. 14. The computer program product of claim 8, wherein the unloading a portion of the first set of evidence is performed at a rate that is based on a relevance of the first set of characteristics to subsequent question characteristics. 15. A data processing system, comprising:
a cache memory; and a processor coupled to the cache memory, wherein the processor is configured to:
receive a first question;
analyze the first question to identify a first set of characteristics of the first question;
load a first set of evidence into the cache memory for answering the first question;
receive a second question;
analyze the second question to identify a second set of characteristics of the second question; and
unload from the cache memory a portion of the first set of evidence whose expected usage in answering the second question is below a determined level. 16. The data processing system of claim 15, wherein the unloading a portion of the first set of evidence is performed at a rate that is based on a relevance of the first set of characteristics to the second set of characteristics. 17. The data processing system of claim 15, wherein the first set of characteristics and the second set of characteristics each include a question type, an evidence size, primary search attributes, and an evidence score that are respectively associated with the first and second questions. 18. The data processing system of claim 15, wherein the processor is further configured to load additional evidence for a hypothesis related to one of the first and second questions into the cache memory when another question is not received. 19. The data processing system of claim 15, wherein the processor is further configured to compare the first set of characteristics to the second set of characteristics to determine the expected usage for the first set of evidence. 20. The data processing system of claim 15, wherein the cache memory is shared between processors of a node and the data processing system is a high performance computing system that includes multiple nodes. | A technique for caching evidence for answering questions in a cache memory of a data processing system (that is configured to answer questions) includes receiving a first question. The first question is analyzed to identify a first set of characteristics of the first question. A first set of evidence for answering the first question is loaded into the cache memory. A second question is received. The second question is analyzed to identify a second set of characteristics of the second question. A portion of the first set of evidence, whose expected usage in answering the second question is below a determined threshold, is unloaded from the cache memory.1. A method for caching evidence for answering questions in a cache memory of a data processing system that is configured to answer questions, comprising:
receiving, by the data processing system, a first question; analyzing, by the data processing system, the first question to identify a first set of characteristics of the first question; loading, by the data processing system, a first set of evidence into the cache memory of the data processing system for answering the first question; receiving, by the data processing system, a second question; analyzing, by the data processing system, the second question to identify a second set of characteristics of the second question; and unloading from the cache memory, by the data processing system, a portion of the first set of evidence whose expected usage in answering the second question is below a determined threshold. 2. The method of claim 1, wherein the unloading, by the data processing system, a portion of the first set of evidence is performed at a rate that is based on a relevance of the first set of characteristics to the second set of characteristics. 3. The method of claim 1, wherein the first set of characteristics and the second set of characteristics each include a question type, an evidence size, primary search attributes, and an evidence score that are respectively associated with the first and second questions. 4. The method of claim 1, further comprising:
loading additional evidence for a hypothesis related to one of the first and second questions into the cache memory when another question is not received. 5. The method of claim 1, further comprising comparing the first set of characteristics to the second set of characteristics to determine the expected usage for the first set of evidence. 6. The method of claim 1, wherein the cache memory is shared between processors of a node and the data processing system is a high performance computing system that includes multiple nodes. 7. The method of claim 1, wherein the unloading, by the data processing system, a portion of the first set of evidence is performed at a rate that is based on a relevance of the first set of characteristics to subsequent question characteristics. 8. A computer program product for managing cache memory of a question answering system, the computer program product comprising:
a computer-readable storage device; and computer-readable program code embodied on the computer-readable storage device, wherein the computer-readable program code, when executed by a data processing system, causes the data processing system to:
receive a first question;
analyze the first question to identify a first set of characteristics of the first question;
load a first set of evidence into the cache memory of the data processing system for answering the first question;
receive a second question;
analyze the second question to identify a second set of characteristics of the second question; and
unload from the cache memory a portion of the first set of evidence whose expected usage in answering the second question is below a determined level. 9. The computer program product of claim 8, wherein the unloading a portion of the first set of evidence is performed at a rate that is based on a relevance of the first set of characteristics to the second set of characteristics. 10. The computer program product of claim 8, wherein the first set of characteristics and the second set of characteristics each include a question type, an evidence size, primary search attributes, and an evidence score that are respectively associated with the first and second questions. 11. The computer program product of claim 8, wherein the computer-readable program code, when executed by the data processing system, is further configured to cause the data processing system to load additional evidence for a hypothesis related to one of the first and second questions into the cache memory when another question is not received. 12. The computer program product of claim 8, further comprising comparing the first set of characteristics to the second set of characteristics to determine the expected usage for the first set of evidence. 13. The computer program product of claim 8, wherein the cache memory is shared between processors of a node of a high performance computing system that includes multiple nodes. 14. The computer program product of claim 8, wherein the unloading a portion of the first set of evidence is performed at a rate that is based on a relevance of the first set of characteristics to subsequent question characteristics. 15. A data processing system, comprising:
a cache memory; and a processor coupled to the cache memory, wherein the processor is configured to:
receive a first question;
analyze the first question to identify a first set of characteristics of the first question;
load a first set of evidence into the cache memory for answering the first question;
receive a second question;
analyze the second question to identify a second set of characteristics of the second question; and
unload from the cache memory a portion of the first set of evidence whose expected usage in answering the second question is below a determined level. 16. The data processing system of claim 15, wherein the unloading a portion of the first set of evidence is performed at a rate that is based on a relevance of the first set of characteristics to the second set of characteristics. 17. The data processing system of claim 15, wherein the first set of characteristics and the second set of characteristics each include a question type, an evidence size, primary search attributes, and an evidence score that are respectively associated with the first and second questions. 18. The data processing system of claim 15, wherein the processor is further configured to load additional evidence for a hypothesis related to one of the first and second questions into the cache memory when another question is not received. 19. The data processing system of claim 15, wherein the processor is further configured to compare the first set of characteristics to the second set of characteristics to determine the expected usage for the first set of evidence. 20. The data processing system of claim 15, wherein the cache memory is shared between processors of a node and the data processing system is a high performance computing system that includes multiple nodes. | 2,100 |
5,531 | 5,531 | 12,168,821 | 2,164 | Embodiments of the present invention generate and optimize query plans that are at least partially executable in hardware. Upon receiving a query, the query is rewritten and optimized with a bias for hardware execution of fragments of the query. A template-based algorithm may be employed for transforming a query into fragments and then into query tasks. The various query tasks can then be routed to either a hardware accelerator, a software module, or sent back to a database management system for execution. For those tasks routed to the hardware accelerator, the query tasks are compiled into machine code database instructions. In order to optimize query execution, query tasks may be broken into subtasks, rearranged based on available resources of the hardware, pipelined, or branched conditionally | 1. A query compiler, said compiler comprising:
a processor; and a memory having program code for configuring the processor to: receive a SQL query; determine query fragments needed to perform the SQL query; determine an execution mode for each of the query fragments, wherein at least one execution mode relates to execution in a hardware accelerator; and compile query fragments, which will be executed in the hardware accelerator, into respective sets of machine code database instructions, and grouping the sets of machine code database instructions into tasks that can be executed as a dataflow based on resources of the hardware accelerator. 2. The query compiler of claim 1, wherein the program code further comprises code for determining an execution mode that relates to execution by a host processor coupled to the hardware accelerator. 3. The query compiler of claim 1, wherein the program code further comprises code for removing at least one control flow from execution of the SQL query to enable dataflow execution in the hardware accelerator. 4. The query compiler of claim 3, wherein the program code further comprises code for using Magic-Set based rewrites of the SQL query to enable dataflow execution in the hardware accelerator. 5. The query compiler of claim 3, wherein the program code further comprises code for decorrelating the SQL query to remove loops from execution of the SQL query to enable dataflow execution in the hardware accelerator. 6. The query compiler of claim 1, wherein the program code further comprises code for compiling the SQL query into a form suitable for dataflow execution within a limit of the hardware accelerator resources. 7. The query compiler of claim 6, wherein the program code further comprises code for compiling the SQL query into a dataflow execution having a finite width of data. 8. The query compiler of claim 6, wherein the program code further comprises code for compiling the SQL query into a dataflow execution within a capacity of memory of the hardware accelerator. 9. The query compiler of claim 6, wherein the program code further comprises code for compiling the SQL query into a dataflow execution for a finite number of processing elements in the hardware accelerator. 10. The query compiler of claim 1, wherein the program code further comprises code for translating the SQL query into a dataflow suitable for execution on the hardware accelerator. 11. The query compiler of claim 10, wherein the program code for translating the SQL query further comprises:
code for annotating the SQL query that defines a unique execution; and code for translating the annotated SQL query into a program of database machine code instructions. 12. The query compiler of claim 10, wherein the program code for translating the SQL query further comprises code for translating the SQL query into the dataflow based on a set of templates. 13. The query compiler of claim 12, wherein the program code further comprises code for identifying at least one pattern for each template that corresponds to a set of database machine code instructions. 14. The query compiler of claim 1, wherein the program code further comprises code for execution of the query fragments directly on compressed data. 15. A method for creating query fragments and operations for a query, said method comprising:
receiving a SQL query; determining query fragments needed to perform the SQL query; determining an execution mode for each of the query fragments, wherein at least one execution mode relates to execution in a hardware accelerator; compiling query fragments, which will be executed in the hardware accelerator, into respective sets of machine code database instructions; and grouping the sets of machine code database instructions into tasks that can be executed as a dataflow based on resources of the hardware accelerator. 16. The method of claim 15, wherein determining an execution mode for each of the query fragments comprises determining an execution mode that relates to execution by a host processor coupled to the hardware accelerator. 17. The method of claim 15, wherein determining query fragments needed to perform the SQL query comprises removing at least one control flow from execution of the SQL query to enable dataflow execution in the hardware accelerator. 18. The method of claim 17, wherein determining query fragments needed to perform the SQL query comprises rewriting the SQL query to enable dataflow execution in the hardware accelerator based on Magic-Sets. 19. The method of claim 17, wherein determining query fragments needed to perform the SQL query comprises decorrelating the SQL query to remove loops from execution of the SQL query to enable dataflow execution in the hardware accelerator. 20. The method of claim 15, wherein determining query fragments needed to perform the SQL query comprises rewriting the SQL query into a form suitable for dataflow execution within a limit of the hardware accelerator resources. 21. The method of claim 20, wherein determining query fragments needed to perform the SQL query comprises rewriting the SQL query into a dataflow execution having a finite width. 22. The method of claim 20, wherein determining query fragments needed to perform the SQL query comprises rewriting the SQL query into a dataflow execution within a capacity of memory of the hardware accelerator. 23. The method of claim 20, wherein determining query fragments needed to perform the SQL query comprises rewriting the SQL query into a dataflow execution for a finite number of processing elements in the hardware accelerator. 24. The method of claim 15, wherein determining query fragments needed to perform the SQL query comprises translating the SQL query into a dataflow suitable for execution on the hardware accelerator. 25. The method of claim 23, wherein translating the SQL query further comprises:
annotating the SQL query that defines a unique execution; and translating the annotated SQL query into a program of database machine code instructions. 26. The method of claim 23, wherein translating the SQL query further comprises translating the SQL query into the dataflow based on a set of templates. 27. The method of claim 23, wherein translating the SQL query further comprises identifying at least one pattern for each template that corresponds to a set of database machine code instructions. 28. The method of claim 15, further comprising routing query fragments to a host processor based on the execution mode of the query fragments. 29. The method of claim 15, further comprising routing query fragments to software running on a host processor based on the execution mode of the query fragments. 30. The method of claim 14, further comprising routing query fragments to a database management system based on the execution mode of the query fragments. 31. The method of claim 14, further comprising compiling the query fragments into to be executed on compressed data. | Embodiments of the present invention generate and optimize query plans that are at least partially executable in hardware. Upon receiving a query, the query is rewritten and optimized with a bias for hardware execution of fragments of the query. A template-based algorithm may be employed for transforming a query into fragments and then into query tasks. The various query tasks can then be routed to either a hardware accelerator, a software module, or sent back to a database management system for execution. For those tasks routed to the hardware accelerator, the query tasks are compiled into machine code database instructions. In order to optimize query execution, query tasks may be broken into subtasks, rearranged based on available resources of the hardware, pipelined, or branched conditionally1. A query compiler, said compiler comprising:
a processor; and a memory having program code for configuring the processor to: receive a SQL query; determine query fragments needed to perform the SQL query; determine an execution mode for each of the query fragments, wherein at least one execution mode relates to execution in a hardware accelerator; and compile query fragments, which will be executed in the hardware accelerator, into respective sets of machine code database instructions, and grouping the sets of machine code database instructions into tasks that can be executed as a dataflow based on resources of the hardware accelerator. 2. The query compiler of claim 1, wherein the program code further comprises code for determining an execution mode that relates to execution by a host processor coupled to the hardware accelerator. 3. The query compiler of claim 1, wherein the program code further comprises code for removing at least one control flow from execution of the SQL query to enable dataflow execution in the hardware accelerator. 4. The query compiler of claim 3, wherein the program code further comprises code for using Magic-Set based rewrites of the SQL query to enable dataflow execution in the hardware accelerator. 5. The query compiler of claim 3, wherein the program code further comprises code for decorrelating the SQL query to remove loops from execution of the SQL query to enable dataflow execution in the hardware accelerator. 6. The query compiler of claim 1, wherein the program code further comprises code for compiling the SQL query into a form suitable for dataflow execution within a limit of the hardware accelerator resources. 7. The query compiler of claim 6, wherein the program code further comprises code for compiling the SQL query into a dataflow execution having a finite width of data. 8. The query compiler of claim 6, wherein the program code further comprises code for compiling the SQL query into a dataflow execution within a capacity of memory of the hardware accelerator. 9. The query compiler of claim 6, wherein the program code further comprises code for compiling the SQL query into a dataflow execution for a finite number of processing elements in the hardware accelerator. 10. The query compiler of claim 1, wherein the program code further comprises code for translating the SQL query into a dataflow suitable for execution on the hardware accelerator. 11. The query compiler of claim 10, wherein the program code for translating the SQL query further comprises:
code for annotating the SQL query that defines a unique execution; and code for translating the annotated SQL query into a program of database machine code instructions. 12. The query compiler of claim 10, wherein the program code for translating the SQL query further comprises code for translating the SQL query into the dataflow based on a set of templates. 13. The query compiler of claim 12, wherein the program code further comprises code for identifying at least one pattern for each template that corresponds to a set of database machine code instructions. 14. The query compiler of claim 1, wherein the program code further comprises code for execution of the query fragments directly on compressed data. 15. A method for creating query fragments and operations for a query, said method comprising:
receiving a SQL query; determining query fragments needed to perform the SQL query; determining an execution mode for each of the query fragments, wherein at least one execution mode relates to execution in a hardware accelerator; compiling query fragments, which will be executed in the hardware accelerator, into respective sets of machine code database instructions; and grouping the sets of machine code database instructions into tasks that can be executed as a dataflow based on resources of the hardware accelerator. 16. The method of claim 15, wherein determining an execution mode for each of the query fragments comprises determining an execution mode that relates to execution by a host processor coupled to the hardware accelerator. 17. The method of claim 15, wherein determining query fragments needed to perform the SQL query comprises removing at least one control flow from execution of the SQL query to enable dataflow execution in the hardware accelerator. 18. The method of claim 17, wherein determining query fragments needed to perform the SQL query comprises rewriting the SQL query to enable dataflow execution in the hardware accelerator based on Magic-Sets. 19. The method of claim 17, wherein determining query fragments needed to perform the SQL query comprises decorrelating the SQL query to remove loops from execution of the SQL query to enable dataflow execution in the hardware accelerator. 20. The method of claim 15, wherein determining query fragments needed to perform the SQL query comprises rewriting the SQL query into a form suitable for dataflow execution within a limit of the hardware accelerator resources. 21. The method of claim 20, wherein determining query fragments needed to perform the SQL query comprises rewriting the SQL query into a dataflow execution having a finite width. 22. The method of claim 20, wherein determining query fragments needed to perform the SQL query comprises rewriting the SQL query into a dataflow execution within a capacity of memory of the hardware accelerator. 23. The method of claim 20, wherein determining query fragments needed to perform the SQL query comprises rewriting the SQL query into a dataflow execution for a finite number of processing elements in the hardware accelerator. 24. The method of claim 15, wherein determining query fragments needed to perform the SQL query comprises translating the SQL query into a dataflow suitable for execution on the hardware accelerator. 25. The method of claim 23, wherein translating the SQL query further comprises:
annotating the SQL query that defines a unique execution; and translating the annotated SQL query into a program of database machine code instructions. 26. The method of claim 23, wherein translating the SQL query further comprises translating the SQL query into the dataflow based on a set of templates. 27. The method of claim 23, wherein translating the SQL query further comprises identifying at least one pattern for each template that corresponds to a set of database machine code instructions. 28. The method of claim 15, further comprising routing query fragments to a host processor based on the execution mode of the query fragments. 29. The method of claim 15, further comprising routing query fragments to software running on a host processor based on the execution mode of the query fragments. 30. The method of claim 14, further comprising routing query fragments to a database management system based on the execution mode of the query fragments. 31. The method of claim 14, further comprising compiling the query fragments into to be executed on compressed data. | 2,100 |
5,532 | 5,532 | 15,079,925 | 2,126 | A technique for caching evidence for answering questions in a cache memory of a data processing system (that is configured to answer questions) includes receiving a first question. The first question is analyzed to identify a first set of characteristics of the first question. A first set of evidence for answering the first question is loaded into the cache memory. A second question is received. The second question is analyzed to identify a second set of characteristics of the second question. A portion of the first set of evidence, whose expected usage in answering the second question is below a determined threshold, is unloaded from the cache memory. | 1. A method for caching evidence for answering questions in a cache memory of a data processing system that is configured to answer questions, comprising:
receiving, by the data processing system, a first question; analyzing, by the data processing system, the first question to identify a first set of characteristics of the first question; loading, by the data processing system, a first set of evidence into the cache memory of the data processing system for answering the first question; receiving, by the data processing system, a second question; analyzing, by the data processing system, the second question to identify a second set of characteristics of the second question; and unloading from the cache memory, by the data processing system, a portion of the first set of evidence whose expected usage in answering the second question is below a determined threshold. 2. The method of claim 1, wherein the unloading, by the data processing system, a portion of the first set of evidence is performed at a rate that is based on a relevance of the first set of characteristics to the second set of characteristics. 3. The method of claim 1, wherein the first set of characteristics and the second set of characteristics each include a question type, an evidence size, primary search attributes, and an evidence score that are respectively associated with the first and second questions. 4. The method of claim 1, further comprising:
loading additional evidence for a hypothesis related to one of the first and second questions into the cache memory when another question is not received. 5. The method of claim 1, further comprising comparing the first set of characteristics to the second set of characteristics to determine the expected usage for the first set of evidence. 6. The method of claim 1, wherein the cache memory is shared between processors of a node and the data processing system is a high performance computing system that includes multiple nodes. 7. The method of claim 1, wherein the unloading, by the data processing system, a portion of the first set of evidence is performed at a rate that is based on a relevance of the first set of characteristics to subsequent question characteristics. | A technique for caching evidence for answering questions in a cache memory of a data processing system (that is configured to answer questions) includes receiving a first question. The first question is analyzed to identify a first set of characteristics of the first question. A first set of evidence for answering the first question is loaded into the cache memory. A second question is received. The second question is analyzed to identify a second set of characteristics of the second question. A portion of the first set of evidence, whose expected usage in answering the second question is below a determined threshold, is unloaded from the cache memory.1. A method for caching evidence for answering questions in a cache memory of a data processing system that is configured to answer questions, comprising:
receiving, by the data processing system, a first question; analyzing, by the data processing system, the first question to identify a first set of characteristics of the first question; loading, by the data processing system, a first set of evidence into the cache memory of the data processing system for answering the first question; receiving, by the data processing system, a second question; analyzing, by the data processing system, the second question to identify a second set of characteristics of the second question; and unloading from the cache memory, by the data processing system, a portion of the first set of evidence whose expected usage in answering the second question is below a determined threshold. 2. The method of claim 1, wherein the unloading, by the data processing system, a portion of the first set of evidence is performed at a rate that is based on a relevance of the first set of characteristics to the second set of characteristics. 3. The method of claim 1, wherein the first set of characteristics and the second set of characteristics each include a question type, an evidence size, primary search attributes, and an evidence score that are respectively associated with the first and second questions. 4. The method of claim 1, further comprising:
loading additional evidence for a hypothesis related to one of the first and second questions into the cache memory when another question is not received. 5. The method of claim 1, further comprising comparing the first set of characteristics to the second set of characteristics to determine the expected usage for the first set of evidence. 6. The method of claim 1, wherein the cache memory is shared between processors of a node and the data processing system is a high performance computing system that includes multiple nodes. 7. The method of claim 1, wherein the unloading, by the data processing system, a portion of the first set of evidence is performed at a rate that is based on a relevance of the first set of characteristics to subsequent question characteristics. | 2,100 |
5,533 | 5,533 | 15,804,085 | 2,159 | Disclosed are various embodiments for navigating a taxonomy using search queries. A search query is parsed in order to identify one or more item categories. A confidence score for each item categories is generated. When the confidence score meets a threshold, a pool of items associated with a respective category is selected. When the confidence score fails to meets the threshold, the pool of items is selected from the collection of items. | 1. A system, comprising:
at least one computing device; and at least one application executable in the at least one computing device, wherein when executed, the at least one application causes the at least one computing device to at least:
receive a search query from a client device;
identify a category based at least in part on at least one term of the search query;
generate a confidence score associated with the category based at least in part on a frequency that at least a portion of the search query occurs within a description of the category;
select a pool of items from a first collection of items included within the category when the confidence score meets a threshold, the first collection of items being a subset of a second collection of items associated with a plurality of categories;
generate a user interface including at least a portion of the pool of items that have been selected; and
transmit data encoding the user interface to the client device. 2. The system of claim 1, wherein, when executed, the at least one application further causes the at least one computing device to at least identify at least one refinement based at least in part on the at least one term of the search query. 3. The system of claim 2, wherein the at least one refinement is identified based at least in part on a comparison of a list of predefined refinements associated with the category and the at least one term of the search query. 4. The system of claim 2, wherein, when executed, the at least one application further causes the at least one computing device to at least translate the at least one refinement into an item attribute. 5. The system of claim 4, wherein the user interface further comprises a respective link to a detailed network page for individual items from the pool of items that are selected, the detailed network page having the item attribute preselected for the individual items. 6. The system of claim 2, wherein the pool of items are selected further based at least in part on the at least one refinement. 7. The system of claim 1, where, when executed, the at least one application further causes the at least one computing device to at least:
receive another search query from the client device; generate another confidence score associated with at least one category of the plurality of categories, the at least one category being identified based at least in part on at least a portion of the other search query; determine that the other confidence score fails to meet the threshold; and generate another user interface including another pool of items selected from the second collection of items in response to the other confidence score failing to meet the threshold, the other user interface further comprising a disambiguation tool allowing for selection of a particular category of the plurality of categories. 8. A method, comprising:
parsing, via at least one computing device, a search query into a plurality of keywords, the search query being received from a client device; identifying, via the at least one computing device, a category associated with a plurality of items based at least in part on at least one of the plurality of keywords matching a category term of the category; determining, via the at least one computing device, a frequency that at least a portion of the search query occurs within a description of the category; generating, via the at least one computing device, a confidence score associated with the category, the confidence score being based at least in part on the frequency that the at least a portion of the search query occurs within the description of the category; selecting, via the at least one computing device, at least one item from a collection of items included within the category in response to the confidence score meeting or exceeding a threshold, the collection of items being a subset of a plurality of items associated with a plurality of categories; generating, via the at least one computing device, a user interface including the at least one item that has been selected; and transmitting, via the at least one computing device, data encoding the user interface to the client device. 9. The method of claim 8, further comprising identifying, via the at least one computing device, a refinement based at least in part on a particular keyword of the plurality of keywords. 10. The method of claim 9, further comprising identifying, via the at least one computing device, at least one synonym associated with the particular keyword, wherein the refinement is based at least in part on the at least one synonym. 11. The method of claim 8, further comprising:
retrieving, via the at least one computing device, a list of refinements associated with the category; and comparing, via the at least one computing device, individual refinements of the list of refinements with individual keywords of the search query to determine a quality of match between the list of refinements and the search query, wherein the confidence score is further based at least in part on the quality of match. 12. The method of claim 8, wherein the user interface includes a disambiguation tool. 13. The method of claim 12, wherein the disambiguation tool allows for deselection of the category. 14. The method of claim 8, further comprising:
receiving, via the at least one computing device, another search query from the client device; generating, via the at least one computing device, another confidence score associated with at least one category of the plurality of categories, the at least one category being identified according to at least one term of the other search query; selecting, via the at least one computing device, at least one other item from the plurality of items in response to the other confidence score failing to meet the threshold; and generating, via the at least one computing device, another user interface including the at least one other item and a disambiguation tool, the disambiguation tool being configured to allow for selection of a particular category from the plurality of categories. 15. A non-transitory computer-readable medium embodying a program executable in at least one computing device, wherein, when executed the program causes the at least one computing device to at least:
compare a plurality of category keywords with at least a portion of a search query received from a client device to identify a plurality of item categories; determine, for individual item categories of the plurality of item categories, a frequency of occurrence of the at least a portion of the search query in a description of a respective item category; generate, for the individual item categories, a respective confidence score based at least in part on the frequency of occurrence; determine that the respective confidence score for at least one item category of the plurality of items categories meets or exceeds a threshold; generate a user interface including a plurality of items associated with the at least one item category; and transmit data encoding the user interface to the client device. 16. The non-transitory computer-readable medium of claim 15, wherein, when executed, the program further causes the at least one computing device to at least identify at least one item attribute based at least in part on one or more terms of the search query. 17. The non-transitory computer-readable medium of claim 16, wherein the plurality of items is a subset of a collection of items associated with the at least one item category, and when executed, the program further causes the at least one computing device to select the plurality of items from the collection of items based at least in part on the at least one item attribute. 18. The non-transitory computer-readable medium of claim 15, wherein the user interface further includes a disambiguation tool configured to allow deselection of the at least one category. 19. The non-transitory computer-readable medium of claim 15, wherein the user interface further includes a plurality of links for a plurality of detail network pages for the plurality of items. 20. The non-transitory computer-readable medium of claim 15, wherein, when executed, the program further causes the at least one computing device to at least parse the search query into a plurality of search query keywords. | Disclosed are various embodiments for navigating a taxonomy using search queries. A search query is parsed in order to identify one or more item categories. A confidence score for each item categories is generated. When the confidence score meets a threshold, a pool of items associated with a respective category is selected. When the confidence score fails to meets the threshold, the pool of items is selected from the collection of items.1. A system, comprising:
at least one computing device; and at least one application executable in the at least one computing device, wherein when executed, the at least one application causes the at least one computing device to at least:
receive a search query from a client device;
identify a category based at least in part on at least one term of the search query;
generate a confidence score associated with the category based at least in part on a frequency that at least a portion of the search query occurs within a description of the category;
select a pool of items from a first collection of items included within the category when the confidence score meets a threshold, the first collection of items being a subset of a second collection of items associated with a plurality of categories;
generate a user interface including at least a portion of the pool of items that have been selected; and
transmit data encoding the user interface to the client device. 2. The system of claim 1, wherein, when executed, the at least one application further causes the at least one computing device to at least identify at least one refinement based at least in part on the at least one term of the search query. 3. The system of claim 2, wherein the at least one refinement is identified based at least in part on a comparison of a list of predefined refinements associated with the category and the at least one term of the search query. 4. The system of claim 2, wherein, when executed, the at least one application further causes the at least one computing device to at least translate the at least one refinement into an item attribute. 5. The system of claim 4, wherein the user interface further comprises a respective link to a detailed network page for individual items from the pool of items that are selected, the detailed network page having the item attribute preselected for the individual items. 6. The system of claim 2, wherein the pool of items are selected further based at least in part on the at least one refinement. 7. The system of claim 1, where, when executed, the at least one application further causes the at least one computing device to at least:
receive another search query from the client device; generate another confidence score associated with at least one category of the plurality of categories, the at least one category being identified based at least in part on at least a portion of the other search query; determine that the other confidence score fails to meet the threshold; and generate another user interface including another pool of items selected from the second collection of items in response to the other confidence score failing to meet the threshold, the other user interface further comprising a disambiguation tool allowing for selection of a particular category of the plurality of categories. 8. A method, comprising:
parsing, via at least one computing device, a search query into a plurality of keywords, the search query being received from a client device; identifying, via the at least one computing device, a category associated with a plurality of items based at least in part on at least one of the plurality of keywords matching a category term of the category; determining, via the at least one computing device, a frequency that at least a portion of the search query occurs within a description of the category; generating, via the at least one computing device, a confidence score associated with the category, the confidence score being based at least in part on the frequency that the at least a portion of the search query occurs within the description of the category; selecting, via the at least one computing device, at least one item from a collection of items included within the category in response to the confidence score meeting or exceeding a threshold, the collection of items being a subset of a plurality of items associated with a plurality of categories; generating, via the at least one computing device, a user interface including the at least one item that has been selected; and transmitting, via the at least one computing device, data encoding the user interface to the client device. 9. The method of claim 8, further comprising identifying, via the at least one computing device, a refinement based at least in part on a particular keyword of the plurality of keywords. 10. The method of claim 9, further comprising identifying, via the at least one computing device, at least one synonym associated with the particular keyword, wherein the refinement is based at least in part on the at least one synonym. 11. The method of claim 8, further comprising:
retrieving, via the at least one computing device, a list of refinements associated with the category; and comparing, via the at least one computing device, individual refinements of the list of refinements with individual keywords of the search query to determine a quality of match between the list of refinements and the search query, wherein the confidence score is further based at least in part on the quality of match. 12. The method of claim 8, wherein the user interface includes a disambiguation tool. 13. The method of claim 12, wherein the disambiguation tool allows for deselection of the category. 14. The method of claim 8, further comprising:
receiving, via the at least one computing device, another search query from the client device; generating, via the at least one computing device, another confidence score associated with at least one category of the plurality of categories, the at least one category being identified according to at least one term of the other search query; selecting, via the at least one computing device, at least one other item from the plurality of items in response to the other confidence score failing to meet the threshold; and generating, via the at least one computing device, another user interface including the at least one other item and a disambiguation tool, the disambiguation tool being configured to allow for selection of a particular category from the plurality of categories. 15. A non-transitory computer-readable medium embodying a program executable in at least one computing device, wherein, when executed the program causes the at least one computing device to at least:
compare a plurality of category keywords with at least a portion of a search query received from a client device to identify a plurality of item categories; determine, for individual item categories of the plurality of item categories, a frequency of occurrence of the at least a portion of the search query in a description of a respective item category; generate, for the individual item categories, a respective confidence score based at least in part on the frequency of occurrence; determine that the respective confidence score for at least one item category of the plurality of items categories meets or exceeds a threshold; generate a user interface including a plurality of items associated with the at least one item category; and transmit data encoding the user interface to the client device. 16. The non-transitory computer-readable medium of claim 15, wherein, when executed, the program further causes the at least one computing device to at least identify at least one item attribute based at least in part on one or more terms of the search query. 17. The non-transitory computer-readable medium of claim 16, wherein the plurality of items is a subset of a collection of items associated with the at least one item category, and when executed, the program further causes the at least one computing device to select the plurality of items from the collection of items based at least in part on the at least one item attribute. 18. The non-transitory computer-readable medium of claim 15, wherein the user interface further includes a disambiguation tool configured to allow deselection of the at least one category. 19. The non-transitory computer-readable medium of claim 15, wherein the user interface further includes a plurality of links for a plurality of detail network pages for the plurality of items. 20. The non-transitory computer-readable medium of claim 15, wherein, when executed, the program further causes the at least one computing device to at least parse the search query into a plurality of search query keywords. | 2,100 |
5,534 | 5,534 | 15,110,533 | 2,184 | A wireless docking system has a host ( 100 ) and at least one dockee ( 120,130,140 ). The host accommodates at least one wireless docking environment including at least one peripheral ( 110,111,112 ). The host has a host communication unit ( 102 ) for providing wireless communication and a host processor ( 101 ) arranged for docking the dockee into the wireless docking environment. The dockee has a dockee communication unit ( 121 ) for providing said wireless communication, and a dockee processor ( 122 ) arranged for docking into the wireless docking environment. The dockee has at least one dockee peripheral ( 123 ). The dockee processor advertises the dockee peripheral, and, upon receiving a coupling request from the host, couples to the host for providing connection data and control of the dockee peripheral by the host. The host processor advertises the set of peripherals including the dockee peripheral for making the dockee peripheral available for use as a further peripheral in the wireless docking environment. | 1. Wireless docking system comprising a host and at least one dockee, the host and the dockee arranged for docking via wireless communication,
the host arranged for accommodating at least one wireless docking environment and advertising a set of peripherals for making the peripherals available for use in the wireless docking environment, the docking enabling the dockee to use the set of peripherals, the host comprising
a host communication unit for providing said wireless communication,
a host processor arranged for docking the dockee into the wireless docking environment, the dockee comprising
a dockee communication unit for providing said wireless communication,
a dockee processor arranged for docking into the wireless docking environment,
the dockee comprising at least one dockee peripheral internal to the dockee, wherein the dockee processor is arranged for advertising the dockee peripheral, and, upon receiving a coupling request from the host,
coupling to the host for providing connection data, and
allowing control of the dockee peripheral as peripheral by the host, and
the host processor being arranged for
sending the coupling request to the dockee for obtaining the connection data,
taking control of the dockee peripheral as peripheral, and
advertising the set of peripherals including the dockee peripheral for making the dockee peripheral available for use as a further peripheral in the wireless docking environment. 2. The system as claimed in claim 1, wherein the host processor is arranged for setting up a session to the dockee peripheral via said coupling request, and the dockee processor is arranged for providing the control of the dockee peripheral via said session. 3. The system as claimed in claim 1, wherein the dockee processor is arranged for said advertising the dockee peripheral by sending a peripheral capability signal to the host indicative of the dockee peripheral unit being available for coupling as a further peripheral, and the host processor is arranged for discovery of the dockee peripheral by receiving the peripheral capability signal from the dockee. 4. The system as claimed in claim 1, the system comprising a further dockee comprising a further dockee processor arranged for, upon docking into the wireless docking environment, using the dockee peripheral, the host processor arranged for, upon docking the further dockee into the wireless docking environment,
sending a use request to the dockee, the use request indicating that the dockee peripheral is to be used in the wireless docking environment, and accommodating transfer of signals between the dockee peripheral and the further dockee for using the dockee peripheral, the dockee processor arranged for, upon receiving the use request from the host, engaging a use mode of the dockee peripheral and transferring the signals between the dockee peripheral and the further dockee. 5. A dockee for use in a wireless docking system, the dockee arranged for docking via wireless communication, the dockee comprising:
a dockee communication unit for providing said wireless communication, a dockee processor arranged for docking into the wireless docking environment, the dockee comprising at least one dockee peripheral internal to the dockee, wherein the dockee processor is arranged for advertising the dockee peripheral, and, upon receiving a coupling request from the host, coupling to the host for providing connection data, and allowing control of the dockee peripheral as peripheral by the host for making the dockee peripheral accessible as a further peripheral in the wireless docking environment. 6. The dockee as claimed in claim 5, wherein the dockee processor is arranged for
receiving a synchronization command for activating a function of the dockee peripheral at a time as indicated by the synchronization command; and generating a synchronization command for activating a function of at least one peripheral in the wireless docking environment at a time as indicated by the synchronization command. 7. The dockee as claimed in claim 5, wherein the dockee processor is arranged for, upon receiving a coupling request or a use request, determining whether a user of the dockee agrees to allowing control of the dockee peripheral as peripheral by the host. 8. The dockee as claimed in claim 5, wherein the dockee processor is arranged for, when a use mode of the dockee peripheral is engaged, determining whether a user of the dockee requires to use the dockee peripheral, and subsequently limiting or terminating the use of the dockee peripheral as a further peripheral in the wireless docking environment. 9. The dockee as claimed in claim wherein the at least one dockee peripheral comprises at least one of a microphone, a loudspeaker, a camera, a display, a touch screen, a mouse, a keyboard, a communication unit, a light sensor, a temperature sensor, an orientation sensor, a location sensor. 10. A host for use in a wireless docking system, the host arranged for docking via wireless communication and for accommodating at least one wireless docking environment and advertising a set of peripherals for making the peripherals available for use in the wireless docking environment, the host comprising
a host communication unit for providing said wireless communication, a host processor arranged for docking the dockee into the wireless docking environment, wherein the host processor is arranged for sending a coupling request to the dockee for obtaining connection data, taking control of the dockee peripheral as peripheral, and advertising the set of peripherals including the dockee peripheral for making the dockee peripheral available for use as a further peripheral in the wireless docking environment. 11. The host as claimed in claim 10, wherein the host processor is arranged to accommodate a configuration mode in which the wireless docking environment is configurable for making the dockee peripheral available for use as a further peripheral in the wireless docking environment. 12. The host as claimed in claim 11, wherein the host processor is arranged to engage the configuration mode by at least one of
detection of a dockee being docked; a user input via a user interface of the host; a configuration message from the dockee as received by the host. 13. A method of wireless docking in a host for use in a wireless docking system comprising the host and at least one dockee, the host and the dockee arranged for docking via wireless communication, the host arranged for accommodating at least one wireless docking environment and advertising a set of peripherals for making the peripherals available for use in the wireless docking environment, the docking enabling the dockee to use the set of peripherals, the dockee comprising at least one dockee peripheral internal to the dockee, the method comprising
docking the dockee into the wireless docking environment, sending a coupling request to the dockee for obtaining the connection data, and taking control of the dockee peripheral as peripheral, and advertising the set of peripherals including the dockee peripheral for making the dockee peripheral available for use as a further peripheral in the wireless docking environment. 14. A method of wireless docking in a dockee for use in a wireless docking system comprising a host and at least one dockee, the host and the dockee arranged for docking via wireless communication, the host arranged for accommodating at least one wireless docking environment and advertising a set of peripherals for making the peripherals available for use in the wireless docking environment, the docking enabling the dockee to use the set of peripherals, the dockee comprising at least one dockee peripheral, the method comprising
docking into the wireless docking environment, advertising the dockee peripheral, and, upon receiving a coupling request from the host, coupling to the host for providing connection data, and allowing control of the dockee peripheral as peripheral by the host for making the dockee peripheral accessible as a further peripheral in the wireless docking environment. 15. (canceled) | A wireless docking system has a host ( 100 ) and at least one dockee ( 120,130,140 ). The host accommodates at least one wireless docking environment including at least one peripheral ( 110,111,112 ). The host has a host communication unit ( 102 ) for providing wireless communication and a host processor ( 101 ) arranged for docking the dockee into the wireless docking environment. The dockee has a dockee communication unit ( 121 ) for providing said wireless communication, and a dockee processor ( 122 ) arranged for docking into the wireless docking environment. The dockee has at least one dockee peripheral ( 123 ). The dockee processor advertises the dockee peripheral, and, upon receiving a coupling request from the host, couples to the host for providing connection data and control of the dockee peripheral by the host. The host processor advertises the set of peripherals including the dockee peripheral for making the dockee peripheral available for use as a further peripheral in the wireless docking environment.1. Wireless docking system comprising a host and at least one dockee, the host and the dockee arranged for docking via wireless communication,
the host arranged for accommodating at least one wireless docking environment and advertising a set of peripherals for making the peripherals available for use in the wireless docking environment, the docking enabling the dockee to use the set of peripherals, the host comprising
a host communication unit for providing said wireless communication,
a host processor arranged for docking the dockee into the wireless docking environment, the dockee comprising
a dockee communication unit for providing said wireless communication,
a dockee processor arranged for docking into the wireless docking environment,
the dockee comprising at least one dockee peripheral internal to the dockee, wherein the dockee processor is arranged for advertising the dockee peripheral, and, upon receiving a coupling request from the host,
coupling to the host for providing connection data, and
allowing control of the dockee peripheral as peripheral by the host, and
the host processor being arranged for
sending the coupling request to the dockee for obtaining the connection data,
taking control of the dockee peripheral as peripheral, and
advertising the set of peripherals including the dockee peripheral for making the dockee peripheral available for use as a further peripheral in the wireless docking environment. 2. The system as claimed in claim 1, wherein the host processor is arranged for setting up a session to the dockee peripheral via said coupling request, and the dockee processor is arranged for providing the control of the dockee peripheral via said session. 3. The system as claimed in claim 1, wherein the dockee processor is arranged for said advertising the dockee peripheral by sending a peripheral capability signal to the host indicative of the dockee peripheral unit being available for coupling as a further peripheral, and the host processor is arranged for discovery of the dockee peripheral by receiving the peripheral capability signal from the dockee. 4. The system as claimed in claim 1, the system comprising a further dockee comprising a further dockee processor arranged for, upon docking into the wireless docking environment, using the dockee peripheral, the host processor arranged for, upon docking the further dockee into the wireless docking environment,
sending a use request to the dockee, the use request indicating that the dockee peripheral is to be used in the wireless docking environment, and accommodating transfer of signals between the dockee peripheral and the further dockee for using the dockee peripheral, the dockee processor arranged for, upon receiving the use request from the host, engaging a use mode of the dockee peripheral and transferring the signals between the dockee peripheral and the further dockee. 5. A dockee for use in a wireless docking system, the dockee arranged for docking via wireless communication, the dockee comprising:
a dockee communication unit for providing said wireless communication, a dockee processor arranged for docking into the wireless docking environment, the dockee comprising at least one dockee peripheral internal to the dockee, wherein the dockee processor is arranged for advertising the dockee peripheral, and, upon receiving a coupling request from the host, coupling to the host for providing connection data, and allowing control of the dockee peripheral as peripheral by the host for making the dockee peripheral accessible as a further peripheral in the wireless docking environment. 6. The dockee as claimed in claim 5, wherein the dockee processor is arranged for
receiving a synchronization command for activating a function of the dockee peripheral at a time as indicated by the synchronization command; and generating a synchronization command for activating a function of at least one peripheral in the wireless docking environment at a time as indicated by the synchronization command. 7. The dockee as claimed in claim 5, wherein the dockee processor is arranged for, upon receiving a coupling request or a use request, determining whether a user of the dockee agrees to allowing control of the dockee peripheral as peripheral by the host. 8. The dockee as claimed in claim 5, wherein the dockee processor is arranged for, when a use mode of the dockee peripheral is engaged, determining whether a user of the dockee requires to use the dockee peripheral, and subsequently limiting or terminating the use of the dockee peripheral as a further peripheral in the wireless docking environment. 9. The dockee as claimed in claim wherein the at least one dockee peripheral comprises at least one of a microphone, a loudspeaker, a camera, a display, a touch screen, a mouse, a keyboard, a communication unit, a light sensor, a temperature sensor, an orientation sensor, a location sensor. 10. A host for use in a wireless docking system, the host arranged for docking via wireless communication and for accommodating at least one wireless docking environment and advertising a set of peripherals for making the peripherals available for use in the wireless docking environment, the host comprising
a host communication unit for providing said wireless communication, a host processor arranged for docking the dockee into the wireless docking environment, wherein the host processor is arranged for sending a coupling request to the dockee for obtaining connection data, taking control of the dockee peripheral as peripheral, and advertising the set of peripherals including the dockee peripheral for making the dockee peripheral available for use as a further peripheral in the wireless docking environment. 11. The host as claimed in claim 10, wherein the host processor is arranged to accommodate a configuration mode in which the wireless docking environment is configurable for making the dockee peripheral available for use as a further peripheral in the wireless docking environment. 12. The host as claimed in claim 11, wherein the host processor is arranged to engage the configuration mode by at least one of
detection of a dockee being docked; a user input via a user interface of the host; a configuration message from the dockee as received by the host. 13. A method of wireless docking in a host for use in a wireless docking system comprising the host and at least one dockee, the host and the dockee arranged for docking via wireless communication, the host arranged for accommodating at least one wireless docking environment and advertising a set of peripherals for making the peripherals available for use in the wireless docking environment, the docking enabling the dockee to use the set of peripherals, the dockee comprising at least one dockee peripheral internal to the dockee, the method comprising
docking the dockee into the wireless docking environment, sending a coupling request to the dockee for obtaining the connection data, and taking control of the dockee peripheral as peripheral, and advertising the set of peripherals including the dockee peripheral for making the dockee peripheral available for use as a further peripheral in the wireless docking environment. 14. A method of wireless docking in a dockee for use in a wireless docking system comprising a host and at least one dockee, the host and the dockee arranged for docking via wireless communication, the host arranged for accommodating at least one wireless docking environment and advertising a set of peripherals for making the peripherals available for use in the wireless docking environment, the docking enabling the dockee to use the set of peripherals, the dockee comprising at least one dockee peripheral, the method comprising
docking into the wireless docking environment, advertising the dockee peripheral, and, upon receiving a coupling request from the host, coupling to the host for providing connection data, and allowing control of the dockee peripheral as peripheral by the host for making the dockee peripheral accessible as a further peripheral in the wireless docking environment. 15. (canceled) | 2,100 |
5,535 | 5,535 | 15,242,614 | 2,198 | The current document is directed to methods and systems that extend cloud-management-facility management from a private data center to infrastructure provided by a remote cloud-computing facility. A remote cloud-management-facility agent is installed within the remote cloud-computing facility to mediate exchange of control and information messages between the cloud-management facility within the private data center and virtual machines executing within the remote cloud-computing facility. The cloud-management-facility agent is connected to the cloud-management facility through a secure tunnel or connection. The cloud-management facility running within the private data center is augmented to include load-discovery functionality and virtual-machine-movement functionality, controlled by policies and parameters specified through an administration-and-management interface to automatically move executing virtual machines back and forth between the private data center and remote cloud-computing facility according to policy-specified goals, considerations, and constraints. | 1. An extended cloud-management facility comprising:
a private data center having multiple servers, one or more internal communications networks, multiple mass-storage devices, and a cloud-management facility that manages the private data center and provides an administration-and-management interface through which management and administration operations and functionalities are accessed; a remote cloud-computing facility having multiple servers, one or more internal communications networks, multiple mass-storage devices, and an interface through which cloud-computing-facility infrastructure and resources are accessed and virtual machines are moved; cloud-management-facility load-discovery and virtual-machine-selection components within the private data center that control automated movement of virtual-machines and applications between the private data center and remote cloud-computing facility; a remote cloud-management-facility agent within the remote cloud-computing facility, and a secure communications connection through which the cloud-management facility communicates with the remote cloud-management-facility agent in order to manage virtual machines moved from the private data center to the remote cloud-computing facility by the cloud-management-facility load-discovery and virtual-machine-selection components. 2. The extended cloud-management facility of claim 1 wherein the administration-and-management interface provided by the cloud-management facility includes input features that control the cloud-management facility to contract for remote computational infrastructure provided by the remote cloud-computing facility. 3. The extended cloud-management facility of claim 1 wherein the load-discovery component periodically determines the computational loads on the private data center, virtual machines and applications executing locally within the private data center, and virtual machines and applications executing remotely within the remote cloud-computing facility. 4. The extended cloud-management facility of claim 3 wherein the computational load on the private data center includes indications of the total amount of computational resources and the amount of computational resources allocated to currently executing virtual machines and virtual appliances. 5. The extended cloud-management facility of claim 1 wherein 4 wherein the computational resources include:
memory,
mass-storage;
internal networking;
external communications bandwidth; and
processor bandwidth. 6. The extended cloud-management facility of claim 3 wherein, after determining the computational loads, the load-discovery component applies load policies to the determined computational load or the private data center in order to determine whether or not to move one or more virtual machines from the private data center to the remote cloud-computing facility or from the remote cloud-computing facility to the private data center. 7. The extended cloud-management facility of claim 6 wherein the load polices are specified through the administration-and-management interface. 8. The extended cloud-management facility of claim 7 wherein the load policies include thresholds and logic statements that determine whether computational loading on private data center is sufficient to justify moving one or more virtual machines to the remote cloud-computing facility. 9. The extended cloud-management facility of claim 7 wherein the load policies include thresholds and logic statements that determine whether computational loading on private data center is sufficiently low to justify moving one or more virtual machines back from the remote cloud-computing facility to the private data center. 10. The extended cloud-management facility of claim 6 wherein, when the load-discovery components determines that one or more virtual machines are to be moved from the private data center to the remote cloud-computing facility, the load-discovery module invokes the virtual-machine-selection component to select one or more virtual machines from the virtual machines currently executing within the private data center for relocation. 11. The extended cloud-management facility of claim 1 wherein the virtual-machine-selection component uses the determined virtual machine loads and application loads, threshold values, and logic statements to identify one or more virtual machines, relocation of which satisfies one or more relocation goals, constraints, and considerations. 12. The extended cloud-management facility of claim 11 wherein the relocation goals include freeing sufficient computational resources within the private data center so that the computational resources available for allocating to newly provisioned virtual machines rises above a threshold level. 13. The extended cloud-management facility of claim 11 wherein the relocation goals include minimizing the cost associated with executing the virtual machines currently provisioned and anticipated to be provisioned by the cloud-computing facility. 14. The extended cloud-management facility of claim 11 wherein relocation goals include minimizing latencies and delays associated with virtual-machine movement between the private data center and the remote cloud-computing facility. 15. The extended cloud-management facility of claim 11 wherein the relocation constraints include avoiding relocating virtual machines associated with security concerns from the private data center to the remote cloud-computing facility. 16. The extended cloud-management facility of claim 11 wherein the relocation considerations include the available computational resources on the private data center, the available computational resources on the remote cloud-computing facility, and changes in computational resources needed by virtual machines when the virtual machines are relocated. 17. A method that expands and contracts the computational resources of a private data center having multiple servers, one or more internal communications networks, multiple mass-storage devices, and a cloud-management facility that manages the private data center and provides an administration-and-management interface through which management and administration operations and functionalities are accessed, the method comprising:
contracting, through the administration-and-management interface, for remote computational resources provided by a remote cloud-computing facility having multiple servers, one or more internal communications networks, multiple mass-storage devices, and an interface through which cloud-computing-facility infrastructure and resources are accessed and virtual machines are moved; periodically monitoring, by a cloud-management-facility load-discovery component, the computational load on the private data center and applying load policies to indications of the current computational load on the private data center; and when application of the load policies to indications of the current computational load on the private data center indicate that one or more virtual machines should be relocated to the remote cloud-computing facility to execute using the contracted for remote computational resources,
selecting one or more virtual machines for relocation by a cloud-management-facility virtual-machine-selection component, and
moving the selected one or more virtual machines through the interface of the remote cloud computing facility through which virtual machines are moved. 18. The method of claim 17 wherein, following relocation of the one or more selected virtual machines to the remote cloud-computing facility, the cloud-management facility communicates with the relocated virtual machines via a secure communications connection established between the cloud-management facility and a remote cloud-management-facility agent within the remote cloud-computing facility. 19. The method of claim 18 wherein the load polices are specified through the administration-and-management interface and wherein the load policies comprise threshold values, and logic statements. 20. A physical data-storage device that stores computer instructions that, when executed by one or more physical processors within a private data center having multiple servers, one or more internal communications networks, multiple mass-storage devices, and a cloud-management facility that manages the private data center and provides an administration-and-management interface through which management and administration operations and functionalities are accessed, control the private data center to
contract, through the administration-and-management interface, for remote computational resources provided by a remote cloud-computing facility having multiple servers, one or more internal communications networks, multiple mass-storage devices, and an interface through which cloud-computing-facility infrastructure and resources are accessed and virtual machines are moved; periodically monitor, by a cloud-management-facility load-discovery component, the computational load on the private data center and applying load policies to indications of the current computational load on the private data center; and when application of the load policies to indications of the current computational load on the private data center indicate that one or more virtual machines should be relocated to the remote cloud-computing facility to execute using the contracted for remote computational resources,
select one or more virtual machines for relocation by a cloud-management-facility virtual-machine-selection component, and
move the selected one or more virtual machines through the interface of the remote cloud computing facility through which virtual machines are moved. | The current document is directed to methods and systems that extend cloud-management-facility management from a private data center to infrastructure provided by a remote cloud-computing facility. A remote cloud-management-facility agent is installed within the remote cloud-computing facility to mediate exchange of control and information messages between the cloud-management facility within the private data center and virtual machines executing within the remote cloud-computing facility. The cloud-management-facility agent is connected to the cloud-management facility through a secure tunnel or connection. The cloud-management facility running within the private data center is augmented to include load-discovery functionality and virtual-machine-movement functionality, controlled by policies and parameters specified through an administration-and-management interface to automatically move executing virtual machines back and forth between the private data center and remote cloud-computing facility according to policy-specified goals, considerations, and constraints.1. An extended cloud-management facility comprising:
a private data center having multiple servers, one or more internal communications networks, multiple mass-storage devices, and a cloud-management facility that manages the private data center and provides an administration-and-management interface through which management and administration operations and functionalities are accessed; a remote cloud-computing facility having multiple servers, one or more internal communications networks, multiple mass-storage devices, and an interface through which cloud-computing-facility infrastructure and resources are accessed and virtual machines are moved; cloud-management-facility load-discovery and virtual-machine-selection components within the private data center that control automated movement of virtual-machines and applications between the private data center and remote cloud-computing facility; a remote cloud-management-facility agent within the remote cloud-computing facility, and a secure communications connection through which the cloud-management facility communicates with the remote cloud-management-facility agent in order to manage virtual machines moved from the private data center to the remote cloud-computing facility by the cloud-management-facility load-discovery and virtual-machine-selection components. 2. The extended cloud-management facility of claim 1 wherein the administration-and-management interface provided by the cloud-management facility includes input features that control the cloud-management facility to contract for remote computational infrastructure provided by the remote cloud-computing facility. 3. The extended cloud-management facility of claim 1 wherein the load-discovery component periodically determines the computational loads on the private data center, virtual machines and applications executing locally within the private data center, and virtual machines and applications executing remotely within the remote cloud-computing facility. 4. The extended cloud-management facility of claim 3 wherein the computational load on the private data center includes indications of the total amount of computational resources and the amount of computational resources allocated to currently executing virtual machines and virtual appliances. 5. The extended cloud-management facility of claim 1 wherein 4 wherein the computational resources include:
memory,
mass-storage;
internal networking;
external communications bandwidth; and
processor bandwidth. 6. The extended cloud-management facility of claim 3 wherein, after determining the computational loads, the load-discovery component applies load policies to the determined computational load or the private data center in order to determine whether or not to move one or more virtual machines from the private data center to the remote cloud-computing facility or from the remote cloud-computing facility to the private data center. 7. The extended cloud-management facility of claim 6 wherein the load polices are specified through the administration-and-management interface. 8. The extended cloud-management facility of claim 7 wherein the load policies include thresholds and logic statements that determine whether computational loading on private data center is sufficient to justify moving one or more virtual machines to the remote cloud-computing facility. 9. The extended cloud-management facility of claim 7 wherein the load policies include thresholds and logic statements that determine whether computational loading on private data center is sufficiently low to justify moving one or more virtual machines back from the remote cloud-computing facility to the private data center. 10. The extended cloud-management facility of claim 6 wherein, when the load-discovery components determines that one or more virtual machines are to be moved from the private data center to the remote cloud-computing facility, the load-discovery module invokes the virtual-machine-selection component to select one or more virtual machines from the virtual machines currently executing within the private data center for relocation. 11. The extended cloud-management facility of claim 1 wherein the virtual-machine-selection component uses the determined virtual machine loads and application loads, threshold values, and logic statements to identify one or more virtual machines, relocation of which satisfies one or more relocation goals, constraints, and considerations. 12. The extended cloud-management facility of claim 11 wherein the relocation goals include freeing sufficient computational resources within the private data center so that the computational resources available for allocating to newly provisioned virtual machines rises above a threshold level. 13. The extended cloud-management facility of claim 11 wherein the relocation goals include minimizing the cost associated with executing the virtual machines currently provisioned and anticipated to be provisioned by the cloud-computing facility. 14. The extended cloud-management facility of claim 11 wherein relocation goals include minimizing latencies and delays associated with virtual-machine movement between the private data center and the remote cloud-computing facility. 15. The extended cloud-management facility of claim 11 wherein the relocation constraints include avoiding relocating virtual machines associated with security concerns from the private data center to the remote cloud-computing facility. 16. The extended cloud-management facility of claim 11 wherein the relocation considerations include the available computational resources on the private data center, the available computational resources on the remote cloud-computing facility, and changes in computational resources needed by virtual machines when the virtual machines are relocated. 17. A method that expands and contracts the computational resources of a private data center having multiple servers, one or more internal communications networks, multiple mass-storage devices, and a cloud-management facility that manages the private data center and provides an administration-and-management interface through which management and administration operations and functionalities are accessed, the method comprising:
contracting, through the administration-and-management interface, for remote computational resources provided by a remote cloud-computing facility having multiple servers, one or more internal communications networks, multiple mass-storage devices, and an interface through which cloud-computing-facility infrastructure and resources are accessed and virtual machines are moved; periodically monitoring, by a cloud-management-facility load-discovery component, the computational load on the private data center and applying load policies to indications of the current computational load on the private data center; and when application of the load policies to indications of the current computational load on the private data center indicate that one or more virtual machines should be relocated to the remote cloud-computing facility to execute using the contracted for remote computational resources,
selecting one or more virtual machines for relocation by a cloud-management-facility virtual-machine-selection component, and
moving the selected one or more virtual machines through the interface of the remote cloud computing facility through which virtual machines are moved. 18. The method of claim 17 wherein, following relocation of the one or more selected virtual machines to the remote cloud-computing facility, the cloud-management facility communicates with the relocated virtual machines via a secure communications connection established between the cloud-management facility and a remote cloud-management-facility agent within the remote cloud-computing facility. 19. The method of claim 18 wherein the load polices are specified through the administration-and-management interface and wherein the load policies comprise threshold values, and logic statements. 20. A physical data-storage device that stores computer instructions that, when executed by one or more physical processors within a private data center having multiple servers, one or more internal communications networks, multiple mass-storage devices, and a cloud-management facility that manages the private data center and provides an administration-and-management interface through which management and administration operations and functionalities are accessed, control the private data center to
contract, through the administration-and-management interface, for remote computational resources provided by a remote cloud-computing facility having multiple servers, one or more internal communications networks, multiple mass-storage devices, and an interface through which cloud-computing-facility infrastructure and resources are accessed and virtual machines are moved; periodically monitor, by a cloud-management-facility load-discovery component, the computational load on the private data center and applying load policies to indications of the current computational load on the private data center; and when application of the load policies to indications of the current computational load on the private data center indicate that one or more virtual machines should be relocated to the remote cloud-computing facility to execute using the contracted for remote computational resources,
select one or more virtual machines for relocation by a cloud-management-facility virtual-machine-selection component, and
move the selected one or more virtual machines through the interface of the remote cloud computing facility through which virtual machines are moved. | 2,100 |
5,536 | 5,536 | 14,549,655 | 2,123 | Mechanisms for generating different lines of questioning based on evaluation of a previous line of questioning are provided. A set of evidential data specifying a plurality of concept entities and input specifying a scenario to be evaluated are received. The scenario specifies a hypothetical link between at least two of the concept entities. A first set of questions corresponding to the at least two information concept entities are evaluated based on the set of evidential data. Based on results of evaluating the first set of questions, a second set of questions is automatically generated to further expand upon and investigate the results of evaluating the first set of questions. The second set of questions are processed and an indication of the scenario and a corresponding measure of support for or against the scenario being a valid scenario is output. | 1. A method, in a data processing system comprising a processor and a memory, for generating different lines of questioning based on evaluation of a previous line of questioning, the method comprising:
receiving, by the data processing system, a set of evidential data specifying a plurality of concept entities; receiving, by the data processing system, input specifying a scenario to be evaluated by the data processing system, wherein the scenario specifies a hypothetical link between at least two of the concept entities; evaluating, by the data processing system, a first set of questions corresponding to the at least two information concept entities based on the set of evidential data; based on results of evaluating the first set of questions, automatically generating, by the data processing system, a second set of questions to further expand upon and investigate the results of evaluating the first set of questions; processing, by the data processing system, the second set of questions based on the set of evidential data; and outputting, by the data processing system, an indication of the scenario and a corresponding measure of support for or against the scenario being a valid scenario involving the at least two concept entities based on results of evaluating the first set of questions and processing the second set of questions. 2. The method of claim 1, wherein the second set of questions is associated with one or more other links related to the hypothetical link. 3. The method of claim 2, wherein the second set of questions are directed to at least one information concept entity different from the at least two information concept entities. 4. The method of claim 1, wherein automatically generating the second set of questions comprises:
identifying at least one of an follow-up information concept entity type that is correlated with an information concept entity type of one of the at least two information concept entities, or a follow-up link type of another link that is correlated with a link type of the hypothetical link; retrieving, from a question template data structure, a set of question templates corresponding to the follow-up information concept entity type or follow-up link type; and generating the second set of questions based on the retrieved set of question templates. 5. The method of claim 4, wherein identifying at least one of the follow-up information concept entity type or follow-up link type comprises using at least one of machine learned or manually input configuration information specifying related information concept entity types and related link types. 6. The method of claim 1, wherein automatically generating the second set of questions is performed in response to the results of evaluating the first set of questions indicating that the hypothetical link has sufficient evidential support to be considered an actual link to be added to an ontology. 7. The method of claim 1, wherein automatically generating the second set of questions comprises evaluating the scenario, a link type of the hypothetical link, and information concept types of the at least two information concept entities to identify other information concept types and link types that are highly related to one or more of the scenario, the hypothetical link, or the at least two information concept entities. 8. 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, causes the data processing system to:
receive a set of evidential data specifying a plurality of concept entities; receive input specifying a scenario to be evaluated by the data processing system, wherein the scenario specifies a hypothetical link between at least two of the concept entities; evaluate a first set of questions corresponding to the at least two information concept entities based on the set of evidential data; based on results of evaluating the first set of questions, automatically generate a second set of questions to further expand upon and investigate the results of evaluating the first set of questions; process the second set of questions based on the set of evidential data; and output an indication of the scenario and a corresponding measure of support for or against the scenario being a valid scenario involving the at least two concept entities based on results of evaluating the first set of questions and processing the second set of questions. 9. The computer program product of claim 8, wherein the second set of questions is associated with one or more other links related to the hypothetical link. 10. The computer program product of claim 9, wherein the second set of questions are directed to at least one information concept entity different from the at least two information concept entities. 11. The computer program product of claim 8, wherein the computer readable program further causes the data processing system to automatically generate the second set of questions at least by:
identifying at least one of an follow-up information concept entity type that is correlated with an information concept entity type of one of the at least two information concept entities, or a follow-up link type of another link that is correlated with a link type of the hypothetical link; retrieving, from a question template data structure, a set of question templates corresponding to the follow-up information concept entity type or follow-up link type; and generating the second set of questions based on the retrieved set of question templates. 12. The computer program product of claim 11, wherein identifying at least one of the follow-up information concept entity type or follow-up link type comprises using at least one of machine learned or manually input configuration information specifying related information concept entity types and related link types. 13. The computer program product of claim 8, wherein the computer readable program further causes the data processing system to automatically generate the second set of questions in response to the results of evaluating the first set of questions indicating that the hypothetical link has sufficient evidential support to be considered an actual link to be added to an ontology. 14. The computer program product of claim 8, wherein the computer readable program further causes the data processing system to automatically generate the second set of questions at least by evaluating the scenario, a link type of the hypothetical link, and information concept types of the at least two information concept entities to identify other information concept types and link types that are highly related to one or more of the scenario, the hypothetical link, or the at least two information concept entities. 15. An apparatus comprising:
a processor; and a memory coupled to the processor, wherein the memory comprises instructions which, when executed by the processor, cause the processor to: receive a set of evidential data specifying a plurality of concept entities; receive input specifying a scenario to be evaluated by the data processing system, wherein the scenario specifies a hypothetical link between at least two of the concept entities; evaluate a first set of questions corresponding to the at least two information concept entities based on the set of evidential data; based on results of evaluating the first set of questions, automatically generate a second set of questions to further expand upon and investigate the results of evaluating the first set of questions; process the second set of questions based on the set of evidential data; and output an indication of the scenario and a corresponding measure of support for or against the scenario being a valid scenario involving the at least two concept entities based on results of evaluating the first set of questions and processing the second set of questions. 16. The apparatus of claim 15, wherein the second set of questions is associated with one or more other links related to the hypothetical link. 17. The apparatus of claim 16, wherein the second set of questions are directed to at least one information concept entity different from the at least two information concept entities. 18. The apparatus of claim 15, wherein the instructions further cause the processor to automatically generate the second set of questions at least by:
identifying at least one of an follow-up information concept entity type that is correlated with an information concept entity type of one of the at least two information concept entities, or a follow-up link type of another link that is correlated with a link type of the hypothetical link; retrieving, from a question template data structure, a set of question templates corresponding to the follow-up information concept entity type or follow-up link type; and generating the second set of questions based on the retrieved set of question templates. 19. The apparatus of claim 18, wherein identifying at least one of the follow-up information concept entity type or follow-up link type comprises using at least one of machine learned or manually input configuration information specifying related information concept entity types and related link types. 20. The apparatus of claim 15, wherein the instructions further cause the processor to automatically generate the second set of questions in response to the results of evaluating the first set of questions indicating that the hypothetical link has sufficient evidential support to be considered an actual link to be added to an ontology. | Mechanisms for generating different lines of questioning based on evaluation of a previous line of questioning are provided. A set of evidential data specifying a plurality of concept entities and input specifying a scenario to be evaluated are received. The scenario specifies a hypothetical link between at least two of the concept entities. A first set of questions corresponding to the at least two information concept entities are evaluated based on the set of evidential data. Based on results of evaluating the first set of questions, a second set of questions is automatically generated to further expand upon and investigate the results of evaluating the first set of questions. The second set of questions are processed and an indication of the scenario and a corresponding measure of support for or against the scenario being a valid scenario is output.1. A method, in a data processing system comprising a processor and a memory, for generating different lines of questioning based on evaluation of a previous line of questioning, the method comprising:
receiving, by the data processing system, a set of evidential data specifying a plurality of concept entities; receiving, by the data processing system, input specifying a scenario to be evaluated by the data processing system, wherein the scenario specifies a hypothetical link between at least two of the concept entities; evaluating, by the data processing system, a first set of questions corresponding to the at least two information concept entities based on the set of evidential data; based on results of evaluating the first set of questions, automatically generating, by the data processing system, a second set of questions to further expand upon and investigate the results of evaluating the first set of questions; processing, by the data processing system, the second set of questions based on the set of evidential data; and outputting, by the data processing system, an indication of the scenario and a corresponding measure of support for or against the scenario being a valid scenario involving the at least two concept entities based on results of evaluating the first set of questions and processing the second set of questions. 2. The method of claim 1, wherein the second set of questions is associated with one or more other links related to the hypothetical link. 3. The method of claim 2, wherein the second set of questions are directed to at least one information concept entity different from the at least two information concept entities. 4. The method of claim 1, wherein automatically generating the second set of questions comprises:
identifying at least one of an follow-up information concept entity type that is correlated with an information concept entity type of one of the at least two information concept entities, or a follow-up link type of another link that is correlated with a link type of the hypothetical link; retrieving, from a question template data structure, a set of question templates corresponding to the follow-up information concept entity type or follow-up link type; and generating the second set of questions based on the retrieved set of question templates. 5. The method of claim 4, wherein identifying at least one of the follow-up information concept entity type or follow-up link type comprises using at least one of machine learned or manually input configuration information specifying related information concept entity types and related link types. 6. The method of claim 1, wherein automatically generating the second set of questions is performed in response to the results of evaluating the first set of questions indicating that the hypothetical link has sufficient evidential support to be considered an actual link to be added to an ontology. 7. The method of claim 1, wherein automatically generating the second set of questions comprises evaluating the scenario, a link type of the hypothetical link, and information concept types of the at least two information concept entities to identify other information concept types and link types that are highly related to one or more of the scenario, the hypothetical link, or the at least two information concept entities. 8. 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, causes the data processing system to:
receive a set of evidential data specifying a plurality of concept entities; receive input specifying a scenario to be evaluated by the data processing system, wherein the scenario specifies a hypothetical link between at least two of the concept entities; evaluate a first set of questions corresponding to the at least two information concept entities based on the set of evidential data; based on results of evaluating the first set of questions, automatically generate a second set of questions to further expand upon and investigate the results of evaluating the first set of questions; process the second set of questions based on the set of evidential data; and output an indication of the scenario and a corresponding measure of support for or against the scenario being a valid scenario involving the at least two concept entities based on results of evaluating the first set of questions and processing the second set of questions. 9. The computer program product of claim 8, wherein the second set of questions is associated with one or more other links related to the hypothetical link. 10. The computer program product of claim 9, wherein the second set of questions are directed to at least one information concept entity different from the at least two information concept entities. 11. The computer program product of claim 8, wherein the computer readable program further causes the data processing system to automatically generate the second set of questions at least by:
identifying at least one of an follow-up information concept entity type that is correlated with an information concept entity type of one of the at least two information concept entities, or a follow-up link type of another link that is correlated with a link type of the hypothetical link; retrieving, from a question template data structure, a set of question templates corresponding to the follow-up information concept entity type or follow-up link type; and generating the second set of questions based on the retrieved set of question templates. 12. The computer program product of claim 11, wherein identifying at least one of the follow-up information concept entity type or follow-up link type comprises using at least one of machine learned or manually input configuration information specifying related information concept entity types and related link types. 13. The computer program product of claim 8, wherein the computer readable program further causes the data processing system to automatically generate the second set of questions in response to the results of evaluating the first set of questions indicating that the hypothetical link has sufficient evidential support to be considered an actual link to be added to an ontology. 14. The computer program product of claim 8, wherein the computer readable program further causes the data processing system to automatically generate the second set of questions at least by evaluating the scenario, a link type of the hypothetical link, and information concept types of the at least two information concept entities to identify other information concept types and link types that are highly related to one or more of the scenario, the hypothetical link, or the at least two information concept entities. 15. An apparatus comprising:
a processor; and a memory coupled to the processor, wherein the memory comprises instructions which, when executed by the processor, cause the processor to: receive a set of evidential data specifying a plurality of concept entities; receive input specifying a scenario to be evaluated by the data processing system, wherein the scenario specifies a hypothetical link between at least two of the concept entities; evaluate a first set of questions corresponding to the at least two information concept entities based on the set of evidential data; based on results of evaluating the first set of questions, automatically generate a second set of questions to further expand upon and investigate the results of evaluating the first set of questions; process the second set of questions based on the set of evidential data; and output an indication of the scenario and a corresponding measure of support for or against the scenario being a valid scenario involving the at least two concept entities based on results of evaluating the first set of questions and processing the second set of questions. 16. The apparatus of claim 15, wherein the second set of questions is associated with one or more other links related to the hypothetical link. 17. The apparatus of claim 16, wherein the second set of questions are directed to at least one information concept entity different from the at least two information concept entities. 18. The apparatus of claim 15, wherein the instructions further cause the processor to automatically generate the second set of questions at least by:
identifying at least one of an follow-up information concept entity type that is correlated with an information concept entity type of one of the at least two information concept entities, or a follow-up link type of another link that is correlated with a link type of the hypothetical link; retrieving, from a question template data structure, a set of question templates corresponding to the follow-up information concept entity type or follow-up link type; and generating the second set of questions based on the retrieved set of question templates. 19. The apparatus of claim 18, wherein identifying at least one of the follow-up information concept entity type or follow-up link type comprises using at least one of machine learned or manually input configuration information specifying related information concept entity types and related link types. 20. The apparatus of claim 15, wherein the instructions further cause the processor to automatically generate the second set of questions in response to the results of evaluating the first set of questions indicating that the hypothetical link has sufficient evidential support to be considered an actual link to be added to an ontology. | 2,100 |
5,537 | 5,537 | 14,664,434 | 2,164 | A storage system is provided. The storage system includes a plurality of storage nodes coupled together as a storage cluster. Each storage node of the plurality of storage nodes has a processor and one or more storage units having solid-state storage memory. At least one storage node of the plurality of storage nodes has a metadata query engine configured to respond to a query regarding metadata in one or more of the plurality of storage nodes. | 1. A storage system, comprising:
a plurality of storage nodes, each having a processor, a plurality of authorities, and at least one storage unit having a first memory configured to hold metadata and a second memory configured to hold user data, wherein each authority owns a range of user data; at least one storage node of the plurality of storage nodes having a metadata query engine:, and the at least one storage node configured to perform a method comprising: receiving, at one of a plurality of storage nodes of the storage system, a query relating to metadata of the storage system; determining which authorities have ownership of ranges of user data to which the query pertains; and distributing the query or portions of the query to the authorities that have ownership of the data, wherein each of the authorities provides access to the metadata of the storage system associated with the query. 2. The storage system of claim 1, further comprising:
the at least one storage node of the plurality of storage nodes configured to transform a portion of the metadata into a relational format from a native storage format, responsive to the query. 3. The storage system of claim 1, further comprising:
the metadata query engine configured to receive the query, store the query, and update contents of a file with results of the query responsive to reading the file. 4. The storage system of claim 1, wherein a response to the query is expressed as a schema defining a structure relating portions of the metadata to one another. 5. The storage system of claim 1, further comprising:
the metadata query engine configured to sort, retrieve and aggregate types of metadata. 6. The storage system of claim 1, further comprising:
the metadata query engine configured to retrieve metadata pertaining to the query, evaluate an expression in the query pertaining to the metadata and return a result of the query. 7. The storage system of claim 1, further comprising:
the metadata query engine configured to perform nested queries on the metadata. 8. The storage system of claim 1, further comprising:
the metadata query engine configured to add, update or delete metadata according to the query. 9. A method for querying a storage system, comprising:
receiving, at one of a plurality of storage nodes of the storage system, a query relating to metadata of the storage system; determining which authorities have ownership of ranges of user data to which the query pertains; and distributing the query or portions of the query to the authorities that have ownership of the data, wherein each of the authorities provides access to the metadata of the storage system associated with the query;. 10. The method of claim 9, further comprising:
striping user data across the plurality of storage nodes of the storage system, wherein the metadata relates to the user data that is striped across the plurality of storage nodes. 11. The method of claim 9, further comprising:
updating a file with a result of the query, wherein the file is available for reading from the storage system. 12. The method of claim 9, further comprising:
at least one of: retrieving, sorting or aggregating a portion of the metadata, responsive to receiving the query. 13. The method of claim 9, further comprising:
accessing metadata pertaining to the query; and evaluating an expression in the query, relative to the metadata, wherein [[the]] a result is based on the evaluating. 14. The method of claim 9, further comprising:
at least one of: adding metadata, updating metadata, or deleting metadata, in accordance with the query. 15. A tangible, non-transitory, computer-readable media having instructions thereupon for a processor of a storage system, which when executed cause the processor to perform a method comprising:
receiving, at one of a plurality of storage nodes of the storage system, a query relating to metadata of the storage system, wherein at least the one of the plurality of storage nodes has a metadata query engine, wherein each of the plurality of storage nodes has a processor, a plurality of authorities, and at least one storage unit having a first memory configured to hold metadata and a second memory configured to hold user data, and wherein each authority owns a range of user data; determining which authorities have ownership of ranges of user data to which the query pertains; and distributing the query or portions thereof to the authorities that have ownership of the data to which the query pertains, wherein each authority provides accesses to the metadata of the storage system and forms a reply to the query or portion thereof. 16. The computer-readable media of claim 15, wherein the method further comprises:
transforming a portion of the metadata from a native storage format into a relational format responsive to the query, wherein the metadata relates to user data that is striped across storage units of the storage cluster. 17. The computer-readable media of claim 15, wherein the method further comprises:
updating a file with the result of the query, responsive to reading the file. 18. The computer-readable media of claim 15, wherein the storage system is housed within a single chassis and wherein the metadata query engine is in a programmable logic device. 19. The computer-readable media of claim 15, wherein each storage node of the plurality of storage nodes includes a plurality of storage units. 20. The computer-readable media of claim 15, wherein each of the storage nodes includes flash memory. | A storage system is provided. The storage system includes a plurality of storage nodes coupled together as a storage cluster. Each storage node of the plurality of storage nodes has a processor and one or more storage units having solid-state storage memory. At least one storage node of the plurality of storage nodes has a metadata query engine configured to respond to a query regarding metadata in one or more of the plurality of storage nodes.1. A storage system, comprising:
a plurality of storage nodes, each having a processor, a plurality of authorities, and at least one storage unit having a first memory configured to hold metadata and a second memory configured to hold user data, wherein each authority owns a range of user data; at least one storage node of the plurality of storage nodes having a metadata query engine:, and the at least one storage node configured to perform a method comprising: receiving, at one of a plurality of storage nodes of the storage system, a query relating to metadata of the storage system; determining which authorities have ownership of ranges of user data to which the query pertains; and distributing the query or portions of the query to the authorities that have ownership of the data, wherein each of the authorities provides access to the metadata of the storage system associated with the query. 2. The storage system of claim 1, further comprising:
the at least one storage node of the plurality of storage nodes configured to transform a portion of the metadata into a relational format from a native storage format, responsive to the query. 3. The storage system of claim 1, further comprising:
the metadata query engine configured to receive the query, store the query, and update contents of a file with results of the query responsive to reading the file. 4. The storage system of claim 1, wherein a response to the query is expressed as a schema defining a structure relating portions of the metadata to one another. 5. The storage system of claim 1, further comprising:
the metadata query engine configured to sort, retrieve and aggregate types of metadata. 6. The storage system of claim 1, further comprising:
the metadata query engine configured to retrieve metadata pertaining to the query, evaluate an expression in the query pertaining to the metadata and return a result of the query. 7. The storage system of claim 1, further comprising:
the metadata query engine configured to perform nested queries on the metadata. 8. The storage system of claim 1, further comprising:
the metadata query engine configured to add, update or delete metadata according to the query. 9. A method for querying a storage system, comprising:
receiving, at one of a plurality of storage nodes of the storage system, a query relating to metadata of the storage system; determining which authorities have ownership of ranges of user data to which the query pertains; and distributing the query or portions of the query to the authorities that have ownership of the data, wherein each of the authorities provides access to the metadata of the storage system associated with the query;. 10. The method of claim 9, further comprising:
striping user data across the plurality of storage nodes of the storage system, wherein the metadata relates to the user data that is striped across the plurality of storage nodes. 11. The method of claim 9, further comprising:
updating a file with a result of the query, wherein the file is available for reading from the storage system. 12. The method of claim 9, further comprising:
at least one of: retrieving, sorting or aggregating a portion of the metadata, responsive to receiving the query. 13. The method of claim 9, further comprising:
accessing metadata pertaining to the query; and evaluating an expression in the query, relative to the metadata, wherein [[the]] a result is based on the evaluating. 14. The method of claim 9, further comprising:
at least one of: adding metadata, updating metadata, or deleting metadata, in accordance with the query. 15. A tangible, non-transitory, computer-readable media having instructions thereupon for a processor of a storage system, which when executed cause the processor to perform a method comprising:
receiving, at one of a plurality of storage nodes of the storage system, a query relating to metadata of the storage system, wherein at least the one of the plurality of storage nodes has a metadata query engine, wherein each of the plurality of storage nodes has a processor, a plurality of authorities, and at least one storage unit having a first memory configured to hold metadata and a second memory configured to hold user data, and wherein each authority owns a range of user data; determining which authorities have ownership of ranges of user data to which the query pertains; and distributing the query or portions thereof to the authorities that have ownership of the data to which the query pertains, wherein each authority provides accesses to the metadata of the storage system and forms a reply to the query or portion thereof. 16. The computer-readable media of claim 15, wherein the method further comprises:
transforming a portion of the metadata from a native storage format into a relational format responsive to the query, wherein the metadata relates to user data that is striped across storage units of the storage cluster. 17. The computer-readable media of claim 15, wherein the method further comprises:
updating a file with the result of the query, responsive to reading the file. 18. The computer-readable media of claim 15, wherein the storage system is housed within a single chassis and wherein the metadata query engine is in a programmable logic device. 19. The computer-readable media of claim 15, wherein each storage node of the plurality of storage nodes includes a plurality of storage units. 20. The computer-readable media of claim 15, wherein each of the storage nodes includes flash memory. | 2,100 |
5,538 | 5,538 | 13,935,303 | 2,139 | The present disclosure includes apparatuses, electronic device readable media, and methods for memory controlled data movement and timing. A number of electronic device readable media can store instructions executable by an electronic device to provide programmable control of data movement operations within a memory. The memory can provide timing control, independent of any associated processor, for interaction between the memory and the associated processor. | 1. A non-transitory electronic device readable medium storing a set of instructions executable by an electronic device to:
provide programmable control of data movement operations within a memory; wherein the memory provides timing control, independent of any associated processor, for interaction between the memory and the associated processor. 2. The medium of claim 1, wherein the instructions to provide programmable control comprise instructions to provide programmable control of data gather operations. 3. The medium of claim 1, wherein the instructions to provide programmable control comprise instructions to provide programmable control of data scatter operations. 4. The medium of claim 1, wherein the instructions to provide programmable control comprise instructions to provide programmable control of a strided data gather/scatter operation. 5. The medium of claim 1, wherein the instructions to provide programmable control comprise instructions to provide programmable control of pointer based gather/scatter operation. 6. A method, comprising:
receiving a request from a requesting device for data stored in memory, wherein the requested data is distributed in the memory; controlling timing of the memory independent of the requesting device; gathering the requested data from the memory; and sending the requested data to the requesting device without sending non-requested data surrounding the requested data. 7. The method of claim 6, wherein:
the requesting device comprises a cache based processor; the requested data is non-contiguously distributed in the memory such that the requested data and the non-requested data surrounding data comprises a plurality of cache line sized portions of data; and sending the requested data comprises sending the requested data in a single cache line sized portion of data. 8. The method of claim 6, wherein the request comprises a direct memory access (DMA) request. 9. The method of claim 6, wherein the requesting device is unaware of a read time associated with the request. 10. The method of claim 6, wherein the method includes, in association with gathering the requested data, providing an indication that locations in the memory where the requested data is stored are unavailable until the requested data is released by the requesting device. 11. The method of claim 6, wherein the method includes, subsequent to sending the requested data to the requesting device:
receiving from the requesting device, modified data corresponding to the requested data; and scattering the modified data in the memory such that the modified data is stored in the same locations in which the requested data was previously stored. 12. A method, comprising:
receiving, by a memory, a request from a requesting device including:
a pointer to a data structure in the memory;
an indication of a number of attributes;
an indication of a list of pointers to be dereferenced; and
a number of conditions and corresponding operations for the request;
examining, by the memory, the data structure according to the pointer, the indication of the number of attributes, and the indication of the list of pointers; and performing, by the memory, an operation of the number of operations in response to a corresponding condition of the number of conditions being met. 13. The method of claim 12, wherein receiving the indication of the list of pointers includes receiving an indication of how many pointers from the list are to be dereferenced. 14. The method of claim 12, wherein examining the data structure comprises dereferencing the list of pointers until an end of the list is reached or until a threshold number of the pointers have been dereferenced. 15. The method of claim 12, wherein the indication of the number of attributes comprises an indication of a number of attributes of data to be gathered by the memory from the data structure and returned to the requesting device. 16. The method of claim 15, wherein receiving the request comprises receiving a search request. 17. The method of claim 15, wherein receiving the request comprises receiving a filter request. 18. The method of claim 12, wherein the indication of the number of attributes comprises an indication of a number of attributes of data to be scattered from the requesting device into the data structure by the memory. 19. The method of claim 12, wherein examining comprises determining whether the data structure referenced by a particular pointer of the list of pointers includes the attribute; and
wherein performing the operation in response to the corresponding condition comprises returning data including the attribute to the requesting device in response to determining that the data structure referenced by the particular pointer includes the attribute. 20. The method of claim 19, wherein the method includes generating, by the memory, a new request cloning the request from the requesting device in response to determining that the data structure referenced by the particular pointer includes the attribute. 21. The method of claim 12, wherein receiving the request including the number of conditions and corresponding operations comprises receiving a request including a particular condition and corresponding operation comprising:
returning data including an attribute of the number of attributes to the requesting device in response to the data matching a set value or search key. 22. The method of claim 12, wherein receiving the request including the number of conditions and corresponding operations comprises receiving a request including a particular condition and corresponding operation comprising:
performing an atomic update of data including an attribute of the number of attributes in response to a match. 23. The method of claim 12, wherein receiving the request including the number of conditions and corresponding operations comprises receiving a request including a particular condition and corresponding operation comprising:
ending operations for the request in response to a remaining number of pointers being a sentinel value or a threshold number of the pointers having been dereferenced. 24. The method of claim 12, wherein the data structure comprises one of the group including a linked list, a tree, and a graph. 25. A method, comprising:
receiving a request from a requesting device for data to be modified, wherein the data is distributed in a data structure in a memory; and originating and performing a data gather operation in the memory based on the data structure in response to receiving the request; originating and performing a data modify operation on the gathered data in the memory; and sending the modified data to the requesting device. 26. The method of claim 25, wherein performing the data modify operation comprises adjusting a value of the gathered data. 27. The method of claim 26, wherein adjusting the value of the gathered data comprises adjusting a value of each unit of the gathered data. 28. The method of claim 25, wherein the method comprises controlling timing of the memory independent of the requesting device. 29. An apparatus, comprising:
memory; and hardware logic coupled to the memory including a logical/physical interface for the memory, wherein the interface is configured to be coupled to a number of processors; wherein the hardware logic is configured to:
provide timing control, independent of the number of processors, for interaction between the memory and the number of processors; and
gather data that is distributed in the memory into a single cache line sized portion of data. 30. The apparatus of claim 29, wherein the logic is configured to receive a single cache line sized portion of updated data and to scatter the updated data to same locations in the memory from which the distributed data was gathered. 31. The apparatus of claim 29, wherein the logic is configured to gather the data in response to receiving a request for the data, wherein the request includes a tag; and
wherein the logic is configured to return the gathered data with the tag. 32. The apparatus of claim 29, wherein the logic is configured to gather the data according to a received base address, a received stride, a received indication of a number of data elements requested, and a received indication of a data element size. 33. The apparatus of claim 29, wherein the apparatus does not include a central memory controller. 34. The apparatus of claim 29, wherein the memory comprises a plurality of memory devices organized into vaults; and
wherein the hardware logic comprises a plurality of logic units each coupled to a respective vault of the plurality of memory devices. 35. The apparatus of claim 29, wherein the interface comprises:
a switch coupled to the hardware logic; and a plurality of links coupled to the switch and configured to be coupled to the number of processors. 36. The apparatus of claim 29, wherein the logic is configured to provide an indication that locations in the memory, from which the data was gathered, are unavailable until the gathered data is released by the number of processors. 37. The apparatus of claim 29, wherein the logic is configured to provide timing control by providing timing control of at least one of a row address strobe (RAS) or a column address strobe (CAS) of the memory. 38. The apparatus of claim 29, wherein the apparatus comprises a hybrid memory cube (HMC). 39. An apparatus, comprising:
a number of cache based processors; a number of main memory devices; and an interface between the number of cache based processors and the number of main memory devices; wherein the number of main memory devices are configured to:
provide timing control of the number of main memory devices; and
traverse a data structure stored in the number of main memory devices independent of an instruction stream from the number of cache based processors. 40. The apparatus of claim 39, wherein the number of cache based processors comprise vector processors;
wherein the number of cache based processors do not provide timing control of the number of main memory devices; wherein the number of cache based processors are configured to provide a request to the number of main memory devices; wherein the request includes a tag to allow for buffering by the number of cache based processors until the number of main memory devices respond to the request. 41. The apparatus of claim 40, wherein the number of main memory devices are configured to traverse the data structure to gather data in response to the request, wherein the request comprises an address based request. 42. The apparatus of claim 40, wherein the number of main memory devices are configured to traverse the data structure to gather data in response to the request, wherein the request comprises an offset based request. | The present disclosure includes apparatuses, electronic device readable media, and methods for memory controlled data movement and timing. A number of electronic device readable media can store instructions executable by an electronic device to provide programmable control of data movement operations within a memory. The memory can provide timing control, independent of any associated processor, for interaction between the memory and the associated processor.1. A non-transitory electronic device readable medium storing a set of instructions executable by an electronic device to:
provide programmable control of data movement operations within a memory; wherein the memory provides timing control, independent of any associated processor, for interaction between the memory and the associated processor. 2. The medium of claim 1, wherein the instructions to provide programmable control comprise instructions to provide programmable control of data gather operations. 3. The medium of claim 1, wherein the instructions to provide programmable control comprise instructions to provide programmable control of data scatter operations. 4. The medium of claim 1, wherein the instructions to provide programmable control comprise instructions to provide programmable control of a strided data gather/scatter operation. 5. The medium of claim 1, wherein the instructions to provide programmable control comprise instructions to provide programmable control of pointer based gather/scatter operation. 6. A method, comprising:
receiving a request from a requesting device for data stored in memory, wherein the requested data is distributed in the memory; controlling timing of the memory independent of the requesting device; gathering the requested data from the memory; and sending the requested data to the requesting device without sending non-requested data surrounding the requested data. 7. The method of claim 6, wherein:
the requesting device comprises a cache based processor; the requested data is non-contiguously distributed in the memory such that the requested data and the non-requested data surrounding data comprises a plurality of cache line sized portions of data; and sending the requested data comprises sending the requested data in a single cache line sized portion of data. 8. The method of claim 6, wherein the request comprises a direct memory access (DMA) request. 9. The method of claim 6, wherein the requesting device is unaware of a read time associated with the request. 10. The method of claim 6, wherein the method includes, in association with gathering the requested data, providing an indication that locations in the memory where the requested data is stored are unavailable until the requested data is released by the requesting device. 11. The method of claim 6, wherein the method includes, subsequent to sending the requested data to the requesting device:
receiving from the requesting device, modified data corresponding to the requested data; and scattering the modified data in the memory such that the modified data is stored in the same locations in which the requested data was previously stored. 12. A method, comprising:
receiving, by a memory, a request from a requesting device including:
a pointer to a data structure in the memory;
an indication of a number of attributes;
an indication of a list of pointers to be dereferenced; and
a number of conditions and corresponding operations for the request;
examining, by the memory, the data structure according to the pointer, the indication of the number of attributes, and the indication of the list of pointers; and performing, by the memory, an operation of the number of operations in response to a corresponding condition of the number of conditions being met. 13. The method of claim 12, wherein receiving the indication of the list of pointers includes receiving an indication of how many pointers from the list are to be dereferenced. 14. The method of claim 12, wherein examining the data structure comprises dereferencing the list of pointers until an end of the list is reached or until a threshold number of the pointers have been dereferenced. 15. The method of claim 12, wherein the indication of the number of attributes comprises an indication of a number of attributes of data to be gathered by the memory from the data structure and returned to the requesting device. 16. The method of claim 15, wherein receiving the request comprises receiving a search request. 17. The method of claim 15, wherein receiving the request comprises receiving a filter request. 18. The method of claim 12, wherein the indication of the number of attributes comprises an indication of a number of attributes of data to be scattered from the requesting device into the data structure by the memory. 19. The method of claim 12, wherein examining comprises determining whether the data structure referenced by a particular pointer of the list of pointers includes the attribute; and
wherein performing the operation in response to the corresponding condition comprises returning data including the attribute to the requesting device in response to determining that the data structure referenced by the particular pointer includes the attribute. 20. The method of claim 19, wherein the method includes generating, by the memory, a new request cloning the request from the requesting device in response to determining that the data structure referenced by the particular pointer includes the attribute. 21. The method of claim 12, wherein receiving the request including the number of conditions and corresponding operations comprises receiving a request including a particular condition and corresponding operation comprising:
returning data including an attribute of the number of attributes to the requesting device in response to the data matching a set value or search key. 22. The method of claim 12, wherein receiving the request including the number of conditions and corresponding operations comprises receiving a request including a particular condition and corresponding operation comprising:
performing an atomic update of data including an attribute of the number of attributes in response to a match. 23. The method of claim 12, wherein receiving the request including the number of conditions and corresponding operations comprises receiving a request including a particular condition and corresponding operation comprising:
ending operations for the request in response to a remaining number of pointers being a sentinel value or a threshold number of the pointers having been dereferenced. 24. The method of claim 12, wherein the data structure comprises one of the group including a linked list, a tree, and a graph. 25. A method, comprising:
receiving a request from a requesting device for data to be modified, wherein the data is distributed in a data structure in a memory; and originating and performing a data gather operation in the memory based on the data structure in response to receiving the request; originating and performing a data modify operation on the gathered data in the memory; and sending the modified data to the requesting device. 26. The method of claim 25, wherein performing the data modify operation comprises adjusting a value of the gathered data. 27. The method of claim 26, wherein adjusting the value of the gathered data comprises adjusting a value of each unit of the gathered data. 28. The method of claim 25, wherein the method comprises controlling timing of the memory independent of the requesting device. 29. An apparatus, comprising:
memory; and hardware logic coupled to the memory including a logical/physical interface for the memory, wherein the interface is configured to be coupled to a number of processors; wherein the hardware logic is configured to:
provide timing control, independent of the number of processors, for interaction between the memory and the number of processors; and
gather data that is distributed in the memory into a single cache line sized portion of data. 30. The apparatus of claim 29, wherein the logic is configured to receive a single cache line sized portion of updated data and to scatter the updated data to same locations in the memory from which the distributed data was gathered. 31. The apparatus of claim 29, wherein the logic is configured to gather the data in response to receiving a request for the data, wherein the request includes a tag; and
wherein the logic is configured to return the gathered data with the tag. 32. The apparatus of claim 29, wherein the logic is configured to gather the data according to a received base address, a received stride, a received indication of a number of data elements requested, and a received indication of a data element size. 33. The apparatus of claim 29, wherein the apparatus does not include a central memory controller. 34. The apparatus of claim 29, wherein the memory comprises a plurality of memory devices organized into vaults; and
wherein the hardware logic comprises a plurality of logic units each coupled to a respective vault of the plurality of memory devices. 35. The apparatus of claim 29, wherein the interface comprises:
a switch coupled to the hardware logic; and a plurality of links coupled to the switch and configured to be coupled to the number of processors. 36. The apparatus of claim 29, wherein the logic is configured to provide an indication that locations in the memory, from which the data was gathered, are unavailable until the gathered data is released by the number of processors. 37. The apparatus of claim 29, wherein the logic is configured to provide timing control by providing timing control of at least one of a row address strobe (RAS) or a column address strobe (CAS) of the memory. 38. The apparatus of claim 29, wherein the apparatus comprises a hybrid memory cube (HMC). 39. An apparatus, comprising:
a number of cache based processors; a number of main memory devices; and an interface between the number of cache based processors and the number of main memory devices; wherein the number of main memory devices are configured to:
provide timing control of the number of main memory devices; and
traverse a data structure stored in the number of main memory devices independent of an instruction stream from the number of cache based processors. 40. The apparatus of claim 39, wherein the number of cache based processors comprise vector processors;
wherein the number of cache based processors do not provide timing control of the number of main memory devices; wherein the number of cache based processors are configured to provide a request to the number of main memory devices; wherein the request includes a tag to allow for buffering by the number of cache based processors until the number of main memory devices respond to the request. 41. The apparatus of claim 40, wherein the number of main memory devices are configured to traverse the data structure to gather data in response to the request, wherein the request comprises an address based request. 42. The apparatus of claim 40, wherein the number of main memory devices are configured to traverse the data structure to gather data in response to the request, wherein the request comprises an offset based request. | 2,100 |
5,539 | 5,539 | 14,610,979 | 2,178 | Techniques for obtaining electronic signatures via word processing applications are described. One approach utilizes a code module, also referred to as a “markup module,” that executes within a word processing application and that facilitates the preparation of a document for electronic signature. A user can operate the word processing application together with the markup module in order to add signature tag markers to the document and to provide recipient information about intended signers, such as names and email addresses. Once the document has been prepared, the code module transmits the document (including the added signature tag markers) and the recipient information to a digital transaction service. The digital transaction service then manages the signing of the document, such as by notifying the recipient, receiving the recipient's signature and securely storing the signature in association with the document. | 1. A system for obtaining an electronic signature, the system comprising:
a digital transaction service; a client device executing a word processing application that is editing a first document, wherein the client device is configured to:
in the word processing application, add a signature tag marker at a location in the first document;
collect recipient information that identifies a first signer via a code module that is provided by the digital transaction service and that is executed by the word processing application; and
transmit the first document and the recipient information from the client device to the digital transaction service; and
wherein the digital transaction service is configured to:
receive the first document from the client device, wherein the first document includes the signature tag marker that was added to the first document by the word processing application;
receive recipient information from the client device; and
obtain an electronic signature from the first signer by:
preparing a second document that is a non-editable version of the first document and that does not include the signature tag marker;
associating a signing tag with a location on the second document that corresponds to the location in the first document; and
transmitting a request to the first signer to sign the second document via the signing tag. 2. The system of claim 1, wherein the word processing application is configured to: present a user interface for the code module within the word processing application, the user interface including controls for providing recipient information and for adding signature tag markers to the first document. 3. The system of claim 1, wherein the word processing application is configured to: transmit the document and the recipient information to the digital transaction service. 4. The system of claim 1, wherein the first document references the code module and is configured to cause the word processing application to load the code module when the first document is opened. 5. The system of claim 1, wherein the signature tag marker is an image embedded in the first document by the word processor application, wherein the word processing application is configured to move and resize the image within the first document. 6. The system of claim 1, wherein the signature tag marker is a button control embedded in the first document by the word processor application, wherein the word processing application is configured to move and resize the button control within the first document. 7. A non-transitory computer-readable medium including contents that are configured, when executed, to perform a method for obtaining an electronic signature via a client device, the method comprising:
in a word processing application executing on the client device, adding a signature tag marker at a location in a first document that is open in and editable by the word processing application; collecting recipient information that identifies a first signer via a code module that is provided by the digital transaction service and that is executed by the word processing application; transmitting to a digital transaction service the first document and the recipient information from the client device; and causing the digital transaction service to obtain an electronic signature. 8. The computer-readable medium of claim 7, wherein the causing the digital transaction service to obtain an electronic signature includes:
causing the digital transaction service to prepare a second document that is a non-editable version of the first document and that does not include the signature tag marker; causing the digital transaction service to associate a signing tag with a location on the second document that corresponds to the location in the first document; and causing the digital transaction service to transmit a request to the first signer to sign the second document via the signing tag. 9. The computer-readable medium of claim 7, further comprising:
receiving, via the code module, an indication to sign the first document by the first signer, wherein the first signer is a user of the word processing application; and transmitting the indication to the digital transaction service, thereby causing the digital transaction service to associate a signature of the user with the second document. 10. The computer-readable medium of claim 7, further comprising: presenting an user interface for the code module within the word processing application, the user interface including controls for providing recipient information and for adding signature tag markers to the first document. 11. The computer-readable medium of claim 7, further comprising: causing, based on a reference to the code module contained within the first document, the word processing application to load and execute the code module. 12. The computer-readable medium of claim 7, wherein the adding a signature tag marker at a location in a first document includes: adding a signature tag marker that directs a user to sign, initial, provide a name and/or provide a date at the first location, wherein the signature tag marker is an image embedded within the first document. 13. The computer-readable medium of claim 7, wherein the collecting recipient information that identifies a first signer includes: receiving an email address for the signer via the code module. 14. The computer-readable medium of claim 7, further comprising dynamically loading the module from the digital transaction service in response to opening the document by the word processing application. 15. A method for obtaining an electronic signature, the method comprising:
receiving from a client device a first document that includes a signature tag marker added at a location of the first document by a word processing application executing on a client device; receiving recipient information from the client device, wherein the recipient information identifies a first signer and is collected via a code module that is provided by the digital transaction service and that is executed by the word processing application; preparing a second document that is a non-editable version of the first document and that does not include the signature tag marker; associating a signing tag with a location on the second document that corresponds to the location in the first document; and transmitting a request to the first signer to sign the second document via the signing tag. 16. The method of claim 15, wherein the receiving from a client device a first document that includes a signature tag marker added at a location of the first document includes: receiving the first document from the code module executed by the word processing application. 17. The method of claim 15, wherein the associating a signing tag with a location on the second document that corresponds to the location in the first document includes:
searching for the signature tag marker within the first document; recording a location of the signature tag marker; removing the signature tag marker from the first document; and producing the second document based on the first document without the signature tag marker, the second document representing contents of first document in a page description language. 18. The method of claim 15, wherein the transmitting a request to the first signer to sign the second document includes: transmitting an email with a link that is operable by a client device to access the second document at the digital transaction service. 19. The method of claim 15, further comprising:
causing the second document and the signing tag to be displayed via a Web-based user interface of a client device of the first signer; receiving, via the Web-based interface, an indication to sign the second document at the signing tag; and associating a signature of the first signer with the second document. 20. The method of claim 15, further comprising:
receiving from the code module an indication of a signature of a user of the word processing application, the indication obtained by the code module; and storing an association of the signature of the user with the second document. | Techniques for obtaining electronic signatures via word processing applications are described. One approach utilizes a code module, also referred to as a “markup module,” that executes within a word processing application and that facilitates the preparation of a document for electronic signature. A user can operate the word processing application together with the markup module in order to add signature tag markers to the document and to provide recipient information about intended signers, such as names and email addresses. Once the document has been prepared, the code module transmits the document (including the added signature tag markers) and the recipient information to a digital transaction service. The digital transaction service then manages the signing of the document, such as by notifying the recipient, receiving the recipient's signature and securely storing the signature in association with the document.1. A system for obtaining an electronic signature, the system comprising:
a digital transaction service; a client device executing a word processing application that is editing a first document, wherein the client device is configured to:
in the word processing application, add a signature tag marker at a location in the first document;
collect recipient information that identifies a first signer via a code module that is provided by the digital transaction service and that is executed by the word processing application; and
transmit the first document and the recipient information from the client device to the digital transaction service; and
wherein the digital transaction service is configured to:
receive the first document from the client device, wherein the first document includes the signature tag marker that was added to the first document by the word processing application;
receive recipient information from the client device; and
obtain an electronic signature from the first signer by:
preparing a second document that is a non-editable version of the first document and that does not include the signature tag marker;
associating a signing tag with a location on the second document that corresponds to the location in the first document; and
transmitting a request to the first signer to sign the second document via the signing tag. 2. The system of claim 1, wherein the word processing application is configured to: present a user interface for the code module within the word processing application, the user interface including controls for providing recipient information and for adding signature tag markers to the first document. 3. The system of claim 1, wherein the word processing application is configured to: transmit the document and the recipient information to the digital transaction service. 4. The system of claim 1, wherein the first document references the code module and is configured to cause the word processing application to load the code module when the first document is opened. 5. The system of claim 1, wherein the signature tag marker is an image embedded in the first document by the word processor application, wherein the word processing application is configured to move and resize the image within the first document. 6. The system of claim 1, wherein the signature tag marker is a button control embedded in the first document by the word processor application, wherein the word processing application is configured to move and resize the button control within the first document. 7. A non-transitory computer-readable medium including contents that are configured, when executed, to perform a method for obtaining an electronic signature via a client device, the method comprising:
in a word processing application executing on the client device, adding a signature tag marker at a location in a first document that is open in and editable by the word processing application; collecting recipient information that identifies a first signer via a code module that is provided by the digital transaction service and that is executed by the word processing application; transmitting to a digital transaction service the first document and the recipient information from the client device; and causing the digital transaction service to obtain an electronic signature. 8. The computer-readable medium of claim 7, wherein the causing the digital transaction service to obtain an electronic signature includes:
causing the digital transaction service to prepare a second document that is a non-editable version of the first document and that does not include the signature tag marker; causing the digital transaction service to associate a signing tag with a location on the second document that corresponds to the location in the first document; and causing the digital transaction service to transmit a request to the first signer to sign the second document via the signing tag. 9. The computer-readable medium of claim 7, further comprising:
receiving, via the code module, an indication to sign the first document by the first signer, wherein the first signer is a user of the word processing application; and transmitting the indication to the digital transaction service, thereby causing the digital transaction service to associate a signature of the user with the second document. 10. The computer-readable medium of claim 7, further comprising: presenting an user interface for the code module within the word processing application, the user interface including controls for providing recipient information and for adding signature tag markers to the first document. 11. The computer-readable medium of claim 7, further comprising: causing, based on a reference to the code module contained within the first document, the word processing application to load and execute the code module. 12. The computer-readable medium of claim 7, wherein the adding a signature tag marker at a location in a first document includes: adding a signature tag marker that directs a user to sign, initial, provide a name and/or provide a date at the first location, wherein the signature tag marker is an image embedded within the first document. 13. The computer-readable medium of claim 7, wherein the collecting recipient information that identifies a first signer includes: receiving an email address for the signer via the code module. 14. The computer-readable medium of claim 7, further comprising dynamically loading the module from the digital transaction service in response to opening the document by the word processing application. 15. A method for obtaining an electronic signature, the method comprising:
receiving from a client device a first document that includes a signature tag marker added at a location of the first document by a word processing application executing on a client device; receiving recipient information from the client device, wherein the recipient information identifies a first signer and is collected via a code module that is provided by the digital transaction service and that is executed by the word processing application; preparing a second document that is a non-editable version of the first document and that does not include the signature tag marker; associating a signing tag with a location on the second document that corresponds to the location in the first document; and transmitting a request to the first signer to sign the second document via the signing tag. 16. The method of claim 15, wherein the receiving from a client device a first document that includes a signature tag marker added at a location of the first document includes: receiving the first document from the code module executed by the word processing application. 17. The method of claim 15, wherein the associating a signing tag with a location on the second document that corresponds to the location in the first document includes:
searching for the signature tag marker within the first document; recording a location of the signature tag marker; removing the signature tag marker from the first document; and producing the second document based on the first document without the signature tag marker, the second document representing contents of first document in a page description language. 18. The method of claim 15, wherein the transmitting a request to the first signer to sign the second document includes: transmitting an email with a link that is operable by a client device to access the second document at the digital transaction service. 19. The method of claim 15, further comprising:
causing the second document and the signing tag to be displayed via a Web-based user interface of a client device of the first signer; receiving, via the Web-based interface, an indication to sign the second document at the signing tag; and associating a signature of the first signer with the second document. 20. The method of claim 15, further comprising:
receiving from the code module an indication of a signature of a user of the word processing application, the indication obtained by the code module; and storing an association of the signature of the user with the second document. | 2,100 |
5,540 | 5,540 | 13,530,121 | 2,176 | Checking and/or completing for data grids is described such as for grids having rows and columns of cells at least some of which contain data values such as numbers or categories. In various embodiments predictive probability distributions are obtained from an inference engine for one or more of the cells and the predictive probability distributions are used for various tasks such as to suggest values to complete blank cells, highlight cells having outlying values, identify potential errors, suggest corrections to potential errors, identify similarities between cells, identify differences between cells, cluster rows of the data grid, and other tasks. In various embodiments a graphical user interface displays a data grid and provides facilities for completing, error checking/correcting, and analyzing data in the data grid. | 1. A method comprising:
presenting, using a processor, a data grid at a graphical user interface, the data grid comprising cells arranged in rows and columns, at least some of the cells containing data values; for at least one of the cells, obtaining from an inference engine a predictive probability distribution of a value associated with the cell; using the predictive probability distribution to obtain at least one output value selected from: a data value in the data grid which is an outlier with respect to the predictive probability distribution; a data value in the data grid which is likely to be an error; a suggested data value for correcting a data value in the data grid which is likely to be an error; a suggested data value for a cell in the data grid which contains no data value; and presenting, at the graphical user interface, either the at least one output value or an indication the at least one output value is available. 2. A method as claimed in claim 1 comprising receiving user input associated with the at least one output value and, as a result of the user input, either ignoring the at least one output value, modifying the data grid using the at least one output value, or creating a copy of the data grid containing the at least one output value. 3. A method as claimed in claim 1 comprising presenting, at the graphical user interface, certainty information associated with the at least one output value. 4. A method as claimed in claim 1 comprising, when the at least one cell contains no data value, autocompleting the cell by inserting the at least one output value into the cell at the graphical user interface. 5. A method as claimed in claim 3 comprising marking the autocompleted cell at the graphical user interface in order that a user is able to visually identify the autocompleted cell. 6. A method as claimed in claim 3 comprising presenting, at the at least one cell in the graphical user interface, certainty information associated with the at least one output value. 7. A method as claimed in claim 1 comprising, when the at least one cell contains no data value, using the predictive probability distribution to obtain the output value by any one or more of: taking at least one sample from the predictive probability distribution; obtaining at least one statistic describing the predictive probability distribution. 8. A method as claimed in claim 1 comprising, when the at least one cell contains a data value, checking for a discrepancy between the data value of the at least one cell and the predictive probability distribution, and when a discrepancy is found, marking the at least one cell at the graphical user interface in order that a user is able to visually identify a cell with a potential data error or an outlier data value. 9. A method as claimed in claim 8 comprising receiving user input setting a sensitivity and using the sensitivity to find an outlier data value. 10. A method as claimed in claim 1 comprising, when the at least one cell contains a data value, checking for a discrepancy between the data value of the at least one cell and the predictive probability distribution, and when a discrepancy is found using the predictive probability distribution to suggest a correction to the data value of the at least one cell. 11. A method as claimed in claim 10 comprising using the predictive probability distribution to suggest a correction to the data value of the at least one cell and to give a certainty of the suggested correction. 12. A method as claimed in claim 1 comprising, for each of a plurality of the cells, obtaining from an inference engine a predictive probability distribution of a value associated with the cell, using the predictive probability distributions to identify differences or relationships between cells and presenting the identified differences or relationships at the graphical user interface. 13. A method as claimed in claim 1, the output value being a suggested data value for a cell in the data grid which contains no data value, the suggested data value being a categorical value indicating one of a plurality of clusters to which rows of the data grid belong. 14. A method as claimed in claim 1 comprising obtaining the predictive probability distribution from an inference engine which comprises a probabilistic model of the data grid, the model taking into account data value types of the data grid, the data grid having heterogeneous types between at least some of the columns and uniform data value types within columns. 15. A method comprising:
presenting, using a processor, a data grid at a graphical user interface, the data grid comprising cells arranged in rows and columns, at least some of the cells containing data values; for at least one of the cells, obtaining a predictive probability distribution of a value associated with the cell from an inference engine comprising a probabilistic model of the data grid, the model taking into account data value types of the data grid, the data grid having heterogeneous types between at least some of the columns and uniform data value types within columns; using the predictive probability distribution to obtain at least one output value selected from: a data value in the data grid which is an outlier with respect to the predictive probability distribution; a data value in the data grid which is likely to be an error; a suggested data value for correcting a data value in the data grid which is likely to be an error; a suggested data value for a cell in the data grid which contains no data value; and presenting, at the graphical user interface, either the at least one output value or an indication the at least one output value is available. 16. A method as claimed in claim 15 comprising presenting, at the graphical user interface, certainty information associated with the at least one output value. 17. An apparatus comprising:
a graphical user interface arranged to present a data grid comprising cells arranged in rows and columns, at least some of the cells containing data values; an input arranged, for at least one of the cells, to obtain from an inference engine a predictive probability distribution of a value associated with the cell; a data perfector arranged to use the predictive probability distribution to obtain at least one output value selected from: a data value in the data grid which is an outlier with respect to the predictive probability distribution; a data value in the data grid which is likely to be an error; a suggested data value for correcting a data value in the data grid which is likely to be an error; a suggested data value for a cell in the data grid which contains no data value; and the graphical user interface being arranged to present either the at least one output value or an indication the at least one output value is available. 18. An apparatus as claimed in claim 17 the data perfector being arranged to, when the at least one cell contains no data value, autocomplete the cell by inserting the at least one output value into the cell at the graphical user interface. 19. An apparatus as claimed in claim 17 the data perfector being arranged to, when the at least one cell contains a data value, check for a discrepancy between the data value of the at least one cell and the predictive probability distribution, and when a discrepancy is found, mark the at least one cell at the graphical user interface in order that a user is able to visually identify a cell with a potential data error or an outlier data value. 20. An apparatus as claimed in claim 17 the data perfector being at least partially implemented using hardware logic selected from any one or more of: a field-programmable gate array, a program-specific integrated circuit, a program-specific standard product, a system-on-a-chip, a complex programmable logic device. | Checking and/or completing for data grids is described such as for grids having rows and columns of cells at least some of which contain data values such as numbers or categories. In various embodiments predictive probability distributions are obtained from an inference engine for one or more of the cells and the predictive probability distributions are used for various tasks such as to suggest values to complete blank cells, highlight cells having outlying values, identify potential errors, suggest corrections to potential errors, identify similarities between cells, identify differences between cells, cluster rows of the data grid, and other tasks. In various embodiments a graphical user interface displays a data grid and provides facilities for completing, error checking/correcting, and analyzing data in the data grid.1. A method comprising:
presenting, using a processor, a data grid at a graphical user interface, the data grid comprising cells arranged in rows and columns, at least some of the cells containing data values; for at least one of the cells, obtaining from an inference engine a predictive probability distribution of a value associated with the cell; using the predictive probability distribution to obtain at least one output value selected from: a data value in the data grid which is an outlier with respect to the predictive probability distribution; a data value in the data grid which is likely to be an error; a suggested data value for correcting a data value in the data grid which is likely to be an error; a suggested data value for a cell in the data grid which contains no data value; and presenting, at the graphical user interface, either the at least one output value or an indication the at least one output value is available. 2. A method as claimed in claim 1 comprising receiving user input associated with the at least one output value and, as a result of the user input, either ignoring the at least one output value, modifying the data grid using the at least one output value, or creating a copy of the data grid containing the at least one output value. 3. A method as claimed in claim 1 comprising presenting, at the graphical user interface, certainty information associated with the at least one output value. 4. A method as claimed in claim 1 comprising, when the at least one cell contains no data value, autocompleting the cell by inserting the at least one output value into the cell at the graphical user interface. 5. A method as claimed in claim 3 comprising marking the autocompleted cell at the graphical user interface in order that a user is able to visually identify the autocompleted cell. 6. A method as claimed in claim 3 comprising presenting, at the at least one cell in the graphical user interface, certainty information associated with the at least one output value. 7. A method as claimed in claim 1 comprising, when the at least one cell contains no data value, using the predictive probability distribution to obtain the output value by any one or more of: taking at least one sample from the predictive probability distribution; obtaining at least one statistic describing the predictive probability distribution. 8. A method as claimed in claim 1 comprising, when the at least one cell contains a data value, checking for a discrepancy between the data value of the at least one cell and the predictive probability distribution, and when a discrepancy is found, marking the at least one cell at the graphical user interface in order that a user is able to visually identify a cell with a potential data error or an outlier data value. 9. A method as claimed in claim 8 comprising receiving user input setting a sensitivity and using the sensitivity to find an outlier data value. 10. A method as claimed in claim 1 comprising, when the at least one cell contains a data value, checking for a discrepancy between the data value of the at least one cell and the predictive probability distribution, and when a discrepancy is found using the predictive probability distribution to suggest a correction to the data value of the at least one cell. 11. A method as claimed in claim 10 comprising using the predictive probability distribution to suggest a correction to the data value of the at least one cell and to give a certainty of the suggested correction. 12. A method as claimed in claim 1 comprising, for each of a plurality of the cells, obtaining from an inference engine a predictive probability distribution of a value associated with the cell, using the predictive probability distributions to identify differences or relationships between cells and presenting the identified differences or relationships at the graphical user interface. 13. A method as claimed in claim 1, the output value being a suggested data value for a cell in the data grid which contains no data value, the suggested data value being a categorical value indicating one of a plurality of clusters to which rows of the data grid belong. 14. A method as claimed in claim 1 comprising obtaining the predictive probability distribution from an inference engine which comprises a probabilistic model of the data grid, the model taking into account data value types of the data grid, the data grid having heterogeneous types between at least some of the columns and uniform data value types within columns. 15. A method comprising:
presenting, using a processor, a data grid at a graphical user interface, the data grid comprising cells arranged in rows and columns, at least some of the cells containing data values; for at least one of the cells, obtaining a predictive probability distribution of a value associated with the cell from an inference engine comprising a probabilistic model of the data grid, the model taking into account data value types of the data grid, the data grid having heterogeneous types between at least some of the columns and uniform data value types within columns; using the predictive probability distribution to obtain at least one output value selected from: a data value in the data grid which is an outlier with respect to the predictive probability distribution; a data value in the data grid which is likely to be an error; a suggested data value for correcting a data value in the data grid which is likely to be an error; a suggested data value for a cell in the data grid which contains no data value; and presenting, at the graphical user interface, either the at least one output value or an indication the at least one output value is available. 16. A method as claimed in claim 15 comprising presenting, at the graphical user interface, certainty information associated with the at least one output value. 17. An apparatus comprising:
a graphical user interface arranged to present a data grid comprising cells arranged in rows and columns, at least some of the cells containing data values; an input arranged, for at least one of the cells, to obtain from an inference engine a predictive probability distribution of a value associated with the cell; a data perfector arranged to use the predictive probability distribution to obtain at least one output value selected from: a data value in the data grid which is an outlier with respect to the predictive probability distribution; a data value in the data grid which is likely to be an error; a suggested data value for correcting a data value in the data grid which is likely to be an error; a suggested data value for a cell in the data grid which contains no data value; and the graphical user interface being arranged to present either the at least one output value or an indication the at least one output value is available. 18. An apparatus as claimed in claim 17 the data perfector being arranged to, when the at least one cell contains no data value, autocomplete the cell by inserting the at least one output value into the cell at the graphical user interface. 19. An apparatus as claimed in claim 17 the data perfector being arranged to, when the at least one cell contains a data value, check for a discrepancy between the data value of the at least one cell and the predictive probability distribution, and when a discrepancy is found, mark the at least one cell at the graphical user interface in order that a user is able to visually identify a cell with a potential data error or an outlier data value. 20. An apparatus as claimed in claim 17 the data perfector being at least partially implemented using hardware logic selected from any one or more of: a field-programmable gate array, a program-specific integrated circuit, a program-specific standard product, a system-on-a-chip, a complex programmable logic device. | 2,100 |
5,541 | 5,541 | 14,187,290 | 2,136 | Nonvolatile memory (e.g., flash memory, solid-state disk) is included on memory modules that are on a DRAM memory channel. Nonvolatile memory residing on a DRAM memory channel may be integrated into the existing file system structures of operating systems. The nonvolatile memory residing on a DRAM memory channel may be presented as part or all of a distributed file system. Requests and/or remote procedure call (RPC) requests, or information associated with requests and/or RPCs, may be routed to the memory modules over the DRAM memory channel in order to service compute and/or distributed file system commands. | 1. A module, comprising:
an interface configured to communicate with a DRAM memory channel; and, non-volatile storage, the module configured to service requests for storage commands using the non-volatile storage on the module, the requests to be received by the module via the DRAM memory channel. 2. The module of claim 1, wherein the requests are RPC requests that originate from a processor not directly connected to the module. 3. The module of claim 1, wherein the storage commands are block I/O storage type device commands. 4. The module of claim 3, further comprising:
a processor to execute a block storage I/O driver that services the block I/O storage type device commands for data stored in the non-volatile storage. 5. The module of claim 4, further comprising:
a solid-state disk controller coupled to provide a block I/O storage interface to the processor for the communication of data stored in the non-volatile storage. 6. The module of claim 5, wherein the block I/O storage interface uses at least one of SCSI commands and ATA commands. 7. The module of claim 2, wherein the RPC requests to be received by the module via the DRAM memory channel are communicated to the module via memory write transaction of the DRAM memory channel that are addressed to a memory space of the module. 8. A module, comprising:
a DRAM memory channel interface to receive procedure calls and procedure data for execution on the module, the procedure calls and the procedure data to be communicated to the module via memory write transactions addressed to a memory space of the module. 9. The module of claim 8, wherein the procedure calls include remote procedure call (RPC) requests. 10. The module of claim 8, wherein the procedure calls and the procedure data implement virtual file system procedure calls. 11. The module of claim 8, further comprising:
non-volatile storage accessed using block I/O storage type device commands. 12. The module of claim 11, wherein said non-volatile storage is accessed using NFS requests communicated to the module via the memory write transactions addressed to the memory space of the module. 13. The module of claim 11, wherein said non-volatile storage is accessed using HDFS requests communicated to the module via the memory write transactions addressed to the memory space of the module. 14. A module comprising:
non-volatile storage; and, a DRAM memory channel interface to receive block I/O storage type device commands, the module to service the block I/O storage type device commands using the non-volatile storage. 15. The module of claim 14, wherein the non-volatile storage is a solid-state disk drive (SSD). 16. The module of claim 14, wherein the block I/O storage type device commands are directed to a disk drive type block I/O storage device. 17. The module of claim 14, wherein a distributed file system is implemented using data stored in the non-volatile memory. | Nonvolatile memory (e.g., flash memory, solid-state disk) is included on memory modules that are on a DRAM memory channel. Nonvolatile memory residing on a DRAM memory channel may be integrated into the existing file system structures of operating systems. The nonvolatile memory residing on a DRAM memory channel may be presented as part or all of a distributed file system. Requests and/or remote procedure call (RPC) requests, or information associated with requests and/or RPCs, may be routed to the memory modules over the DRAM memory channel in order to service compute and/or distributed file system commands.1. A module, comprising:
an interface configured to communicate with a DRAM memory channel; and, non-volatile storage, the module configured to service requests for storage commands using the non-volatile storage on the module, the requests to be received by the module via the DRAM memory channel. 2. The module of claim 1, wherein the requests are RPC requests that originate from a processor not directly connected to the module. 3. The module of claim 1, wherein the storage commands are block I/O storage type device commands. 4. The module of claim 3, further comprising:
a processor to execute a block storage I/O driver that services the block I/O storage type device commands for data stored in the non-volatile storage. 5. The module of claim 4, further comprising:
a solid-state disk controller coupled to provide a block I/O storage interface to the processor for the communication of data stored in the non-volatile storage. 6. The module of claim 5, wherein the block I/O storage interface uses at least one of SCSI commands and ATA commands. 7. The module of claim 2, wherein the RPC requests to be received by the module via the DRAM memory channel are communicated to the module via memory write transaction of the DRAM memory channel that are addressed to a memory space of the module. 8. A module, comprising:
a DRAM memory channel interface to receive procedure calls and procedure data for execution on the module, the procedure calls and the procedure data to be communicated to the module via memory write transactions addressed to a memory space of the module. 9. The module of claim 8, wherein the procedure calls include remote procedure call (RPC) requests. 10. The module of claim 8, wherein the procedure calls and the procedure data implement virtual file system procedure calls. 11. The module of claim 8, further comprising:
non-volatile storage accessed using block I/O storage type device commands. 12. The module of claim 11, wherein said non-volatile storage is accessed using NFS requests communicated to the module via the memory write transactions addressed to the memory space of the module. 13. The module of claim 11, wherein said non-volatile storage is accessed using HDFS requests communicated to the module via the memory write transactions addressed to the memory space of the module. 14. A module comprising:
non-volatile storage; and, a DRAM memory channel interface to receive block I/O storage type device commands, the module to service the block I/O storage type device commands using the non-volatile storage. 15. The module of claim 14, wherein the non-volatile storage is a solid-state disk drive (SSD). 16. The module of claim 14, wherein the block I/O storage type device commands are directed to a disk drive type block I/O storage device. 17. The module of claim 14, wherein a distributed file system is implemented using data stored in the non-volatile memory. | 2,100 |
5,542 | 5,542 | 15,373,993 | 2,177 | In an example embodiment, a first function is performed on the first document received at first middleware management architecture, causing a change in the status of the first document. The change is logged in a record corresponding to the first document in a memory. Then the first document is sent to a second network via a transmission protocol layer. A notification of a change in the status of the first document within the second layer is received in a layer other than the transmission protocol layer, from the second network. The change in the second network is logged in the record corresponding to the first document in the memory. Information corresponding to the change in the status of the first document at the middleware management architecture and the change in the status of the first document in the second network is reported to the first network. | 1. A system comprising:
at least one processor; a memory; and a middleware management architecture engine stored in the memory and executable by the at least one processor to perform operations comprising: performing a first function on a first document received from a first network, causing a change in the status of the first document, the first document being a file stored at the first network; logging the change in the status of the first document in a record corresponding to the first document in the memory; causing the first document to be sent to a second network via a transmission protocol layer; receiving a notification of a change in status of the first document within the second network; logging the change to the status of the first document in the second network in the record corresponding to the first document in the memory; and causing the reporting, to the first network, of information corresponding to the change in the status of the first document in the middleware management architecture and the change in the status of the first document in the second network. 2. The system of claim 1, further comprising:
an integration layer configured to perform operations comprising: receiving a first communication comprising the first document from the first network; transforming the first communication into a format compatible with the engine; sending the first communication to the middleware management architecture engine; transforming a second communication comprising the first document into a format compatible with the second network; sending the second communication to the second network via a transmission protocol layer; receiving, in a layer other than the transmission protocol layer, from the second network, in a third communication, a notification of a change in status of the first document within the second network; transforming the third communication into a format compatible with the middleware management architecture engine; and sending the third communication to the middleware management architecture engine. 3. The system of claim 2, wherein the integration layer and the middleware management architecture engine are contained within a middleware management architecture. 4. The system of claim 1, further comprising an integration server to perform operations comprising:
receiving a first communication comprising the first document from the first network; transforming the first communication into a format compatible with the middleware management architecture engine; sending the first communication to the middleware management architecture engine; transforming a second communication comprising the first document into a format compatible with the second network; sending the second communication to the second network via a transmission protocol layer; receiving, in a layer other than the transmission protocol layer, from the second network, in a third communication, a notification of a change in status of the first document within the second network; transforming the third communication into a format compatible with the middleware management architecture engine; and sending the third communication to the middleware management architecture engine. 5. The system of claim 1, further comprising a buffer containing a queue, and the first document is sent to the first network by placing the first document in the queue and sending a plurality of document in the queue in a batch mode when the queue becomes full. 6. A method of tracking status of a computerized document through multiple computer networks, the method comprising:
receiving, at a middleware management architecture, a first document from a first network, the first document being a file stored at the first network; performing, at the middleware management architecture, a first function on the first document, causing a change in the status of the first document; logging the change in the status of the first document in a record corresponding to the first document in a memory; sending the first document to a second network via a transmission protocol layer; receiving, in a layer other than the transmission protocol layer, from the second network, a notification of a change in status of the first document within the second network; logging the change to the status of the first document in the second network in the record corresponding to the first document in the memory; and reporting, to the first network, information corresponding to the change in the status of the first document in the middleware management architecture and the change in the status of the first document in the second network. 7. The method of claim 6, further comprising:
sending the first document to a third network via a transmission protocol layer; receiving, in the layer other than the transmission protocol layer, from the second network, a notification of a change in status of the first document within the second network; and logging the change to the status of the first document in the third network in the record corresponding to the first document in the memory. 8. The method of claim 6, wherein the sending of the first document include placing the first document in a queue within a buffer and sending a plurality of document in the queue in a batch mode when the queue becomes full. 9. The method of claim 8, wherein a size of the buffer is larger than a size of the queue. 10. The method of claim 9, further comprising:
examining status updates for the first document to determine whether the first document was successfully sent to the first network; and in response to a determination that the first document was not successfully sent to the first network, placing the first document back in the queue. 11. The method of claim 10, wherein both the queue and buffer sizes are dynamically determined based on network bandwidth. 12. The method of claim 10, wherein both the queue and buffer sizes are dynamically determined based on processing load. 13. The method of claim 12, wherein both the queue and buffer sizes are also dynamically determined based on network bandwidth. 14. A non-transitory machine-readable storage medium comprising instructions, which when implemented by one or more machines, cause the one or more machines to perform operations comprising:
receiving, at a middleware management architecture, a first document from a first network, the first document being a file stored at the first network; performing, at the middleware management architecture, a first function on the first document, causing a change in the status of the first document; logging the change in the status of the first document in a record corresponding to the first document in a memory; sending the first document to a second network via a transmission protocol layer; receiving, in a layer other than the transmission protocol layer, from the second network, a notification of a change in status of the first document within the second network; logging the change to the status of the first document in the second network in the record corresponding to the first document in the memory; and reporting, to the first network, information corresponding to the change in the status of the first document in the middleware management architecture and the change in the status of the first document in the second network. 15. The non-transitory machine-readable storage medium of claim 14, further comprising:
sending the first document to a third network via a transmission protocol layer; receiving, in the layer other than the transmission protocol layer, from the second network, a notification of a change in status of the first document within the second network; and logging the change to the status of the first document in the third network in the record corresponding to the first document in the memory. 16. The non-transitory machine-readable storage medium of claim 14, wherein the sending of the first document include placing the first document in a queue within a buffer and sending a plurality of document in the queue in a batch mode when the queue becomes full. 17. The non-transitory machine-readable storage medium of claim 16, wherein a size of the buffer is larger than a size of the queue. 18. The non-transitory machine-readable storage medium of claim 17, further comprising:
examining status updates for the first document to determine whether the first document was successfully sent to the first network; and in response to a determination that the first document was not successfully sent to the first network, placing the first document back in the queue. 19. The non-transitory machine-readable storage medium of claim 18, wherein both the queue and buffer sizes are dynamically determined based on processing load. 20. The non-transitory machine-readable storage medium of claim 19, wherein both the queue and buffer sizes are also dynamically determined based on network bandwidth. | In an example embodiment, a first function is performed on the first document received at first middleware management architecture, causing a change in the status of the first document. The change is logged in a record corresponding to the first document in a memory. Then the first document is sent to a second network via a transmission protocol layer. A notification of a change in the status of the first document within the second layer is received in a layer other than the transmission protocol layer, from the second network. The change in the second network is logged in the record corresponding to the first document in the memory. Information corresponding to the change in the status of the first document at the middleware management architecture and the change in the status of the first document in the second network is reported to the first network.1. A system comprising:
at least one processor; a memory; and a middleware management architecture engine stored in the memory and executable by the at least one processor to perform operations comprising: performing a first function on a first document received from a first network, causing a change in the status of the first document, the first document being a file stored at the first network; logging the change in the status of the first document in a record corresponding to the first document in the memory; causing the first document to be sent to a second network via a transmission protocol layer; receiving a notification of a change in status of the first document within the second network; logging the change to the status of the first document in the second network in the record corresponding to the first document in the memory; and causing the reporting, to the first network, of information corresponding to the change in the status of the first document in the middleware management architecture and the change in the status of the first document in the second network. 2. The system of claim 1, further comprising:
an integration layer configured to perform operations comprising: receiving a first communication comprising the first document from the first network; transforming the first communication into a format compatible with the engine; sending the first communication to the middleware management architecture engine; transforming a second communication comprising the first document into a format compatible with the second network; sending the second communication to the second network via a transmission protocol layer; receiving, in a layer other than the transmission protocol layer, from the second network, in a third communication, a notification of a change in status of the first document within the second network; transforming the third communication into a format compatible with the middleware management architecture engine; and sending the third communication to the middleware management architecture engine. 3. The system of claim 2, wherein the integration layer and the middleware management architecture engine are contained within a middleware management architecture. 4. The system of claim 1, further comprising an integration server to perform operations comprising:
receiving a first communication comprising the first document from the first network; transforming the first communication into a format compatible with the middleware management architecture engine; sending the first communication to the middleware management architecture engine; transforming a second communication comprising the first document into a format compatible with the second network; sending the second communication to the second network via a transmission protocol layer; receiving, in a layer other than the transmission protocol layer, from the second network, in a third communication, a notification of a change in status of the first document within the second network; transforming the third communication into a format compatible with the middleware management architecture engine; and sending the third communication to the middleware management architecture engine. 5. The system of claim 1, further comprising a buffer containing a queue, and the first document is sent to the first network by placing the first document in the queue and sending a plurality of document in the queue in a batch mode when the queue becomes full. 6. A method of tracking status of a computerized document through multiple computer networks, the method comprising:
receiving, at a middleware management architecture, a first document from a first network, the first document being a file stored at the first network; performing, at the middleware management architecture, a first function on the first document, causing a change in the status of the first document; logging the change in the status of the first document in a record corresponding to the first document in a memory; sending the first document to a second network via a transmission protocol layer; receiving, in a layer other than the transmission protocol layer, from the second network, a notification of a change in status of the first document within the second network; logging the change to the status of the first document in the second network in the record corresponding to the first document in the memory; and reporting, to the first network, information corresponding to the change in the status of the first document in the middleware management architecture and the change in the status of the first document in the second network. 7. The method of claim 6, further comprising:
sending the first document to a third network via a transmission protocol layer; receiving, in the layer other than the transmission protocol layer, from the second network, a notification of a change in status of the first document within the second network; and logging the change to the status of the first document in the third network in the record corresponding to the first document in the memory. 8. The method of claim 6, wherein the sending of the first document include placing the first document in a queue within a buffer and sending a plurality of document in the queue in a batch mode when the queue becomes full. 9. The method of claim 8, wherein a size of the buffer is larger than a size of the queue. 10. The method of claim 9, further comprising:
examining status updates for the first document to determine whether the first document was successfully sent to the first network; and in response to a determination that the first document was not successfully sent to the first network, placing the first document back in the queue. 11. The method of claim 10, wherein both the queue and buffer sizes are dynamically determined based on network bandwidth. 12. The method of claim 10, wherein both the queue and buffer sizes are dynamically determined based on processing load. 13. The method of claim 12, wherein both the queue and buffer sizes are also dynamically determined based on network bandwidth. 14. A non-transitory machine-readable storage medium comprising instructions, which when implemented by one or more machines, cause the one or more machines to perform operations comprising:
receiving, at a middleware management architecture, a first document from a first network, the first document being a file stored at the first network; performing, at the middleware management architecture, a first function on the first document, causing a change in the status of the first document; logging the change in the status of the first document in a record corresponding to the first document in a memory; sending the first document to a second network via a transmission protocol layer; receiving, in a layer other than the transmission protocol layer, from the second network, a notification of a change in status of the first document within the second network; logging the change to the status of the first document in the second network in the record corresponding to the first document in the memory; and reporting, to the first network, information corresponding to the change in the status of the first document in the middleware management architecture and the change in the status of the first document in the second network. 15. The non-transitory machine-readable storage medium of claim 14, further comprising:
sending the first document to a third network via a transmission protocol layer; receiving, in the layer other than the transmission protocol layer, from the second network, a notification of a change in status of the first document within the second network; and logging the change to the status of the first document in the third network in the record corresponding to the first document in the memory. 16. The non-transitory machine-readable storage medium of claim 14, wherein the sending of the first document include placing the first document in a queue within a buffer and sending a plurality of document in the queue in a batch mode when the queue becomes full. 17. The non-transitory machine-readable storage medium of claim 16, wherein a size of the buffer is larger than a size of the queue. 18. The non-transitory machine-readable storage medium of claim 17, further comprising:
examining status updates for the first document to determine whether the first document was successfully sent to the first network; and in response to a determination that the first document was not successfully sent to the first network, placing the first document back in the queue. 19. The non-transitory machine-readable storage medium of claim 18, wherein both the queue and buffer sizes are dynamically determined based on processing load. 20. The non-transitory machine-readable storage medium of claim 19, wherein both the queue and buffer sizes are also dynamically determined based on network bandwidth. | 2,100 |
5,543 | 5,543 | 15,198,881 | 2,164 | In accordance with some embodiments, classification of input/output requests from a database to a storage system may be performed. Each input/output request may be associated with a database class, and each database class may be mapped to a quality of service policy. Thus, quality of service may be enforced such that different data blocks within the storage system of the database may be afforded appropriate quality of service. | 1-20. (canceled) 21. At least one machine accessible storage medium having instructions stored thereon, the instructions when executed on a machine, cause the machine to:
determine that a particular one of a plurality of classes is to be associated with a request for data from a database; assign a tag to the request, wherein the tag identifies the particular class and the particular class corresponds to one or more performance policies specifying performance characteristics to be applied to servicing of the request; and transmit the request with the tag for servicing by a database system, wherein the request is to be serviced by the database system according to the one or more performance policies based on the tag. 22. The storage medium of claim 21, wherein the particular class is based at least in part on a type of system used to implement the database. 23. The storage medium of claim 22, wherein the type of system comprises a server pool. 24. The storage medium of claim 22, the one or more performance policies apply to the type of system. 25. The storage medium of claim 21, wherein the request comprises an input/output (I/O) request. 26. The storage medium of claim 21, wherein the request is received from a particular system and sent to the database system. 27. The storage medium of claim 26, wherein the particular system is remote from the database system. 28. The storage medium of claim 26, wherein the request is received by a database manager, the particular class is determined by the database manager, and the request with the tag are transmitted by the database manager to the database system. 29. The storage medium of claim 28, wherein the database manager is remote from the database system. 30. The storage medium of claim 28, wherein the database manager manages a plurality of database systems. 31. The storage medium of claim 21, wherein the particular class corresponds to one or more performance policies identifying the performance characteristics. 32. The storage medium of claim 31, wherein the one or more performance policies comprise one of a fast write policy, low latency policy, and high bandwidth policy. 33. The storage medium of claim 21, wherein the instructions when executed further cause the machine to generate the tag. 34. A method comprising:
receiving, from a particular system, a request for data from a database; determining that a particular one of a plurality of classes is to be associated with the request; determining a tag to the request, wherein the tag identifies the particular class and the particular class corresponds to one or more performance policies specifying performance characteristics to be applied to servicing of the request; and transmitting the request with the tag for servicing by a database system, wherein the request is to be serviced by the database system according to the one or more performance policies based on the tag. 35. The method of claim 34, wherein the particular class is based at least in part on a type of the database system. 36. The method of claim 35, wherein the type of the database system comprises a server pool. 37. The method of claim 35, the one or more performance policies apply to the type of the database system. 38. The method of claim 34, wherein the request comprises an input/output (I/O) request. 39. The method of claim 34, wherein the request is forwarded to the database system with the tag. 40. The method of claim 39, wherein the particular system is remote from the database system. 41. The method of claim 39, wherein the request is received by a database manager, the particular class is determined by the database manager, and the request with the tag are transmitted by the database manager to the database system. 42. The method of claim 41, wherein the database manager is remote from the database system. 43. The method of claim 41, wherein the database manager manages a plurality of database systems. 44. The method of claim 34, wherein the particular class corresponds to one or more performance policies identifying the performance characteristics. 45. The method of claim 44, wherein the one or more performance policies comprise one of a fast write policy, low latency policy, and high bandwidth policy. 46. The method of claim 34, further comprising generating the tag. 47. A database system comprising:
a memory; a processor to execute instructions stored in the memory, the instructions comprising:
receiving a request for data from a database manager, wherein the request comprises a tag;
determining, from the tag, that a particular performance policy is to apply to the request for data; and
generate a response to the request according to the particular performance policy; and
send the response according to the particular performance policy. 48. The database system of claim 47, wherein the database manager is remote from the database system. 49. The database system of claim 47, wherein the tag corresponds to a particular class associated with the database system. 50. The database system of claim 49, wherein the particular class is based at least in part on a type of the database system. 51. The database system of claim 50, wherein the type of the database system comprises a server pool. 52. The database system of claim 51, the one or more performance policies apply to the type of the database system. 53. The database system of claim 47, wherein the request comprises an input/output (I/O) request. 54. The database system of claim 47, wherein the request originates from a host system and is forwarded to the database system with the tag by the database manager. 55. The database system of claim 54, wherein the tag is added to the request by the database manager. 56. The database system of claim 54, wherein the host system is remote from the database system. 57. The database system of claim 47, wherein the database manager manages a plurality of database systems. 58. A system comprising:
a processor; a database; and a database manager, executable by the processor to:
determine that a particular one of a plurality of classes is to be associated with a request for data from a database;
assign a tag to the request, wherein the tag identifies the particular class and the particular class corresponds to one or more performance policies specifying performance characteristics to be applied to servicing of the request; and
transmit the request with the tag for servicing by a database system, wherein the request is to be serviced by the database system according to the one or more performance policies based on the tag. 59. The system of claim 58, wherein the request is received from a host system remote from the database. 60. The system of claim 58, wherein the database is hosted by a host system remote from a host of the database manager and the database manager manages classification of requests to a plurality of different database host systems. 61. The system of claim 58, wherein the particular class is based at least in part on a type of system used to implement the database. 62. The system of claim 61, wherein the type of system comprises a server pool. 63. The system of claim 61, the one or more performance policies apply to the type of system. 64. The system of claim 58, wherein the request comprises an input/output (I/O) request. 65. The system of claim 58, wherein the particular class corresponds to one or more performance policies identifying the performance characteristics. 66. The system of claim 65, wherein the one or more performance policies comprise one of a fast write policy, low latency policy, and high bandwidth policy. 67. The system of claim 58, wherein the database manager is further executable to generate the tag. | In accordance with some embodiments, classification of input/output requests from a database to a storage system may be performed. Each input/output request may be associated with a database class, and each database class may be mapped to a quality of service policy. Thus, quality of service may be enforced such that different data blocks within the storage system of the database may be afforded appropriate quality of service.1-20. (canceled) 21. At least one machine accessible storage medium having instructions stored thereon, the instructions when executed on a machine, cause the machine to:
determine that a particular one of a plurality of classes is to be associated with a request for data from a database; assign a tag to the request, wherein the tag identifies the particular class and the particular class corresponds to one or more performance policies specifying performance characteristics to be applied to servicing of the request; and transmit the request with the tag for servicing by a database system, wherein the request is to be serviced by the database system according to the one or more performance policies based on the tag. 22. The storage medium of claim 21, wherein the particular class is based at least in part on a type of system used to implement the database. 23. The storage medium of claim 22, wherein the type of system comprises a server pool. 24. The storage medium of claim 22, the one or more performance policies apply to the type of system. 25. The storage medium of claim 21, wherein the request comprises an input/output (I/O) request. 26. The storage medium of claim 21, wherein the request is received from a particular system and sent to the database system. 27. The storage medium of claim 26, wherein the particular system is remote from the database system. 28. The storage medium of claim 26, wherein the request is received by a database manager, the particular class is determined by the database manager, and the request with the tag are transmitted by the database manager to the database system. 29. The storage medium of claim 28, wherein the database manager is remote from the database system. 30. The storage medium of claim 28, wherein the database manager manages a plurality of database systems. 31. The storage medium of claim 21, wherein the particular class corresponds to one or more performance policies identifying the performance characteristics. 32. The storage medium of claim 31, wherein the one or more performance policies comprise one of a fast write policy, low latency policy, and high bandwidth policy. 33. The storage medium of claim 21, wherein the instructions when executed further cause the machine to generate the tag. 34. A method comprising:
receiving, from a particular system, a request for data from a database; determining that a particular one of a plurality of classes is to be associated with the request; determining a tag to the request, wherein the tag identifies the particular class and the particular class corresponds to one or more performance policies specifying performance characteristics to be applied to servicing of the request; and transmitting the request with the tag for servicing by a database system, wherein the request is to be serviced by the database system according to the one or more performance policies based on the tag. 35. The method of claim 34, wherein the particular class is based at least in part on a type of the database system. 36. The method of claim 35, wherein the type of the database system comprises a server pool. 37. The method of claim 35, the one or more performance policies apply to the type of the database system. 38. The method of claim 34, wherein the request comprises an input/output (I/O) request. 39. The method of claim 34, wherein the request is forwarded to the database system with the tag. 40. The method of claim 39, wherein the particular system is remote from the database system. 41. The method of claim 39, wherein the request is received by a database manager, the particular class is determined by the database manager, and the request with the tag are transmitted by the database manager to the database system. 42. The method of claim 41, wherein the database manager is remote from the database system. 43. The method of claim 41, wherein the database manager manages a plurality of database systems. 44. The method of claim 34, wherein the particular class corresponds to one or more performance policies identifying the performance characteristics. 45. The method of claim 44, wherein the one or more performance policies comprise one of a fast write policy, low latency policy, and high bandwidth policy. 46. The method of claim 34, further comprising generating the tag. 47. A database system comprising:
a memory; a processor to execute instructions stored in the memory, the instructions comprising:
receiving a request for data from a database manager, wherein the request comprises a tag;
determining, from the tag, that a particular performance policy is to apply to the request for data; and
generate a response to the request according to the particular performance policy; and
send the response according to the particular performance policy. 48. The database system of claim 47, wherein the database manager is remote from the database system. 49. The database system of claim 47, wherein the tag corresponds to a particular class associated with the database system. 50. The database system of claim 49, wherein the particular class is based at least in part on a type of the database system. 51. The database system of claim 50, wherein the type of the database system comprises a server pool. 52. The database system of claim 51, the one or more performance policies apply to the type of the database system. 53. The database system of claim 47, wherein the request comprises an input/output (I/O) request. 54. The database system of claim 47, wherein the request originates from a host system and is forwarded to the database system with the tag by the database manager. 55. The database system of claim 54, wherein the tag is added to the request by the database manager. 56. The database system of claim 54, wherein the host system is remote from the database system. 57. The database system of claim 47, wherein the database manager manages a plurality of database systems. 58. A system comprising:
a processor; a database; and a database manager, executable by the processor to:
determine that a particular one of a plurality of classes is to be associated with a request for data from a database;
assign a tag to the request, wherein the tag identifies the particular class and the particular class corresponds to one or more performance policies specifying performance characteristics to be applied to servicing of the request; and
transmit the request with the tag for servicing by a database system, wherein the request is to be serviced by the database system according to the one or more performance policies based on the tag. 59. The system of claim 58, wherein the request is received from a host system remote from the database. 60. The system of claim 58, wherein the database is hosted by a host system remote from a host of the database manager and the database manager manages classification of requests to a plurality of different database host systems. 61. The system of claim 58, wherein the particular class is based at least in part on a type of system used to implement the database. 62. The system of claim 61, wherein the type of system comprises a server pool. 63. The system of claim 61, the one or more performance policies apply to the type of system. 64. The system of claim 58, wherein the request comprises an input/output (I/O) request. 65. The system of claim 58, wherein the particular class corresponds to one or more performance policies identifying the performance characteristics. 66. The system of claim 65, wherein the one or more performance policies comprise one of a fast write policy, low latency policy, and high bandwidth policy. 67. The system of claim 58, wherein the database manager is further executable to generate the tag. | 2,100 |
5,544 | 5,544 | 15,149,162 | 2,142 | Techniques include receiving a search query from a user of a user device, transmitting the query to a search system, and receiving a search result from the system. The result specifies a first state of a first software application (app), the state associated with a first function performed based on a parameter. The techniques further include displaying a user-selectable link associated with the result, the link configured to, upon being selected, cause the device to set the first software app into the first state. The techniques still further include receiving a user input selecting the link and an app icon displayed at the device from the user, the icon associated with a second software app installed on the device. The techniques also include, in response to receiving the input, setting the second software app into a second state associated with a second function performed based on the parameter. | 1. A method comprising:
receiving, at a user device, a search query from a user; transmitting, using the user device, the search query to a search system; in response to transmitting the search query, receiving, at the user device, a search result from the search system, wherein the search result includes an access uniform resource locator (URL) that specifies a first state of a first software application (app), and wherein the first state is associated with a first function performed based on a parameter; displaying, at the user device, a user-selectable link associated with the search result, wherein the user-selectable link is configured to, upon being selected by a user input, cause the user device to set the first software app into the first state; receiving, at the user device, a user input selecting the user-selectable link and an app icon displayed at the user device from the user, wherein the app icon is associated with a second, different software app installed on the user device; and in response to receiving the user input, setting, using the user device, the second software app into a second, different state associated with a second, different function performed based on the parameter. 2. The method of claim 1, wherein the user input comprises a first user input, the method further comprising:
receiving, at the user device, a second, different user input from the user; and in response to receiving the second user input, storing, using the user device, one or more of the search result and the user-selectable link, wherein setting the second software app into the second state in response to receiving the first user input comprises retrieving, using the user device, the stored one or more of the search result and the user-selectable link. 3. The method of claim 1, wherein the user input selecting the user-selectable link and the app icon comprises the user input selecting the user-selectable link, dragging the user-selectable link toward the app icon, and dropping the user-selectable link onto the app icon. 4. The method of claim 1, wherein the user input selecting the user-selectable link and the app icon comprises the user input substantially simultaneously selecting the user-selectable link and the app icon. 5. The method of claim 1, wherein the user input comprises one or more user interactions with a user menu displayed at the user device, and wherein the one or more user interactions are configured to select the user-selectable link and the app icon. 6. The method of claim 1, wherein the user-selectable link includes a portion associated with the parameter, and wherein the user input selecting the user-selectable link comprises the user input selecting the portion. 7. The method of claim 6, wherein the user input selects the portion of the user-selectable link associated with the parameter, drags the portion toward the app icon, and drops the portion onto the app icon. 8. The method of claim 1, further comprising determining, using the user device, whether the second software app includes the second state. 9. The method of claim 8, wherein determining whether the second software app includes the second state comprises one or more of the following:
performing a search for the second state in a data store associated with the second software app; performing a search for the second state in the second software app executing on the user device; querying an app programming interface (API) associated with the second software app to determine whether the second software app includes the second state; and querying the search system to determine whether the search system includes a state record that specifies the second state. 10. The method of claim 8, further comprising displaying, at the user device, a graphical user interface (GUI) element indicating whether the second software app includes the second state. 11. The method of claim 10, wherein displaying the GUI element comprises:
in the event the second software app includes the second state, displaying a highlighted version of at least one of the user-selectable link and the app icon; and in the event the second software app does not include the second state, displaying an unmodified version of each of the user-selectable link and the app icon. 12. The method of claim 10, wherein displaying the GUI element comprises:
in the event the second software app includes the second state, displaying an unmodified version of each of the user-selectable link and the app icon; and in the event the second software app does not include the second state, displaying a grayed out version of at least one of the user-selectable link and the app icon. 13. The method of claim 10, wherein displaying the GUI element comprises:
in the event the second software app includes the second state, displaying a highlighted version of at least one of the user-selectable link and the app icon; and in the event the second software app does not include the second state, displaying a grayed out version of at least one of the user-selectable link and the app icon. 14. The method of claim 10, wherein displaying the GUI element comprises displaying the GUI element after displaying the user-selectable link and the app icon and otherwise refraining from displaying the GUI element. 15. The method of claim 10, wherein displaying the GUI element comprises displaying the GUI element while receiving the user input and otherwise refraining from displaying the GUI element. 16. The method of claim 1, wherein the access URL comprises a first access URL, and wherein setting the second software app into the second state comprises:
generating a second, different access URL that specifies the second state of the second software app based on the parameter, including inserting the parameter into a field of a template access URL associated with the second software app and configured to include the parameter; and setting the second software app into the second state based on the second access URL. 17. The method of claim 1, wherein the access URL comprises a first access URL, and wherein setting the second software app into the second state comprises:
performing a search within the second software app based on the parameter; in response to performing the search, determining a second, different access URL that specifies the second state of the second software app; and setting the second software app into the second state based on the second access URL. 18. The method of claim 1, wherein the access URL comprises a first access URL, and wherein setting the second software app into the second state comprises:
querying an app programming interface (API) associated with the second software app based on the parameter; in response to querying the API, determining a second, different access URL that specifies the second state of the second software app; and setting the second software app into the second state based on the second access URL. 19. The method of claim 1, wherein the search result comprises a first search result, wherein the access URL comprises a first access URL, and wherein setting the second software app into the second state comprises:
generating a modified version of the search query based on the parameter and an indication of the second software app; transmitting the modified version of the search query to the search system; in response to transmitting the modified version of the search query, receiving a second, different search result from the search system, wherein the second search result includes a second, different access URL that specifies the second state of the second software app; and setting the second software app into the second state based on the second access URL. 20. A computing device comprising:
a network interface component configured to communicate with a network; an input/output (I/O) component configured to receive a search query and a user input from a user of the computing device; a display; one or more memory components configured to store computer-readable instructions; and one or more processing units configured to execute the computer-readable instructions, wherein the computer-readable instructions, when executed by the one or more processing units, cause the one or more processing units to:
receive the search query from the user using the I/O component;
transmit the search query to a search system via the network using the network interface component;
in response to transmitting the search query, receive a search result from the search system via the network using the network interface component, wherein the search result includes an access uniform resource locator (URL) that specifies a first state of a first software application (app), and wherein the first state is associated with a first function performed based on a parameter;
display a user-selectable link associated with the search result using the display, wherein the user-selectable link is configured to, upon being selected by a user input, cause the computing device to set the first software app into the first state;
receive the user input from the user using the I/O component, wherein the user input selects the user-selectable link and an app icon displayed using the display, and wherein the app icon is associated with a second, different software app installed on the computing device; and
in response to receiving the user input, set the second software app into a second, different state associated with a second, different function performed based on the parameter. | Techniques include receiving a search query from a user of a user device, transmitting the query to a search system, and receiving a search result from the system. The result specifies a first state of a first software application (app), the state associated with a first function performed based on a parameter. The techniques further include displaying a user-selectable link associated with the result, the link configured to, upon being selected, cause the device to set the first software app into the first state. The techniques still further include receiving a user input selecting the link and an app icon displayed at the device from the user, the icon associated with a second software app installed on the device. The techniques also include, in response to receiving the input, setting the second software app into a second state associated with a second function performed based on the parameter.1. A method comprising:
receiving, at a user device, a search query from a user; transmitting, using the user device, the search query to a search system; in response to transmitting the search query, receiving, at the user device, a search result from the search system, wherein the search result includes an access uniform resource locator (URL) that specifies a first state of a first software application (app), and wherein the first state is associated with a first function performed based on a parameter; displaying, at the user device, a user-selectable link associated with the search result, wherein the user-selectable link is configured to, upon being selected by a user input, cause the user device to set the first software app into the first state; receiving, at the user device, a user input selecting the user-selectable link and an app icon displayed at the user device from the user, wherein the app icon is associated with a second, different software app installed on the user device; and in response to receiving the user input, setting, using the user device, the second software app into a second, different state associated with a second, different function performed based on the parameter. 2. The method of claim 1, wherein the user input comprises a first user input, the method further comprising:
receiving, at the user device, a second, different user input from the user; and in response to receiving the second user input, storing, using the user device, one or more of the search result and the user-selectable link, wherein setting the second software app into the second state in response to receiving the first user input comprises retrieving, using the user device, the stored one or more of the search result and the user-selectable link. 3. The method of claim 1, wherein the user input selecting the user-selectable link and the app icon comprises the user input selecting the user-selectable link, dragging the user-selectable link toward the app icon, and dropping the user-selectable link onto the app icon. 4. The method of claim 1, wherein the user input selecting the user-selectable link and the app icon comprises the user input substantially simultaneously selecting the user-selectable link and the app icon. 5. The method of claim 1, wherein the user input comprises one or more user interactions with a user menu displayed at the user device, and wherein the one or more user interactions are configured to select the user-selectable link and the app icon. 6. The method of claim 1, wherein the user-selectable link includes a portion associated with the parameter, and wherein the user input selecting the user-selectable link comprises the user input selecting the portion. 7. The method of claim 6, wherein the user input selects the portion of the user-selectable link associated with the parameter, drags the portion toward the app icon, and drops the portion onto the app icon. 8. The method of claim 1, further comprising determining, using the user device, whether the second software app includes the second state. 9. The method of claim 8, wherein determining whether the second software app includes the second state comprises one or more of the following:
performing a search for the second state in a data store associated with the second software app; performing a search for the second state in the second software app executing on the user device; querying an app programming interface (API) associated with the second software app to determine whether the second software app includes the second state; and querying the search system to determine whether the search system includes a state record that specifies the second state. 10. The method of claim 8, further comprising displaying, at the user device, a graphical user interface (GUI) element indicating whether the second software app includes the second state. 11. The method of claim 10, wherein displaying the GUI element comprises:
in the event the second software app includes the second state, displaying a highlighted version of at least one of the user-selectable link and the app icon; and in the event the second software app does not include the second state, displaying an unmodified version of each of the user-selectable link and the app icon. 12. The method of claim 10, wherein displaying the GUI element comprises:
in the event the second software app includes the second state, displaying an unmodified version of each of the user-selectable link and the app icon; and in the event the second software app does not include the second state, displaying a grayed out version of at least one of the user-selectable link and the app icon. 13. The method of claim 10, wherein displaying the GUI element comprises:
in the event the second software app includes the second state, displaying a highlighted version of at least one of the user-selectable link and the app icon; and in the event the second software app does not include the second state, displaying a grayed out version of at least one of the user-selectable link and the app icon. 14. The method of claim 10, wherein displaying the GUI element comprises displaying the GUI element after displaying the user-selectable link and the app icon and otherwise refraining from displaying the GUI element. 15. The method of claim 10, wherein displaying the GUI element comprises displaying the GUI element while receiving the user input and otherwise refraining from displaying the GUI element. 16. The method of claim 1, wherein the access URL comprises a first access URL, and wherein setting the second software app into the second state comprises:
generating a second, different access URL that specifies the second state of the second software app based on the parameter, including inserting the parameter into a field of a template access URL associated with the second software app and configured to include the parameter; and setting the second software app into the second state based on the second access URL. 17. The method of claim 1, wherein the access URL comprises a first access URL, and wherein setting the second software app into the second state comprises:
performing a search within the second software app based on the parameter; in response to performing the search, determining a second, different access URL that specifies the second state of the second software app; and setting the second software app into the second state based on the second access URL. 18. The method of claim 1, wherein the access URL comprises a first access URL, and wherein setting the second software app into the second state comprises:
querying an app programming interface (API) associated with the second software app based on the parameter; in response to querying the API, determining a second, different access URL that specifies the second state of the second software app; and setting the second software app into the second state based on the second access URL. 19. The method of claim 1, wherein the search result comprises a first search result, wherein the access URL comprises a first access URL, and wherein setting the second software app into the second state comprises:
generating a modified version of the search query based on the parameter and an indication of the second software app; transmitting the modified version of the search query to the search system; in response to transmitting the modified version of the search query, receiving a second, different search result from the search system, wherein the second search result includes a second, different access URL that specifies the second state of the second software app; and setting the second software app into the second state based on the second access URL. 20. A computing device comprising:
a network interface component configured to communicate with a network; an input/output (I/O) component configured to receive a search query and a user input from a user of the computing device; a display; one or more memory components configured to store computer-readable instructions; and one or more processing units configured to execute the computer-readable instructions, wherein the computer-readable instructions, when executed by the one or more processing units, cause the one or more processing units to:
receive the search query from the user using the I/O component;
transmit the search query to a search system via the network using the network interface component;
in response to transmitting the search query, receive a search result from the search system via the network using the network interface component, wherein the search result includes an access uniform resource locator (URL) that specifies a first state of a first software application (app), and wherein the first state is associated with a first function performed based on a parameter;
display a user-selectable link associated with the search result using the display, wherein the user-selectable link is configured to, upon being selected by a user input, cause the computing device to set the first software app into the first state;
receive the user input from the user using the I/O component, wherein the user input selects the user-selectable link and an app icon displayed using the display, and wherein the app icon is associated with a second, different software app installed on the computing device; and
in response to receiving the user input, set the second software app into a second, different state associated with a second, different function performed based on the parameter. | 2,100 |
5,545 | 5,545 | 14,977,432 | 2,165 | Systems and methods for assigning scores to objects based on evaluating triggering conditions applied to datasets produced by search queries in data aggregation and analysis systems. An example method may comprise: executing, by one or more processing devices, a search query to produce a dataset comprising one or more data items derived from source data; and responsive to determining that at least a portion of the dataset satisfies a triggering condition, modifying a score assigned to an object to which the portion of the dataset pertains. | 1. A method comprising:
executing, by a computer system, a search query against a set of events, each of the events including time-stamped machine data indicative of performance or operation of an information technology environment; determining, by the computer system, whether at least a portion of a result of the search query satisfies a triggering condition; in response to a determination that at least a portion of the result of the search query satisfies the triggering condition,
identifying, by the computer system, an object that has a predefined association with the search query, for score adjustment, and
adjusting a score of the object, by the computer system; and
causing an output, by the computer system, of the score of the object or an indication of an adjustment of the score of the object. 2. The method of claim 1, further comprising:
prior to executing the search query, receiving user input defining a rule that includes the search query and that further identifies an object whose score is to be modified when at least a portion of a result of the search query satisfies a triggering condition; wherein said executing the search query and said identifying the object are performed based on the rule. 3. The method of claim 1, further comprising:
prior to executing the search query, receiving user input defining a rule that includes: i) the search query, ii) an identification of an object whose score is to be modified when at least a portion of a result of the search query satisfies a triggering condition, and iii) a numerical contribution to be applied to the score of the object based on a determination that the triggering condition is satisfied; wherein said executing the search query and said identifying the object are performed based on the rule, and said adjusting the score of the object is performed based on the numerical contribution. 4. The method of claim 1, further comprising:
prior to executing the search query, receiving user input defining a rule that includes: i) the search query, ii) an identification of an object whose score is to be modified when at least a portion of a result of the search query satisfies a triggering condition, and ii) a numerical contribution to a score of the object; and in response to a determination that at least a portion of the result of the search query satisfies the triggering condition, generating a record of the numerical contribution specified in the rule, the record associating the numerical contribution with a time indicator and indicating the object whose score should be affected by the contribution. 5. The method of claim 1, further comprising:
identifying, from a number of numerical contribution records, a numerical contribution associated with a time indicator that falls within a defined time range. 6. The method of claim 1, wherein execution of the search query triggers application of a schema at a time of execution of the search query. 7. The method of claim 1, wherein the search query is executed by applying a schema, the method further comprising:
extracting data representing a plurality of objects from the set of events, based on the schema. 8. The method of claim 1, wherein the search query is executed by applying a schema, and wherein applying the schema includes applying an extraction rule or a regular expression associated with the schema to unstructured data in an event to derive a value for a field. 9. The method of claim 1, wherein the search query includes a defined time range that limits a scope of the search query. 10. The method of claim 1, wherein the score of the object is identified based on a value of a field in a number of particular events that caused the triggering condition to be satisfied. 11. The method of claim 1, wherein the score of the object is identified based on a type of the object, and wherein the type of the object is at least one of: an entity, an asset, or a user-defined type. 12. The method of claim 1, wherein the score of the object is adjusted further based on the results of the search query. 13. The method of claim 1, wherein an amount by which the score is adjusted is directly correlated to a numerical contribution defined in a rule and a number of the events that caused the triggering condition to be satisfied. 14. The method of claim 1, wherein an amount by which the score is adjusted is proportional to a metric associated with a specified activity. 15. The method of claim 1, wherein the triggering condition includes a value for a field in an event that satisfies a specified criterion in the search query. 16. The method of claim 1, wherein the triggering condition is based on aggregated statistics calculated for a data set returned by the search query. 17. The method of claim 1, wherein the triggering condition includes a threshold number for a number of times that search criteria in the search query have been satisfied. 18. The method of claim 1, wherein said adjusting a score of the object comprises adjusting the score of the object according to a numerical contribution in a user-specified rule, the method further comprising:
creating, in response to a user request, a negative score modifier as the numerical contribution. 19. The method of claim 1, further comprising:
receiving a request to adjust the score of the object by a particular amount. 20. The method of claim 1, further comprising:
receiving a schedule based on which the search query is to be executed. 21. The method of claim 1, further comprising:
causing display of a graphical user interface by which a user can create an object-scoring rule that includes the search query and at least one of: data for identifying the object or a numerical contribution for adjusting the score of the object. 22. The method of claim 1, further comprising:
causing display of object scores for a plurality of objects. 23. The method of claim 1, wherein the object represents at least one of: a component of a networked computer environment, an application running in the networked computer environment, or a person using the component of the networked computer environment. 24. The method of claim 1, wherein the score for the object indicates at least one of: a degree of security risk represented by the object, or a degree of performance of the object. 25. The method of claim 1, wherein at least some events in the set of events are derived from log data. 26. The method of claim 1, wherein at least some events in the set of events are derived from network packet data. 27. The method of claim 1, wherein the score of the object is indicative of a security risk associated with the object, the method further comprising generating an alert when the triggering condition is satisfied. 28. The method of claim 1, wherein the score of the object is indicative of a performance of the object, the method further comprising generating an alert when the triggering condition is satisfied. 29. A non-transitory machine-readable storage medium storing instructions, execution of which by one or more processing devices causes the one or more processing devices to perform operations comprising:
executing a search query against a set of events, each of which includes time-stamped machine data indicative of performance or operation of an information technology environment; determining whether at least a portion of a result of the search query satisfies a triggering condition; in response to a determination that at least a portion of the result of the search query satisfies the triggering condition,
identifying an object that has a predefined association with the search query, for score adjustment, and
adjusting a score of the object; and
causing an output of an indication of the score of the object or an adjustment of the score of the object. 30. A computer system comprising:
a processor; and a storage facility accessible to the processor and containing code that configures the processor to perform operations including:
executing a search query against a set of events, each of which includes time-stamped machine data indicative of performance or operation of an information technology environment;
determining whether at least a portion of a result of the search query satisfies a triggering condition;
in response to a determination that at least a portion of the result of the search query satisfies the triggering condition,
identifying an object that has a predefined association with the search query, for score adjustment, and
adjusting a score of the object; and
causing an output of an indication of the score of the object or an adjustment of the score of the object. | Systems and methods for assigning scores to objects based on evaluating triggering conditions applied to datasets produced by search queries in data aggregation and analysis systems. An example method may comprise: executing, by one or more processing devices, a search query to produce a dataset comprising one or more data items derived from source data; and responsive to determining that at least a portion of the dataset satisfies a triggering condition, modifying a score assigned to an object to which the portion of the dataset pertains.1. A method comprising:
executing, by a computer system, a search query against a set of events, each of the events including time-stamped machine data indicative of performance or operation of an information technology environment; determining, by the computer system, whether at least a portion of a result of the search query satisfies a triggering condition; in response to a determination that at least a portion of the result of the search query satisfies the triggering condition,
identifying, by the computer system, an object that has a predefined association with the search query, for score adjustment, and
adjusting a score of the object, by the computer system; and
causing an output, by the computer system, of the score of the object or an indication of an adjustment of the score of the object. 2. The method of claim 1, further comprising:
prior to executing the search query, receiving user input defining a rule that includes the search query and that further identifies an object whose score is to be modified when at least a portion of a result of the search query satisfies a triggering condition; wherein said executing the search query and said identifying the object are performed based on the rule. 3. The method of claim 1, further comprising:
prior to executing the search query, receiving user input defining a rule that includes: i) the search query, ii) an identification of an object whose score is to be modified when at least a portion of a result of the search query satisfies a triggering condition, and iii) a numerical contribution to be applied to the score of the object based on a determination that the triggering condition is satisfied; wherein said executing the search query and said identifying the object are performed based on the rule, and said adjusting the score of the object is performed based on the numerical contribution. 4. The method of claim 1, further comprising:
prior to executing the search query, receiving user input defining a rule that includes: i) the search query, ii) an identification of an object whose score is to be modified when at least a portion of a result of the search query satisfies a triggering condition, and ii) a numerical contribution to a score of the object; and in response to a determination that at least a portion of the result of the search query satisfies the triggering condition, generating a record of the numerical contribution specified in the rule, the record associating the numerical contribution with a time indicator and indicating the object whose score should be affected by the contribution. 5. The method of claim 1, further comprising:
identifying, from a number of numerical contribution records, a numerical contribution associated with a time indicator that falls within a defined time range. 6. The method of claim 1, wherein execution of the search query triggers application of a schema at a time of execution of the search query. 7. The method of claim 1, wherein the search query is executed by applying a schema, the method further comprising:
extracting data representing a plurality of objects from the set of events, based on the schema. 8. The method of claim 1, wherein the search query is executed by applying a schema, and wherein applying the schema includes applying an extraction rule or a regular expression associated with the schema to unstructured data in an event to derive a value for a field. 9. The method of claim 1, wherein the search query includes a defined time range that limits a scope of the search query. 10. The method of claim 1, wherein the score of the object is identified based on a value of a field in a number of particular events that caused the triggering condition to be satisfied. 11. The method of claim 1, wherein the score of the object is identified based on a type of the object, and wherein the type of the object is at least one of: an entity, an asset, or a user-defined type. 12. The method of claim 1, wherein the score of the object is adjusted further based on the results of the search query. 13. The method of claim 1, wherein an amount by which the score is adjusted is directly correlated to a numerical contribution defined in a rule and a number of the events that caused the triggering condition to be satisfied. 14. The method of claim 1, wherein an amount by which the score is adjusted is proportional to a metric associated with a specified activity. 15. The method of claim 1, wherein the triggering condition includes a value for a field in an event that satisfies a specified criterion in the search query. 16. The method of claim 1, wherein the triggering condition is based on aggregated statistics calculated for a data set returned by the search query. 17. The method of claim 1, wherein the triggering condition includes a threshold number for a number of times that search criteria in the search query have been satisfied. 18. The method of claim 1, wherein said adjusting a score of the object comprises adjusting the score of the object according to a numerical contribution in a user-specified rule, the method further comprising:
creating, in response to a user request, a negative score modifier as the numerical contribution. 19. The method of claim 1, further comprising:
receiving a request to adjust the score of the object by a particular amount. 20. The method of claim 1, further comprising:
receiving a schedule based on which the search query is to be executed. 21. The method of claim 1, further comprising:
causing display of a graphical user interface by which a user can create an object-scoring rule that includes the search query and at least one of: data for identifying the object or a numerical contribution for adjusting the score of the object. 22. The method of claim 1, further comprising:
causing display of object scores for a plurality of objects. 23. The method of claim 1, wherein the object represents at least one of: a component of a networked computer environment, an application running in the networked computer environment, or a person using the component of the networked computer environment. 24. The method of claim 1, wherein the score for the object indicates at least one of: a degree of security risk represented by the object, or a degree of performance of the object. 25. The method of claim 1, wherein at least some events in the set of events are derived from log data. 26. The method of claim 1, wherein at least some events in the set of events are derived from network packet data. 27. The method of claim 1, wherein the score of the object is indicative of a security risk associated with the object, the method further comprising generating an alert when the triggering condition is satisfied. 28. The method of claim 1, wherein the score of the object is indicative of a performance of the object, the method further comprising generating an alert when the triggering condition is satisfied. 29. A non-transitory machine-readable storage medium storing instructions, execution of which by one or more processing devices causes the one or more processing devices to perform operations comprising:
executing a search query against a set of events, each of which includes time-stamped machine data indicative of performance or operation of an information technology environment; determining whether at least a portion of a result of the search query satisfies a triggering condition; in response to a determination that at least a portion of the result of the search query satisfies the triggering condition,
identifying an object that has a predefined association with the search query, for score adjustment, and
adjusting a score of the object; and
causing an output of an indication of the score of the object or an adjustment of the score of the object. 30. A computer system comprising:
a processor; and a storage facility accessible to the processor and containing code that configures the processor to perform operations including:
executing a search query against a set of events, each of which includes time-stamped machine data indicative of performance or operation of an information technology environment;
determining whether at least a portion of a result of the search query satisfies a triggering condition;
in response to a determination that at least a portion of the result of the search query satisfies the triggering condition,
identifying an object that has a predefined association with the search query, for score adjustment, and
adjusting a score of the object; and
causing an output of an indication of the score of the object or an adjustment of the score of the object. | 2,100 |
5,546 | 5,546 | 14,993,805 | 2,117 | A system and method for operating a blower motor disposed in an air handling unit is provided. The system and method includes determining a torque limit of the blower motor based at least partially on an operational speed of the blower motor, determining a target torque based at least in part on a target airflow, and operating the blower motor at the torque limit if it is determined that the target torque is greater than the torque limit | 1. A method for operating a blower motor disposed in an air handling unit, the method comprising the steps:
(a) determining a torque limit of the blower motor based at least partially on an operational speed of the blower motor; (b) determining a target torque based at least in part on a target airflow; and (c) operating the blower motor at the torque limit if it is determined that the target torque is greater than the torque limit. 2. The method of claim 1, further comprising (d) operating the blower motor at the target torque if it is determined that the target torque is less than or equal to the torque limit. 3. The method of claim 1, wherein determining the torque limit of the blower motor is based at least in part on at least one of a static pressure value, extrapolating blower motor speed values correlated with blower motor torque values, and receiving at least one torque limit value from a system controller. 4. The method of claim 1, wherein the target airflow includes a target airflow command received from a system controller. 5. The method of claim 1, wherein step (c) further comprises determining a corrected speed of the blower motor. 6. The method of claim 5, further comprising determining a corrected airflow based on at least one of the corrected speed and the torque limit. 7. The method of claim 6, further comprising:
displaying the corrected airflow on a user interface element operably coupled to the air handling unit. 8. An air handler unit comprising:
a blower unit; a motor operably coupled to the blower unit; and a controller in electrical communication with the motor; wherein the controller is configured to:
determine a torque limit of the motor based at least partially on a speed of the motor;
determine a target torque based at least in part on a target airflow; and
operate the motor at the torque limit if it is determined that the target torque is greater than the torque limit. 9. The air handler unit of claim 8, wherein the controller is further configured to operate the motor at the target torque if it is determined that the target torque is less than or equal to the torque limit. 10. The air handler unit of claim 8, wherein the torque limit is based at least in part on at least one of a static pressure value, extrapolating a plurality of blower motor speed values correlated with a plurality of blower motor torque values, and receiving at least one torque limit value from a system controller. 11. The air handler unit of claim 8, wherein the target airflow includes a target airflow command received from a system controller operably coupled to the controller. 12. The air handler unit of claim 8, wherein the controller is further configured to determine a corrected speed when the motor operates at the torque limit. 13. The air handler unit of claim 12, wherein the controller is further configured to determine a corrected airflow based on at least one of the corrected speed and the torque limit. 14. A controller for use within an air handler comprising:
a processor; a memory; and executable software stored in the memory, wherein the executable software determines a torque limit of a motor based at least partially on a speed of the motor, determines a target torque based at least in part on a target airflow, and transmits a torque limit operation signal to the motor causing the motor to operate at the torque limit if it is determined that the target torque is greater than the torque limit. 15. The controller of claim 14, wherein the executable software transmits a target torque operation signal to the motor causing the motor to operate at the target torque if it is determined that the target torque is less than or equal to the torque limit. 16. The controller of claim 14, wherein the torque limit is based at least in part on at least one of a static pressure value, extrapolating a plurality of blower motor speed values correlated with a plurality of blower motor torque values, and receiving at least one torque limit value from a system controller. 17. The controller of claim 14, wherein the target airflow comprises a received target airflow command. 18. The controller of claim 14, wherein the executable software determines a corrected airflow based on at least one of a corrected speed and the torque limit. | A system and method for operating a blower motor disposed in an air handling unit is provided. The system and method includes determining a torque limit of the blower motor based at least partially on an operational speed of the blower motor, determining a target torque based at least in part on a target airflow, and operating the blower motor at the torque limit if it is determined that the target torque is greater than the torque limit1. A method for operating a blower motor disposed in an air handling unit, the method comprising the steps:
(a) determining a torque limit of the blower motor based at least partially on an operational speed of the blower motor; (b) determining a target torque based at least in part on a target airflow; and (c) operating the blower motor at the torque limit if it is determined that the target torque is greater than the torque limit. 2. The method of claim 1, further comprising (d) operating the blower motor at the target torque if it is determined that the target torque is less than or equal to the torque limit. 3. The method of claim 1, wherein determining the torque limit of the blower motor is based at least in part on at least one of a static pressure value, extrapolating blower motor speed values correlated with blower motor torque values, and receiving at least one torque limit value from a system controller. 4. The method of claim 1, wherein the target airflow includes a target airflow command received from a system controller. 5. The method of claim 1, wherein step (c) further comprises determining a corrected speed of the blower motor. 6. The method of claim 5, further comprising determining a corrected airflow based on at least one of the corrected speed and the torque limit. 7. The method of claim 6, further comprising:
displaying the corrected airflow on a user interface element operably coupled to the air handling unit. 8. An air handler unit comprising:
a blower unit; a motor operably coupled to the blower unit; and a controller in electrical communication with the motor; wherein the controller is configured to:
determine a torque limit of the motor based at least partially on a speed of the motor;
determine a target torque based at least in part on a target airflow; and
operate the motor at the torque limit if it is determined that the target torque is greater than the torque limit. 9. The air handler unit of claim 8, wherein the controller is further configured to operate the motor at the target torque if it is determined that the target torque is less than or equal to the torque limit. 10. The air handler unit of claim 8, wherein the torque limit is based at least in part on at least one of a static pressure value, extrapolating a plurality of blower motor speed values correlated with a plurality of blower motor torque values, and receiving at least one torque limit value from a system controller. 11. The air handler unit of claim 8, wherein the target airflow includes a target airflow command received from a system controller operably coupled to the controller. 12. The air handler unit of claim 8, wherein the controller is further configured to determine a corrected speed when the motor operates at the torque limit. 13. The air handler unit of claim 12, wherein the controller is further configured to determine a corrected airflow based on at least one of the corrected speed and the torque limit. 14. A controller for use within an air handler comprising:
a processor; a memory; and executable software stored in the memory, wherein the executable software determines a torque limit of a motor based at least partially on a speed of the motor, determines a target torque based at least in part on a target airflow, and transmits a torque limit operation signal to the motor causing the motor to operate at the torque limit if it is determined that the target torque is greater than the torque limit. 15. The controller of claim 14, wherein the executable software transmits a target torque operation signal to the motor causing the motor to operate at the target torque if it is determined that the target torque is less than or equal to the torque limit. 16. The controller of claim 14, wherein the torque limit is based at least in part on at least one of a static pressure value, extrapolating a plurality of blower motor speed values correlated with a plurality of blower motor torque values, and receiving at least one torque limit value from a system controller. 17. The controller of claim 14, wherein the target airflow comprises a received target airflow command. 18. The controller of claim 14, wherein the executable software determines a corrected airflow based on at least one of a corrected speed and the torque limit. | 2,100 |
5,547 | 5,547 | 15,209,627 | 2,139 | One embodiment of the present invention provides a system for efficiently warming up a cache. During operation, the system determines a cache prediction based on a user request. The cache prediction determines replication data from a database; the replication data is data that is to be replicated in the cache from the database for warming up the cache. The system generates a control signal comprising a replication proportion, which determines the volume of the replication data, for the replication model. The system then stores the replication data prior to receiving a request for the replication data, thereby warming up the cache with the replication data. | 1. A computer-implemented method for efficiently warming up a cache, comprising:
determining, by a computing system, a cache prediction based on a user request, wherein the cache prediction determines replication data from a database, and wherein the replication data is data that is to be replicated in the cache from the database for warming up the cache; generating a control signal comprising a replication proportion for the replication model, wherein the replication proportion determines the volume of the replication data; and storing the replication data prior to receiving a request for the replication data, thereby warming up the cache with the replication data. 2. The method of claim 1, wherein the cache prediction is a data prediction model derived from data requested in the user request. 3. The method of claim 2, wherein the data prediction model predicts hotspot data in the database prior to receiving a request for the hotspot data, wherein the hotspot data is most demanded data in the database. 4. The method of claim 1, further comprising linearly increasing the replication proportion for the replication model. 5. The method of claim 1, further comprising:
determining whether requested data in the user request is available in the cache; in response to determining that requested data is available in the cache, obtaining the requested data from the cache; and in response to determining that requested data is not available in the cache, obtaining the requested data from the database. 6. The method of claim 5, further comprising preventing the requested data from replicating to the cache based on a replication policy. 7. The method of claim 1, further comprising disabling cache warm up for the cache, thereby retaining current content of the cache. 8. A non-transitory computer-readable storage medium storing instructions that when executed by a computer cause the computer to perform a method for efficiently warming up a cache, the method comprising:
determining, by a computing system, a cache prediction based on a user request, wherein the cache prediction determines replication data from a database, and wherein the replication data is data that is to be replicated in the cache from the database for warming up the cache; generating a control signal comprising a replication proportion for the replication model, wherein the replication proportion determines the volume of the replication data; and storing the replication data prior to receiving a request for the replication data, thereby warming up the cache with the replication data. 9. The non-transitory computer-readable storage medium of claim 8, wherein the cache prediction is a data prediction model derived from data requested in the user request. 10. The non-transitory computer-readable storage medium of claim 9, wherein the data prediction model predicts hotspot data in the database prior to receiving a request for the hotspot data, wherein the hotspot data is most demanded data in the database. 11. The non-transitory computer-readable storage medium of claim 8, wherein the method further comprises linearly increasing the replication proportion for the replication model. 12. The non-transitory computer-readable storage medium of claim 8, wherein the method further comprises:
determining whether requested data in the user request is available in the cache; in response to determining that requested data is available in the cache, obtaining the requested data from the cache; and in response to determining that requested data is not available in the cache, obtaining the requested data from the database. 13. The non-transitory computer-readable storage medium of claim 12, wherein the method further comprises preventing the requested data from replicating to the cache based on a replication policy. 14. The non-transitory computer-readable storage medium of claim 8, wherein the method further comprises disabling cache warm up for the cache, thereby retaining current content of the cache. 15. A computing system for efficiently warming up a cache, the computing system comprising:
a processor; and a memory coupled to the processor and storing instructions, which when executed by the processor cause the processor to perform a method, the method comprising:
determining, by a computing system, a cache prediction based on a user request, wherein the cache prediction determines replication data from a database, and wherein the replication data is data that is to be replicated in the cache from the database for warming up the cache;
generating a control signal comprising a replication proportion for the replication model, wherein the replication proportion determines the volume of the replication data; and
storing the replication data prior to receiving a request for the replication data, thereby warming up the cache with the replication data. 16. The computing system of claim 15, wherein the cache prediction is a data prediction model derived from data requested in the user request. 17. The computing system of claim 16, wherein the data prediction model predicts hotspot data in the database prior to receiving a request for the hotspot data, wherein the hotspot data is most demanded data in the database. 18. The computing system of claim 15, wherein the method further comprises linearly increasing the replication proportion for the replication model. 19. The computing system of claim 15, wherein the method further comprises:
determining whether requested data in the user request is available in the cache; in response to determining that requested data is available in the cache, obtaining the requested data from the cache; and in response to determining that requested data is not available in the cache, obtaining the requested data from the database. 20. The computing system of claim 15, wherein the method further comprises disabling cache warm up for the cache, thereby retaining current content of the cache. | One embodiment of the present invention provides a system for efficiently warming up a cache. During operation, the system determines a cache prediction based on a user request. The cache prediction determines replication data from a database; the replication data is data that is to be replicated in the cache from the database for warming up the cache. The system generates a control signal comprising a replication proportion, which determines the volume of the replication data, for the replication model. The system then stores the replication data prior to receiving a request for the replication data, thereby warming up the cache with the replication data.1. A computer-implemented method for efficiently warming up a cache, comprising:
determining, by a computing system, a cache prediction based on a user request, wherein the cache prediction determines replication data from a database, and wherein the replication data is data that is to be replicated in the cache from the database for warming up the cache; generating a control signal comprising a replication proportion for the replication model, wherein the replication proportion determines the volume of the replication data; and storing the replication data prior to receiving a request for the replication data, thereby warming up the cache with the replication data. 2. The method of claim 1, wherein the cache prediction is a data prediction model derived from data requested in the user request. 3. The method of claim 2, wherein the data prediction model predicts hotspot data in the database prior to receiving a request for the hotspot data, wherein the hotspot data is most demanded data in the database. 4. The method of claim 1, further comprising linearly increasing the replication proportion for the replication model. 5. The method of claim 1, further comprising:
determining whether requested data in the user request is available in the cache; in response to determining that requested data is available in the cache, obtaining the requested data from the cache; and in response to determining that requested data is not available in the cache, obtaining the requested data from the database. 6. The method of claim 5, further comprising preventing the requested data from replicating to the cache based on a replication policy. 7. The method of claim 1, further comprising disabling cache warm up for the cache, thereby retaining current content of the cache. 8. A non-transitory computer-readable storage medium storing instructions that when executed by a computer cause the computer to perform a method for efficiently warming up a cache, the method comprising:
determining, by a computing system, a cache prediction based on a user request, wherein the cache prediction determines replication data from a database, and wherein the replication data is data that is to be replicated in the cache from the database for warming up the cache; generating a control signal comprising a replication proportion for the replication model, wherein the replication proportion determines the volume of the replication data; and storing the replication data prior to receiving a request for the replication data, thereby warming up the cache with the replication data. 9. The non-transitory computer-readable storage medium of claim 8, wherein the cache prediction is a data prediction model derived from data requested in the user request. 10. The non-transitory computer-readable storage medium of claim 9, wherein the data prediction model predicts hotspot data in the database prior to receiving a request for the hotspot data, wherein the hotspot data is most demanded data in the database. 11. The non-transitory computer-readable storage medium of claim 8, wherein the method further comprises linearly increasing the replication proportion for the replication model. 12. The non-transitory computer-readable storage medium of claim 8, wherein the method further comprises:
determining whether requested data in the user request is available in the cache; in response to determining that requested data is available in the cache, obtaining the requested data from the cache; and in response to determining that requested data is not available in the cache, obtaining the requested data from the database. 13. The non-transitory computer-readable storage medium of claim 12, wherein the method further comprises preventing the requested data from replicating to the cache based on a replication policy. 14. The non-transitory computer-readable storage medium of claim 8, wherein the method further comprises disabling cache warm up for the cache, thereby retaining current content of the cache. 15. A computing system for efficiently warming up a cache, the computing system comprising:
a processor; and a memory coupled to the processor and storing instructions, which when executed by the processor cause the processor to perform a method, the method comprising:
determining, by a computing system, a cache prediction based on a user request, wherein the cache prediction determines replication data from a database, and wherein the replication data is data that is to be replicated in the cache from the database for warming up the cache;
generating a control signal comprising a replication proportion for the replication model, wherein the replication proportion determines the volume of the replication data; and
storing the replication data prior to receiving a request for the replication data, thereby warming up the cache with the replication data. 16. The computing system of claim 15, wherein the cache prediction is a data prediction model derived from data requested in the user request. 17. The computing system of claim 16, wherein the data prediction model predicts hotspot data in the database prior to receiving a request for the hotspot data, wherein the hotspot data is most demanded data in the database. 18. The computing system of claim 15, wherein the method further comprises linearly increasing the replication proportion for the replication model. 19. The computing system of claim 15, wherein the method further comprises:
determining whether requested data in the user request is available in the cache; in response to determining that requested data is available in the cache, obtaining the requested data from the cache; and in response to determining that requested data is not available in the cache, obtaining the requested data from the database. 20. The computing system of claim 15, wherein the method further comprises disabling cache warm up for the cache, thereby retaining current content of the cache. | 2,100 |
5,548 | 5,548 | 15,463,736 | 2,191 | A method includes establishing a hierarchy of related software object classes according to a service, receiving data from an external process to invoke the service, and organizing the data received from the external process according to the hierarchy. A system includes a graphical user interface on a computing device configured to allow a user to organize a plurality of related software object classes into a hierarchy according to a service, and a service interface on a computing device configured to organize data received from an external service according to the hierarchy to allow the external process to invoke the service. | 1. A method comprising:
providing a service on a network using a server computer; using the server computer, establishing a hierarchy of related software object classes according to the service, wherein the service is provided by object-oriented software that uses the software object classes of the hierarchy; using the server computer, receiving data from n external process to invoke the service; using the server computer, organizing the data received from the external process according to the hierarchy; and, with a graphical user interface, receiving user input specifying a processing order among software object classes in the hierarchy. 2. The method of claim 1, wherein the hierarchy comprises at least one of: a new hierarchy created by a user with the graphical user interface, and an existing hierarchy modified by the user with the graphical user interface. 3. The method of claim 1, wherein establishing the hierarchy further comprises adding at least one software object class to the hierarchy from a plurality of defined software object classes. 4. The method of claim 1, wherein establishing the hierarchy further comprises deleting at least one software object class from the hierarchy. 5. The method of claim 1, wherein establishing the hierarchy further comprises defining dependency relationships between the related software object classes in the hierarchy. 6. The method of claim 1, further comprising performing the service using the data received from the external process that has been organized according to the hierarchy. 7. The method of claim 6, wherein the service comprises at least one of: creating at least one new software object structure component according to the hierarchy, updating at least one existing software object structure according to the hierarchy, deleting at least one existing software object structure according to the hierarchy, at least one operation specific to a certain type of software object, and at least one custom operation defined by the user. 8. The method of claim 6, further comprising communicating a response to the external process from the service. 9. The method of claim 1, wherein organizing data received from the external process according to the hierarchy further comprises mapping portions of the data to specific software object classes in the hierarchy. 10. The method of claim 1, wherein the data is received from the external process in an eXtensible Markup Language (XML) format. 11. The method of claim 1, further comprising performing organizing of data with a service interface which can be reconfigured with a change to the hierarchy without restarting the server computer. 12. A system, comprising:
a graphical user interface on a computing device configured to allow a user to organize a plurality of related software object classes into a hierarchy according to a desired service to be provided by object-oriented software that uses the hierarchy of software object classes, the graphical user interface comprising controls for specifying a processing order among software object classes in said hierarchy; and a service interface on a computing device comprising a server, said service interface configured to organize data received from an external process according to said hierarchy to allow said external process to invoke said service and providing said data organized according to said hierarchy to said service once invoked. 13. The system of claim 12, wherein the hierarchy comprises a new hierarchy created by a user with the graphical user interface. 14. The system of claim 12, wherein the hierarchy comprises an existing hierarchy modified by the user with the graphical user interface. 15. The system of claim 12, wherein said service interface is further configured to provide a response to said external process upon completion of said service. 16. The system of claim 12, wherein the service comprises creating at least one new software object structure component according to the hierarchy. 17. The system of claim 12, wherein the service comprises updating at least one existing software object structure according to the hierarchy. 18. The system of claim 12, wherein e ice comprises deleting at least one existing software object structure according to the hierarchy. 19. The system of claim 12, wherein the service comprises, and at least one custom operation defined by the user. 20. A computer program product comprising a non-transitory, computer-readable storage medium having instructions that, when executed by a server computer, cause the server computer to:
establish a hierarchy of related software object classes according to a service provided by the server computer, wherein the service is provided by object-oriented software that uses the software object classes of the hierarchy; receive data from an external process to invoke the service; organize the data received from the external process according to the hierarchy; and, with a graphical user interface, receive user input specifying a processing order among software object classes in the hierarchy. | A method includes establishing a hierarchy of related software object classes according to a service, receiving data from an external process to invoke the service, and organizing the data received from the external process according to the hierarchy. A system includes a graphical user interface on a computing device configured to allow a user to organize a plurality of related software object classes into a hierarchy according to a service, and a service interface on a computing device configured to organize data received from an external service according to the hierarchy to allow the external process to invoke the service.1. A method comprising:
providing a service on a network using a server computer; using the server computer, establishing a hierarchy of related software object classes according to the service, wherein the service is provided by object-oriented software that uses the software object classes of the hierarchy; using the server computer, receiving data from n external process to invoke the service; using the server computer, organizing the data received from the external process according to the hierarchy; and, with a graphical user interface, receiving user input specifying a processing order among software object classes in the hierarchy. 2. The method of claim 1, wherein the hierarchy comprises at least one of: a new hierarchy created by a user with the graphical user interface, and an existing hierarchy modified by the user with the graphical user interface. 3. The method of claim 1, wherein establishing the hierarchy further comprises adding at least one software object class to the hierarchy from a plurality of defined software object classes. 4. The method of claim 1, wherein establishing the hierarchy further comprises deleting at least one software object class from the hierarchy. 5. The method of claim 1, wherein establishing the hierarchy further comprises defining dependency relationships between the related software object classes in the hierarchy. 6. The method of claim 1, further comprising performing the service using the data received from the external process that has been organized according to the hierarchy. 7. The method of claim 6, wherein the service comprises at least one of: creating at least one new software object structure component according to the hierarchy, updating at least one existing software object structure according to the hierarchy, deleting at least one existing software object structure according to the hierarchy, at least one operation specific to a certain type of software object, and at least one custom operation defined by the user. 8. The method of claim 6, further comprising communicating a response to the external process from the service. 9. The method of claim 1, wherein organizing data received from the external process according to the hierarchy further comprises mapping portions of the data to specific software object classes in the hierarchy. 10. The method of claim 1, wherein the data is received from the external process in an eXtensible Markup Language (XML) format. 11. The method of claim 1, further comprising performing organizing of data with a service interface which can be reconfigured with a change to the hierarchy without restarting the server computer. 12. A system, comprising:
a graphical user interface on a computing device configured to allow a user to organize a plurality of related software object classes into a hierarchy according to a desired service to be provided by object-oriented software that uses the hierarchy of software object classes, the graphical user interface comprising controls for specifying a processing order among software object classes in said hierarchy; and a service interface on a computing device comprising a server, said service interface configured to organize data received from an external process according to said hierarchy to allow said external process to invoke said service and providing said data organized according to said hierarchy to said service once invoked. 13. The system of claim 12, wherein the hierarchy comprises a new hierarchy created by a user with the graphical user interface. 14. The system of claim 12, wherein the hierarchy comprises an existing hierarchy modified by the user with the graphical user interface. 15. The system of claim 12, wherein said service interface is further configured to provide a response to said external process upon completion of said service. 16. The system of claim 12, wherein the service comprises creating at least one new software object structure component according to the hierarchy. 17. The system of claim 12, wherein the service comprises updating at least one existing software object structure according to the hierarchy. 18. The system of claim 12, wherein e ice comprises deleting at least one existing software object structure according to the hierarchy. 19. The system of claim 12, wherein the service comprises, and at least one custom operation defined by the user. 20. A computer program product comprising a non-transitory, computer-readable storage medium having instructions that, when executed by a server computer, cause the server computer to:
establish a hierarchy of related software object classes according to a service provided by the server computer, wherein the service is provided by object-oriented software that uses the software object classes of the hierarchy; receive data from an external process to invoke the service; organize the data received from the external process according to the hierarchy; and, with a graphical user interface, receive user input specifying a processing order among software object classes in the hierarchy. | 2,100 |
5,549 | 5,549 | 12,579,404 | 2,168 | Methods and systems to search a data source based on compatibility with an application. The system receives a first query that includes keywords and identifies at least one keyword in the first query as application information. The application information describes a first application. Next the system infers remaining keywords in the first query as item information that describe a first item that is sought on a network-based marketplace. The first item is a part that is compatible with the first application. Next, the system searches a data storage device to identify a first listing on the data storage device as matched. The first listing includes an item for sale on the network-based marketplace and listing item information that matches the item information in the first query. The first listing further includes listing application information that is matched based on the application information. | 1. A method comprising:
receiving a first query that includes keywords; using a data processor to identify at least one keyword in the first query as application information describing a first application; inferring remaining keywords in the first query as item information that describes a first item that a user is searching for on a network-based marketplace, the first item being a part that is compatible with the first application; and searching a data storage device, the searching including identifying a first listing on the data storage device as matched, the first listing including an item offered for sale on the network-based marketplace and including listing item information that matches the item information in the query, the first listing further including listing application information that is matched based on application information. 2. The method of claim 1, wherein the listing application information includes a first plurality of application identifiers. 3. The method of claim 2, wherein the first plurality of application identifiers respectively identifies a plurality of applications being compatible with the item for sale on the network-based marketplace. 4. The method of claim 2 wherein the first plurality of application identifiers includes a first application identifier that includes a first plurality of attribute-value pairs that respectively includes a first plurality of values. 5. The method of claim 4, wherein the first plurality of application identifiers is respectively associated with a first set of predetermined attributes. 6. The method of claim 5, wherein the identifying the at least one keyword in the first query as application information comprises associating a first plurality of keywords in the first query with a first plurality of attribute-keyword pairs. 7. The method of claim 6, wherein the identifying the at least one keyword in the first query as application information further comprises identifying a second plurality of attribute-keyword pairs in the first plurality of attribute-keyword pairs. 8. The method of claim 7, wherein the identifying the first listing as matched includes identifying the second plurality of attribute-keyword pairs as including keywords that respectively match corresponding values included in the first plurality of values. 9. The method of claim 8, wherein the second plurality of attribute-keyword pairs includes fewer keywords than the first plurality of attribute-value pairs includes values. 10. A system comprising:
a data processor; a data storage device in data communication with the data processor; a finding module to receive a first query that includes keywords and to identify at least one keyword in the first query as application information describing a first application, the finding module to further infer remaining keywords in the first query as item information that describe a first item that is sought on a network-based marketplace, the first item being a part that is compatible with the first application; and a search module to search the data storage device, the search module to identify a first listing on the data storage device as matched, the first listing including an item for sale on the network-based marketplace and including listing item information that matches the item information in the first query, the first listing further including listing application information that is matched based on the application information. 11. The system of claim 10, wherein the listing application information includes a first plurality of application identifiers. 12. The system of claim 11, wherein the first plurality of application identifiers respectively identifies a plurality of applications being compatible with the item for sale on the network-based marketplace. 13. The system of claim 11, wherein the first plurality of application identifiers includes a first application identifier that includes a first plurality of attribute-value pairs that respectively includes of a first plurality of values. 14. The system of claim 13, wherein the first plurality of application identifiers is respectively associated with a first set of predetermined attributes. 15. The system of claim 14, further comprising a keyword converter module to associate a first plurality of keywords in the first query with a first plurality of attribute-keyword pairs. 16. The system of claim 15, further comprising a metadata module to identify a second plurality of attribute-keyword pairs in the first plurality of attribute-keyword pairs. 17. The system of claim 16, wherein the finding module identifies the second plurality of attribute-keyword pairs as including keywords that respectively match corresponding values included in the first plurality of values. 18. The system of claim 17, wherein the second plurality of attribute-keyword pairs includes fewer keywords than the first plurality of attribute-value pairs includes values. 19. A machine-readable medium storing instructions that, when executed by at least one processor, cause the at least one processor to perform the following actions:
receiving a first query that includes keywords; identifying at least one keyword in the first query as application information describing a first application; inferring remaining keywords in the first query as item information that describes a first item that a user is searching for on a network-based marketplace, the first item being a part that is compatible with the first application; and searching a data storage device, the searching including identifying a first listing on the data storage device as matched, the first listing including an item offered for sale on the network-based marketplace and including listing item information that matches the item information in the query, the first listing further including listing application information that is matched based on application information. 20. A system comprising:
a data processor; a data storage device in data communication with the data processor; a finding module to receive a first query that includes keywords and to identify at least one keyword in the first query as application information describing a first application, the finding module to further infer remaining keywords in the first query as item information that describe a first item that is sought on a network-based marketplace, the first item being a part that is compatible with the first application; and a first means for searching the data storage device, the search module to identify a first listing on the data storage device as matched, the first listing including an item for sale on the network-based marketplace and including listing item information that matches the item information in the first query, the first listing further including listing application information that is matched based on the application information. | Methods and systems to search a data source based on compatibility with an application. The system receives a first query that includes keywords and identifies at least one keyword in the first query as application information. The application information describes a first application. Next the system infers remaining keywords in the first query as item information that describe a first item that is sought on a network-based marketplace. The first item is a part that is compatible with the first application. Next, the system searches a data storage device to identify a first listing on the data storage device as matched. The first listing includes an item for sale on the network-based marketplace and listing item information that matches the item information in the first query. The first listing further includes listing application information that is matched based on the application information.1. A method comprising:
receiving a first query that includes keywords; using a data processor to identify at least one keyword in the first query as application information describing a first application; inferring remaining keywords in the first query as item information that describes a first item that a user is searching for on a network-based marketplace, the first item being a part that is compatible with the first application; and searching a data storage device, the searching including identifying a first listing on the data storage device as matched, the first listing including an item offered for sale on the network-based marketplace and including listing item information that matches the item information in the query, the first listing further including listing application information that is matched based on application information. 2. The method of claim 1, wherein the listing application information includes a first plurality of application identifiers. 3. The method of claim 2, wherein the first plurality of application identifiers respectively identifies a plurality of applications being compatible with the item for sale on the network-based marketplace. 4. The method of claim 2 wherein the first plurality of application identifiers includes a first application identifier that includes a first plurality of attribute-value pairs that respectively includes a first plurality of values. 5. The method of claim 4, wherein the first plurality of application identifiers is respectively associated with a first set of predetermined attributes. 6. The method of claim 5, wherein the identifying the at least one keyword in the first query as application information comprises associating a first plurality of keywords in the first query with a first plurality of attribute-keyword pairs. 7. The method of claim 6, wherein the identifying the at least one keyword in the first query as application information further comprises identifying a second plurality of attribute-keyword pairs in the first plurality of attribute-keyword pairs. 8. The method of claim 7, wherein the identifying the first listing as matched includes identifying the second plurality of attribute-keyword pairs as including keywords that respectively match corresponding values included in the first plurality of values. 9. The method of claim 8, wherein the second plurality of attribute-keyword pairs includes fewer keywords than the first plurality of attribute-value pairs includes values. 10. A system comprising:
a data processor; a data storage device in data communication with the data processor; a finding module to receive a first query that includes keywords and to identify at least one keyword in the first query as application information describing a first application, the finding module to further infer remaining keywords in the first query as item information that describe a first item that is sought on a network-based marketplace, the first item being a part that is compatible with the first application; and a search module to search the data storage device, the search module to identify a first listing on the data storage device as matched, the first listing including an item for sale on the network-based marketplace and including listing item information that matches the item information in the first query, the first listing further including listing application information that is matched based on the application information. 11. The system of claim 10, wherein the listing application information includes a first plurality of application identifiers. 12. The system of claim 11, wherein the first plurality of application identifiers respectively identifies a plurality of applications being compatible with the item for sale on the network-based marketplace. 13. The system of claim 11, wherein the first plurality of application identifiers includes a first application identifier that includes a first plurality of attribute-value pairs that respectively includes of a first plurality of values. 14. The system of claim 13, wherein the first plurality of application identifiers is respectively associated with a first set of predetermined attributes. 15. The system of claim 14, further comprising a keyword converter module to associate a first plurality of keywords in the first query with a first plurality of attribute-keyword pairs. 16. The system of claim 15, further comprising a metadata module to identify a second plurality of attribute-keyword pairs in the first plurality of attribute-keyword pairs. 17. The system of claim 16, wherein the finding module identifies the second plurality of attribute-keyword pairs as including keywords that respectively match corresponding values included in the first plurality of values. 18. The system of claim 17, wherein the second plurality of attribute-keyword pairs includes fewer keywords than the first plurality of attribute-value pairs includes values. 19. A machine-readable medium storing instructions that, when executed by at least one processor, cause the at least one processor to perform the following actions:
receiving a first query that includes keywords; identifying at least one keyword in the first query as application information describing a first application; inferring remaining keywords in the first query as item information that describes a first item that a user is searching for on a network-based marketplace, the first item being a part that is compatible with the first application; and searching a data storage device, the searching including identifying a first listing on the data storage device as matched, the first listing including an item offered for sale on the network-based marketplace and including listing item information that matches the item information in the query, the first listing further including listing application information that is matched based on application information. 20. A system comprising:
a data processor; a data storage device in data communication with the data processor; a finding module to receive a first query that includes keywords and to identify at least one keyword in the first query as application information describing a first application, the finding module to further infer remaining keywords in the first query as item information that describe a first item that is sought on a network-based marketplace, the first item being a part that is compatible with the first application; and a first means for searching the data storage device, the search module to identify a first listing on the data storage device as matched, the first listing including an item for sale on the network-based marketplace and including listing item information that matches the item information in the first query, the first listing further including listing application information that is matched based on the application information. | 2,100 |
5,550 | 5,550 | 13,710,865 | 2,152 | When processing data tuples, operators of a streaming application may identify certain tuples as being relevant. To determine relevant tuples, the operators may, for example, process the received tuples and determine if they meet certain thresholds. If so, the tuples are deemed relevant, but if not they are characterized as irrelevant. The streaming application may use a pattern detector to parse the relevant data tuples to identify a pattern, such as a shared trait between the tuples. Based on this commonality, the pattern detector may generate filtering criteria that may be used to process subsequently received tuples. In one embodiment, the filtering criteria identified by one operator is transmitted to a second operator to be used to process tuples received there. Thus, once one of the operators determines a pattern, the operator generates filtering criteria that another, related operator uses for filtering received tuples. | 1. A method comprising:
receiving streaming data tuples to be processed by a plurality of interconnected operators, the operators processing at least a portion of the received data tuples by operation of one or more computer processors; processing tuples received by a first operator of the plurality of operators to identify relevant tuples that satisfy one or more criteria; evaluating the relevant tuples to determine a pattern based on a commonality shared by at least a portion of the relevant tuples; transmitting the shared commonality to a second operator of the plurality of operators; and determining whether data tuples received by the second operator contain the shared commonality. 2. The method of claim 1, further comprising:
upon determining that one of the data tuples received by the second operator contain the shared commonality, performing a first action with the one data tuple; and upon determining that the one data tuple received by the second operator does not contain the shared commonality, performing a second, different action with the one data tuple. 3. The method of claim 2, wherein the first action is processing the one data tuple based on one or more preconfigured code elements in the second operator and the second action is discarding the one data tuple such that the one data tuple is not forwarded to an operator downstream from the second operator. 4. The method of claim 2, wherein the first action is re-ordering the data tuples received by the second operator such that the one data tuple is processed before a second data tuple that was received by the second operator before the second operator received the one data tuple, wherein the second data tuple does not contain the commonality. 5. The method of claim 1, further comprising:
generating at least one derivative of the commonality, the derivative representing a suitable alternative of the commonality; transmitting the derivative to the second operator; and determining whether data tuples received by the second operator contain the derivative of the commonality. 6. The method of claim 1, wherein the commonality is at least one of: metadata associated with the relevant tuples and a value stored in the relevant tuples. 7. The method of claim 1, further comprising, upon determining that at least one criterion is satisfied, invalidating the identified commonality whereby the second operator ceases to determine whether the received data tuples contain the commonality. 8. The method of claim 7, wherein the criterion is at least one of: a signal indicating an event, a predefined time period expiring, and a threshold representing the maximum number of received data tuples to be evaluated using the commonality. 9. The method of claim 1, wherein identifying relevant tuples comprises:
determining if a result from processing each of the data tuples received by the first operator satisfy the one or more criteria, wherein the received data tuples that satisfy the one or more criteria are identified as relevant tuples. | When processing data tuples, operators of a streaming application may identify certain tuples as being relevant. To determine relevant tuples, the operators may, for example, process the received tuples and determine if they meet certain thresholds. If so, the tuples are deemed relevant, but if not they are characterized as irrelevant. The streaming application may use a pattern detector to parse the relevant data tuples to identify a pattern, such as a shared trait between the tuples. Based on this commonality, the pattern detector may generate filtering criteria that may be used to process subsequently received tuples. In one embodiment, the filtering criteria identified by one operator is transmitted to a second operator to be used to process tuples received there. Thus, once one of the operators determines a pattern, the operator generates filtering criteria that another, related operator uses for filtering received tuples.1. A method comprising:
receiving streaming data tuples to be processed by a plurality of interconnected operators, the operators processing at least a portion of the received data tuples by operation of one or more computer processors; processing tuples received by a first operator of the plurality of operators to identify relevant tuples that satisfy one or more criteria; evaluating the relevant tuples to determine a pattern based on a commonality shared by at least a portion of the relevant tuples; transmitting the shared commonality to a second operator of the plurality of operators; and determining whether data tuples received by the second operator contain the shared commonality. 2. The method of claim 1, further comprising:
upon determining that one of the data tuples received by the second operator contain the shared commonality, performing a first action with the one data tuple; and upon determining that the one data tuple received by the second operator does not contain the shared commonality, performing a second, different action with the one data tuple. 3. The method of claim 2, wherein the first action is processing the one data tuple based on one or more preconfigured code elements in the second operator and the second action is discarding the one data tuple such that the one data tuple is not forwarded to an operator downstream from the second operator. 4. The method of claim 2, wherein the first action is re-ordering the data tuples received by the second operator such that the one data tuple is processed before a second data tuple that was received by the second operator before the second operator received the one data tuple, wherein the second data tuple does not contain the commonality. 5. The method of claim 1, further comprising:
generating at least one derivative of the commonality, the derivative representing a suitable alternative of the commonality; transmitting the derivative to the second operator; and determining whether data tuples received by the second operator contain the derivative of the commonality. 6. The method of claim 1, wherein the commonality is at least one of: metadata associated with the relevant tuples and a value stored in the relevant tuples. 7. The method of claim 1, further comprising, upon determining that at least one criterion is satisfied, invalidating the identified commonality whereby the second operator ceases to determine whether the received data tuples contain the commonality. 8. The method of claim 7, wherein the criterion is at least one of: a signal indicating an event, a predefined time period expiring, and a threshold representing the maximum number of received data tuples to be evaluated using the commonality. 9. The method of claim 1, wherein identifying relevant tuples comprises:
determining if a result from processing each of the data tuples received by the first operator satisfy the one or more criteria, wherein the received data tuples that satisfy the one or more criteria are identified as relevant tuples. | 2,100 |
5,551 | 5,551 | 11,469,483 | 2,139 | Embodiments of the present invention relate to a device includes both a transferring and receiving interface. The device may include a direction indicator, for example an arrow, indicating a direction of data transfer. The device may also include a switch, such as a button, to initiate data transfer. The device may also include a counter, display, or light that indicates the amount data transferred and serves as a user interface. The device may also include a power source, such as a battery, to power the device during data transfer. | 1. A device, comprising:
a memory for storing data; a first interface, coupled to the memory, for transferring data; and a second interface, coupled to the memory and adapted to couple to first interfaces of other devices, for transferring data. 2. The device of claim 1, further comprising:
a communications bus coupled to the memory, first interface, and second interface; and a memory controller, coupled to the communications bus, for controlling access to the memory. 3. The device of claim 2, further comprising:
a switch, coupled to the communication bus, for controlling transfer of data. 4. The device of claim 3, further comprising:
a battery coupled to the memory and memory controller. 5. The device of claim 4, further comprising:
a counter, coupled to the communications bus, for displaying the amount of data transferred. 6. The device of claim 5, further comprising:
a sign, affixed to the device, for indicating a direction of data transfer. 7. The device of claim 1, wherein the first interface is a male connector. 8. The device of claim 1, wherein the second interface is a female connector. 9. A portable Universal Serial Bus (USB) storage device, comprising
a memory for storing data; a first USB interface, coupled to the memory, for transferring data; and a second USB interface, coupled to the memory and adapted to couple with USB interfaces of other portable USB storage devices, for transferring data. 10. The device of claim 9, wherein the second USB interface is a female USB interface. 11. The device of claim 10, wherein the first USB interface is a male USB interface. 12. The device of claim 9, further comprising:
a communications bus, coupled to the memory, first USB interface, and second USB interface, for transferring data; and a memory controller, coupled to the communications bus, for controlling access to the memory. 13. The device of claim 12, further comprising:
a switch, coupled to the communication bus, for controlling transfer of data. 14. The device of claim 13, further comprising:
a battery coupled to the memory and memory controller. 15. The device of claim 14, further comprising:
a counter, coupled to the communications bus, for displaying the amount of data transferred. 16. The device of claim 15, further comprising:
a sign, affixed to the device, for indicating a direction of data transfer. 17. A device, comprising:
means for storing data; means for interfacing with electronic devices and for transferring data; and means for interfacing with other devices and for transferring data. | Embodiments of the present invention relate to a device includes both a transferring and receiving interface. The device may include a direction indicator, for example an arrow, indicating a direction of data transfer. The device may also include a switch, such as a button, to initiate data transfer. The device may also include a counter, display, or light that indicates the amount data transferred and serves as a user interface. The device may also include a power source, such as a battery, to power the device during data transfer.1. A device, comprising:
a memory for storing data; a first interface, coupled to the memory, for transferring data; and a second interface, coupled to the memory and adapted to couple to first interfaces of other devices, for transferring data. 2. The device of claim 1, further comprising:
a communications bus coupled to the memory, first interface, and second interface; and a memory controller, coupled to the communications bus, for controlling access to the memory. 3. The device of claim 2, further comprising:
a switch, coupled to the communication bus, for controlling transfer of data. 4. The device of claim 3, further comprising:
a battery coupled to the memory and memory controller. 5. The device of claim 4, further comprising:
a counter, coupled to the communications bus, for displaying the amount of data transferred. 6. The device of claim 5, further comprising:
a sign, affixed to the device, for indicating a direction of data transfer. 7. The device of claim 1, wherein the first interface is a male connector. 8. The device of claim 1, wherein the second interface is a female connector. 9. A portable Universal Serial Bus (USB) storage device, comprising
a memory for storing data; a first USB interface, coupled to the memory, for transferring data; and a second USB interface, coupled to the memory and adapted to couple with USB interfaces of other portable USB storage devices, for transferring data. 10. The device of claim 9, wherein the second USB interface is a female USB interface. 11. The device of claim 10, wherein the first USB interface is a male USB interface. 12. The device of claim 9, further comprising:
a communications bus, coupled to the memory, first USB interface, and second USB interface, for transferring data; and a memory controller, coupled to the communications bus, for controlling access to the memory. 13. The device of claim 12, further comprising:
a switch, coupled to the communication bus, for controlling transfer of data. 14. The device of claim 13, further comprising:
a battery coupled to the memory and memory controller. 15. The device of claim 14, further comprising:
a counter, coupled to the communications bus, for displaying the amount of data transferred. 16. The device of claim 15, further comprising:
a sign, affixed to the device, for indicating a direction of data transfer. 17. A device, comprising:
means for storing data; means for interfacing with electronic devices and for transferring data; and means for interfacing with other devices and for transferring data. | 2,100 |
5,552 | 5,552 | 13,777,416 | 2,125 | The claimed Innovation Expert System, IES, and for a given innovation/invention the claimed Data Structure DS—structurally being the same for any innovation/invention—meet two kinds of functional requirements. They support:
(I) determining all the innovation's/invention's technical/legal relations to given prior art information, (II) instantly recognizing and answering any reasonable query about any such relation alias fact. Functionality (I) enables generating/providing functionality (II)—jointly implemented by IES and DS, also usable by other expert systems. DS results from screening the innovation for technical/legal informal fundamental facts, transforming them into technical/legal formal fundamental facts, these into technical/legal primary facts, these into technical/legal secondary semantic/creative/inventive and pragmatic facts, and these into argument chains being the final technical/legal facts. All facts use the number and kinds of independent creative/inventive concepts alias thoughts needed for finding/qualifying the invention over prior art, as induced by HIGHEST COURTS of Germany and recently the US. | 1) A computer-implemented method for generating for a “Problem of TT.0 and RS, PTRCT” a data structure “PTRCT-DS” for use by an expert system, the computer system executing the method having a processor for generating and a memory for storing PTRCT-DS, the method comprising:
receiving a document.0 with marked-up items (“doc.0-MUIs”) of information disclosing a technical teaching TT.0, receiving a reference set RS of document.i with doc.i-MUIs disclosing technical teachings TT.i, i=1, 2, 3, . . . , and writing all document.i, i=0, 1, 2, . . . , and their MUIs any one called a “subject matter item”—into the PTRCT-DS;
receiving a context document, document.CT, comprising an authority's directives (such as the wordings of 35 USC §§112/102/103/101) with doc.CT-MUIs of their wordings, and writing document.CT and its MUIs—any one called a “legal item”—into the PTRCT-DS;
and creating further items of both kinds by the execution of this method as determined by its following steps:
(a) identifying of TT.0 of said claim of doc.0
1 one element and generating a set comprising it, and writing said set into the PTRCT-DS;
2 the property of said element and generating a set comprising it, and writing said set into the PTRCT-DS;
3 at least one creative binary independent concept—such that the conjunction of their mirror predicates describes said property—generating for each and only this one a set comprising it, and writing any said set into the PTRCT-DS;
(b) generating for any set generated in (a) a set of doc.0-MUIs disclosing its element and writing said set into the PTRCT-DS;
(c) generating for any set generated in (b) a set of I.CTs justifying it and writing said set into the PTRCT-DS;
repeating the steps (d)-(f) for any doc.i, i>0, and therein with any item peer to one generated in (a).1 or (a).3:
(d) generating a set comprising of TT.i either an element peer to one in step (a),1—if this peer element is not existent, replace it by a dummy peer element—or a binary independent concept of TT.i peer to one in step (a).3—if it is not existent or not equal to its peer in TT.0, replace it by a dummy peer concept—and writing said set into the PTRCT-DS;
(e) generating for any set generated in (d) a set of doc.i-MUIs disclosing in doc.i the item replaced in (d) and writing said set into the PTRCT-DS;
(f) generating for any set generated in (e) a set of I.CTs justifying it and writing said set into the PTRCT-DS;
(g) generating the set of all anticipation combinations based on the replacements of (d) and writing it into the PTRCT-DS;
(h) generating for any AC generated in (g) the set of a shortest sequences of Q 1-CCs such that AC/mod(Q-CC) ants TT.0, and writing said set into the PTRCT-DS;
(i) generating for any sequence of Q 1-CCs generated in (h) a set of I.CTs justifying it and writing said set into the PTRCT-DS;
(j) generating for sets generated in (a)-(i), a concatenation of which represents a test T, a set of argument chains as to this T, whereby any chain is limited to comprising sets from (a)-(i) as links, which are glued together by natural language fragments,
(k) generating for any set generated in (a)-(j) a real-time-access set, if it is needed for guaranteeing that this set's retrieval and presentation is terminated in dialog-real time and writing said set into the PTRCT-DS. 2) A method according to claim 1, whereby its generated sets have the properties described in (a)-(k) by their BID-cr-Cs:
(a) (a).1 “AD-TT.0-concept”≡it comprises a) an element X.0.n or
b) a predicate AD-X.0.n, 1≦n≦N, and
(a).2 “BID-TT.0-concept”≡it comprises a) a BID-C.0.kn, 1≦kn≦Kn, Σ1≦n≦N Kn=K≧N, such that
b) any AD-X.0.n of (a).1 is a conjunction of the mirror predicates BID-C.0.kn of the BID-C.0.kn,
(b) “SoDIS(Y.0)-concept”≡its element “SoDIS(Y.0)” ::={dis(y.0)::={MUI.0s disclosing Y.0}}, (c) “SoJ(dis(y.0))-concept”≡its element “SoJ(dis(y.0))” ::={I.CTs justifying dis(y.0)},
and for any 1≦i≦I in (d)-(f)
(d) “BID-TT.i-concept”≡it comprises a) an element X.i.n peer to X.0.n or a peer dummy-X.i.n, or
b) a BID-C.i.kn, if it is =BID-C.0.kn or a peer dummy-BID-C.i.kn, 1≦kn≦Kn, 1≦n≦N,
(e) “SoDIS(Y.i)-concept”≡its element “SoDIS(Y.i)” ::={dis(y.i)::={MUI.i's disclosing Y.i}},
(f) “SoJ(dis(y.i))-concept”≡its element “SoJ(dis(y.i))” ::={I.CTs justifying dis(y.i)},
and further
(g) “BID-AC-concept”≡it comprising an AC of the PTRCT,
(h) “SoQCC(Y)-concept”≡its element “QCC(Y)” ::={qcc(y)::={Q-CC I Y/mod(Q-CC) ants TT.0}},
(i) “SoJ(qcc(y))-concept”≡its element “J(qcc(y))” ::={I.CTs justifying qcc(y)},
(j) “SoARGC(T)-concept”≡it comprises argument chains as to the execution of a test T, any chain limited to comprising only T-specific sets from (a)-(i) as links, being glued together by natural language fragments,
(k) “SoAccess-concept”≡it comprises at least one q/a-provision, which guarantees within 1 sec to
(k).1 recognize in any query put in a given query language of the PTRCT-DS an item generated in (a)-(j),
(k).2 retrieving said item and presenting it in a representation of the PTRCT-DS determinable by the user. 3) A method according to claim 2, being subject to the additional limitation that for all dis(y) and J(dis(y)) of Y holds that they comprise {all doc.0-MUIs disclosing Y} respectively {all doc.CT-MUIs justifying dis(y)}. 4) A method according to claim 2, subject to the additional limitation that PTRCT-DS comprises for all BID-AC-concepts all SoJ(qcc(AC))-concepts. 5) A method according to claim 1, being subject to the additional limitation that its restart due to an incremental change of an item interactively performed by the user may reuse a part of the PTRCT-DS generated prior to this change. 6) A method according to claim 1, being subject to the additional limitation that the PTRCT-DS is implemented as one or several data objects on one or several computer systems. 7) A method according to claim 1, being subject to the additional limitation that the user may toggle anytime between several PTRCT-DSes based on different document.CTs. 8) A method according to claim 1, being subject to the additional limitation that at least one normally interactively performed step (a)-(k) of generating PTRCT-DS is performed automatically. 9) A method according to claim 1, being subject to the additional limitation that user-defined “technical-secondary-fact”-items of PTRCT's TT.0 may be introduced in the PTRCT-DS generation as additional items. 10) A method according to claim 1, being subject to the additional limitation that the generated PTRCT-DS comprises provisions for monitoring, accounting, and reporting about a range of modes of using its concepts. 11) An apparatus, controlled by a computer-implemented method, for generating for a “Problem of TT.0 and RS, PTRCT” a data structure “PTRCT-DS” for use by an expert system, the computer system executing the method having a processor for generating and a memory for storing PTRCT-DS, the method comprising:
receiving a document.0 with marked-up items (“doc.0-MUIs”) of information disclosing a technical teaching TT.0, receiving a reference set RS of document.i with doc.i-MUIs disclosing technical teachings TT.i, i=1, 2, 3, . . . , and writing all document.i, i=0, 1, 2, . . . , and their MUIs—any one called a “subject matter item”—into the PTRCT-DS;
receiving a context document, document.CT, comprising an authority's directives (such as the wordings of 35 USC §§112/102/103/101) with doc.CT-MUIs of their wordings, and writing document.CT and its MUIs—any one called a “legal item”—into the PTRCT-DS;
and creating further items of both kinds by the execution of this method as determined by its following steps:
(a) identifying of TT.0 of said claim of doc.0
4 one element and generating a set comprising it, and writing said set into the PTRCT-DS;
5 the property of said element and generating a set comprising it, and writing said set into the PTRCT-DS;
6 at least one creative binary independent concept—such that the conjunction of their mirror predicates describes said property—generating for each and only this one a set comprising it, and writing any said set into the PTRCT-DS;
(b) generating for any set generated in (a) a set of doc.0-MUIs disclosing its element and writing said set into the PTRCT-DS;
(c) generating for any set generated in (b) a set of I.CTs justifying it and writing said set into the PTRCT-DS;
repeating the steps (d)-(f) for any doc.i, i>0, and therein with any item peer to one generated in (a).1 or (a).3:
(d) generating a set comprising of TT.i either an element peer to one in step (a),1—if this peer element is not existent, replace it by a dummy peer element—or a binary independent concept of TT.i peer to one in step (a).3—if it is not existent or not equal to its peer in TT.0, replace it by a dummy peer concept—and writing said set into the PTRCT-DS;
(e) generating for any set generated in (d) a set of doc.i-MUIs disclosing in doc.i the item replaced in (d) and writing said set into the PTRCT-DS;
(f) generating for any set generated in (e) a set of I.CTs justifying it and writing said set into the PTRCT-DS;
(g) generating the set of all anticipation combinations based on the replacements of (d) and writing it into the PTRCT-DS;
(h) generating for any AC generated in (g) the set of a shortest sequences of Q 1-CCs such that AC/mod(Q-CC) ants TT.0, and writing said set into the PTRCT-DS;
(i) generating for any sequence of Q 1-CCs generated in (h) a set of I.CTs justifying it and writing said set into the PTRCT-DS;
(j) generating for sets generated in (a)-(i), a concatenation of which represents a test T, a set of argument chains as to this T, whereby any chain is limited to comprising sets from (a)-(i) as links, which are glued together by natural language fragments,
(k) generating for any set generated in (a)-(j) a real-time-access set, if it is needed for guaranteeing that this set's retrieval and presentation is terminated in dialog-real time and writing said set into the PTRCT-DS. 12) An apparatus, according to claim 11, controlled by a computer-implemented method, which—during its generation of sets—subsequently called “items”—additionally limits these, in the steps (a)-(k), to stand for:
(a) (a).1 “AD-TT.0-concept”≡it comprises a) an element X.0.n or
b) a predicate AD-X.0.n, 1≦n≦N, and
(a).2 “BID-TT.0-concept”≡it comprises a) a BID-C.0.kn, 1≦kn≦Kn, Σ1≦n≦N Kn=K≧N, such that
b) any AD-X.0.n of (a).1 is a conjunction of the mirror predicates BID-C.0.kn of the BID-C.0.kn,
(b) “SoDIS(Y.0)-concept”≡its element “SoDIS(Y.0)” ::={dis(y.0)::={MUI.0s disclosing Y.0}},
(c) “SoJ(dis(y.0))-concept”≡its element “SoJ(dis(y.0))” ::={I.CTs justifying dis(y.0)},
and for any 1≦i≦I in (d)-(f)
(d) “BID-TT.i-concept”≡it comprises a) an element X.i.n peer to X.0.n or a peer dummy-X.i.n, or b) a BID-C.i.kn, if it is =BID-C.0.kn or a peer dummy-BID-C.i.kn, 1≦kn≦Kn, 1≦n≦N,
(e) “SoDIS(Y.i)-concept”≡its element “SoDIS(Y.i)” ::={dis(y.i)::={MUI.i's disclosing Y.i}},
(f) “SoJ(dis(y.i))-concept”≡its element “SoJ(dis(y.i))” ::={I.CTs justifying dis(y.i)},
and further
(g) “BID-AC-concept”≡it comprising an AC of the PTRCT,
(h) “SoQCC(Y)-concept”≡its element “QCC(Y)” ::={qcc(y)::={Q-CC I Y/mod(Q-CC) ants TT.0}},
(i) “SoJ(qcc(y))-concept”≡its element “J(qcc(y))” ::={I.CTs justifying qcc(y)},
(j) “SoARGC(T)-concept”≡it comprises argument chains as to the execution of a test T, any chain limited to comprising only T-specific sets from (a)-(i) as links, being glued together by natural language fragments,
(k) “SoAccess-concept”≡it comprises at least one q/a-provision, which guarantees within 1 sec to
(k).1 recognize in any query put in a given query language of the PTRCT-DS an item generated in (a)-(j),
(k).2 retrieving said item and presenting it in a representation of the PTRCT-DS determinable by the user. 13) An apparatus according to claim 12, being subject to the additional limitation that for all dis(y) and J(dis(y)) of Y holds that they comprise {all doc.0-MUIs disclosing Y} respectively {all doc.CT-MUIs justifying dis(y)}. 14) An apparatus according to claim 12, being subject to the additional limitation that PTRCT-DS comprises for all BID-AC-concepts all SoJ(qcc(AC))-concepts. 15) An apparatus according to claim 11, being subject to the additional limitation that its restart due to an incremental change of an item interactively performed by the user may reuse a part of the PTRCT-DS generated prior to this change. 16) An apparatus according to claim 11, being subject to the additional limitation that the PTRCT-DS is implemented as one or several data objects on one or several computer systems. 17) An apparatus according to claim 11, being subject to the additional limitation that the user may toggle anytime between several PTRCT-DSes based on different document.CTs. 18) An apparatus according to claim 11, being subject to the additional limitation that at least one normally interactively performed given function of generating PTRCT-DS is performed for automatically. 19) An apparatus according to claim 11, subject to the additional limitation that user-defined “technical-secondary-fact”-items of PTRCT's TT.0 may be introduced in the PTRCT-DS generation as additional items. 20) An apparatus according to claim 11, being subject to the additional limitation that the generated PTRCT-DS comprises provisions for monitoring, accounting, and reporting about a range of modes of using its concepts. 21) An apparatus according to claim 11, being subject to the additional limitation that it is capable of acoustic word spotting for a given set of keywords and providing graphic feedback about its alleged hits. 22) An apparatus using a PTRCT-DS i.e. using a computer-generated data structure, which is stored on a tangible medium connected to said apparatus and readable by said computer and which is based on and comprising part of a given PTRCT—which is capable of retrieving items of information from the PTRCT-DS defined by it and by means of the provisions provided by it to this end, whereby comprising the steps
(a) reading a set of given keywords from an input device connected to this apparatus;
(b) establishing that any one of said keywords addresses one of said items;
(c) recognizing any one of said keywords on its presentation by a user to the apparatus on an input interface of it;
(d) retrieving a copy of the item addressed as to (b) by said keyword and delivering said copy to an output device connected to this apparatus for presentation to said user;
(e) performing steps (c) and (d) within one second. 23) An apparatus according to claim 22, being subject to the additional limitation that its input device and output device are those of PCs or connectable to it. 24) An apparatus according to claim 22, being subject to the additional limitation that its graphics and/or acoustic capabilities of the input device and/or the output device are user configurable. 25) An apparatus according to claim 22, being subject to the additional limitation that it is configurable to hiding part of the information items on the PTRCT-DS for a given set of users. 26) An apparatus according to claim 22, being subject to the additional limitation that it is capable of adding information to part of the information items on the PTRCT-DS for a given set of users. 27) An apparatus according to claim 22, being subject to the additional limitation that one said item comprises, for a BID-cr-C disclosed by doc.0 of the PTRCT underlying the PTRCT-DS and for a TT.i of PTRCT, 0≦i≦I, a set of references to doc.i-MUIs allegedly showing they anticipate or non-anticipate said BID-cr-C. 28) An apparatus according to claim 22, being subject to the additional limitation that one said item comprises, for a BID-cr-C disclosed by doc.0 of the PTRCT underlying the PTRCT-DS and for a TT.i of PTRCT, 0≦i≦I, and a set of references to doc.i-MUIs allegedly showing they anticipate or non-anticipate said BID-cr-C, a set of I.CT-items of said PTRCT, a concatenation of which legally justifies this allegation. 29) An apparatus according to claim 22, being subject to the additional limitation that one said item comprises a statement saying, for a BID-cr-C disclosed by doc.0 of the PTRCT underlying the PTRCT-DS and for any TT.i of PTRCT that said BID-cr-C is anticipated or non-anticipated by this TT.i. 30) An apparatus according to claim 22, being subject to the additional limitation that one said item comprises, for a test T of said PTRCT provided by said PTRCT-DS and selected by the user or defined by the user and this T allegedly being passed or failed by said PTRCT, a set of I.CT-items of said PTRCT, a concatenation of which legally justifies this allegation. | The claimed Innovation Expert System, IES, and for a given innovation/invention the claimed Data Structure DS—structurally being the same for any innovation/invention—meet two kinds of functional requirements. They support:
(I) determining all the innovation's/invention's technical/legal relations to given prior art information, (II) instantly recognizing and answering any reasonable query about any such relation alias fact. Functionality (I) enables generating/providing functionality (II)—jointly implemented by IES and DS, also usable by other expert systems. DS results from screening the innovation for technical/legal informal fundamental facts, transforming them into technical/legal formal fundamental facts, these into technical/legal primary facts, these into technical/legal secondary semantic/creative/inventive and pragmatic facts, and these into argument chains being the final technical/legal facts. All facts use the number and kinds of independent creative/inventive concepts alias thoughts needed for finding/qualifying the invention over prior art, as induced by HIGHEST COURTS of Germany and recently the US.1) A computer-implemented method for generating for a “Problem of TT.0 and RS, PTRCT” a data structure “PTRCT-DS” for use by an expert system, the computer system executing the method having a processor for generating and a memory for storing PTRCT-DS, the method comprising:
receiving a document.0 with marked-up items (“doc.0-MUIs”) of information disclosing a technical teaching TT.0, receiving a reference set RS of document.i with doc.i-MUIs disclosing technical teachings TT.i, i=1, 2, 3, . . . , and writing all document.i, i=0, 1, 2, . . . , and their MUIs any one called a “subject matter item”—into the PTRCT-DS;
receiving a context document, document.CT, comprising an authority's directives (such as the wordings of 35 USC §§112/102/103/101) with doc.CT-MUIs of their wordings, and writing document.CT and its MUIs—any one called a “legal item”—into the PTRCT-DS;
and creating further items of both kinds by the execution of this method as determined by its following steps:
(a) identifying of TT.0 of said claim of doc.0
1 one element and generating a set comprising it, and writing said set into the PTRCT-DS;
2 the property of said element and generating a set comprising it, and writing said set into the PTRCT-DS;
3 at least one creative binary independent concept—such that the conjunction of their mirror predicates describes said property—generating for each and only this one a set comprising it, and writing any said set into the PTRCT-DS;
(b) generating for any set generated in (a) a set of doc.0-MUIs disclosing its element and writing said set into the PTRCT-DS;
(c) generating for any set generated in (b) a set of I.CTs justifying it and writing said set into the PTRCT-DS;
repeating the steps (d)-(f) for any doc.i, i>0, and therein with any item peer to one generated in (a).1 or (a).3:
(d) generating a set comprising of TT.i either an element peer to one in step (a),1—if this peer element is not existent, replace it by a dummy peer element—or a binary independent concept of TT.i peer to one in step (a).3—if it is not existent or not equal to its peer in TT.0, replace it by a dummy peer concept—and writing said set into the PTRCT-DS;
(e) generating for any set generated in (d) a set of doc.i-MUIs disclosing in doc.i the item replaced in (d) and writing said set into the PTRCT-DS;
(f) generating for any set generated in (e) a set of I.CTs justifying it and writing said set into the PTRCT-DS;
(g) generating the set of all anticipation combinations based on the replacements of (d) and writing it into the PTRCT-DS;
(h) generating for any AC generated in (g) the set of a shortest sequences of Q 1-CCs such that AC/mod(Q-CC) ants TT.0, and writing said set into the PTRCT-DS;
(i) generating for any sequence of Q 1-CCs generated in (h) a set of I.CTs justifying it and writing said set into the PTRCT-DS;
(j) generating for sets generated in (a)-(i), a concatenation of which represents a test T, a set of argument chains as to this T, whereby any chain is limited to comprising sets from (a)-(i) as links, which are glued together by natural language fragments,
(k) generating for any set generated in (a)-(j) a real-time-access set, if it is needed for guaranteeing that this set's retrieval and presentation is terminated in dialog-real time and writing said set into the PTRCT-DS. 2) A method according to claim 1, whereby its generated sets have the properties described in (a)-(k) by their BID-cr-Cs:
(a) (a).1 “AD-TT.0-concept”≡it comprises a) an element X.0.n or
b) a predicate AD-X.0.n, 1≦n≦N, and
(a).2 “BID-TT.0-concept”≡it comprises a) a BID-C.0.kn, 1≦kn≦Kn, Σ1≦n≦N Kn=K≧N, such that
b) any AD-X.0.n of (a).1 is a conjunction of the mirror predicates BID-C.0.kn of the BID-C.0.kn,
(b) “SoDIS(Y.0)-concept”≡its element “SoDIS(Y.0)” ::={dis(y.0)::={MUI.0s disclosing Y.0}}, (c) “SoJ(dis(y.0))-concept”≡its element “SoJ(dis(y.0))” ::={I.CTs justifying dis(y.0)},
and for any 1≦i≦I in (d)-(f)
(d) “BID-TT.i-concept”≡it comprises a) an element X.i.n peer to X.0.n or a peer dummy-X.i.n, or
b) a BID-C.i.kn, if it is =BID-C.0.kn or a peer dummy-BID-C.i.kn, 1≦kn≦Kn, 1≦n≦N,
(e) “SoDIS(Y.i)-concept”≡its element “SoDIS(Y.i)” ::={dis(y.i)::={MUI.i's disclosing Y.i}},
(f) “SoJ(dis(y.i))-concept”≡its element “SoJ(dis(y.i))” ::={I.CTs justifying dis(y.i)},
and further
(g) “BID-AC-concept”≡it comprising an AC of the PTRCT,
(h) “SoQCC(Y)-concept”≡its element “QCC(Y)” ::={qcc(y)::={Q-CC I Y/mod(Q-CC) ants TT.0}},
(i) “SoJ(qcc(y))-concept”≡its element “J(qcc(y))” ::={I.CTs justifying qcc(y)},
(j) “SoARGC(T)-concept”≡it comprises argument chains as to the execution of a test T, any chain limited to comprising only T-specific sets from (a)-(i) as links, being glued together by natural language fragments,
(k) “SoAccess-concept”≡it comprises at least one q/a-provision, which guarantees within 1 sec to
(k).1 recognize in any query put in a given query language of the PTRCT-DS an item generated in (a)-(j),
(k).2 retrieving said item and presenting it in a representation of the PTRCT-DS determinable by the user. 3) A method according to claim 2, being subject to the additional limitation that for all dis(y) and J(dis(y)) of Y holds that they comprise {all doc.0-MUIs disclosing Y} respectively {all doc.CT-MUIs justifying dis(y)}. 4) A method according to claim 2, subject to the additional limitation that PTRCT-DS comprises for all BID-AC-concepts all SoJ(qcc(AC))-concepts. 5) A method according to claim 1, being subject to the additional limitation that its restart due to an incremental change of an item interactively performed by the user may reuse a part of the PTRCT-DS generated prior to this change. 6) A method according to claim 1, being subject to the additional limitation that the PTRCT-DS is implemented as one or several data objects on one or several computer systems. 7) A method according to claim 1, being subject to the additional limitation that the user may toggle anytime between several PTRCT-DSes based on different document.CTs. 8) A method according to claim 1, being subject to the additional limitation that at least one normally interactively performed step (a)-(k) of generating PTRCT-DS is performed automatically. 9) A method according to claim 1, being subject to the additional limitation that user-defined “technical-secondary-fact”-items of PTRCT's TT.0 may be introduced in the PTRCT-DS generation as additional items. 10) A method according to claim 1, being subject to the additional limitation that the generated PTRCT-DS comprises provisions for monitoring, accounting, and reporting about a range of modes of using its concepts. 11) An apparatus, controlled by a computer-implemented method, for generating for a “Problem of TT.0 and RS, PTRCT” a data structure “PTRCT-DS” for use by an expert system, the computer system executing the method having a processor for generating and a memory for storing PTRCT-DS, the method comprising:
receiving a document.0 with marked-up items (“doc.0-MUIs”) of information disclosing a technical teaching TT.0, receiving a reference set RS of document.i with doc.i-MUIs disclosing technical teachings TT.i, i=1, 2, 3, . . . , and writing all document.i, i=0, 1, 2, . . . , and their MUIs—any one called a “subject matter item”—into the PTRCT-DS;
receiving a context document, document.CT, comprising an authority's directives (such as the wordings of 35 USC §§112/102/103/101) with doc.CT-MUIs of their wordings, and writing document.CT and its MUIs—any one called a “legal item”—into the PTRCT-DS;
and creating further items of both kinds by the execution of this method as determined by its following steps:
(a) identifying of TT.0 of said claim of doc.0
4 one element and generating a set comprising it, and writing said set into the PTRCT-DS;
5 the property of said element and generating a set comprising it, and writing said set into the PTRCT-DS;
6 at least one creative binary independent concept—such that the conjunction of their mirror predicates describes said property—generating for each and only this one a set comprising it, and writing any said set into the PTRCT-DS;
(b) generating for any set generated in (a) a set of doc.0-MUIs disclosing its element and writing said set into the PTRCT-DS;
(c) generating for any set generated in (b) a set of I.CTs justifying it and writing said set into the PTRCT-DS;
repeating the steps (d)-(f) for any doc.i, i>0, and therein with any item peer to one generated in (a).1 or (a).3:
(d) generating a set comprising of TT.i either an element peer to one in step (a),1—if this peer element is not existent, replace it by a dummy peer element—or a binary independent concept of TT.i peer to one in step (a).3—if it is not existent or not equal to its peer in TT.0, replace it by a dummy peer concept—and writing said set into the PTRCT-DS;
(e) generating for any set generated in (d) a set of doc.i-MUIs disclosing in doc.i the item replaced in (d) and writing said set into the PTRCT-DS;
(f) generating for any set generated in (e) a set of I.CTs justifying it and writing said set into the PTRCT-DS;
(g) generating the set of all anticipation combinations based on the replacements of (d) and writing it into the PTRCT-DS;
(h) generating for any AC generated in (g) the set of a shortest sequences of Q 1-CCs such that AC/mod(Q-CC) ants TT.0, and writing said set into the PTRCT-DS;
(i) generating for any sequence of Q 1-CCs generated in (h) a set of I.CTs justifying it and writing said set into the PTRCT-DS;
(j) generating for sets generated in (a)-(i), a concatenation of which represents a test T, a set of argument chains as to this T, whereby any chain is limited to comprising sets from (a)-(i) as links, which are glued together by natural language fragments,
(k) generating for any set generated in (a)-(j) a real-time-access set, if it is needed for guaranteeing that this set's retrieval and presentation is terminated in dialog-real time and writing said set into the PTRCT-DS. 12) An apparatus, according to claim 11, controlled by a computer-implemented method, which—during its generation of sets—subsequently called “items”—additionally limits these, in the steps (a)-(k), to stand for:
(a) (a).1 “AD-TT.0-concept”≡it comprises a) an element X.0.n or
b) a predicate AD-X.0.n, 1≦n≦N, and
(a).2 “BID-TT.0-concept”≡it comprises a) a BID-C.0.kn, 1≦kn≦Kn, Σ1≦n≦N Kn=K≧N, such that
b) any AD-X.0.n of (a).1 is a conjunction of the mirror predicates BID-C.0.kn of the BID-C.0.kn,
(b) “SoDIS(Y.0)-concept”≡its element “SoDIS(Y.0)” ::={dis(y.0)::={MUI.0s disclosing Y.0}},
(c) “SoJ(dis(y.0))-concept”≡its element “SoJ(dis(y.0))” ::={I.CTs justifying dis(y.0)},
and for any 1≦i≦I in (d)-(f)
(d) “BID-TT.i-concept”≡it comprises a) an element X.i.n peer to X.0.n or a peer dummy-X.i.n, or b) a BID-C.i.kn, if it is =BID-C.0.kn or a peer dummy-BID-C.i.kn, 1≦kn≦Kn, 1≦n≦N,
(e) “SoDIS(Y.i)-concept”≡its element “SoDIS(Y.i)” ::={dis(y.i)::={MUI.i's disclosing Y.i}},
(f) “SoJ(dis(y.i))-concept”≡its element “SoJ(dis(y.i))” ::={I.CTs justifying dis(y.i)},
and further
(g) “BID-AC-concept”≡it comprising an AC of the PTRCT,
(h) “SoQCC(Y)-concept”≡its element “QCC(Y)” ::={qcc(y)::={Q-CC I Y/mod(Q-CC) ants TT.0}},
(i) “SoJ(qcc(y))-concept”≡its element “J(qcc(y))” ::={I.CTs justifying qcc(y)},
(j) “SoARGC(T)-concept”≡it comprises argument chains as to the execution of a test T, any chain limited to comprising only T-specific sets from (a)-(i) as links, being glued together by natural language fragments,
(k) “SoAccess-concept”≡it comprises at least one q/a-provision, which guarantees within 1 sec to
(k).1 recognize in any query put in a given query language of the PTRCT-DS an item generated in (a)-(j),
(k).2 retrieving said item and presenting it in a representation of the PTRCT-DS determinable by the user. 13) An apparatus according to claim 12, being subject to the additional limitation that for all dis(y) and J(dis(y)) of Y holds that they comprise {all doc.0-MUIs disclosing Y} respectively {all doc.CT-MUIs justifying dis(y)}. 14) An apparatus according to claim 12, being subject to the additional limitation that PTRCT-DS comprises for all BID-AC-concepts all SoJ(qcc(AC))-concepts. 15) An apparatus according to claim 11, being subject to the additional limitation that its restart due to an incremental change of an item interactively performed by the user may reuse a part of the PTRCT-DS generated prior to this change. 16) An apparatus according to claim 11, being subject to the additional limitation that the PTRCT-DS is implemented as one or several data objects on one or several computer systems. 17) An apparatus according to claim 11, being subject to the additional limitation that the user may toggle anytime between several PTRCT-DSes based on different document.CTs. 18) An apparatus according to claim 11, being subject to the additional limitation that at least one normally interactively performed given function of generating PTRCT-DS is performed for automatically. 19) An apparatus according to claim 11, subject to the additional limitation that user-defined “technical-secondary-fact”-items of PTRCT's TT.0 may be introduced in the PTRCT-DS generation as additional items. 20) An apparatus according to claim 11, being subject to the additional limitation that the generated PTRCT-DS comprises provisions for monitoring, accounting, and reporting about a range of modes of using its concepts. 21) An apparatus according to claim 11, being subject to the additional limitation that it is capable of acoustic word spotting for a given set of keywords and providing graphic feedback about its alleged hits. 22) An apparatus using a PTRCT-DS i.e. using a computer-generated data structure, which is stored on a tangible medium connected to said apparatus and readable by said computer and which is based on and comprising part of a given PTRCT—which is capable of retrieving items of information from the PTRCT-DS defined by it and by means of the provisions provided by it to this end, whereby comprising the steps
(a) reading a set of given keywords from an input device connected to this apparatus;
(b) establishing that any one of said keywords addresses one of said items;
(c) recognizing any one of said keywords on its presentation by a user to the apparatus on an input interface of it;
(d) retrieving a copy of the item addressed as to (b) by said keyword and delivering said copy to an output device connected to this apparatus for presentation to said user;
(e) performing steps (c) and (d) within one second. 23) An apparatus according to claim 22, being subject to the additional limitation that its input device and output device are those of PCs or connectable to it. 24) An apparatus according to claim 22, being subject to the additional limitation that its graphics and/or acoustic capabilities of the input device and/or the output device are user configurable. 25) An apparatus according to claim 22, being subject to the additional limitation that it is configurable to hiding part of the information items on the PTRCT-DS for a given set of users. 26) An apparatus according to claim 22, being subject to the additional limitation that it is capable of adding information to part of the information items on the PTRCT-DS for a given set of users. 27) An apparatus according to claim 22, being subject to the additional limitation that one said item comprises, for a BID-cr-C disclosed by doc.0 of the PTRCT underlying the PTRCT-DS and for a TT.i of PTRCT, 0≦i≦I, a set of references to doc.i-MUIs allegedly showing they anticipate or non-anticipate said BID-cr-C. 28) An apparatus according to claim 22, being subject to the additional limitation that one said item comprises, for a BID-cr-C disclosed by doc.0 of the PTRCT underlying the PTRCT-DS and for a TT.i of PTRCT, 0≦i≦I, and a set of references to doc.i-MUIs allegedly showing they anticipate or non-anticipate said BID-cr-C, a set of I.CT-items of said PTRCT, a concatenation of which legally justifies this allegation. 29) An apparatus according to claim 22, being subject to the additional limitation that one said item comprises a statement saying, for a BID-cr-C disclosed by doc.0 of the PTRCT underlying the PTRCT-DS and for any TT.i of PTRCT that said BID-cr-C is anticipated or non-anticipated by this TT.i. 30) An apparatus according to claim 22, being subject to the additional limitation that one said item comprises, for a test T of said PTRCT provided by said PTRCT-DS and selected by the user or defined by the user and this T allegedly being passed or failed by said PTRCT, a set of I.CT-items of said PTRCT, a concatenation of which legally justifies this allegation. | 2,100 |
5,553 | 5,553 | 14,902,260 | 2,127 | In some embodiments, an apparatus and a system, as well as a method and an article, may operate to receive parameters for a first node of a network, the network including a plurality of segments through which an object is to be routed and a plurality of nodes, including the first node, representative of intersections of two or more segments of the plurality of segments; to generate segment lengths for segments between the first node and neighboring nodes to identify a nearest neighboring node with a shortest segment length relative to the first node; and to repeat operations of receiving parameters, generating segment lengths, and identifying nearest neighboring nodes until a route has been identified between a first endpoint and a second endpoint of the network. Additional apparatus, systems, and methods are disclosed. | 1. A processor-implemented method comprising:
receiving parameters for a first node of a network, the network including a plurality of segments through which an object is to be routed and a plurality of nodes, including the first node, representative of intersections of two or more segments of the plurality of segments; generating segment lengths for segments between the first node and neighboring nodes of the plurality of nodes to identify a nearest neighboring node with a shortest segment length relative to the first node; and repeating operations of receiving parameters, generating segment lengths, and identifying nearest neighboring nodes until a route has been identified between a first endpoint and a second endpoint of the network. 2. The method of claim 1, wherein the object to be routed comprises crude oil or natural gas. 3. The method of claim 2, wherein the route has been identified when segment lengths have been generated based on each node of the plurality of nodes. 4. The method of claim 2, wherein generating segment lengths comprises:
generating, based on the parameters, weights between the first node and neighboring nodes of the first node; and generating the segment lengths based on the weights. 5. The method of claim 4, wherein the parameters include:
a list of neighboring nodes, relative to the first node; a pressure difference between the first node and each neighboring node of the list; a flow regime for each segment of the plurality of segments, wherein the flow regime is determined based on a Reynolds number corresponding to each segment; and a length and diameter for each segment of the plurality of segments. 6. The method of claim 4, wherein generating the weights includes calculating a least square root (LSQR) of the parameters. 7. The method of claim 2, further comprising:
performing the operations of the method upon detection of an error condition in the network. 8. The method of claim 7, wherein the error condition includes one of a reduced flow rate, or a change in flow regime in a segment of the network, and wherein the method further includes generating an alarm indication upon detection of the error condition. 9. The method of claim 2, wherein the first endpoint comprises a wellhead and the second endpoint comprises a storage unit. 10. The method of claim 9, wherein the route includes a list of nodes between the wellhead and the storage unit. 11. The method of claim 1, further comprising:
generating a visual display of the network, wherein the visual display includes a representation of the route. 12. The method of claim 1, further comprising:
providing a control signal to control an element of the network based on the route. 13. A system comprising:
one or more processors to
receive parameters for a first node of a network, the network including a plurality of segments through which an object is to be routed and a plurality of nodes, including the first node, representative of intersections of two or more segments of the plurality of segments;
generate segment lengths for segments between the first node and neighboring nodes of the plurality of nodes to identify a nearest neighboring node with a shortest segment length relative to the first node; and
repeat operations of receiving parameters, generating segment lengths, and identifying nearest neighboring nodes until a route has been identified between a first endpoint and a second endpoint of the network;
memory to store
parameters for the first node of the network, and
parameters to define the route; and
valves to receive control signals based on the route. 14. The system of claim 13, further comprising a display to display a graphical user interface (GUI) including GUI elements representative of the route. 15. The system of claim 13, further comprising:
a notification module to
notify of an error condition in the network, and to
initiate operations of receiving parameters, generating segment lengths, and identifying nearest neighboring nodes to generate an updated route responsive to detection of the error condition. 16. A non-transitory machine-readable storage device having instructions stored thereon which, when performed by a machine, cause the machine to perform operations, the operations comprising:
receiving parameters for a first node of a network, the network including a plurality of segments through which an object is to be routed and a plurality of nodes, including the first node, representative of intersections of two or more segments of the plurality of segments; generating segment lengths for segments between the first node and neighboring nodes of the plurality of nodes to identify a nearest neighboring node with a shortest segment length relative to the first node; and repeating operations of receiving parameters, generating segment lengths, and identifying nearest neighboring nodes until a route has been identified between a first endpoint and a second endpoint of the network. 17. The non-transitory machine-readable storage device of claim 16, wherein the instructions cause the machine to perform further operations including:
determining that the route has been identified when segment lengths have been generated based on each node of the plurality of nodes, and wherein generating segment lengths comprises: generating, based on the parameters, weights between the first node and neighboring nodes; and generating the segment lengths based on the weights. 18. The non-transitory machine-readable storage device of claim 17; wherein generating the weights includes calculating a least square root (LSQR) of the parameters. 19. The non-transitory machine-readable storage device of claim 16, wherein the instructions cause the machine to perform further operations comprising:
detecting an error condition in the network; and initiating operations of identifying the route responsive to detecting the error condition. 20. The non-transitory machine-readable storage device of claim 19, wherein the error condition includes one of a reduced flow rate or a change in flow regime in a segment of the network, and wherein the method further includes generating an alarm indication upon detection of the error condition. 21-22. (canceled) | In some embodiments, an apparatus and a system, as well as a method and an article, may operate to receive parameters for a first node of a network, the network including a plurality of segments through which an object is to be routed and a plurality of nodes, including the first node, representative of intersections of two or more segments of the plurality of segments; to generate segment lengths for segments between the first node and neighboring nodes to identify a nearest neighboring node with a shortest segment length relative to the first node; and to repeat operations of receiving parameters, generating segment lengths, and identifying nearest neighboring nodes until a route has been identified between a first endpoint and a second endpoint of the network. Additional apparatus, systems, and methods are disclosed.1. A processor-implemented method comprising:
receiving parameters for a first node of a network, the network including a plurality of segments through which an object is to be routed and a plurality of nodes, including the first node, representative of intersections of two or more segments of the plurality of segments; generating segment lengths for segments between the first node and neighboring nodes of the plurality of nodes to identify a nearest neighboring node with a shortest segment length relative to the first node; and repeating operations of receiving parameters, generating segment lengths, and identifying nearest neighboring nodes until a route has been identified between a first endpoint and a second endpoint of the network. 2. The method of claim 1, wherein the object to be routed comprises crude oil or natural gas. 3. The method of claim 2, wherein the route has been identified when segment lengths have been generated based on each node of the plurality of nodes. 4. The method of claim 2, wherein generating segment lengths comprises:
generating, based on the parameters, weights between the first node and neighboring nodes of the first node; and generating the segment lengths based on the weights. 5. The method of claim 4, wherein the parameters include:
a list of neighboring nodes, relative to the first node; a pressure difference between the first node and each neighboring node of the list; a flow regime for each segment of the plurality of segments, wherein the flow regime is determined based on a Reynolds number corresponding to each segment; and a length and diameter for each segment of the plurality of segments. 6. The method of claim 4, wherein generating the weights includes calculating a least square root (LSQR) of the parameters. 7. The method of claim 2, further comprising:
performing the operations of the method upon detection of an error condition in the network. 8. The method of claim 7, wherein the error condition includes one of a reduced flow rate, or a change in flow regime in a segment of the network, and wherein the method further includes generating an alarm indication upon detection of the error condition. 9. The method of claim 2, wherein the first endpoint comprises a wellhead and the second endpoint comprises a storage unit. 10. The method of claim 9, wherein the route includes a list of nodes between the wellhead and the storage unit. 11. The method of claim 1, further comprising:
generating a visual display of the network, wherein the visual display includes a representation of the route. 12. The method of claim 1, further comprising:
providing a control signal to control an element of the network based on the route. 13. A system comprising:
one or more processors to
receive parameters for a first node of a network, the network including a plurality of segments through which an object is to be routed and a plurality of nodes, including the first node, representative of intersections of two or more segments of the plurality of segments;
generate segment lengths for segments between the first node and neighboring nodes of the plurality of nodes to identify a nearest neighboring node with a shortest segment length relative to the first node; and
repeat operations of receiving parameters, generating segment lengths, and identifying nearest neighboring nodes until a route has been identified between a first endpoint and a second endpoint of the network;
memory to store
parameters for the first node of the network, and
parameters to define the route; and
valves to receive control signals based on the route. 14. The system of claim 13, further comprising a display to display a graphical user interface (GUI) including GUI elements representative of the route. 15. The system of claim 13, further comprising:
a notification module to
notify of an error condition in the network, and to
initiate operations of receiving parameters, generating segment lengths, and identifying nearest neighboring nodes to generate an updated route responsive to detection of the error condition. 16. A non-transitory machine-readable storage device having instructions stored thereon which, when performed by a machine, cause the machine to perform operations, the operations comprising:
receiving parameters for a first node of a network, the network including a plurality of segments through which an object is to be routed and a plurality of nodes, including the first node, representative of intersections of two or more segments of the plurality of segments; generating segment lengths for segments between the first node and neighboring nodes of the plurality of nodes to identify a nearest neighboring node with a shortest segment length relative to the first node; and repeating operations of receiving parameters, generating segment lengths, and identifying nearest neighboring nodes until a route has been identified between a first endpoint and a second endpoint of the network. 17. The non-transitory machine-readable storage device of claim 16, wherein the instructions cause the machine to perform further operations including:
determining that the route has been identified when segment lengths have been generated based on each node of the plurality of nodes, and wherein generating segment lengths comprises: generating, based on the parameters, weights between the first node and neighboring nodes; and generating the segment lengths based on the weights. 18. The non-transitory machine-readable storage device of claim 17; wherein generating the weights includes calculating a least square root (LSQR) of the parameters. 19. The non-transitory machine-readable storage device of claim 16, wherein the instructions cause the machine to perform further operations comprising:
detecting an error condition in the network; and initiating operations of identifying the route responsive to detecting the error condition. 20. The non-transitory machine-readable storage device of claim 19, wherein the error condition includes one of a reduced flow rate or a change in flow regime in a segment of the network, and wherein the method further includes generating an alarm indication upon detection of the error condition. 21-22. (canceled) | 2,100 |
5,554 | 5,554 | 13,743,626 | 2,158 | A computer system having one or more processors and memory storing one or more programs for execution by the one or more processors is described. The computer system displays at least a portion of the respective document, and while displaying at least the portion of the respective document, receives a request for document operation labels. The document operation labels correspond to respective document operations. In response to receiving the request for document operation labels, the computer system selects a plurality of document operation labels at least in accordance with user data and user-interface data corresponding to a respective user of the computer system, and provides the plurality of document operation labels for display to the respective user. | 1. A computer-implemented method for providing document operation labels for use with a respective document stored in an online document system, comprising:
storing one or more programs in memory for execution by one or more processors to perform the method of: storing user data for a user in a user information database, wherein:
the user data includes login information associated with the user;
the user data includes a list of documents that are associated with the user,
the user data includes a feature usage history of the respective user,
the feature usage history includes document operations that have been selected by the respective user, and
the list of documents includes the respective document;
displaying, to the authenticated respective user at a client device, at least a portion of the respective document; while displaying at least the portion of the respective document, receiving a request for document operation labels, the document operation labels corresponding to respective document operations; and in response to receiving the request for document operation labels:
selecting a plurality of document operation labels at least in accordance with a frequency of respective document operations in the feature usage history; and
providing the plurality of document operation labels for display in a browser application to the respective user. 2. The computer-implemented method of claim 1, wherein:
displaying at least the portion of the respective document includes concurrently displaying at least the portion of the respective document and a region for receiving a search query; and receiving the request for document operation labels includes detecting user selection of the region for receiving the search query. 3. The computer-implemented method of claim 1, wherein:
the plurality of document operation labels is selected in accordance with a document operation classifier that receives at least the user data and the user-interface data corresponding to the respective user as input; and the method includes: receiving a user selection of one of the plurality of document operation labels by the respective user; and updating the document operation classifier in accordance with the user selection. 4-5. (canceled) 6. The computer-implemented method of claim 1, wherein
at least a subset of the plurality of document operation labels is selected in accordance with a recency of respective document operations in the feature usage history. 7. The computer-implemented method of claim 1, wherein:
the user data identifies a geographic location of the respective user; and the method includes selecting at least a subset of the plurality of document operation labels in accordance with the location of the respective user. 8. The computer-implemented method of claim 1, wherein:
the user data identifies a job function of the respective user; and the method includes selecting at least a subset of the plurality of document operation labels in accordance with the job function of the respective user. 9. The computer-implemented method of claim 1, wherein:
the user data includes a feature search history, the feature search history identifying a plurality of search queries that have been used by the respective user to identify one or more document operations; and the method includes selecting at least a subset of the plurality of document operation labels in accordance with the feature search history. 10. The computer-implemented method of claim 1, wherein:
the user interface data identifies one or more visible objects in the respective document; and the method includes selecting at least a subset of the plurality of document operation labels in accordance with at least one of the one or more visible objects. 11. The computer-implemented method of claim 1, wherein:
the user interface data identifies one or more selected objects in the respective document; and the method includes selecting at least a subset of the plurality of document operation labels in accordance with at least one of the one or more selected objects. 12. The computer-implemented method of claim 1, wherein:
the user interface data identifies one or more document operation labels in an undo stack or a redo stack; and the method includes selecting at least a subset of the plurality of document operation labels in accordance with at least one of the one or more document operation labels in the undo stack or the redo stack. 13. The computer-implemented method of claim 1, wherein:
the user interface data identifies a cursor location in the respective document; and the method includes selecting at least a subset of the plurality of document operation labels in accordance with the cursor location in the respective document. 14. The computer-implemented method of claim 1, including:
receiving a search query from the respective user; and selecting at least a subset of the plurality of document operation labels in accordance with: the search query, user data and user-interface data corresponding to the respective user, and user data and user-interface data corresponding to a community of users. 15. The computer-implemented method of claim 1, including:
receiving a search query from the respective user; identifying candidate document operation labels including: one or more document operation labels selected in accordance with the search query, one or more document operation labels selected in accordance with user data corresponding to the respective user, one or more document operation labels selected in accordance with user-interface data corresponding to the respective user, one or more document operation labels selected in accordance with user data corresponding to a community of users, and one or more document operation labels selected in accordance with user-interface data corresponding to the community of users; and selecting at least a subset of the candidate document operation labels for display to the respective user. 16. The computer-implemented method of claim 1, further comprising:
selecting one or more document operation labels corresponding to one or more document operations used with respect to one or more documents related to the respective document. 17. The computer-implemented method of claim 16, wherein the one or more related documents and the respective document are included in a same document collection. 18. The computer-implemented method of claim 16, wherein:
each document is associated with a respective domain; and the one or more related documents and the respective document are associated with a same domain. 19. A computer system, comprising:
one or more processors; and memory storing one or more programs for execution by the one or more processors, the one or more programs including instructions for performing: storing user data for a user in a user information database, wherein:
the user data includes login information associated with the user;
the user data includes a list of documents that are associated with the user,
the user data includes a feature usage history of the respective user,
the feature usage history includes document operations that have been selected by the respective user, and
the list of documents includes the respective document;
displaying, to the authenticated respective user at a client device, at least a portion of the respective document; while displaying at least the portion of the respective document, receiving a request for document operation labels, the document operation labels corresponding to respective document operations; and in response to receiving the request for document operation labels: selecting a plurality of document operation labels at least in accordance with a frequency of respective document operations in the feature usage history; and providing the plurality of document operation labels for display in a browser application to the respective user. 20. A non-transitory computer-readable storage medium, storing one or more programs for execution by a computer system with one or more processors, the one or more programs including instructions for performing:
storing user data for a user in a user information database, wherein:
the user data includes login information associated with the user;
the user data includes a list of documents that are associated with the user,
the user data includes a feature usage history of the respective user,
the feature usage history includes document operations that have been selected by the respective user, and
the list of documents includes the respective document;
displaying, to the authenticated respective user at a client device, at least a portion of the respective document; while displaying at least the portion of the respective document, receiving a request for document operation labels, the document operation labels corresponding to respective document operations; and in response to receiving the request for document operation labels: selecting a plurality of document operation labels at least in accordance with a frequency of respective document operations in the feature usage history; and providing the plurality of document operation labels for display in a browser application to the respective user. | A computer system having one or more processors and memory storing one or more programs for execution by the one or more processors is described. The computer system displays at least a portion of the respective document, and while displaying at least the portion of the respective document, receives a request for document operation labels. The document operation labels correspond to respective document operations. In response to receiving the request for document operation labels, the computer system selects a plurality of document operation labels at least in accordance with user data and user-interface data corresponding to a respective user of the computer system, and provides the plurality of document operation labels for display to the respective user.1. A computer-implemented method for providing document operation labels for use with a respective document stored in an online document system, comprising:
storing one or more programs in memory for execution by one or more processors to perform the method of: storing user data for a user in a user information database, wherein:
the user data includes login information associated with the user;
the user data includes a list of documents that are associated with the user,
the user data includes a feature usage history of the respective user,
the feature usage history includes document operations that have been selected by the respective user, and
the list of documents includes the respective document;
displaying, to the authenticated respective user at a client device, at least a portion of the respective document; while displaying at least the portion of the respective document, receiving a request for document operation labels, the document operation labels corresponding to respective document operations; and in response to receiving the request for document operation labels:
selecting a plurality of document operation labels at least in accordance with a frequency of respective document operations in the feature usage history; and
providing the plurality of document operation labels for display in a browser application to the respective user. 2. The computer-implemented method of claim 1, wherein:
displaying at least the portion of the respective document includes concurrently displaying at least the portion of the respective document and a region for receiving a search query; and receiving the request for document operation labels includes detecting user selection of the region for receiving the search query. 3. The computer-implemented method of claim 1, wherein:
the plurality of document operation labels is selected in accordance with a document operation classifier that receives at least the user data and the user-interface data corresponding to the respective user as input; and the method includes: receiving a user selection of one of the plurality of document operation labels by the respective user; and updating the document operation classifier in accordance with the user selection. 4-5. (canceled) 6. The computer-implemented method of claim 1, wherein
at least a subset of the plurality of document operation labels is selected in accordance with a recency of respective document operations in the feature usage history. 7. The computer-implemented method of claim 1, wherein:
the user data identifies a geographic location of the respective user; and the method includes selecting at least a subset of the plurality of document operation labels in accordance with the location of the respective user. 8. The computer-implemented method of claim 1, wherein:
the user data identifies a job function of the respective user; and the method includes selecting at least a subset of the plurality of document operation labels in accordance with the job function of the respective user. 9. The computer-implemented method of claim 1, wherein:
the user data includes a feature search history, the feature search history identifying a plurality of search queries that have been used by the respective user to identify one or more document operations; and the method includes selecting at least a subset of the plurality of document operation labels in accordance with the feature search history. 10. The computer-implemented method of claim 1, wherein:
the user interface data identifies one or more visible objects in the respective document; and the method includes selecting at least a subset of the plurality of document operation labels in accordance with at least one of the one or more visible objects. 11. The computer-implemented method of claim 1, wherein:
the user interface data identifies one or more selected objects in the respective document; and the method includes selecting at least a subset of the plurality of document operation labels in accordance with at least one of the one or more selected objects. 12. The computer-implemented method of claim 1, wherein:
the user interface data identifies one or more document operation labels in an undo stack or a redo stack; and the method includes selecting at least a subset of the plurality of document operation labels in accordance with at least one of the one or more document operation labels in the undo stack or the redo stack. 13. The computer-implemented method of claim 1, wherein:
the user interface data identifies a cursor location in the respective document; and the method includes selecting at least a subset of the plurality of document operation labels in accordance with the cursor location in the respective document. 14. The computer-implemented method of claim 1, including:
receiving a search query from the respective user; and selecting at least a subset of the plurality of document operation labels in accordance with: the search query, user data and user-interface data corresponding to the respective user, and user data and user-interface data corresponding to a community of users. 15. The computer-implemented method of claim 1, including:
receiving a search query from the respective user; identifying candidate document operation labels including: one or more document operation labels selected in accordance with the search query, one or more document operation labels selected in accordance with user data corresponding to the respective user, one or more document operation labels selected in accordance with user-interface data corresponding to the respective user, one or more document operation labels selected in accordance with user data corresponding to a community of users, and one or more document operation labels selected in accordance with user-interface data corresponding to the community of users; and selecting at least a subset of the candidate document operation labels for display to the respective user. 16. The computer-implemented method of claim 1, further comprising:
selecting one or more document operation labels corresponding to one or more document operations used with respect to one or more documents related to the respective document. 17. The computer-implemented method of claim 16, wherein the one or more related documents and the respective document are included in a same document collection. 18. The computer-implemented method of claim 16, wherein:
each document is associated with a respective domain; and the one or more related documents and the respective document are associated with a same domain. 19. A computer system, comprising:
one or more processors; and memory storing one or more programs for execution by the one or more processors, the one or more programs including instructions for performing: storing user data for a user in a user information database, wherein:
the user data includes login information associated with the user;
the user data includes a list of documents that are associated with the user,
the user data includes a feature usage history of the respective user,
the feature usage history includes document operations that have been selected by the respective user, and
the list of documents includes the respective document;
displaying, to the authenticated respective user at a client device, at least a portion of the respective document; while displaying at least the portion of the respective document, receiving a request for document operation labels, the document operation labels corresponding to respective document operations; and in response to receiving the request for document operation labels: selecting a plurality of document operation labels at least in accordance with a frequency of respective document operations in the feature usage history; and providing the plurality of document operation labels for display in a browser application to the respective user. 20. A non-transitory computer-readable storage medium, storing one or more programs for execution by a computer system with one or more processors, the one or more programs including instructions for performing:
storing user data for a user in a user information database, wherein:
the user data includes login information associated with the user;
the user data includes a list of documents that are associated with the user,
the user data includes a feature usage history of the respective user,
the feature usage history includes document operations that have been selected by the respective user, and
the list of documents includes the respective document;
displaying, to the authenticated respective user at a client device, at least a portion of the respective document; while displaying at least the portion of the respective document, receiving a request for document operation labels, the document operation labels corresponding to respective document operations; and in response to receiving the request for document operation labels: selecting a plurality of document operation labels at least in accordance with a frequency of respective document operations in the feature usage history; and providing the plurality of document operation labels for display in a browser application to the respective user. | 2,100 |
5,555 | 5,555 | 14,894,066 | 2,169 | A method and apparatus for logging data records on data received from a log source in a network comprising a plurality of log sources, the apparatus comprising a processor to format the received data into a log file data format encoded with a unique record identifier encoded in the log file data format for identifying and associating between data of records of a first record originating from first protocol data unit layer, and a second record originating from a second protocol data unit layer different from the first protocol data unit layer. | 1.-105. (canceled) 106. An apparatus for logging data received from a log source in a network comprising at least one log source having a protocol data unit layer, the apparatus comprising:
a processor configured to format the data received from the log source into a log file data format encoded with a unique record identifier for identifying and associating between data of records of a first record originating from a first protocol data unit layer, and a second record originating from a second protocol data unit layer different from the first protocol data unit layer. 107. The apparatus of claim 106, wherein the first protocol data unit layer is a physical layer of open systems interconnection (OSI) protocols. 108. The apparatus of claim 106, wherein the second protocol data unit layer is a data link layer of open systems interconnection (OSI) protocols. 109. The apparatus of claim 106, wherein the received data is downlink data wherein the data passes from the second protocol data unit layer to the first protocol data unit layer. 110. The apparatus of claim 106, wherein the received data is uplink data wherein the data passes from the first protocol data unit layer to the second protocol data unit layer. 111. The apparatus of claim 106, wherein the first record of data is radio link control (RLC) data. 112. The apparatus of claim 106, wherein the second record of data is media access control (MAC) data. 113. The apparatus of claim 106, wherein the second protocol data unit layer is a network layer of open systems interconnection (OSI) protocols. 114. The apparatus of claim 106, wherein the first record and second record are received from different log sources. 115. The apparatus of claim 106, wherein multiple source protocol data unit layer records are transported via the first protocol data unit layer or second protocol data unit layer. 116. The apparatus of claim 106, wherein each record comprises a header comprising the unique record identifier and a time identifier for identifying the time the data is logged at the log source and for identification of the log source from where data originates. 117. The apparatus of claim 106, wherein the unique record identifier comprises a counter that is incremented with each record originating from a log source. 118. The apparatus of claim 106, wherein the log file data format comprises a portion of data that is compressed. 119. The apparatus of claim 106, further comprising:
an encoder to encode the data with a time identifier for identifying the time the data is logged at the log source; and a log source identifier for identification of the log source from where data is received. 120. The apparatus of claim 106, wherein the processor is arranged to reformat a first log file data format into a second log file data format. 121. The apparatus of claim 106, wherein the processor is arranged to reformat the log file data format into a log file view data format for output. 122. The apparatus of claim 106, wherein the processor is arranged to format the log file view data format into a filtered format without the first record of data relating to a first protocol data unit layer. 123. The apparatus of claim 106, wherein the processor is configured to format the log file data format into the log file view data format for output upon receipt of a request for output of the logging data. 124. The apparatus of claim 106, wherein the processor is arranged to load a partial set of the log file view data as required for output. 125. The apparatus of claim 106, wherein the partially loaded log file view data is cached in a memory and the processor is arranged to load unloaded log file view data as required for output. 126. The apparatus of claim 125, wherein the processor is arranged to remove from memory the log file view data cached in memory after a predetermined time. 127. The apparatus of claim 106, wherein the network of log sources is a mobile communications network simulation test system for running a test activity on user equipment. 128. The apparatus of claim 106, wherein the first record of data and second record of data are batched and stored according to the log source identifier. 129. The apparatus of claim 106, wherein the log file data format is arranged with at least two types of record data, a first type of log data relating to control records of a mobile communications network simulation test system, and a second type of log data relating to data records of a test of a user equipment. 130. The apparatus of claim 106, wherein the log file data format comprises a header wherein the header being uncompressed. 131. The apparatus of claim 106, wherein the log file data format comprises a data and control records section with data records and control records mixed in any order. 132. The apparatus of claim 106, wherein the log file data format is batched according to a trigger event. 133. The apparatus of claim 132, wherein the trigger event is based on a predetermined time. 134. The apparatus of claim 106, wherein the apparatus is a log server, configured to log data received from the log source having a protocol data unit layer. 135. A non-transitory computer readable medium comprising instructions, executable a processor of a device, which when executed by an apparatus for logging data received from a log source in a network device with a screen display, cause the apparatus to perform a method of formatting log data received from a log source in a network comprising at least one log source having a protocol data unit layer, the method comprising:
receiving the log data from a log source; and formatting the received log data into a log file format with a unique record identifier encoded in the log file data format for identifying and associating between data of records of a first record originating from first protocol data unit layer, and a second record originating from a second protocol data unit layer different from the first protocol data unit layer. 136. The non-statutory computer readable medium of claim 135, wherein the first protocol data unit layer is a physical layer of open systems interconnection (OSI) protocols. 137. The non-statutory computer readable medium of claim 135, wherein the second protocol data unit layer is a data link layer of open systems interconnection (OSI) protocols. 138. The non-statutory computer readable medium of claim 135, wherein receiving the data as downlink data wherein the data passes from the second protocol data unit layer to the first protocol data unit layer. 139. The non-statutory computer readable medium of claim 135, wherein receiving the data as uplink data wherein the data passes from the first protocol data unit layer to the second protocol data unit layer. | A method and apparatus for logging data records on data received from a log source in a network comprising a plurality of log sources, the apparatus comprising a processor to format the received data into a log file data format encoded with a unique record identifier encoded in the log file data format for identifying and associating between data of records of a first record originating from first protocol data unit layer, and a second record originating from a second protocol data unit layer different from the first protocol data unit layer.1.-105. (canceled) 106. An apparatus for logging data received from a log source in a network comprising at least one log source having a protocol data unit layer, the apparatus comprising:
a processor configured to format the data received from the log source into a log file data format encoded with a unique record identifier for identifying and associating between data of records of a first record originating from a first protocol data unit layer, and a second record originating from a second protocol data unit layer different from the first protocol data unit layer. 107. The apparatus of claim 106, wherein the first protocol data unit layer is a physical layer of open systems interconnection (OSI) protocols. 108. The apparatus of claim 106, wherein the second protocol data unit layer is a data link layer of open systems interconnection (OSI) protocols. 109. The apparatus of claim 106, wherein the received data is downlink data wherein the data passes from the second protocol data unit layer to the first protocol data unit layer. 110. The apparatus of claim 106, wherein the received data is uplink data wherein the data passes from the first protocol data unit layer to the second protocol data unit layer. 111. The apparatus of claim 106, wherein the first record of data is radio link control (RLC) data. 112. The apparatus of claim 106, wherein the second record of data is media access control (MAC) data. 113. The apparatus of claim 106, wherein the second protocol data unit layer is a network layer of open systems interconnection (OSI) protocols. 114. The apparatus of claim 106, wherein the first record and second record are received from different log sources. 115. The apparatus of claim 106, wherein multiple source protocol data unit layer records are transported via the first protocol data unit layer or second protocol data unit layer. 116. The apparatus of claim 106, wherein each record comprises a header comprising the unique record identifier and a time identifier for identifying the time the data is logged at the log source and for identification of the log source from where data originates. 117. The apparatus of claim 106, wherein the unique record identifier comprises a counter that is incremented with each record originating from a log source. 118. The apparatus of claim 106, wherein the log file data format comprises a portion of data that is compressed. 119. The apparatus of claim 106, further comprising:
an encoder to encode the data with a time identifier for identifying the time the data is logged at the log source; and a log source identifier for identification of the log source from where data is received. 120. The apparatus of claim 106, wherein the processor is arranged to reformat a first log file data format into a second log file data format. 121. The apparatus of claim 106, wherein the processor is arranged to reformat the log file data format into a log file view data format for output. 122. The apparatus of claim 106, wherein the processor is arranged to format the log file view data format into a filtered format without the first record of data relating to a first protocol data unit layer. 123. The apparatus of claim 106, wherein the processor is configured to format the log file data format into the log file view data format for output upon receipt of a request for output of the logging data. 124. The apparatus of claim 106, wherein the processor is arranged to load a partial set of the log file view data as required for output. 125. The apparatus of claim 106, wherein the partially loaded log file view data is cached in a memory and the processor is arranged to load unloaded log file view data as required for output. 126. The apparatus of claim 125, wherein the processor is arranged to remove from memory the log file view data cached in memory after a predetermined time. 127. The apparatus of claim 106, wherein the network of log sources is a mobile communications network simulation test system for running a test activity on user equipment. 128. The apparatus of claim 106, wherein the first record of data and second record of data are batched and stored according to the log source identifier. 129. The apparatus of claim 106, wherein the log file data format is arranged with at least two types of record data, a first type of log data relating to control records of a mobile communications network simulation test system, and a second type of log data relating to data records of a test of a user equipment. 130. The apparatus of claim 106, wherein the log file data format comprises a header wherein the header being uncompressed. 131. The apparatus of claim 106, wherein the log file data format comprises a data and control records section with data records and control records mixed in any order. 132. The apparatus of claim 106, wherein the log file data format is batched according to a trigger event. 133. The apparatus of claim 132, wherein the trigger event is based on a predetermined time. 134. The apparatus of claim 106, wherein the apparatus is a log server, configured to log data received from the log source having a protocol data unit layer. 135. A non-transitory computer readable medium comprising instructions, executable a processor of a device, which when executed by an apparatus for logging data received from a log source in a network device with a screen display, cause the apparatus to perform a method of formatting log data received from a log source in a network comprising at least one log source having a protocol data unit layer, the method comprising:
receiving the log data from a log source; and formatting the received log data into a log file format with a unique record identifier encoded in the log file data format for identifying and associating between data of records of a first record originating from first protocol data unit layer, and a second record originating from a second protocol data unit layer different from the first protocol data unit layer. 136. The non-statutory computer readable medium of claim 135, wherein the first protocol data unit layer is a physical layer of open systems interconnection (OSI) protocols. 137. The non-statutory computer readable medium of claim 135, wherein the second protocol data unit layer is a data link layer of open systems interconnection (OSI) protocols. 138. The non-statutory computer readable medium of claim 135, wherein receiving the data as downlink data wherein the data passes from the second protocol data unit layer to the first protocol data unit layer. 139. The non-statutory computer readable medium of claim 135, wherein receiving the data as uplink data wherein the data passes from the first protocol data unit layer to the second protocol data unit layer. | 2,100 |
5,556 | 5,556 | 14,132,063 | 2,174 | An embodiment provides a method, including: ascertaining, via an input component of an information handling device, a graphical input; determining, using a processor, two or more functions associated with the graphical input; and providing, using the processor, an indication co-displayed with a rendering of the graphical input and associated with the two or more functions. Other aspects are described and claimed. | 1. A method, comprising:
ascertaining, via an input component of an information handling device, a graphical input; determining, using a processor, two or more functions associated with the graphical input; and providing, using the processor, an indication co-displayed with a rendering of the graphical input and associated with the two or more functions. 2. The method of claim 1, wherein the indication comprises interactive user interface components. 3. The method of claim 2, wherein the interactive user interface components are rendered as ordered tabs in a display of the information handling device. 4. The method of claim 3, wherein the graphical input is pen input; and
further comprising: rendering pen input in the display; wherein the ordered tabs are rendered in association with the rendered pen input. 5. The method of claim 3, wherein the ordered tabs are ordered according to a user profile. 6. The method of claim 5, wherein the user profile is based on data selected from the group consisting of user-specific data and group data. 7. The method of claim 2, further comprising receiving, via an interactive user interface component, a user selection. 8. The method of claim 7, further comprising displaying a temporary indication of an action to be committed according to the user selection. 9. The method of claim 7, further comprising committing an action according to the user selection. 10. The method of claim 9, further comprising updating the indication of functions based on user input. 11. An information handling device, comprising:
an input component; a display; a processor; and a memory that stores instructions executable the processor to: ascertain, via the input component, a graphical input; determine two or more functions associated with the graphical input; and provide an indication co-displayed with a rendering of the graphical input and associated with the two or more functions. 12. The information handling device of claim 11, wherein the indication comprises interactive user interface components. 13. The information handling device of claim 12, wherein the interactive user interface components are rendered as ordered tabs in a display of the information handling device. 14. The information handling device of claim 13, wherein the graphical input is pen input; and
wherein the instructions are further executable by the processor to: render pen input in the display; wherein the ordered tabs are rendered in association with the rendered pen input. 15. The information handling device of claim 13, wherein the ordered tabs are ordered according to a user profile. 16. The information handling device of claim 15, wherein the user profile is based on data selected from the group consisting of user-specific data and group data. 17. The information handling device of claim 12, wherein the instructions are further executable by the processor to receive, via an interactive user interface component, a user selection. 18. The information handling device of claim 17, wherein the instructions are further executable by the processor to display a temporary indication of an action to be committed according to the user selection. 19. The information handling device of claim 17, wherein the instructions are further executable by the processor to commit an action according to the user selection. 20. A program product, comprising:
a storage medium comprising computer readable program code, the computer readable program code comprising: code that ascertains, via an input component of an information handling device, a graphical input; code that determines, using a processor, two or more functions associated with the graphical input; and code that provides, using the processor, an indication co-displayed with a rendering of the graphical input and associated with the two or more functions. | An embodiment provides a method, including: ascertaining, via an input component of an information handling device, a graphical input; determining, using a processor, two or more functions associated with the graphical input; and providing, using the processor, an indication co-displayed with a rendering of the graphical input and associated with the two or more functions. Other aspects are described and claimed.1. A method, comprising:
ascertaining, via an input component of an information handling device, a graphical input; determining, using a processor, two or more functions associated with the graphical input; and providing, using the processor, an indication co-displayed with a rendering of the graphical input and associated with the two or more functions. 2. The method of claim 1, wherein the indication comprises interactive user interface components. 3. The method of claim 2, wherein the interactive user interface components are rendered as ordered tabs in a display of the information handling device. 4. The method of claim 3, wherein the graphical input is pen input; and
further comprising: rendering pen input in the display; wherein the ordered tabs are rendered in association with the rendered pen input. 5. The method of claim 3, wherein the ordered tabs are ordered according to a user profile. 6. The method of claim 5, wherein the user profile is based on data selected from the group consisting of user-specific data and group data. 7. The method of claim 2, further comprising receiving, via an interactive user interface component, a user selection. 8. The method of claim 7, further comprising displaying a temporary indication of an action to be committed according to the user selection. 9. The method of claim 7, further comprising committing an action according to the user selection. 10. The method of claim 9, further comprising updating the indication of functions based on user input. 11. An information handling device, comprising:
an input component; a display; a processor; and a memory that stores instructions executable the processor to: ascertain, via the input component, a graphical input; determine two or more functions associated with the graphical input; and provide an indication co-displayed with a rendering of the graphical input and associated with the two or more functions. 12. The information handling device of claim 11, wherein the indication comprises interactive user interface components. 13. The information handling device of claim 12, wherein the interactive user interface components are rendered as ordered tabs in a display of the information handling device. 14. The information handling device of claim 13, wherein the graphical input is pen input; and
wherein the instructions are further executable by the processor to: render pen input in the display; wherein the ordered tabs are rendered in association with the rendered pen input. 15. The information handling device of claim 13, wherein the ordered tabs are ordered according to a user profile. 16. The information handling device of claim 15, wherein the user profile is based on data selected from the group consisting of user-specific data and group data. 17. The information handling device of claim 12, wherein the instructions are further executable by the processor to receive, via an interactive user interface component, a user selection. 18. The information handling device of claim 17, wherein the instructions are further executable by the processor to display a temporary indication of an action to be committed according to the user selection. 19. The information handling device of claim 17, wherein the instructions are further executable by the processor to commit an action according to the user selection. 20. A program product, comprising:
a storage medium comprising computer readable program code, the computer readable program code comprising: code that ascertains, via an input component of an information handling device, a graphical input; code that determines, using a processor, two or more functions associated with the graphical input; and code that provides, using the processor, an indication co-displayed with a rendering of the graphical input and associated with the two or more functions. | 2,100 |
5,557 | 5,557 | 13,430,034 | 2,153 | Techniques for processing relational data with a user-defined function (UDF) are provided. Relational input data being requested by the UDF, from within a relational database system, is intercepted and normalized. The UDF is called with the normalized input data and as the UDF produces output data in response to the normalized input data that output data is captured and normalized. In an embodiment, the normalized output data is used to dynamically update a data model within the relational database for the input data. | 1. A method implemented and programmed within a non-transitory computer-readable storage medium and processed by one or more processors, the processors configured to execute the method, comprising:
acquiring a data model for input data to a user-defined function (UDF), the input data housed in a relational database; normalizing the input data; initiating the UDF to perform custom-user defined calculations using the normalized data; mapping output data produced from the UDF into a normalized output format; and updating the data model based on the mapped output data in the normalized output format. 2. The method of claim 1, wherein acquiring further includes deriving the data model from analysis of the input data. 3. The method of claim 2, wherein deriving further includes identifying processing characteristics associated with the input data for use with parallel processing by the UDF. 4. The method of claim 1, wherein normalizing further includes mapping the input data using the data model into an input data array for usage by the UDF. 5. The method of claim 1, wherein normalizing further includes mapping the input data into a database table for use by the UDF. 6. The method of claim 1, wherein mapping further includes translating the output data as it is produced by the UDF into the normalized output format. 7. The method of claim 1, wherein mapping further includes populating the output data into a database table of the relational database. 8. The method of claim 1, wherein updating further includes augmenting the data model with additional data definitions and/or modified data definitions based on normalized output format. 9. A method implemented and programmed within a non-transitory computer-readable storage medium and processed by one or more processors, the processors configured to execute the method, comprising:
converting input data acquired from a relational database into a normalized data format; passing the normalized input data to a user-customized user-defined function (UDF) for processing; capturing output data produced by the user-customized UDF; and translating the output data into the normalized data format for updating the relational database. 10. The method of claim 9 further comprising, processing a debugging tool debug the method. 11. The method of claim 9, wherein converting further includes calling a pre-processing UDF that intercepts a call being made to the user-customized UDF within the relational database to convert the input data into the normalized data format. 12. The method of claim 9, wherein converting further includes translating the input data into a normalized input data array with different dimensions from the input data. 13. The method of claim 12, wherein translating the input data further includes using a data model acquired from the relational database to produce the normalized input data array. 14. The method of claim 12, wherein translating the input data further includes deriving a data model based on attributes acquired for the input data from the relational database. 15. The method of claim 9, wherein passing further includes configuring the user-customized UDF with processing characteristics defined for the normalized input data to facilitate parallel processing throughput by the user-customized UDF. 16. The method of claim 9, wherein passing further includes interfacing a memory management UDF and a process management UDF to the user-customized UDF to manage memory usage and processor usage of the user-customized UDF while the user-customized UDF processes the normalized input data. 17. The method of claim 9, wherein capturing further includes intercepting the output data as it is produced by the user-customized UDF and calling a post-processing UDF. 18. The method of claim 17, wherein translating further includes using the post-processing UDF to dynamically render the normalized output data. 19. A system, comprising:
one or more processors of a parallel database management system (DBMS) configured with a pre-process user-defined function (UDF) and a post-process UDF, the pre-process UDF and the post-process UDF implemented, programmed, and resides within a non-transitory computer-readable storage medium that execute on the one or more processors; wherein the pre-process UDF is configured to intercept calls made to a user-customized UDF to normalize input data being acquired by the user-customized UDF from the DBMS and configured to provide the normalized input data to the user-customized UDF for processing within the DBMS, the post-process UDF configured to intercept output data produced by the user-customized UDF and translate the output data to normalized output data. 20. The system of claim 19 further comprising, a data model feedback module implemented, programmed, and residing within a non-transitory computer-readable storage medium and for execution on the one or more processors, the data model feedback module configured to dynamically update a data model that defines the input data based on the normalized output data. | Techniques for processing relational data with a user-defined function (UDF) are provided. Relational input data being requested by the UDF, from within a relational database system, is intercepted and normalized. The UDF is called with the normalized input data and as the UDF produces output data in response to the normalized input data that output data is captured and normalized. In an embodiment, the normalized output data is used to dynamically update a data model within the relational database for the input data.1. A method implemented and programmed within a non-transitory computer-readable storage medium and processed by one or more processors, the processors configured to execute the method, comprising:
acquiring a data model for input data to a user-defined function (UDF), the input data housed in a relational database; normalizing the input data; initiating the UDF to perform custom-user defined calculations using the normalized data; mapping output data produced from the UDF into a normalized output format; and updating the data model based on the mapped output data in the normalized output format. 2. The method of claim 1, wherein acquiring further includes deriving the data model from analysis of the input data. 3. The method of claim 2, wherein deriving further includes identifying processing characteristics associated with the input data for use with parallel processing by the UDF. 4. The method of claim 1, wherein normalizing further includes mapping the input data using the data model into an input data array for usage by the UDF. 5. The method of claim 1, wherein normalizing further includes mapping the input data into a database table for use by the UDF. 6. The method of claim 1, wherein mapping further includes translating the output data as it is produced by the UDF into the normalized output format. 7. The method of claim 1, wherein mapping further includes populating the output data into a database table of the relational database. 8. The method of claim 1, wherein updating further includes augmenting the data model with additional data definitions and/or modified data definitions based on normalized output format. 9. A method implemented and programmed within a non-transitory computer-readable storage medium and processed by one or more processors, the processors configured to execute the method, comprising:
converting input data acquired from a relational database into a normalized data format; passing the normalized input data to a user-customized user-defined function (UDF) for processing; capturing output data produced by the user-customized UDF; and translating the output data into the normalized data format for updating the relational database. 10. The method of claim 9 further comprising, processing a debugging tool debug the method. 11. The method of claim 9, wherein converting further includes calling a pre-processing UDF that intercepts a call being made to the user-customized UDF within the relational database to convert the input data into the normalized data format. 12. The method of claim 9, wherein converting further includes translating the input data into a normalized input data array with different dimensions from the input data. 13. The method of claim 12, wherein translating the input data further includes using a data model acquired from the relational database to produce the normalized input data array. 14. The method of claim 12, wherein translating the input data further includes deriving a data model based on attributes acquired for the input data from the relational database. 15. The method of claim 9, wherein passing further includes configuring the user-customized UDF with processing characteristics defined for the normalized input data to facilitate parallel processing throughput by the user-customized UDF. 16. The method of claim 9, wherein passing further includes interfacing a memory management UDF and a process management UDF to the user-customized UDF to manage memory usage and processor usage of the user-customized UDF while the user-customized UDF processes the normalized input data. 17. The method of claim 9, wherein capturing further includes intercepting the output data as it is produced by the user-customized UDF and calling a post-processing UDF. 18. The method of claim 17, wherein translating further includes using the post-processing UDF to dynamically render the normalized output data. 19. A system, comprising:
one or more processors of a parallel database management system (DBMS) configured with a pre-process user-defined function (UDF) and a post-process UDF, the pre-process UDF and the post-process UDF implemented, programmed, and resides within a non-transitory computer-readable storage medium that execute on the one or more processors; wherein the pre-process UDF is configured to intercept calls made to a user-customized UDF to normalize input data being acquired by the user-customized UDF from the DBMS and configured to provide the normalized input data to the user-customized UDF for processing within the DBMS, the post-process UDF configured to intercept output data produced by the user-customized UDF and translate the output data to normalized output data. 20. The system of claim 19 further comprising, a data model feedback module implemented, programmed, and residing within a non-transitory computer-readable storage medium and for execution on the one or more processors, the data model feedback module configured to dynamically update a data model that defines the input data based on the normalized output data. | 2,100 |
5,558 | 5,558 | 14,494,226 | 2,166 | A system and method for a media filter publication application are described. The media filter publication application receives a content item and a selected geolocation, generates a media filter based on the content item and the selected geolocation, and supplies the media filter to a client device located at the selected geolocation. | 1. A server comprising:
a hardware processor of the server comprising a media filter publication module and a media filter engine, the media filter publication module configured to receive a content item and a selected geolocation, and to generate a media filter with the content item, the media filter associated with the selected geolocation; and the media filter engine configured to identify the media filter based on a geolocation of a client device, and to provide the media filter to the client device. 2. The server of claim 1, wherein the media filter publication module comprises:
a user-based content upload module configured to receive the content item; a user-based geolocation selection module configured to receive the selected geolocation; and a user-based media filter publication engine configured to generate a user-based media filter based on the content item and the selected geolocation, the media filter engine configured to supply the client device with the user-based media filter in response to the geolocation of the client device within the selected geolocation. 3. The server of claim 2, wherein the media filter publication module further comprises:
a user-based duration selection module configured to receive an identification of a period of time associated with the content item and the selected geolocation, wherein the media filter engine is configured to supply the client device with the user-based media filter within the selected geolocation during the period of time. 4. The server of claim 1, wherein the media filter publication module comprises:
a merchant-based media content upload module configured to receive a first content item from a first merchant and a second content item from a second merchant; a merchant-based geolocation selection module configured to receive a first geolocation information from the first merchant, and a second geolocation information from the second merchant, to identify a common geolocation based on the first geolocation information and the second geolocation information; a merchant-based bidding module configured to receive a first bid amount from the first merchant and a second bid amount from the second merchant, and to identify a highest bid amount; and a merchant-based publication engine configured to generate a merchant-based media filter based on the content item of the merchant with the highest bid amount and the common geolocation, the media filter engine configured to supply the merchant-based media filter to the client device within the common geolocation. 5. The server of claim 4, wherein the media filter publication module further comprises:
a merchant-based duration selection module configured to disable the merchant-based media filter after a predetermined duration has elapsed. 6. The server of claim 4, wherein the common geolocation includes a common region formed between a first geolocation from the first merchant and a second geolocation from the second merchant. 7. The server of claim 1, wherein the media filter engine further comprises:
a live event module configured to:
identify a live event associated with the geolocation of the client device;
access live event data related to the live event; and
generate a live event media filter based on the live event data and the geolocation of the client device. 8. The server of claim 1, wherein the media filter engine further comprises:
a social network module configured to:
access social network data based on social network information from the client device; and
generate a social network media filter based on the social network data and the social network information from the client device. 9. The server of claim 1, wherein the media filter engine further comprises:
a promotion module configured to:
generate a set of media filters including the media filter for a merchant for a predefined geolocation of the merchant;
randomly select one media filter from the set of media filters; and
provide the randomly selected media filter to the client device in response to the geolocation of the client device corresponding to the predefined geolocation of the merchant. 10. The server of claim 1, wherein the media filter engine further comprises:
a collection module configured to:
store previously provided media filters in a media filter collection associated with the client device; and
present media filters from the media filter collection associated with the client device in response to receiving a geolocation associated with the media filters. 11. The server of claim 1, wherein the media filter engine further comprises:
a progressive module configured to:
generate a progressive use media filter for a predefined geolocation; and
adjust a content of the progressive use media filter in response to a number of prior uses of the progressive use media filter. 12. The server of claim 11, wherein the progressive module is further configured to:
disable the progressive use media filter after the number of prior uses of the progressive use media filter reaches a predefined progressive use limit. 13. The server of claim 1, wherein the media filter engine further comprises:
a viral use module configured to:
generate a viral use media filter for a predefined geolocation;
provide the viral use media filter to a first client device located at the predefined geolocation;
receive a request from the first client device located at the predefined geolocation to provide the viral use media filter to a second client device located outside the predefined geolocation; and
provide the viral use media filter to the second client device located outside the predefined geolocation. 14. The server of claim 1, wherein the media filter engine further comprises:
an actionable module configured to:
execute a programmable function associated with an actionable area in response to detecting a selection of the actionable area from a user of the client device. 15. The server of claim 1, wherein the media filter publication module is configured to generate a graphical user interface for displaying a map, receiving a selection of boundaries in the map, and including a geographic region formed with the selection of boundaries in the selected geolocation. 16. A method comprising:
receiving a content item and a selected geolocation; generating, by a hardware processor, a media filter with the content item, the media filter associated with the selected geolocation; identifying the media filter based on a geolocation of a client device; and causing display of the media filter on a user interface of the client device. 17. The method of claim 16, further comprising:
receiving an identification of a period of time associated with the content item and the selected geolocation, the media filter displayed on the user interface of the client device in response to the client device being located within the selected geolocation during the period of time. 18. The method of claim 16, further comprising:
receiving a first content item and a first geolocation information from a first merchant and a second content item and a second geolocation information from a second merchant; identifying a common geolocation between the first geolocation information and the second geolocation information; receiving a first bid amount from the first merchant and a second bid amount from the merchant; identifying a highest bid amount; and generating a merchant-based media filter based on the content item of the merchant with the highest bid amount and the common geolocation, supplying the merchant-based media filter to the client device within the common geolocation. 19. The server of claim 18, further comprising:
disabling the merchant-based media filter after a predetermined duration has elapsed. 20. A computer-readable storage medium having no transitory signals and storing a set of instructions that, when executed by a processor of a machine, cause the machine to perform operations comprising:
receiving a content item and a selected geolocation; generating a media filter with the content item, the media filter associated with the selected geolocation; identifying the media filter based on a geolocation of a client device; and causing display of the media filter on a user interface of the client device. | A system and method for a media filter publication application are described. The media filter publication application receives a content item and a selected geolocation, generates a media filter based on the content item and the selected geolocation, and supplies the media filter to a client device located at the selected geolocation.1. A server comprising:
a hardware processor of the server comprising a media filter publication module and a media filter engine, the media filter publication module configured to receive a content item and a selected geolocation, and to generate a media filter with the content item, the media filter associated with the selected geolocation; and the media filter engine configured to identify the media filter based on a geolocation of a client device, and to provide the media filter to the client device. 2. The server of claim 1, wherein the media filter publication module comprises:
a user-based content upload module configured to receive the content item; a user-based geolocation selection module configured to receive the selected geolocation; and a user-based media filter publication engine configured to generate a user-based media filter based on the content item and the selected geolocation, the media filter engine configured to supply the client device with the user-based media filter in response to the geolocation of the client device within the selected geolocation. 3. The server of claim 2, wherein the media filter publication module further comprises:
a user-based duration selection module configured to receive an identification of a period of time associated with the content item and the selected geolocation, wherein the media filter engine is configured to supply the client device with the user-based media filter within the selected geolocation during the period of time. 4. The server of claim 1, wherein the media filter publication module comprises:
a merchant-based media content upload module configured to receive a first content item from a first merchant and a second content item from a second merchant; a merchant-based geolocation selection module configured to receive a first geolocation information from the first merchant, and a second geolocation information from the second merchant, to identify a common geolocation based on the first geolocation information and the second geolocation information; a merchant-based bidding module configured to receive a first bid amount from the first merchant and a second bid amount from the second merchant, and to identify a highest bid amount; and a merchant-based publication engine configured to generate a merchant-based media filter based on the content item of the merchant with the highest bid amount and the common geolocation, the media filter engine configured to supply the merchant-based media filter to the client device within the common geolocation. 5. The server of claim 4, wherein the media filter publication module further comprises:
a merchant-based duration selection module configured to disable the merchant-based media filter after a predetermined duration has elapsed. 6. The server of claim 4, wherein the common geolocation includes a common region formed between a first geolocation from the first merchant and a second geolocation from the second merchant. 7. The server of claim 1, wherein the media filter engine further comprises:
a live event module configured to:
identify a live event associated with the geolocation of the client device;
access live event data related to the live event; and
generate a live event media filter based on the live event data and the geolocation of the client device. 8. The server of claim 1, wherein the media filter engine further comprises:
a social network module configured to:
access social network data based on social network information from the client device; and
generate a social network media filter based on the social network data and the social network information from the client device. 9. The server of claim 1, wherein the media filter engine further comprises:
a promotion module configured to:
generate a set of media filters including the media filter for a merchant for a predefined geolocation of the merchant;
randomly select one media filter from the set of media filters; and
provide the randomly selected media filter to the client device in response to the geolocation of the client device corresponding to the predefined geolocation of the merchant. 10. The server of claim 1, wherein the media filter engine further comprises:
a collection module configured to:
store previously provided media filters in a media filter collection associated with the client device; and
present media filters from the media filter collection associated with the client device in response to receiving a geolocation associated with the media filters. 11. The server of claim 1, wherein the media filter engine further comprises:
a progressive module configured to:
generate a progressive use media filter for a predefined geolocation; and
adjust a content of the progressive use media filter in response to a number of prior uses of the progressive use media filter. 12. The server of claim 11, wherein the progressive module is further configured to:
disable the progressive use media filter after the number of prior uses of the progressive use media filter reaches a predefined progressive use limit. 13. The server of claim 1, wherein the media filter engine further comprises:
a viral use module configured to:
generate a viral use media filter for a predefined geolocation;
provide the viral use media filter to a first client device located at the predefined geolocation;
receive a request from the first client device located at the predefined geolocation to provide the viral use media filter to a second client device located outside the predefined geolocation; and
provide the viral use media filter to the second client device located outside the predefined geolocation. 14. The server of claim 1, wherein the media filter engine further comprises:
an actionable module configured to:
execute a programmable function associated with an actionable area in response to detecting a selection of the actionable area from a user of the client device. 15. The server of claim 1, wherein the media filter publication module is configured to generate a graphical user interface for displaying a map, receiving a selection of boundaries in the map, and including a geographic region formed with the selection of boundaries in the selected geolocation. 16. A method comprising:
receiving a content item and a selected geolocation; generating, by a hardware processor, a media filter with the content item, the media filter associated with the selected geolocation; identifying the media filter based on a geolocation of a client device; and causing display of the media filter on a user interface of the client device. 17. The method of claim 16, further comprising:
receiving an identification of a period of time associated with the content item and the selected geolocation, the media filter displayed on the user interface of the client device in response to the client device being located within the selected geolocation during the period of time. 18. The method of claim 16, further comprising:
receiving a first content item and a first geolocation information from a first merchant and a second content item and a second geolocation information from a second merchant; identifying a common geolocation between the first geolocation information and the second geolocation information; receiving a first bid amount from the first merchant and a second bid amount from the merchant; identifying a highest bid amount; and generating a merchant-based media filter based on the content item of the merchant with the highest bid amount and the common geolocation, supplying the merchant-based media filter to the client device within the common geolocation. 19. The server of claim 18, further comprising:
disabling the merchant-based media filter after a predetermined duration has elapsed. 20. A computer-readable storage medium having no transitory signals and storing a set of instructions that, when executed by a processor of a machine, cause the machine to perform operations comprising:
receiving a content item and a selected geolocation; generating a media filter with the content item, the media filter associated with the selected geolocation; identifying the media filter based on a geolocation of a client device; and causing display of the media filter on a user interface of the client device. | 2,100 |
5,559 | 5,559 | 14,703,051 | 2,175 | A window in a multi-window display configuration is provided. A gaze of one or more users is directed at the window. The multi-window display configuration has a plurality of windows that are each configured to display corresponding content. Further, a window attribute of the window is modified based upon the gaze. In addition, a request for the content corresponding to the window is sent to a server. The content corresponding to the window is received from the server. The content corresponding to the window is then displayed according to the modified window attribute at the window. | 1. A computer program product comprising a computer readable storage device having a computer readable program stored thereon, wherein the computer readable program when executed on a computer causes the computer to:
determine a window in a multi-window display configuration at which a gaze of a user is directed, the multi-window display configuration having a plurality of windows that are each configured to display corresponding content; modify a window attribute of the window based upon the gaze; send a request for the content corresponding to the window to a server; receive the content corresponding to the window from the server; and display the content corresponding to the window according to the modified window attribute at the window. 2. The computer program product of claim 1, wherein the window attribute is an available bitrate. 3. The computer program product of claim 2, wherein the modification to the window attribute is an increase in the available bitrate. 4. The computer program product of claim 3, wherein the computer is further caused to send the increased available bitrate with the request to the server. 5. The computer program product of claim 4, wherein the content that is received from the server is based upon the increased available bitrate. 6. The computer program product of claim 1, wherein the window attribute is a window dimension of the window. 7. The computer program product of claim 6, wherein the modification to the window attribute is an increase in the window dimension. 8. The computer program product of claim 1, wherein the window attribute is an audio volume corresponding to the window. 9. The computer program product of claim 8, wherein the modification to the window attribute is an increase in the audio volume. 10. The computer program product of claim 1, wherein the computer is further caused to:
determine an additional window in the multi-window display configuration at which a gaze of a user is not directed; and modify a window attribute of the additional window. 11. The computer program product of claim 10, wherein the modification of the window attribute of the additional window is a replacement of content displayed by the additional window with supplemental content that supplements the content displayed by the window. 12. The computer program product of claim 10, wherein the window attribute of the additional window is an available bitrate. 13. The computer program product of claim 12, wherein the modification to the window attribute of the additional window is a decrease in the available bitrate. 14. A method comprising:
determining a window in a multi-window display configuration at which a plurality of gazes of a plurality of users are directed, the multi-window display configuration having a plurality of windows that are each configured to display corresponding content; modifying a window attribute of the window based upon an amount of the plurality of gazes and a dimension of the window exceeding a predetermined dimension threshold; sending a request for the content corresponding to the window to a server; receiving the content corresponding to the window from the server; and displaying the content corresponding to the window according to the modified window attribute at the window. 15. A system comprising:
a streaming device that receives content from a server; a multi-window display configuration having a plurality of windows that each is in operable communication with the streaming device, each receives distinct content from the streaming device, and each displays the corresponding content; a gaze tracking device that determines a window in the multi-window display configuration at which a gaze of the user is directed; a media player that modifies a window attribute of the window based upon the gaze, sends a request for the content corresponding to the window to the server, receives the content corresponding to the window from the server, and displays the content corresponding to the window according to the modified window attribute at the window, the media player being invoked by the streaming device. 16. The system of claim 15, wherein the gaze tracking device comprises one or more image capture devices that capture images of the user to determine the gaze of the user. 17. The system of claim 15, further comprising one or more image capture devices, the one or more image capture devices being in operable communication with the gaze tracking device. 18. The system of claim 15, further comprising a display device that displays the plurality of windows in the multi-window display configuration, the display device being in operable communication with the streaming device. 19. The system of claim 15, further comprising a plurality of display devices that each display at least one of the plurality of windows in the multi-window display configuration, the plurality of display devices being in operable communication with the streaming device. 20. The system of claim 15, wherein the media player also sends the modified window attribute with the request for the content to the server. | A window in a multi-window display configuration is provided. A gaze of one or more users is directed at the window. The multi-window display configuration has a plurality of windows that are each configured to display corresponding content. Further, a window attribute of the window is modified based upon the gaze. In addition, a request for the content corresponding to the window is sent to a server. The content corresponding to the window is received from the server. The content corresponding to the window is then displayed according to the modified window attribute at the window.1. A computer program product comprising a computer readable storage device having a computer readable program stored thereon, wherein the computer readable program when executed on a computer causes the computer to:
determine a window in a multi-window display configuration at which a gaze of a user is directed, the multi-window display configuration having a plurality of windows that are each configured to display corresponding content; modify a window attribute of the window based upon the gaze; send a request for the content corresponding to the window to a server; receive the content corresponding to the window from the server; and display the content corresponding to the window according to the modified window attribute at the window. 2. The computer program product of claim 1, wherein the window attribute is an available bitrate. 3. The computer program product of claim 2, wherein the modification to the window attribute is an increase in the available bitrate. 4. The computer program product of claim 3, wherein the computer is further caused to send the increased available bitrate with the request to the server. 5. The computer program product of claim 4, wherein the content that is received from the server is based upon the increased available bitrate. 6. The computer program product of claim 1, wherein the window attribute is a window dimension of the window. 7. The computer program product of claim 6, wherein the modification to the window attribute is an increase in the window dimension. 8. The computer program product of claim 1, wherein the window attribute is an audio volume corresponding to the window. 9. The computer program product of claim 8, wherein the modification to the window attribute is an increase in the audio volume. 10. The computer program product of claim 1, wherein the computer is further caused to:
determine an additional window in the multi-window display configuration at which a gaze of a user is not directed; and modify a window attribute of the additional window. 11. The computer program product of claim 10, wherein the modification of the window attribute of the additional window is a replacement of content displayed by the additional window with supplemental content that supplements the content displayed by the window. 12. The computer program product of claim 10, wherein the window attribute of the additional window is an available bitrate. 13. The computer program product of claim 12, wherein the modification to the window attribute of the additional window is a decrease in the available bitrate. 14. A method comprising:
determining a window in a multi-window display configuration at which a plurality of gazes of a plurality of users are directed, the multi-window display configuration having a plurality of windows that are each configured to display corresponding content; modifying a window attribute of the window based upon an amount of the plurality of gazes and a dimension of the window exceeding a predetermined dimension threshold; sending a request for the content corresponding to the window to a server; receiving the content corresponding to the window from the server; and displaying the content corresponding to the window according to the modified window attribute at the window. 15. A system comprising:
a streaming device that receives content from a server; a multi-window display configuration having a plurality of windows that each is in operable communication with the streaming device, each receives distinct content from the streaming device, and each displays the corresponding content; a gaze tracking device that determines a window in the multi-window display configuration at which a gaze of the user is directed; a media player that modifies a window attribute of the window based upon the gaze, sends a request for the content corresponding to the window to the server, receives the content corresponding to the window from the server, and displays the content corresponding to the window according to the modified window attribute at the window, the media player being invoked by the streaming device. 16. The system of claim 15, wherein the gaze tracking device comprises one or more image capture devices that capture images of the user to determine the gaze of the user. 17. The system of claim 15, further comprising one or more image capture devices, the one or more image capture devices being in operable communication with the gaze tracking device. 18. The system of claim 15, further comprising a display device that displays the plurality of windows in the multi-window display configuration, the display device being in operable communication with the streaming device. 19. The system of claim 15, further comprising a plurality of display devices that each display at least one of the plurality of windows in the multi-window display configuration, the plurality of display devices being in operable communication with the streaming device. 20. The system of claim 15, wherein the media player also sends the modified window attribute with the request for the content to the server. | 2,100 |
5,560 | 5,560 | 15,177,843 | 2,132 | An example method of page sharing in a host computer having virtualization software that supports execution of a plurality of virtualized computing instances includes identifying, by the virtualization software, duplicate memory pages in system memory of the host computer. The method further includes sharing a memory page of the duplicate memory pages among the plurality of virtualized computing instances. The method further includes monitoring reads by a first virtualized computing instance targeting the shared memory page. The method further includes creating a private copy of the shared memory page for the first virtualized computing instance in response to the reads satisfying a threshold read pattern. | 1. A method of page sharing in a host computer having virtualization software that supports execution of a plurality of virtualized computing instances, the method comprising:
identifying, by the virtualization software, duplicate memory pages in system memory of the host computer; sharing a memory page of the duplicate memory pages among the plurality of virtualized computing instances; monitoring reads by a first virtualized computing instance targeting the shared memory page; and creating a private copy of the shared memory page for the first virtualized computing instance in response to the reads satisfying a threshold read pattern. 2. The method of claim 1, wherein the threshold read pattern comprises a single read. 3. The method of claim 1, wherein the threshold read pattern comprises a plurality of reads. 4. The method of claim 1, wherein the threshold read pattern comprises a plurality of reads within a time period. 5. The method of claim 1, further comprising:
installing a read trace for the shared memory page. 6. The method of claim 5, wherein the step of monitoring is performed in response to one or more page faults triggered by the read trace. 7. The method of claim 5, wherein the step of installing the read trace comprises setting one or more fields of a page table entry referencing the shared memory page that will cause a page fault in response to a read targeting the shared memory page. 8. The method of claim 1, wherein the virtualization software comprises a hypervisor and the plurality of virtualized computing instances is a plurality of virtual machines. 9. The method of claim 1, wherein the virtualization software comprises an operating system and the plurality of virtualized computing instances is a plurality of containers. 10. The method of claim 1, wherein the step of sharing the memory page comprises re-mapping a logical page number associated with the memory page to a machine page number associated with the memory page. 11. A computer system, comprising:
a hardware platform having a central processing unit (CPU) and a system memory; and virtualization software executing on the hardware platform, the virtualization software supporting execution of a plurality of virtualized computing instances, the virtualization software configured to:
identify duplicate memory pages in the system memory;
share a memory page of the duplicate memory pages among the plurality of virtualized computing instances;
monitor reads by a first virtualized computing instance targeting the shared memory page; and
create a private copy of the shared memory page for the first virtualized computing instance in response to the reads satisfying a threshold read pattern. 12. The computer system of claim 11, wherein the threshold read pattern comprises a single read, a plurality of reads, or a plurality of reads within a time period. 13. The computer system of claim 11, wherein the virtualization software is further configured to install a read trace for the shared memory page, and wherein virtualization software monitors the reads in response to one or more page faults triggered by the read trace. 14. The computer system of claim 11, wherein the virtualization software comprises a hypervisor and the plurality of virtualized computing instances is a plurality of virtual machines. 15. The computer system of claim 11, wherein the virtualization software comprises an operating system and the plurality of virtualized computing instances is a plurality of containers. 16. A non-transitory computer readable medium having instructions stored thereon that when executed by a processor cause the processor to perform a method of page sharing in a host computer having virtualization software that supports execution of a plurality of virtualized computing instances, the method comprising:
identifying, by the virtualization software, duplicate memory pages in system memory of the host computer; sharing a memory page of the duplicate memory pages among the plurality of virtualized computing instances; monitoring reads by a first virtualized computing instance targeting the shared memory page; and creating a private copy of the shared memory page for the first virtualized computing instance in response to the reads satisfying a threshold read pattern. 17. The non-transitory computer readable medium of claim 16, wherein the threshold read pattern comprises a single read, a plurality of reads, or a plurality of reads within a time period. 18. The non-transitory computer readable medium of claim 16, further comprising:
installing a read trace for the shared memory page; wherein the step of monitoring is performed in response to one or more page faults triggered by the read trace. 19. The non-transitory computer readable medium of claim 16, wherein the virtualization software comprises a hypervisor and the plurality of virtualized computing instances is a plurality of virtual machines. 20. The non-transitory computer readable medium of claim 16, wherein the virtualization software comprises an operating system and the plurality of virtualized computing instances is a plurality of containers. | An example method of page sharing in a host computer having virtualization software that supports execution of a plurality of virtualized computing instances includes identifying, by the virtualization software, duplicate memory pages in system memory of the host computer. The method further includes sharing a memory page of the duplicate memory pages among the plurality of virtualized computing instances. The method further includes monitoring reads by a first virtualized computing instance targeting the shared memory page. The method further includes creating a private copy of the shared memory page for the first virtualized computing instance in response to the reads satisfying a threshold read pattern.1. A method of page sharing in a host computer having virtualization software that supports execution of a plurality of virtualized computing instances, the method comprising:
identifying, by the virtualization software, duplicate memory pages in system memory of the host computer; sharing a memory page of the duplicate memory pages among the plurality of virtualized computing instances; monitoring reads by a first virtualized computing instance targeting the shared memory page; and creating a private copy of the shared memory page for the first virtualized computing instance in response to the reads satisfying a threshold read pattern. 2. The method of claim 1, wherein the threshold read pattern comprises a single read. 3. The method of claim 1, wherein the threshold read pattern comprises a plurality of reads. 4. The method of claim 1, wherein the threshold read pattern comprises a plurality of reads within a time period. 5. The method of claim 1, further comprising:
installing a read trace for the shared memory page. 6. The method of claim 5, wherein the step of monitoring is performed in response to one or more page faults triggered by the read trace. 7. The method of claim 5, wherein the step of installing the read trace comprises setting one or more fields of a page table entry referencing the shared memory page that will cause a page fault in response to a read targeting the shared memory page. 8. The method of claim 1, wherein the virtualization software comprises a hypervisor and the plurality of virtualized computing instances is a plurality of virtual machines. 9. The method of claim 1, wherein the virtualization software comprises an operating system and the plurality of virtualized computing instances is a plurality of containers. 10. The method of claim 1, wherein the step of sharing the memory page comprises re-mapping a logical page number associated with the memory page to a machine page number associated with the memory page. 11. A computer system, comprising:
a hardware platform having a central processing unit (CPU) and a system memory; and virtualization software executing on the hardware platform, the virtualization software supporting execution of a plurality of virtualized computing instances, the virtualization software configured to:
identify duplicate memory pages in the system memory;
share a memory page of the duplicate memory pages among the plurality of virtualized computing instances;
monitor reads by a first virtualized computing instance targeting the shared memory page; and
create a private copy of the shared memory page for the first virtualized computing instance in response to the reads satisfying a threshold read pattern. 12. The computer system of claim 11, wherein the threshold read pattern comprises a single read, a plurality of reads, or a plurality of reads within a time period. 13. The computer system of claim 11, wherein the virtualization software is further configured to install a read trace for the shared memory page, and wherein virtualization software monitors the reads in response to one or more page faults triggered by the read trace. 14. The computer system of claim 11, wherein the virtualization software comprises a hypervisor and the plurality of virtualized computing instances is a plurality of virtual machines. 15. The computer system of claim 11, wherein the virtualization software comprises an operating system and the plurality of virtualized computing instances is a plurality of containers. 16. A non-transitory computer readable medium having instructions stored thereon that when executed by a processor cause the processor to perform a method of page sharing in a host computer having virtualization software that supports execution of a plurality of virtualized computing instances, the method comprising:
identifying, by the virtualization software, duplicate memory pages in system memory of the host computer; sharing a memory page of the duplicate memory pages among the plurality of virtualized computing instances; monitoring reads by a first virtualized computing instance targeting the shared memory page; and creating a private copy of the shared memory page for the first virtualized computing instance in response to the reads satisfying a threshold read pattern. 17. The non-transitory computer readable medium of claim 16, wherein the threshold read pattern comprises a single read, a plurality of reads, or a plurality of reads within a time period. 18. The non-transitory computer readable medium of claim 16, further comprising:
installing a read trace for the shared memory page; wherein the step of monitoring is performed in response to one or more page faults triggered by the read trace. 19. The non-transitory computer readable medium of claim 16, wherein the virtualization software comprises a hypervisor and the plurality of virtualized computing instances is a plurality of virtual machines. 20. The non-transitory computer readable medium of claim 16, wherein the virtualization software comprises an operating system and the plurality of virtualized computing instances is a plurality of containers. | 2,100 |
5,561 | 5,561 | 15,132,344 | 2,193 | The pump systems (pump+driver) used in a pump station are selected based on the type of fluid or batch. The selection is of the more efficient pump systems for that batch. Less efficient pumps are avoided. When a new batch is detected, the selection is performed again for that new batch, which may result in a different combinations of pump systems for a given pump station. If variable speed pump drives are available, the efficiency at the desired speed is used for selection. The cost of energy (utilities) by pump station may alternatively or additionally be used to select the speed or combination of pump systems. The pump station and pipeline operation is optimized for efficiency of pump systems and/or cost of energy (utilities) for the different pump systems based on pipeline inventory and local utilities tariffs. | 1. A system for pump station optimization, the system comprising:
a pump station having a plurality of pump systems for a pipeline; a sensor configured to sense a type of fluid in the pipeline; a memory configured to store efficiency as a function of the type of fluid for each of the pump systems; and a controller configured to select a sub-set of the pump systems as a function of the type of fluid and the efficiencies of the pump systems for the type of fluid, the sub-set configured to provide an outlet pressure for the pump station. 2. The system of claim 1 wherein the pump systems comprise at least one fixed speed pump and at least one variable speed pump, wherein the efficiency for the variable speed pump includes efficiency as a function of speed by the type of fluid, and wherein the controller is configured to select the variable speed pump and the speed of the variable speed pump as a function of the efficiency as a function of the speed and the type of fluid. 3. The system of claim 1 wherein the sensor comprises a density, viscosity, or density and viscosity sensor, and wherein the controller is configured to determine the type of fluid from fluid properties. 4. The system of claim 1 wherein the controller is configured to select in response to a change in the type of fluid indicated by the sensor. 5. The system of claim 1 wherein the controller is configured to select the sub-set of the pump systems as the pump systems with a greater efficiency for the type of fluid. 6. The system of claim 1 wherein the controller is configured to calculate the efficiency during operation of the pump systems, the selection being based on the at least one of the efficiencies calculated within a day of the selection. 7. The system of claim 1 wherein the memory is configured to store utility rate information, and wherein the controller is configured to select the sub-set as a function of the utility rate information. 8. The system of claim 1 wherein the controller is configured to set the outlet pressure based on utility rate information. 9. The system of claim 8 wherein the controller is configured to set the outlet pressure for the pump station based on the utility rate information for the pump station and utility rate information for other pump stations. 10. The system of claim 1 wherein the controller is configured to select the sub-set based on constraints for the pump systems and the pump station. 11. The system of claim 10 wherein one of the constraints is mechanical performance of the pump systems, one of the pump systems with a greater efficiency not included in the sub-set due to the mechanical performance or maintenance requirements. 12. The system of claim 1 wherein the controller comprises a control system of the pump station and is configured to selection based on a mixed integer optimization. 13. A method for pump station optimization, the method comprising:
determining batches in a pipeline at first and second pump stations; accessing rates for first and second local distribution companies of power to the first and second pump stations, respectively; configuring pump systems of the first pump station and pump systems of the second pump station to pump the batches in the pipeline; and setting a contribution of the first pump station relative to the second pump station based on the rates. 14. The method of claim 13 wherein setting comprises setting comprises configuring the pump systems of the first pump station to provide a lower output pressure than the pump systems of the second pump station where the rate for the first local distribution company supplying the first pump station is higher than the rate for the second local distribution company. 15. The method of claim 13 wherein accessing comprises receiving rate schedules including power levels at which electricity rates are higher, and wherein setting comprises constraining the contribution based on the power levels. 16. The method of claim 13 wherein determining the batches comprises determining a batch inventory throughout the pipeline, wherein configuring comprises selecting sub-sets of the pump systems at the first and second pump stations based on an optimization of efficiency of the pump systems for the batch at the first pump station and the batch at the second pump station. 17. A system for pump station optimization, the system comprising:
a plurality of pump systems including at least a first variable speed pump; and a controller configured to select a speed of the first variable speed pump based on efficiency of the first variable speed pump as a function of speed. 18. The system of claim 17 wherein the controller is configured to select a sub-set of the pump systems, the first variable speed pump included in the sub-set, the selection being a function of relative efficiencies of the pump systems for a density or viscosity of crude oil. 19. The system of claim 17 wherein the controller is configured to select the speed as a function of the efficiency and a utility cost for powering the first variable speed pump. 20. The system of claim 17 wherein the controller is configured to select as an optimization. | The pump systems (pump+driver) used in a pump station are selected based on the type of fluid or batch. The selection is of the more efficient pump systems for that batch. Less efficient pumps are avoided. When a new batch is detected, the selection is performed again for that new batch, which may result in a different combinations of pump systems for a given pump station. If variable speed pump drives are available, the efficiency at the desired speed is used for selection. The cost of energy (utilities) by pump station may alternatively or additionally be used to select the speed or combination of pump systems. The pump station and pipeline operation is optimized for efficiency of pump systems and/or cost of energy (utilities) for the different pump systems based on pipeline inventory and local utilities tariffs.1. A system for pump station optimization, the system comprising:
a pump station having a plurality of pump systems for a pipeline; a sensor configured to sense a type of fluid in the pipeline; a memory configured to store efficiency as a function of the type of fluid for each of the pump systems; and a controller configured to select a sub-set of the pump systems as a function of the type of fluid and the efficiencies of the pump systems for the type of fluid, the sub-set configured to provide an outlet pressure for the pump station. 2. The system of claim 1 wherein the pump systems comprise at least one fixed speed pump and at least one variable speed pump, wherein the efficiency for the variable speed pump includes efficiency as a function of speed by the type of fluid, and wherein the controller is configured to select the variable speed pump and the speed of the variable speed pump as a function of the efficiency as a function of the speed and the type of fluid. 3. The system of claim 1 wherein the sensor comprises a density, viscosity, or density and viscosity sensor, and wherein the controller is configured to determine the type of fluid from fluid properties. 4. The system of claim 1 wherein the controller is configured to select in response to a change in the type of fluid indicated by the sensor. 5. The system of claim 1 wherein the controller is configured to select the sub-set of the pump systems as the pump systems with a greater efficiency for the type of fluid. 6. The system of claim 1 wherein the controller is configured to calculate the efficiency during operation of the pump systems, the selection being based on the at least one of the efficiencies calculated within a day of the selection. 7. The system of claim 1 wherein the memory is configured to store utility rate information, and wherein the controller is configured to select the sub-set as a function of the utility rate information. 8. The system of claim 1 wherein the controller is configured to set the outlet pressure based on utility rate information. 9. The system of claim 8 wherein the controller is configured to set the outlet pressure for the pump station based on the utility rate information for the pump station and utility rate information for other pump stations. 10. The system of claim 1 wherein the controller is configured to select the sub-set based on constraints for the pump systems and the pump station. 11. The system of claim 10 wherein one of the constraints is mechanical performance of the pump systems, one of the pump systems with a greater efficiency not included in the sub-set due to the mechanical performance or maintenance requirements. 12. The system of claim 1 wherein the controller comprises a control system of the pump station and is configured to selection based on a mixed integer optimization. 13. A method for pump station optimization, the method comprising:
determining batches in a pipeline at first and second pump stations; accessing rates for first and second local distribution companies of power to the first and second pump stations, respectively; configuring pump systems of the first pump station and pump systems of the second pump station to pump the batches in the pipeline; and setting a contribution of the first pump station relative to the second pump station based on the rates. 14. The method of claim 13 wherein setting comprises setting comprises configuring the pump systems of the first pump station to provide a lower output pressure than the pump systems of the second pump station where the rate for the first local distribution company supplying the first pump station is higher than the rate for the second local distribution company. 15. The method of claim 13 wherein accessing comprises receiving rate schedules including power levels at which electricity rates are higher, and wherein setting comprises constraining the contribution based on the power levels. 16. The method of claim 13 wherein determining the batches comprises determining a batch inventory throughout the pipeline, wherein configuring comprises selecting sub-sets of the pump systems at the first and second pump stations based on an optimization of efficiency of the pump systems for the batch at the first pump station and the batch at the second pump station. 17. A system for pump station optimization, the system comprising:
a plurality of pump systems including at least a first variable speed pump; and a controller configured to select a speed of the first variable speed pump based on efficiency of the first variable speed pump as a function of speed. 18. The system of claim 17 wherein the controller is configured to select a sub-set of the pump systems, the first variable speed pump included in the sub-set, the selection being a function of relative efficiencies of the pump systems for a density or viscosity of crude oil. 19. The system of claim 17 wherein the controller is configured to select the speed as a function of the efficiency and a utility cost for powering the first variable speed pump. 20. The system of claim 17 wherein the controller is configured to select as an optimization. | 2,100 |
5,562 | 5,562 | 15,228,968 | 2,194 | Systems and methods for migrating configuration changes to a target content management system. A migration statement based on a metadata definition language (“MDL”) may be generated with a first API and executed on a source system to generate new source system configurations. A second API may be sent from the source system to the target system and executed on the target system to apply the new source system configurations on the target system without disturbing operation of the target system. | 1. A method for migrating configuration changes from a source system to a target content management system, comprising:
exposing a first application programming interface (“API”); generating a first migration statement with the first API, wherein the first migration statement comprises information about existing configuration of the source system, a first migration command, type of a first source system component, and name of the first source system component; executing the first migration statement on the source system to generate new source system configurations; sending a second API from the source system to the target system, wherein the second API contains new source system configurations as an input; and executing the second API on the target system to apply the new source system configurations on the target system to migrate configuration changes from the source system to the target system without disturbing operation of the target system. 2. The method of claim 1, wherein the source system is a test content management system. 3. The method of claim 1, wherein the first migration command is for recreating the first source system component on the target system. 4. The method of claim 1, wherein the first migration command is for creating a new component on the target system. 5. The method of claim 1, wherein the first migration statement is for altering a component on the target system. 6. The method of claim 1, wherein the first migration statement is for dropping a component on the target system. 7. The method of claim 1, wherein the first migration statement is for renaming a component on the target system. 8. The method of claim 1, wherein the first migration statement is for committing configuration changes to the target system. 9. The method of claim 1, wherein the configuration changes are at metadata level. 10. The method of claim 1, wherein the first migration statement is based on a metadata definition language (“MDL”). 11. The method of claim 1, wherein the first source system component is MDL enabled. 12. The method of claim 1, further comprising: providing a list of MDL enabled components, and executing the first migration statement on the MDL enabled components. 13. The method of claim 12, further comprising: describing an MDL enabled component. 14. The method of claim 12, further comprising: exporting an MDL enabled component by retrieving its definition; and importing configuration of one or more MDL enabled components by manipulating their definitions. 15. A content management system, comprising:
a source system which comprises: a first content management server, a first file storage system for storing documents and objects, and a first database management system for storing data and metadata of the documents and objects in the first file storage system; and a migration controller for migrating configuration changes from the source system to a target content management system, wherein the migration controller:
exposes a first application programming interface (“API”);
enables generation of a first migration statement with the first API, wherein the first migration statement comprises information about existing configuration of the source system, a first migration command, type of a first source system component, and name of the first source system component;
enables execution of the first migration statement on the source system to generate new source system configurations; and
sends a second API from the source system to a target system, wherein the second API contains new source system configurations as an input; and wherein the second API is executed on the target system to apply the new source system configurations on the target system to migrate configuration changes from the source system to the target system without disturbing operation of the target system. 16. The system of claim 15, wherein the source system is a test content management system. 17. The system of claim 15, wherein the first migration command is for recreating the first source system component on the target system. 18. The system of claim 15, wherein the first migration command is for creating a new component on the target system. 19. The system of claim 15, wherein the first migration statement is for altering a component on the target system. 20. The system of claim 15, wherein the first migration statement is for dropping a component on the target system. | Systems and methods for migrating configuration changes to a target content management system. A migration statement based on a metadata definition language (“MDL”) may be generated with a first API and executed on a source system to generate new source system configurations. A second API may be sent from the source system to the target system and executed on the target system to apply the new source system configurations on the target system without disturbing operation of the target system.1. A method for migrating configuration changes from a source system to a target content management system, comprising:
exposing a first application programming interface (“API”); generating a first migration statement with the first API, wherein the first migration statement comprises information about existing configuration of the source system, a first migration command, type of a first source system component, and name of the first source system component; executing the first migration statement on the source system to generate new source system configurations; sending a second API from the source system to the target system, wherein the second API contains new source system configurations as an input; and executing the second API on the target system to apply the new source system configurations on the target system to migrate configuration changes from the source system to the target system without disturbing operation of the target system. 2. The method of claim 1, wherein the source system is a test content management system. 3. The method of claim 1, wherein the first migration command is for recreating the first source system component on the target system. 4. The method of claim 1, wherein the first migration command is for creating a new component on the target system. 5. The method of claim 1, wherein the first migration statement is for altering a component on the target system. 6. The method of claim 1, wherein the first migration statement is for dropping a component on the target system. 7. The method of claim 1, wherein the first migration statement is for renaming a component on the target system. 8. The method of claim 1, wherein the first migration statement is for committing configuration changes to the target system. 9. The method of claim 1, wherein the configuration changes are at metadata level. 10. The method of claim 1, wherein the first migration statement is based on a metadata definition language (“MDL”). 11. The method of claim 1, wherein the first source system component is MDL enabled. 12. The method of claim 1, further comprising: providing a list of MDL enabled components, and executing the first migration statement on the MDL enabled components. 13. The method of claim 12, further comprising: describing an MDL enabled component. 14. The method of claim 12, further comprising: exporting an MDL enabled component by retrieving its definition; and importing configuration of one or more MDL enabled components by manipulating their definitions. 15. A content management system, comprising:
a source system which comprises: a first content management server, a first file storage system for storing documents and objects, and a first database management system for storing data and metadata of the documents and objects in the first file storage system; and a migration controller for migrating configuration changes from the source system to a target content management system, wherein the migration controller:
exposes a first application programming interface (“API”);
enables generation of a first migration statement with the first API, wherein the first migration statement comprises information about existing configuration of the source system, a first migration command, type of a first source system component, and name of the first source system component;
enables execution of the first migration statement on the source system to generate new source system configurations; and
sends a second API from the source system to a target system, wherein the second API contains new source system configurations as an input; and wherein the second API is executed on the target system to apply the new source system configurations on the target system to migrate configuration changes from the source system to the target system without disturbing operation of the target system. 16. The system of claim 15, wherein the source system is a test content management system. 17. The system of claim 15, wherein the first migration command is for recreating the first source system component on the target system. 18. The system of claim 15, wherein the first migration command is for creating a new component on the target system. 19. The system of claim 15, wherein the first migration statement is for altering a component on the target system. 20. The system of claim 15, wherein the first migration statement is for dropping a component on the target system. | 2,100 |
5,563 | 5,563 | 14,674,585 | 2,182 | A method for decomposing a signal includes receiving sampled data. A wavelet is built using the sampled data that includes a plurality of samples. The wavelet includes a number of oscillations per sampling unit, and a length of the wavelet corresponds to the number of oscillations. The wavelet is time-shifted. The wavelet is then scaled such that the samples proximate to one or both ends of the wavelet decay toward zero. The wavelet is also scaled such that an amplitude at a peak frequency of the wavelet, when transformed into a Fourier domain, is substantially unity. | 1. A method for decomposing a signal, comprising:
receiving sampled data; building a wavelet comprising a plurality of samples using the sampled data, wherein the wavelet includes a number of oscillations per sampling unit, and wherein a length of the wavelet corresponds to the number of oscillations; time-shifting the wavelet; scaling the wavelet after time-shifting the wavelet such that the samples proximate to one or both ends of the wavelet decay toward zero; and scaling the wavelet such that an amplitude at a peak frequency of the wavelet, when transformed into a Fourier domain, is substantially unity. 2. The method of claim 1, further comprising varying the number of oscillations per sampling unit. 3. The method of claim 1, wherein a channel is recorded in the sampled data, and wherein building the wavelet further comprises building the wavelet at least partially based upon the channel. 4. The method of claim 2, further comprising removing one or more negative correlations of a trace with the wavelet, wherein the trace comprises the sampled data recorded for the channel. 5. The method of claim 4, wherein the one or more negative correlations are removed by setting values for one or more of the samples to zero. 6. The method of claim 4, further comprising distributing one or more positive correlations of the trace with the wavelet over a window length that is a fraction of a wavelength of the wavelet at a center frequency of the wavelet. 7. The method of claim 6, wherein distributing the positive correlations of the trace with the wavelet comprises applying a filter that distributes energy of the positive correlations over the window length. 8. The method of claim 7, wherein the filter is selected from the group consisting of a max filter, a median filter, a root mean square filter, a mean filter, and an envelope filter. 9. The method of claim 1, further comprising convolving the wavelet with the sampled data. 10. The method of claim 1, further comprising drilling a wellbore into a subterranean formation in response to the wavelet indicating a likelihood of hydrocarbons in the subterranean formation. 11. A computing system comprising:
one or more processors; and a memory system comprising one or more non-transitory computer-readable media storing instructions that, when executed by at least one of the one or more processors, cause the computing system to perform operations, the operations comprising:
receiving seismic data;
building a wavelet comprising a plurality of samples using the seismic data, wherein the wavelet includes a number of oscillations per sampling unit, and wherein a length of the wavelet corresponds to the number of oscillations;
time-shifting the wavelet;
scaling the wavelet after time-shifting the wavelet such that the samples proximate to one or both ends of the wavelet decay toward zero; and
scaling the wavelet such that an amplitude at a peak frequency of the wavelet, when transformed into a Fourier domain, is substantially unity. 12. The computing system of claim 11, wherein the operations further comprise varying the number of oscillations per sampling unit. 13. The computing system of claim 11, wherein a channel is recorded in the seismic data, and wherein building the wavelet further comprises building the wavelet at least partially based upon the channel. 14. The computing system of claim 13, wherein the operations further comprise removing one or more negative correlations of a trace with the wavelet, wherein the trace comprises the seismic data recorded for the channel. 15. The computing system of claim 14, wherein the one or more negative correlations are removed by setting values for one or more of the samples to zero. 16. The computing system of claim 14, wherein the operations further comprise distributing one or more positive correlations of the trace with the wavelet over a window length that is a fraction of a wavelength of the wavelet at a center frequency of the wavelet. 17. The computing system of claim 16, wherein distributing the positive correlations of the trace with the wavelet comprises applying a filter that distributes energy of the positive correlations over the window length. 18. The computing system of claim 17, wherein the filter is selected from the group consisting of a max filter, a median filter, a root mean square filter, a mean filter, and an envelope filter. 19. The computing system of claim 16, further comprising performing a finite Fourier transform on the wavelet. 20. A non-transitory computer-readable medium storing instructions that, when executed by at least one processor of a computing system, cause the computing system to perform operations, the operations comprising:
receiving seismic data; building a wavelet comprising a plurality of samples using the seismic data, wherein the wavelet includes a number of oscillations per sampling unit, and wherein a length of the wavelet corresponds to the number of oscillations; time-shifting the wavelet; scaling the wavelet after time-shifting the wavelet such that the samples proximate to one or both ends of the wavelet decay toward zero; and scaling the wavelet such that an amplitude at a peak frequency of the wavelet, when transformed into a Fourier domain, is substantially unity. | A method for decomposing a signal includes receiving sampled data. A wavelet is built using the sampled data that includes a plurality of samples. The wavelet includes a number of oscillations per sampling unit, and a length of the wavelet corresponds to the number of oscillations. The wavelet is time-shifted. The wavelet is then scaled such that the samples proximate to one or both ends of the wavelet decay toward zero. The wavelet is also scaled such that an amplitude at a peak frequency of the wavelet, when transformed into a Fourier domain, is substantially unity.1. A method for decomposing a signal, comprising:
receiving sampled data; building a wavelet comprising a plurality of samples using the sampled data, wherein the wavelet includes a number of oscillations per sampling unit, and wherein a length of the wavelet corresponds to the number of oscillations; time-shifting the wavelet; scaling the wavelet after time-shifting the wavelet such that the samples proximate to one or both ends of the wavelet decay toward zero; and scaling the wavelet such that an amplitude at a peak frequency of the wavelet, when transformed into a Fourier domain, is substantially unity. 2. The method of claim 1, further comprising varying the number of oscillations per sampling unit. 3. The method of claim 1, wherein a channel is recorded in the sampled data, and wherein building the wavelet further comprises building the wavelet at least partially based upon the channel. 4. The method of claim 2, further comprising removing one or more negative correlations of a trace with the wavelet, wherein the trace comprises the sampled data recorded for the channel. 5. The method of claim 4, wherein the one or more negative correlations are removed by setting values for one or more of the samples to zero. 6. The method of claim 4, further comprising distributing one or more positive correlations of the trace with the wavelet over a window length that is a fraction of a wavelength of the wavelet at a center frequency of the wavelet. 7. The method of claim 6, wherein distributing the positive correlations of the trace with the wavelet comprises applying a filter that distributes energy of the positive correlations over the window length. 8. The method of claim 7, wherein the filter is selected from the group consisting of a max filter, a median filter, a root mean square filter, a mean filter, and an envelope filter. 9. The method of claim 1, further comprising convolving the wavelet with the sampled data. 10. The method of claim 1, further comprising drilling a wellbore into a subterranean formation in response to the wavelet indicating a likelihood of hydrocarbons in the subterranean formation. 11. A computing system comprising:
one or more processors; and a memory system comprising one or more non-transitory computer-readable media storing instructions that, when executed by at least one of the one or more processors, cause the computing system to perform operations, the operations comprising:
receiving seismic data;
building a wavelet comprising a plurality of samples using the seismic data, wherein the wavelet includes a number of oscillations per sampling unit, and wherein a length of the wavelet corresponds to the number of oscillations;
time-shifting the wavelet;
scaling the wavelet after time-shifting the wavelet such that the samples proximate to one or both ends of the wavelet decay toward zero; and
scaling the wavelet such that an amplitude at a peak frequency of the wavelet, when transformed into a Fourier domain, is substantially unity. 12. The computing system of claim 11, wherein the operations further comprise varying the number of oscillations per sampling unit. 13. The computing system of claim 11, wherein a channel is recorded in the seismic data, and wherein building the wavelet further comprises building the wavelet at least partially based upon the channel. 14. The computing system of claim 13, wherein the operations further comprise removing one or more negative correlations of a trace with the wavelet, wherein the trace comprises the seismic data recorded for the channel. 15. The computing system of claim 14, wherein the one or more negative correlations are removed by setting values for one or more of the samples to zero. 16. The computing system of claim 14, wherein the operations further comprise distributing one or more positive correlations of the trace with the wavelet over a window length that is a fraction of a wavelength of the wavelet at a center frequency of the wavelet. 17. The computing system of claim 16, wherein distributing the positive correlations of the trace with the wavelet comprises applying a filter that distributes energy of the positive correlations over the window length. 18. The computing system of claim 17, wherein the filter is selected from the group consisting of a max filter, a median filter, a root mean square filter, a mean filter, and an envelope filter. 19. The computing system of claim 16, further comprising performing a finite Fourier transform on the wavelet. 20. A non-transitory computer-readable medium storing instructions that, when executed by at least one processor of a computing system, cause the computing system to perform operations, the operations comprising:
receiving seismic data; building a wavelet comprising a plurality of samples using the seismic data, wherein the wavelet includes a number of oscillations per sampling unit, and wherein a length of the wavelet corresponds to the number of oscillations; time-shifting the wavelet; scaling the wavelet after time-shifting the wavelet such that the samples proximate to one or both ends of the wavelet decay toward zero; and scaling the wavelet such that an amplitude at a peak frequency of the wavelet, when transformed into a Fourier domain, is substantially unity. | 2,100 |
5,564 | 5,564 | 14,198,787 | 2,164 | According to one embodiment of the present invention, a system provides access to geographic information. The system generates an index including information and one or more identifiers each indicating a corresponding geographic area pertaining to the information. The system processes a query against the index to provide information aggregated for corresponding geographic areas. Embodiments of the present invention further include a method and computer program product for providing access to geographic information in substantially the same manners described above. | 1-7. (canceled) 8. A system for retrieving geographic related information comprising:
at least one processor configured to:
generate an index including information and one or more identifiers each indicating a corresponding geographic area pertaining to the information; and
process a query against the index to provide information aggregated for one or more of the corresponding geographic areas. 9. The system of claim 8, wherein the one or more identifiers include geohashes. 10. The system of claim 8, wherein processing the query includes:
performing a facet search of the index to determine counts of information for the one or more of the corresponding geographic areas. 11. The system of claim 8, wherein the index includes hierarchical levels of information and links between those hierarchical levels. 12. The system of claim 8, wherein the index includes first and second identifiers for an information element, wherein the second identifier indicates a portion of the geographic area of the first identifier. 13. The system of claim 8, wherein the at least one processor is further configured to:
color code the aggregated information and presenting the color-coded information on a user interface. 14. The system of claim 13, wherein the color-coded information is presented for the one or more of the corresponding geographic areas on a geographic map of the user interface. 15. A computer program product for retrieving geographic related information comprising:
a computer readable storage medium having computer readable program code embodied therewith for execution on a processing system, the computer readable program code comprising computer readable program code configured to:
generate an index including information and one or more identifiers each indicating a corresponding geographic area pertaining to the information; and
process a query against the index to provide information aggregated for one or more of the corresponding geographic areas. 16. The computer program product of claim 15, wherein the one or more identifiers include geohashes. 17. The computer program product of claim 15, wherein processing the query includes:
performing a facet search of the index to determine counts of information for the one or more of the corresponding geographic areas. 18. The computer program product of claim 15, wherein the index includes hierarchical levels of information and links between those hierarchical levels. 19. The computer program product of claim 15, wherein the index includes first and second identifiers for an information element, wherein the second identifier indicates a portion of the geographic area of the first identifier. 20. The computer program product of claim 15, wherein the computer readable program code is further configured to:
color code the aggregated information and presenting the color-coded information on a user interface. | According to one embodiment of the present invention, a system provides access to geographic information. The system generates an index including information and one or more identifiers each indicating a corresponding geographic area pertaining to the information. The system processes a query against the index to provide information aggregated for corresponding geographic areas. Embodiments of the present invention further include a method and computer program product for providing access to geographic information in substantially the same manners described above.1-7. (canceled) 8. A system for retrieving geographic related information comprising:
at least one processor configured to:
generate an index including information and one or more identifiers each indicating a corresponding geographic area pertaining to the information; and
process a query against the index to provide information aggregated for one or more of the corresponding geographic areas. 9. The system of claim 8, wherein the one or more identifiers include geohashes. 10. The system of claim 8, wherein processing the query includes:
performing a facet search of the index to determine counts of information for the one or more of the corresponding geographic areas. 11. The system of claim 8, wherein the index includes hierarchical levels of information and links between those hierarchical levels. 12. The system of claim 8, wherein the index includes first and second identifiers for an information element, wherein the second identifier indicates a portion of the geographic area of the first identifier. 13. The system of claim 8, wherein the at least one processor is further configured to:
color code the aggregated information and presenting the color-coded information on a user interface. 14. The system of claim 13, wherein the color-coded information is presented for the one or more of the corresponding geographic areas on a geographic map of the user interface. 15. A computer program product for retrieving geographic related information comprising:
a computer readable storage medium having computer readable program code embodied therewith for execution on a processing system, the computer readable program code comprising computer readable program code configured to:
generate an index including information and one or more identifiers each indicating a corresponding geographic area pertaining to the information; and
process a query against the index to provide information aggregated for one or more of the corresponding geographic areas. 16. The computer program product of claim 15, wherein the one or more identifiers include geohashes. 17. The computer program product of claim 15, wherein processing the query includes:
performing a facet search of the index to determine counts of information for the one or more of the corresponding geographic areas. 18. The computer program product of claim 15, wherein the index includes hierarchical levels of information and links between those hierarchical levels. 19. The computer program product of claim 15, wherein the index includes first and second identifiers for an information element, wherein the second identifier indicates a portion of the geographic area of the first identifier. 20. The computer program product of claim 15, wherein the computer readable program code is further configured to:
color code the aggregated information and presenting the color-coded information on a user interface. | 2,100 |
5,565 | 5,565 | 14,098,155 | 2,154 | An aspect provides a method, including: receiving from a user, at an input device of an information handling device, user object search input including at least one search term; accessing, using a processor, tag information of a plurality of tags associated with stored user objects; determining, using a processor, at least one modification to the user object search input to change results produced by the user object search input based on the tag information; and providing search results according to the at least one modification. Other aspects are described and claimed. | 1. A method, comprising:
receiving from a user, at an input device of an information handling device, user object search input including at least one search term; accessing, using a processor, tag information of a plurality of tags associated with stored user objects; determining, using a processor, at least one modification to the user object search input to change results produced by the user object search input based on the tag information; and providing search results according to the at least one modification. 2. The method of claim 1, further comprising:
providing an indication of the at least one modification to the user object search input; and awaiting a further user input prior to providing search results according to the at least one modification. 3. The method of claim 2, wherein the indication includes a preview of search results according to the user object search input and a preview of search results according to the at least one modification. 4. The method of claim 1, wherein the tag information further comprises information regarding how two or more tags are related. 5. The method of claim 4, wherein the at least one modification to the user object search input to change results produced by the user object search input comprises:
using a different tag associated with a search term to locate user objects; wherein the different tag is associated with an initial tag associated with the at least one search term. 6. The method of claim 4, wherein:
the search input comprises two or more search terms joined by an operator; and the at least one modification to the user object search input to change results produced by the user object search input comprises changing an operator joining two search terms based on information derived from the tag information. 7. The method of claim 6, wherein the information derived from the tag information comprises relationship information relating tags associated with the two search terms joined by the operator. 8. The method of claim 1, wherein the search results according to the at least one modification comprise search results selected from the group of search results consisting of: search results that are broader than results produced by unmodified user object search input, and search results that are narrower than results produced by unmodified user object search input. 9. The method of claim 1, wherein the determining at least one modification to the user object search input to change results produced by the user object search input further comprises predicting an interest of the user. 10. The method of claim 9, wherein the predicting is based on a tagging profile associated with the user. 11. An information handling device, comprising:
a user input device; a processor; a memory device that stores instructions accessible to the processor, the instructions being executable by the processor to: receive user object search input including at least one search term; access tag information of a plurality of tags associated with stored user objects; determine at least one modification to the user object search input to change results produced by the user object search input based on the tag information; and provide search results according to the at least one modification. 12. The information handling device of claim 11, wherein the instructions are further executable by the processor to:
provide an indication of the at least one modification to the user object search input; and await a further user input prior to providing search results according to the at least one modification. 13. The information handling device of claim 12, wherein the indication includes a preview of search results according to the user object search input and a preview of search results according to the at least one modification. 14. The information handling device of claim 11, wherein the tag information further comprises information regarding how two or more tags are related. 15. The information handling device of claim 14, wherein the at least one modification to the user object search input to change results produced by the user object search input comprises:
using a different tag associated with a search term to locate user objects; wherein the different tag is associated with an initial tag associated with the at least one search term. 16. The information handling device of claim 14, wherein:
the search input comprises two or more search terms joined by an operator; and the at least one modification to the user object search input to change results produced by the user object search input comprises changing an operator joining two search terms based on information derived from the tag information. 17. The information handling device of claim 16, wherein the information derived from the tag information comprises relationship information relating tags associated with the two search terms joined by the operator. 18. The information handling device of claim 11, wherein the search results according to the at least one modification comprise search results selected from the group of search results consisting of: search results that are broader than results produced by unmodified user object search input, and search results that are narrower than results produced by unmodified user object search input. 19. The information handling device of claim 11, wherein to determine at least one modification to the user object search input to change results produced by the user object search input further comprises predicting an interest of the user. 20. A product, comprising:
a storage device having code stored therewith, the code comprising: code that receives from a user, at an input device of an information handling device, user object search input including at least one search term; code that accesses, using a processor, tag information of a plurality of tags associated with stored user objects; code that determines, using a processor, at least one modification to the user object search input to change results produced by the user object search input based on the tag information; and code that provides search results according to the at least one modification. | An aspect provides a method, including: receiving from a user, at an input device of an information handling device, user object search input including at least one search term; accessing, using a processor, tag information of a plurality of tags associated with stored user objects; determining, using a processor, at least one modification to the user object search input to change results produced by the user object search input based on the tag information; and providing search results according to the at least one modification. Other aspects are described and claimed.1. A method, comprising:
receiving from a user, at an input device of an information handling device, user object search input including at least one search term; accessing, using a processor, tag information of a plurality of tags associated with stored user objects; determining, using a processor, at least one modification to the user object search input to change results produced by the user object search input based on the tag information; and providing search results according to the at least one modification. 2. The method of claim 1, further comprising:
providing an indication of the at least one modification to the user object search input; and awaiting a further user input prior to providing search results according to the at least one modification. 3. The method of claim 2, wherein the indication includes a preview of search results according to the user object search input and a preview of search results according to the at least one modification. 4. The method of claim 1, wherein the tag information further comprises information regarding how two or more tags are related. 5. The method of claim 4, wherein the at least one modification to the user object search input to change results produced by the user object search input comprises:
using a different tag associated with a search term to locate user objects; wherein the different tag is associated with an initial tag associated with the at least one search term. 6. The method of claim 4, wherein:
the search input comprises two or more search terms joined by an operator; and the at least one modification to the user object search input to change results produced by the user object search input comprises changing an operator joining two search terms based on information derived from the tag information. 7. The method of claim 6, wherein the information derived from the tag information comprises relationship information relating tags associated with the two search terms joined by the operator. 8. The method of claim 1, wherein the search results according to the at least one modification comprise search results selected from the group of search results consisting of: search results that are broader than results produced by unmodified user object search input, and search results that are narrower than results produced by unmodified user object search input. 9. The method of claim 1, wherein the determining at least one modification to the user object search input to change results produced by the user object search input further comprises predicting an interest of the user. 10. The method of claim 9, wherein the predicting is based on a tagging profile associated with the user. 11. An information handling device, comprising:
a user input device; a processor; a memory device that stores instructions accessible to the processor, the instructions being executable by the processor to: receive user object search input including at least one search term; access tag information of a plurality of tags associated with stored user objects; determine at least one modification to the user object search input to change results produced by the user object search input based on the tag information; and provide search results according to the at least one modification. 12. The information handling device of claim 11, wherein the instructions are further executable by the processor to:
provide an indication of the at least one modification to the user object search input; and await a further user input prior to providing search results according to the at least one modification. 13. The information handling device of claim 12, wherein the indication includes a preview of search results according to the user object search input and a preview of search results according to the at least one modification. 14. The information handling device of claim 11, wherein the tag information further comprises information regarding how two or more tags are related. 15. The information handling device of claim 14, wherein the at least one modification to the user object search input to change results produced by the user object search input comprises:
using a different tag associated with a search term to locate user objects; wherein the different tag is associated with an initial tag associated with the at least one search term. 16. The information handling device of claim 14, wherein:
the search input comprises two or more search terms joined by an operator; and the at least one modification to the user object search input to change results produced by the user object search input comprises changing an operator joining two search terms based on information derived from the tag information. 17. The information handling device of claim 16, wherein the information derived from the tag information comprises relationship information relating tags associated with the two search terms joined by the operator. 18. The information handling device of claim 11, wherein the search results according to the at least one modification comprise search results selected from the group of search results consisting of: search results that are broader than results produced by unmodified user object search input, and search results that are narrower than results produced by unmodified user object search input. 19. The information handling device of claim 11, wherein to determine at least one modification to the user object search input to change results produced by the user object search input further comprises predicting an interest of the user. 20. A product, comprising:
a storage device having code stored therewith, the code comprising: code that receives from a user, at an input device of an information handling device, user object search input including at least one search term; code that accesses, using a processor, tag information of a plurality of tags associated with stored user objects; code that determines, using a processor, at least one modification to the user object search input to change results produced by the user object search input based on the tag information; and code that provides search results according to the at least one modification. | 2,100 |
5,566 | 5,566 | 14,687,720 | 2,121 | In selected embodiments a recommendation generator builds a network of interrelationships between venues, reviewers and users based on their attributes and reviewer and user reviews of the venues. Each interrelationship or link may be positive or negative and may accumulate with other links (or anti-links) to provide nodal links the strength of which are based on commonality of attributes among the linked nodes and/or common preferences that one node, such as a reviewer, expresses for other nodes, such as venues. The links may be first order (based on a direct relationship between, for instance, a reviewer and a venue) or higher order (based on, for instance, the fact that two venue are both liked by a given reviewer). The recommendation engine in certain embodiments determines recommended venues based on user attributes and venue preferences by aggregating the link matrices and determining the venues which are most strongly coupled to the user. | 1. A method comprising:
receiving attribute data for a plurality of users, the data relating to a plurality of attributes of a user and to at least a first venue for which the user has an affinity; receiving venue data for a plurality of venues, the venue data relating to a plurality of attributes of the venues; receiving review data for the plurality of venues, the review data reflecting the affinity of a plurality of reviewers for the plurality of venues; accessing a data network comprising nodes corresponding at least to the plurality of venues and the plurality of reviewers and further comprising links between said nodes, each link reflecting a strength of an interrelationship between at least two nodes, wherein at least a plurality of the link strengths are a function of at least the review data and the venue data and wherein at least a plurality of the link strengths are further a function of both content-based and collaborative interrelationships; determining, based on the link strengths and at least one venue parameter, a plurality of recommended venues having the strongest links to a user; generating recommendation data comprising at least one recommended venue; and serving to a client device the recommendation data for display on a screen of the client device. | In selected embodiments a recommendation generator builds a network of interrelationships between venues, reviewers and users based on their attributes and reviewer and user reviews of the venues. Each interrelationship or link may be positive or negative and may accumulate with other links (or anti-links) to provide nodal links the strength of which are based on commonality of attributes among the linked nodes and/or common preferences that one node, such as a reviewer, expresses for other nodes, such as venues. The links may be first order (based on a direct relationship between, for instance, a reviewer and a venue) or higher order (based on, for instance, the fact that two venue are both liked by a given reviewer). The recommendation engine in certain embodiments determines recommended venues based on user attributes and venue preferences by aggregating the link matrices and determining the venues which are most strongly coupled to the user.1. A method comprising:
receiving attribute data for a plurality of users, the data relating to a plurality of attributes of a user and to at least a first venue for which the user has an affinity; receiving venue data for a plurality of venues, the venue data relating to a plurality of attributes of the venues; receiving review data for the plurality of venues, the review data reflecting the affinity of a plurality of reviewers for the plurality of venues; accessing a data network comprising nodes corresponding at least to the plurality of venues and the plurality of reviewers and further comprising links between said nodes, each link reflecting a strength of an interrelationship between at least two nodes, wherein at least a plurality of the link strengths are a function of at least the review data and the venue data and wherein at least a plurality of the link strengths are further a function of both content-based and collaborative interrelationships; determining, based on the link strengths and at least one venue parameter, a plurality of recommended venues having the strongest links to a user; generating recommendation data comprising at least one recommended venue; and serving to a client device the recommendation data for display on a screen of the client device. | 2,100 |
5,567 | 5,567 | 15,007,401 | 2,179 | Disclosed are systems and methods for improving interactions with and between computers in content communicating, displaying, generating, hosting and/or providing systems supported by or configured with personal computing devices, servers and/or platforms. The systems interact to identify and retrieve data within or across platforms, which can be used to improve the quality of data used in processing interactions between or among processors in such systems. The disclosed systems and methods determine and display message content within a portion of a message inbox in a manner that is specific to the type message content. According to some embodiments, when a message is received in a message inbox of a user, the message content can be opened for display within a dedicated portion of the inbox, thereby enabling improved message content retrieval, access and navigation within a message platform or message application. | 1. A method comprising:
receiving, at a computing device, a message addressed to a first user, said message comprising message content provided by a second user; displaying, via the computing device, said message in an inbox associated with the first user, said inbox comprising an inbox user interface (UI) that comprises a main inbox window view for displaying received messages; receiving, at the computing device, input associated with the message, said input comprising an instruction for opening said message within said inbox UI; automatically generating, via the computing device, a message tab associated with the message in response to receiving said input, said message tab being an embedded interface element displayed in said inbox UI that comprises functionality for switching from the main inbox window view to a tabbed window view when selected, said tabbed window view being an embedded sub-window of the inbox UI that displays the message content; receiving, at the computing device, user input to view said tabbed window view, said user input being entered respective to the displayed message tab; and automatically switching, via the computing device, the view of the inbox UI from the main inbox window view to the tabbed window view in response to said user input, said switching comprising displaying said message content in said currently displayed tabbed window view. 2. The method of claim 1, further comprising:
automatically generating a main inbox tab, said main inbox tab being an interface element displayed in said inbox UI that comprises functionality for actively viewing the main inbox window view when selected. 3. The method of claim 2, further comprising:
receiving second user input to view said main inbox view, said second user input being entered respective to the displayed main inbox tab; and automatically switching the view of the inbox UI from the tabbed window view to the main inbox window view in response to said second user input, said switching comprising displaying said main inbox window view. 4. The method of claim 2, wherein said generation of said main inbox tab is based on said generation of the message tab. 5. The method of claim 1, wherein said tabbed window view overlays the main inbox window view when selected. 6. The method of claim 1, further comprising:
analyzing said message to determine whether said message content corresponds to a criteria, said analysis comprising parsing said message and comparing said message content to the criteria; and determining, based on said comparison, whether the criteria is satisfied. 7. The method of claim 6, wherein said input for opening said message within said inbox UI is automatically generated upon said determination resulting in the criteria being satisfied. 8. The method of claim 6, wherein said criteria comprises information associated with a message selected from a group consisting of: type, category, timing, date, message sender identity, message recipient identity, geo-spatial data, social data, logical data and format. 9. The method of claim 1, wherein said message tab remains displayed within the inbox UI until a detected threshold event, said threshold event being associated with an event that renders the message content unusable by the first user. 10. The method of claim 1, wherein said second user is a third party advertiser. 11. The method of claim 1, further comprising:
determining a context of the message content; causing communication, over the network, of said context to an advertisement platform to obtain digital advertisement content associated with said context; and receiving said identified digital advertisement content, said receiving comprising displaying said digital advertisement content within said inbox UI. 12. The method of claim 11, wherein said displayed digital advertisement content is displayed in said tabbed window view. 13. A non-transitory computer-readable storage medium tangibly encoded with computer-executable instructions, that when executed by a processor associated with a computing device, perform a method comprising:
receiving a message addressed to a first user, said message comprising message content provided by a second user; displaying said message in an inbox associated with the first user, said inbox comprising an inbox user interface (UI) that comprises a main inbox window view for displaying received messages; receiving input associated with the message, said input comprising an instruction for opening said message within said inbox UI; automatically generating a message tab associated with the message in response to receiving said input, said message tab being an embedded interface element displayed in said inbox UI that comprises functionality for switching from the main inbox window view to a tabbed window view when selected, said tabbed window view being an embedded sub-window of the inbox UI that displays the message content; receiving user input to view said tabbed window view, said user input being entered respective to the displayed message tab; and automatically switching the view of the inbox UI from the main inbox window view to the tabbed window view in response to said user input, said switching comprising displaying said message content in said currently displayed tabbed window view. 14. The non-transitory computer-readable storage medium of claim 13, further comprising:
automatically generating a main inbox tab, said main inbox tab being an interface element displayed in said inbox UI that comprises functionality for actively viewing the main inbox window view when selected. 15. The non-transitory computer-readable storage medium of claim 14, further comprising:
receiving second user input to view said main inbox view, said second user input being entered respective to the displayed main inbox tab; and automatically switching the view of the inbox UI from the tabbed window view to the main inbox window view in response to said second user input, said switching comprising displaying said main inbox window view. 16. The non-transitory computer-readable storage medium of claim 14, wherein said generation of said main inbox tab is based on said generation of the message tab. 17. The non-transitory computer-readable storage medium of claim 13, wherein said tabbed window view overlays the main inbox window view when selected. 18. The non-transitory computer-readable storage medium of claim 13, further comprising:
analyzing said message to determine whether said message content corresponds to a criteria, said analysis comprising parsing said message and comparing said message content to the criteria; and determining, based on said comparison, whether the criteria is satisfied. 19. The non-transitory computer-readable storage medium of claim 13, wherein said message tab remains displayed within the inbox UI until a detected threshold event, said threshold event being associated with an event that renders the message content unusable by the first user. 20. A system comprising:
a processor; a non-transitory computer-readable storage medium for tangibly storing thereon program logic for execution by the processor, the program logic comprising:
receiving logic executed by the processor for receiving a message addressed to a first user, said message comprising message content provided by a second user;
display logic executed by the processor for displaying said message in an inbox associated with the first user, said inbox comprising an inbox user interface (UI) that comprises a main inbox window view for displaying received messages;
receiving logic executed by the processor for receiving input associated with the message, said input comprising an instruction for opening said message within said inbox UI;
generation logic executed by the processor for automatically generating a message tab associated with the message in response to receiving said input, said message tab being an embedded interface element displayed in said inbox UI that comprises functionality for switching from the main inbox window view to a tabbed window view when selected, said tabbed window view being an embedded sub-window of the inbox UI that displays the message content;
receiving logic executed by the processor for receiving user input to view said tabbed window view, said user input being entered respective to the displayed message tab; and
switching logic executed by the processor for automatically switching the view of the inbox UI from the main inbox window view to the tabbed window view in response to said user input, said switching comprising displaying said message content in said currently displayed tabbed window view. | Disclosed are systems and methods for improving interactions with and between computers in content communicating, displaying, generating, hosting and/or providing systems supported by or configured with personal computing devices, servers and/or platforms. The systems interact to identify and retrieve data within or across platforms, which can be used to improve the quality of data used in processing interactions between or among processors in such systems. The disclosed systems and methods determine and display message content within a portion of a message inbox in a manner that is specific to the type message content. According to some embodiments, when a message is received in a message inbox of a user, the message content can be opened for display within a dedicated portion of the inbox, thereby enabling improved message content retrieval, access and navigation within a message platform or message application.1. A method comprising:
receiving, at a computing device, a message addressed to a first user, said message comprising message content provided by a second user; displaying, via the computing device, said message in an inbox associated with the first user, said inbox comprising an inbox user interface (UI) that comprises a main inbox window view for displaying received messages; receiving, at the computing device, input associated with the message, said input comprising an instruction for opening said message within said inbox UI; automatically generating, via the computing device, a message tab associated with the message in response to receiving said input, said message tab being an embedded interface element displayed in said inbox UI that comprises functionality for switching from the main inbox window view to a tabbed window view when selected, said tabbed window view being an embedded sub-window of the inbox UI that displays the message content; receiving, at the computing device, user input to view said tabbed window view, said user input being entered respective to the displayed message tab; and automatically switching, via the computing device, the view of the inbox UI from the main inbox window view to the tabbed window view in response to said user input, said switching comprising displaying said message content in said currently displayed tabbed window view. 2. The method of claim 1, further comprising:
automatically generating a main inbox tab, said main inbox tab being an interface element displayed in said inbox UI that comprises functionality for actively viewing the main inbox window view when selected. 3. The method of claim 2, further comprising:
receiving second user input to view said main inbox view, said second user input being entered respective to the displayed main inbox tab; and automatically switching the view of the inbox UI from the tabbed window view to the main inbox window view in response to said second user input, said switching comprising displaying said main inbox window view. 4. The method of claim 2, wherein said generation of said main inbox tab is based on said generation of the message tab. 5. The method of claim 1, wherein said tabbed window view overlays the main inbox window view when selected. 6. The method of claim 1, further comprising:
analyzing said message to determine whether said message content corresponds to a criteria, said analysis comprising parsing said message and comparing said message content to the criteria; and determining, based on said comparison, whether the criteria is satisfied. 7. The method of claim 6, wherein said input for opening said message within said inbox UI is automatically generated upon said determination resulting in the criteria being satisfied. 8. The method of claim 6, wherein said criteria comprises information associated with a message selected from a group consisting of: type, category, timing, date, message sender identity, message recipient identity, geo-spatial data, social data, logical data and format. 9. The method of claim 1, wherein said message tab remains displayed within the inbox UI until a detected threshold event, said threshold event being associated with an event that renders the message content unusable by the first user. 10. The method of claim 1, wherein said second user is a third party advertiser. 11. The method of claim 1, further comprising:
determining a context of the message content; causing communication, over the network, of said context to an advertisement platform to obtain digital advertisement content associated with said context; and receiving said identified digital advertisement content, said receiving comprising displaying said digital advertisement content within said inbox UI. 12. The method of claim 11, wherein said displayed digital advertisement content is displayed in said tabbed window view. 13. A non-transitory computer-readable storage medium tangibly encoded with computer-executable instructions, that when executed by a processor associated with a computing device, perform a method comprising:
receiving a message addressed to a first user, said message comprising message content provided by a second user; displaying said message in an inbox associated with the first user, said inbox comprising an inbox user interface (UI) that comprises a main inbox window view for displaying received messages; receiving input associated with the message, said input comprising an instruction for opening said message within said inbox UI; automatically generating a message tab associated with the message in response to receiving said input, said message tab being an embedded interface element displayed in said inbox UI that comprises functionality for switching from the main inbox window view to a tabbed window view when selected, said tabbed window view being an embedded sub-window of the inbox UI that displays the message content; receiving user input to view said tabbed window view, said user input being entered respective to the displayed message tab; and automatically switching the view of the inbox UI from the main inbox window view to the tabbed window view in response to said user input, said switching comprising displaying said message content in said currently displayed tabbed window view. 14. The non-transitory computer-readable storage medium of claim 13, further comprising:
automatically generating a main inbox tab, said main inbox tab being an interface element displayed in said inbox UI that comprises functionality for actively viewing the main inbox window view when selected. 15. The non-transitory computer-readable storage medium of claim 14, further comprising:
receiving second user input to view said main inbox view, said second user input being entered respective to the displayed main inbox tab; and automatically switching the view of the inbox UI from the tabbed window view to the main inbox window view in response to said second user input, said switching comprising displaying said main inbox window view. 16. The non-transitory computer-readable storage medium of claim 14, wherein said generation of said main inbox tab is based on said generation of the message tab. 17. The non-transitory computer-readable storage medium of claim 13, wherein said tabbed window view overlays the main inbox window view when selected. 18. The non-transitory computer-readable storage medium of claim 13, further comprising:
analyzing said message to determine whether said message content corresponds to a criteria, said analysis comprising parsing said message and comparing said message content to the criteria; and determining, based on said comparison, whether the criteria is satisfied. 19. The non-transitory computer-readable storage medium of claim 13, wherein said message tab remains displayed within the inbox UI until a detected threshold event, said threshold event being associated with an event that renders the message content unusable by the first user. 20. A system comprising:
a processor; a non-transitory computer-readable storage medium for tangibly storing thereon program logic for execution by the processor, the program logic comprising:
receiving logic executed by the processor for receiving a message addressed to a first user, said message comprising message content provided by a second user;
display logic executed by the processor for displaying said message in an inbox associated with the first user, said inbox comprising an inbox user interface (UI) that comprises a main inbox window view for displaying received messages;
receiving logic executed by the processor for receiving input associated with the message, said input comprising an instruction for opening said message within said inbox UI;
generation logic executed by the processor for automatically generating a message tab associated with the message in response to receiving said input, said message tab being an embedded interface element displayed in said inbox UI that comprises functionality for switching from the main inbox window view to a tabbed window view when selected, said tabbed window view being an embedded sub-window of the inbox UI that displays the message content;
receiving logic executed by the processor for receiving user input to view said tabbed window view, said user input being entered respective to the displayed message tab; and
switching logic executed by the processor for automatically switching the view of the inbox UI from the main inbox window view to the tabbed window view in response to said user input, said switching comprising displaying said message content in said currently displayed tabbed window view. | 2,100 |
5,568 | 5,568 | 11,850,005 | 2,175 | Methods, systems, and apparatus, including computer program products, for presenting user interface elements. A first page of one or more user interface elements is presented on a touch-sensitive display. Each of the user interface elements corresponds to a respective application. A gesture performed on the touch-sensitive display is detected. In response to the detected gesture, a second page of one or more user interface elements is presented on the touch-sensitive display. | 1. A method, comprising:
presenting a first page of one or more user interface elements on a touch-sensitive display, each of the user interface elements corresponding to a respective application; detecting a gesture performed on the touch-sensitive display; and in response to the detected gesture, presenting a second page of one or more user interface elements on the touch-sensitive display. 2. The method of claim 1, wherein presenting the first page of user interface elements comprises presenting the user interface elements in the first page of user interface elements in a first rendering style; and
the method further comprising, simultaneous with presenting the user interface elements in the first page of user interface elements in the first rendering style, presenting at least one of the user interface elements in the second page of user interface elements in a second rendering style. 3. The method of claim 2, wherein presenting the user interface elements in the first page of user interface elements in a first rendering style comprises presenting the user interface elements in the first page of user interface elements at a first intensity; and
presenting at least one of the user interface elements in the second page of user interface elements in a second rendering style comprises presenting at least one of the user interface elements in the second page of user interface elements at a second intensity lower than the first intensity. 4. The method of claim 2, wherein presenting the second page of user interface elements in response to the detected gesture comprises:
presenting the user interface elements in the second page of user interface elements in the first rendering style; and presenting at least one of the user interface elements in the first page of user interface elements in the second rendering style. 5. The method of claim 1, wherein presenting the second page of user interface elements on the display comprises:
moving the first page of user interface elements out of view on the display; and moving the second page of user interface elements into view on the display. 6. The method of claim 1, wherein the gesture comprises a horizontal swipe. 7. The method of claim 1, wherein the gesture comprises a vertical swipe. 8. The method of claim 1, further comprising:
presenting a tray area on the display and presenting a set of the user interface elements in the tray area; wherein the tray area is overlaid over the first page of user interface elements or the second page of user interface elements. 9. A method, comprising:
presenting a first user interface element corresponding to a first application on a device, the first application having an unrestricted status; simultaneous with presenting the first user interface element, presenting a second user interface element corresponding to a second application on the device, the second application having a restricted status, and an indication of the restricted status; changing the restricted status of the second application to an unrestricted status; and in response to changing the restricted status, presenting the second user interface element without the indication of the restricted status. 10. The method of claim 9, wherein presenting the first user interface element comprises presenting the first user interface element at a first intensity; and
presenting the second user interface element and an indication of the restricted status comprises presenting the second user interface element at a second intensity lower than the first intensity. 11. The method of claim 10, wherein presenting the second user interface element without the indication of the restricted status comprises presenting the second user interface element at the first intensity. 12. The method of claim 9, wherein presenting the first user interface element comprises presenting a first background with the first user interface element; and
presenting the second user interface element and an indication of the restricted status comprises presenting the second user interface element with a second background different than the first background. 13. The method of claim 12, wherein presenting the second user interface element without the indication of the restricted status comprises presenting the first background with the second user interface element. 14. The method of claim 9, wherein changing the restricted status of the second application to an unrestricted status comprises:
performing a transaction to change, for consideration, the restricted status to the unrestricted status. 15. The method of claim 9, wherein changing the restricted status of the second application to an unrestricted status comprises:
downloading to the device an authorization code associated with the second application. 16. The method of claim 9, wherein changing the restricted status of the second application to an unrestricted status comprises:
downloading to the device data associated with the second application. 17. The method of claim 16, wherein the downloaded data comprises one or more files associated with the second application. 18. A method implemented on a device having a touch-sensitive display, the device having a user interface comprising a plurality of user interface elements, each user interface element corresponding to a respective application on the device, the method comprising:
displaying at least a subset of the user interface elements in an ergonomic layout. 19. The method of claim 18, wherein displaying at least a subset of the user interface elements in an ergonomic layout comprises displaying the at least a subset of the user interface elements along an arced path. 20. The method of claim 18, wherein displaying the at least a subset of the user interface elements along an arced path comprises:
displaying a first subset of the user interface elements along a first arced path; and displaying a second subset of the user interface elements along a second arced path. 21. A method, comprising:
presenting a user interface element corresponding to a application on a display device; presenting a graphical representation of a reflection of the user interface element; receiving an input selecting the graphical representation; and presenting information associated with the application in response to the input. 22. The method of claim 21, wherein the information comprises a settings dialog for the application. 23. The method of claim 21, wherein:
the device comprises a touch-sensitive display; and presenting a graphical representation of a reflection of the user interface element comprises presenting the graphical representation of the reflection of the user interface element on the touch-sensitive display; and receiving an input selecting the graphical representation comprises receiving a touch of the graphical representation on the touch-sensitive display. 24. A device comprising:
a touch-sensitive display; one or more processors; and a computer-readable medium storing instructions for execution by the one or more processors, the instructions comprising instructions to:
present a first page of one or more user interface elements on a touch-sensitive display, each of the user interface elements corresponding to a respective application;
detect a gesture performed on the touch-sensitive display; and
in response to the detected gesture, present a second page of one or more user interface elements on the touch-sensitive display. | Methods, systems, and apparatus, including computer program products, for presenting user interface elements. A first page of one or more user interface elements is presented on a touch-sensitive display. Each of the user interface elements corresponds to a respective application. A gesture performed on the touch-sensitive display is detected. In response to the detected gesture, a second page of one or more user interface elements is presented on the touch-sensitive display.1. A method, comprising:
presenting a first page of one or more user interface elements on a touch-sensitive display, each of the user interface elements corresponding to a respective application; detecting a gesture performed on the touch-sensitive display; and in response to the detected gesture, presenting a second page of one or more user interface elements on the touch-sensitive display. 2. The method of claim 1, wherein presenting the first page of user interface elements comprises presenting the user interface elements in the first page of user interface elements in a first rendering style; and
the method further comprising, simultaneous with presenting the user interface elements in the first page of user interface elements in the first rendering style, presenting at least one of the user interface elements in the second page of user interface elements in a second rendering style. 3. The method of claim 2, wherein presenting the user interface elements in the first page of user interface elements in a first rendering style comprises presenting the user interface elements in the first page of user interface elements at a first intensity; and
presenting at least one of the user interface elements in the second page of user interface elements in a second rendering style comprises presenting at least one of the user interface elements in the second page of user interface elements at a second intensity lower than the first intensity. 4. The method of claim 2, wherein presenting the second page of user interface elements in response to the detected gesture comprises:
presenting the user interface elements in the second page of user interface elements in the first rendering style; and presenting at least one of the user interface elements in the first page of user interface elements in the second rendering style. 5. The method of claim 1, wherein presenting the second page of user interface elements on the display comprises:
moving the first page of user interface elements out of view on the display; and moving the second page of user interface elements into view on the display. 6. The method of claim 1, wherein the gesture comprises a horizontal swipe. 7. The method of claim 1, wherein the gesture comprises a vertical swipe. 8. The method of claim 1, further comprising:
presenting a tray area on the display and presenting a set of the user interface elements in the tray area; wherein the tray area is overlaid over the first page of user interface elements or the second page of user interface elements. 9. A method, comprising:
presenting a first user interface element corresponding to a first application on a device, the first application having an unrestricted status; simultaneous with presenting the first user interface element, presenting a second user interface element corresponding to a second application on the device, the second application having a restricted status, and an indication of the restricted status; changing the restricted status of the second application to an unrestricted status; and in response to changing the restricted status, presenting the second user interface element without the indication of the restricted status. 10. The method of claim 9, wherein presenting the first user interface element comprises presenting the first user interface element at a first intensity; and
presenting the second user interface element and an indication of the restricted status comprises presenting the second user interface element at a second intensity lower than the first intensity. 11. The method of claim 10, wherein presenting the second user interface element without the indication of the restricted status comprises presenting the second user interface element at the first intensity. 12. The method of claim 9, wherein presenting the first user interface element comprises presenting a first background with the first user interface element; and
presenting the second user interface element and an indication of the restricted status comprises presenting the second user interface element with a second background different than the first background. 13. The method of claim 12, wherein presenting the second user interface element without the indication of the restricted status comprises presenting the first background with the second user interface element. 14. The method of claim 9, wherein changing the restricted status of the second application to an unrestricted status comprises:
performing a transaction to change, for consideration, the restricted status to the unrestricted status. 15. The method of claim 9, wherein changing the restricted status of the second application to an unrestricted status comprises:
downloading to the device an authorization code associated with the second application. 16. The method of claim 9, wherein changing the restricted status of the second application to an unrestricted status comprises:
downloading to the device data associated with the second application. 17. The method of claim 16, wherein the downloaded data comprises one or more files associated with the second application. 18. A method implemented on a device having a touch-sensitive display, the device having a user interface comprising a plurality of user interface elements, each user interface element corresponding to a respective application on the device, the method comprising:
displaying at least a subset of the user interface elements in an ergonomic layout. 19. The method of claim 18, wherein displaying at least a subset of the user interface elements in an ergonomic layout comprises displaying the at least a subset of the user interface elements along an arced path. 20. The method of claim 18, wherein displaying the at least a subset of the user interface elements along an arced path comprises:
displaying a first subset of the user interface elements along a first arced path; and displaying a second subset of the user interface elements along a second arced path. 21. A method, comprising:
presenting a user interface element corresponding to a application on a display device; presenting a graphical representation of a reflection of the user interface element; receiving an input selecting the graphical representation; and presenting information associated with the application in response to the input. 22. The method of claim 21, wherein the information comprises a settings dialog for the application. 23. The method of claim 21, wherein:
the device comprises a touch-sensitive display; and presenting a graphical representation of a reflection of the user interface element comprises presenting the graphical representation of the reflection of the user interface element on the touch-sensitive display; and receiving an input selecting the graphical representation comprises receiving a touch of the graphical representation on the touch-sensitive display. 24. A device comprising:
a touch-sensitive display; one or more processors; and a computer-readable medium storing instructions for execution by the one or more processors, the instructions comprising instructions to:
present a first page of one or more user interface elements on a touch-sensitive display, each of the user interface elements corresponding to a respective application;
detect a gesture performed on the touch-sensitive display; and
in response to the detected gesture, present a second page of one or more user interface elements on the touch-sensitive display. | 2,100 |
5,569 | 5,569 | 15,205,404 | 2,176 | Systems and methods for enabling access to data, including data represented using a variety of “richer” data formats, are disclosed. Such systems and methods may be useful, among a variety of cases, with applications or entities that may not typically be able to access such richer data. In at least some implementations, data copied to a clipboard and formatted using a variety of formats may be provided or accessed by a destination application as part of a paste operation even when the destination application may not natively provide the ability to access all of the data formats that might exist on a clipboard. In at least some implementations, such access may be provided without modifying or augmenting the data placed on the clipboard. | 1-20. (canceled) 21. A method for enabling information exchange between a first application and a second application using a clipboard, the method comprising:
in response to a copy operation initiated by a user while using the first application, generating structured clipboard data comprising a content type attribute representing a type of at least one data item and a uniform resource attribute containing a reference to a location of the at least one data item and storing the structured clipboard data in the clipboard; and in response to a paste operation initiated by the user while using the second application: automatically processing the structured clipboard data in the clipboard to determine whether the second application is capable of handling text only or whether the second application is capable of handling richer data, and
if the second application is capable of handling text only, invoking a function to provide the structured clipboard data in the clipboard as text only and executing the paste operation by pasting the text, or
if the second application is capable of handling richer data, automatically processing the structured clipboard data in the clipboard, including:
processing the type of the at least one data item based on the content type attribute representing the type of the at least one data item, retrieving data for pasting from: (1) either the at least one data item or (2) based on the uniform resource attribute containing the reference to the location and executing the paste operation by pasting the data. 22. The method of claim 21, wherein the generating structured clipboard data further comprises generating a description attribute representing any information provided by a user or the first application. 23. The method of claim 22 further comprising pasting any information provided by the user or the first application. 24. The method of claim 21, wherein the generating structured clipboard data further comprising generating a format type attribute for identifying a format associated with the at least one data item. 25. The method of claim 21, wherein the reference to the location comprises a uniform resource locator. 26. The method of claim 21 further comprising implementing an application program interface to allow performance of an operation associated with the clipboard. 27. The method of claim 21, wherein the generating structured clipboard data further comprising generating an encoding attribute for the at least one data item. 28. A method for enabling information exchange between a first application and a second application using a clipboard, the method comprising:
in response to a copy operation initiated by a user while using the first application: generating structured clipboard data comprising a content type attribute representing a format of a plurality of data, a uniform resource attribute containing a reference to a location of the plurality of data, and an identifier attribute for identifying data items in the plurality of data and storing the structured clipboard data in the clipboard; and in response to a paste operation initiated by the user while using the second application, automatically processing the structured clipboard data in the clipboard, including: processing the type of the plurality of data based on the content type attribute representing the type of the plurality of data, retrieving the data items based at least on the uniform resource attribute containing the reference to the location and the identifier attribute for identifying the data items in the plurality of data, and executing the paste operation by: identifying the data items in the plurality of data and pasting the data items such that the user may access the data items with the second application. 29. The method of claim 28, wherein the generating structured clipboard data further comprises generating a description attribute representing any information provided by a user or the first application. 30. The method of claim 29, wherein the automatically processing the structured clipboard data in the clipboard further comprises processing the description attribute pasting any information provided by the user or the first application such that the user may access the information provided by the user or the first application with the second application. 31. The method of claim 28, wherein the structured clipboard data further comprises a format type attribute for identifying a format associated with the at least one data item. 32. The method of claim 28, wherein the structured clipboard data further comprises an identifier for identifying the second data value. 33. The method of claim 28, wherein the reference to the location comprises a uniform resource locator. 34. The method of claim 28 further comprising providing an application programming interface for enabling the copy operation and the paste operation. 35. The method of claim 28, wherein the generating structured clipboard data further comprising generating an encoding attribute for the at least one data item. 36. A method for enabling information exchange between a first application and a second application via a clipboard, the method comprising:
in response to a copy operation initiated by a user while using the first application: generating structured clipboard data comprising a content type attribute representing a format of a plurality of data, a description attribute representing any information provided by the user or the first application, a uniform resource attribute containing a reference to a location of the plurality of data, and an identifier attribute for identifying data items in the plurality of data and storing the structured clipboard data in the clipboard; and in response to a paste operation initiated by the user while using the second application: automatically processing the structured clipboard data in the clipboard to determine whether the second application is capable of handling text only or whether the second application is capable of handling richer data,
if the second application is capable of handling text only, invoking a function to provide the structured clipboard data as text only and executing the paste operation by pasting the text, or
if the second application is capable of handling richer data, processing the type of the plurality of data based on the content type attribute representing the type of the plurality of data, retrieving the data items based at least on the uniform resource attribute containing the reference to the location and the identifier attribute for identifying the data items in the plurality of data, and executing the paste operation by: identifying the data items in the plurality of data, pasting the data items such that the user may access the data items with the second application, and by processing the description attribute pasting any information provided by the user or the first application such that the user may access the information provided by the user or the first application with the second application. 37. The method of claim 36, wherein the reference to the location comprises a uniform resource locator. 38. The method of claim 36 further comprising providing an application programming interface for enabling the copy operation and the paste operation. 39. The method of claim 36 further comprising generating an authentication attribute representing a type of authentication technique that may be used to access the data items in the plurality of data. 40. The method of claim 39 further comprising automatically processing the authentication attribute. | Systems and methods for enabling access to data, including data represented using a variety of “richer” data formats, are disclosed. Such systems and methods may be useful, among a variety of cases, with applications or entities that may not typically be able to access such richer data. In at least some implementations, data copied to a clipboard and formatted using a variety of formats may be provided or accessed by a destination application as part of a paste operation even when the destination application may not natively provide the ability to access all of the data formats that might exist on a clipboard. In at least some implementations, such access may be provided without modifying or augmenting the data placed on the clipboard.1-20. (canceled) 21. A method for enabling information exchange between a first application and a second application using a clipboard, the method comprising:
in response to a copy operation initiated by a user while using the first application, generating structured clipboard data comprising a content type attribute representing a type of at least one data item and a uniform resource attribute containing a reference to a location of the at least one data item and storing the structured clipboard data in the clipboard; and in response to a paste operation initiated by the user while using the second application: automatically processing the structured clipboard data in the clipboard to determine whether the second application is capable of handling text only or whether the second application is capable of handling richer data, and
if the second application is capable of handling text only, invoking a function to provide the structured clipboard data in the clipboard as text only and executing the paste operation by pasting the text, or
if the second application is capable of handling richer data, automatically processing the structured clipboard data in the clipboard, including:
processing the type of the at least one data item based on the content type attribute representing the type of the at least one data item, retrieving data for pasting from: (1) either the at least one data item or (2) based on the uniform resource attribute containing the reference to the location and executing the paste operation by pasting the data. 22. The method of claim 21, wherein the generating structured clipboard data further comprises generating a description attribute representing any information provided by a user or the first application. 23. The method of claim 22 further comprising pasting any information provided by the user or the first application. 24. The method of claim 21, wherein the generating structured clipboard data further comprising generating a format type attribute for identifying a format associated with the at least one data item. 25. The method of claim 21, wherein the reference to the location comprises a uniform resource locator. 26. The method of claim 21 further comprising implementing an application program interface to allow performance of an operation associated with the clipboard. 27. The method of claim 21, wherein the generating structured clipboard data further comprising generating an encoding attribute for the at least one data item. 28. A method for enabling information exchange between a first application and a second application using a clipboard, the method comprising:
in response to a copy operation initiated by a user while using the first application: generating structured clipboard data comprising a content type attribute representing a format of a plurality of data, a uniform resource attribute containing a reference to a location of the plurality of data, and an identifier attribute for identifying data items in the plurality of data and storing the structured clipboard data in the clipboard; and in response to a paste operation initiated by the user while using the second application, automatically processing the structured clipboard data in the clipboard, including: processing the type of the plurality of data based on the content type attribute representing the type of the plurality of data, retrieving the data items based at least on the uniform resource attribute containing the reference to the location and the identifier attribute for identifying the data items in the plurality of data, and executing the paste operation by: identifying the data items in the plurality of data and pasting the data items such that the user may access the data items with the second application. 29. The method of claim 28, wherein the generating structured clipboard data further comprises generating a description attribute representing any information provided by a user or the first application. 30. The method of claim 29, wherein the automatically processing the structured clipboard data in the clipboard further comprises processing the description attribute pasting any information provided by the user or the first application such that the user may access the information provided by the user or the first application with the second application. 31. The method of claim 28, wherein the structured clipboard data further comprises a format type attribute for identifying a format associated with the at least one data item. 32. The method of claim 28, wherein the structured clipboard data further comprises an identifier for identifying the second data value. 33. The method of claim 28, wherein the reference to the location comprises a uniform resource locator. 34. The method of claim 28 further comprising providing an application programming interface for enabling the copy operation and the paste operation. 35. The method of claim 28, wherein the generating structured clipboard data further comprising generating an encoding attribute for the at least one data item. 36. A method for enabling information exchange between a first application and a second application via a clipboard, the method comprising:
in response to a copy operation initiated by a user while using the first application: generating structured clipboard data comprising a content type attribute representing a format of a plurality of data, a description attribute representing any information provided by the user or the first application, a uniform resource attribute containing a reference to a location of the plurality of data, and an identifier attribute for identifying data items in the plurality of data and storing the structured clipboard data in the clipboard; and in response to a paste operation initiated by the user while using the second application: automatically processing the structured clipboard data in the clipboard to determine whether the second application is capable of handling text only or whether the second application is capable of handling richer data,
if the second application is capable of handling text only, invoking a function to provide the structured clipboard data as text only and executing the paste operation by pasting the text, or
if the second application is capable of handling richer data, processing the type of the plurality of data based on the content type attribute representing the type of the plurality of data, retrieving the data items based at least on the uniform resource attribute containing the reference to the location and the identifier attribute for identifying the data items in the plurality of data, and executing the paste operation by: identifying the data items in the plurality of data, pasting the data items such that the user may access the data items with the second application, and by processing the description attribute pasting any information provided by the user or the first application such that the user may access the information provided by the user or the first application with the second application. 37. The method of claim 36, wherein the reference to the location comprises a uniform resource locator. 38. The method of claim 36 further comprising providing an application programming interface for enabling the copy operation and the paste operation. 39. The method of claim 36 further comprising generating an authentication attribute representing a type of authentication technique that may be used to access the data items in the plurality of data. 40. The method of claim 39 further comprising automatically processing the authentication attribute. | 2,100 |
5,570 | 5,570 | 14,707,532 | 2,179 | A system having a processor is provided that visually manipulates objects on a touch screen responsive to inputs through the touch screen. The processor may receive a selection of a first object while a second object remains unselected. Also the processor may be responsive to first motion inputs representative of the selected first object being moved with a first motion that does not have a predetermined motion characteristic, to maintain a connection between the first and second objects while changing the positions of the first object and at least a first portion of the second object. In addition, the processor may be responsive to second motion inputs representative of the selected first object being moved with a second motion that has the predetermined motion characteristic, to break the connection between the first and second objects. | 1. A system comprising:
at least one processor configured to cause a display device to display a plurality of connected objects and to receive at least one selection input through an input device representative of a selection of a first one of the connected objects while a second one of the connected objects remains unselected, wherein the at least one processor is configured responsive to first motion inputs received through the input device representative of the selected first object being moved with a first motion that does not have a predetermined motion characteristic, to maintain a connection between the first and second object while changing positions of the first object and at least a first portion of the second object, wherein the at least one processor is configured responsive to second motion inputs received through the input device representative of the selected first object being moved with a second motion that has the predetermined motion characteristic, to break the connection between the first and second objects. 2. The system according to claim 1, wherein the at least one processor is configured to maintain the connection between the first and second objects responsive to a determination that the first motion does not have the first characteristic, wherein the at least one processor is configured to break the connection between the first and second objects responsive to a determination that the second motion inputs are associated with movement of the selected first object and the first portion of the second object without moving a second portion of the second object and that the second motion has the predetermined motion characteristic. 3. The system according to claim 1, wherein the predetermined motion characteristic corresponds to a speed, an acceleration, a number of direction changes, an amount of time, a motion distance, or any combination thereof having at least one predetermined relationship with at least one predetermined threshold. 4. The system according to claim 3, wherein the at least one predetermined threshold represents a predetermined speed, wherein the predetermined motion characteristic corresponds to a motion speed that reaches the predetermined speed. 5. The system according to claim 3, wherein the at least one predetermined threshold represents a predetermined number of direction changes in a predetermined amount of time, wherein the predetermined motion characteristic corresponds to a motion with a number of direction changes that reaches the predetermined number of direction changes within the predetermined amount of time. 6. The system according to claim 5, wherein predetermined motion characteristic corresponds to a continuous back and forth shaking motion. 7. The system according to claim 3, wherein the first portion of the second object is directly connected to the first object, wherein the second portion of the second object is indirectly connected to the first object through the first portion of the second object, wherein responsive to the first motion inputs, the at least one processor is configured to automatically change the first portion of the second object to maintain the connection between the first and second objects, while the second portion of the first object remains stationary. 8. The system according to claim 7, wherein the at least one processor is operative to store data in a memory representative of an initial configuration of the second object before the first portion of the second object was automatically changed via the first motion inputs, wherein responsive to the second motion inputs, the at least one processor is configured automatically change a current configuration of the second object to correspond to its initial configuration. 9. The system according to claim 3, wherein the at least one processor is configured to store in a memory object data representative of positions of the first and second objects when the first and second objects were connected, wherein using the object data the at least one processor is configured to reconnect the first object to the second object responsive to third motion inputs through the input device representative of the selected first object being moved to a further position relative to the second object that is within a predetermined distance of corresponding to the position stored in the memory for when the first and second objects were connected. 10. The system according to claim 1, further comprising a memory, an application software component, and a touch screen comprised of the input device and the display device, wherein the application software component is comprised of instructions that when included in the memory and executed by the at least one processor, cause the at least one processor to manipulate the connected objects outputted through the touch screen responsive to the first and second motion inputs through the touch screen, wherein the application software component corresponds to a CAD software application that is operative to produce a CAD drawing based at least in part on the motion inputs through the touch screen. 11. A method comprising:
through operation of at least one processor, causing a display device to display a plurality of connected objects while receiving at least one selection input through an input device representative of selecting a first one of the connected objects while a second one of the connected objects remains unselected, through operation of the at least one processor, maintaining a connection between the first and second object while changing positions of the first object and at least a first portion of the second object displayed through the display device, responsive to receiving first motion inputs through the input device representative of the selected first object being moved with a first motion that does not have a predetermined motion characteristic, and through operation of the at least one processor, breaking the connection between the first and second objects, responsive to receiving second motion inputs through the input device representative of the selected first object being moved with a second motion that has the predetermined motion characteristic. 12. The method according to claim 11, further comprising:
wherein maintaining the connection between the first and second objects is carried out responsive to determining that the first motion does not have the first characteristic, and wherein breaking the connection between the first and second objects is carried out responsive to determining that the second motion inputs are associated with movement of the selected first object and the first portion of the second object without moving a second portion of the second object and that the second motion has the predetermined motion characteristic. 13. The method according to claim 11, wherein the predetermined motion characteristic corresponds to a speed, an acceleration, a number of direction changes, an amount of time, a motion distance, or any combination thereof having at least one predetermined relationship with at least one predetermined threshold. 14. The method according to claim 13, wherein the at least one predetermined threshold represents a predetermined speed, wherein the predetermined motion characteristic corresponds to a motion speed that reaches the predetermined speed. 15. The method according to claim 13, wherein the at least one predetermined threshold represents a predetermined number of direction changes in a predetermined amount of time, wherein the predetermined motion characteristic corresponds to a motion with a number of direction changes that reaches the predetermined number of direction changes within the predetermined amount of time. 16. The method according to claim 13, wherein predetermined motion characteristic corresponds to a continuous back and forth shaking motion. 17. The method according to claim 13, wherein the first portion of the second object is directly connected to the first object, wherein the second portion of the second object is indirectly connected to the first object through the first portion of the second object, further comprising:
responsive to the first motion inputs, through operation of the at least one processor changing the first portion of the second object to maintain the connection between the first and second objects, while the second portion of the first object remains stationary. 18. The method according to claim 17, further comprising:
through operation of the at least one processor, storing object data in a memory representative of an initial configuration of the second object before the first portion of the second object was changed via the first motion inputs, responsive to the second motion inputs, through operation of the at least one processor, changing a current configuration of the second object to correspond to its initial configuration. 19. The method according to claim 13, further comprising:
through operation of the at least one processor, storing object data in a memory representative of positions of the first and second objects when the first and second objects were connected, through operation of the at least one processor, using the object data to reconnect the first object to the second object responsive to third motion inputs through the input device representative of the selected first object being moved to a further position relative to the second object that is within a predetermined distance of corresponding to the position stored in the memory for when the first and second objects were connected. 20. A non-transitory computer readable medium encoded with executable instructions that when executed, cause at least one processor to carry out a method comprising:
causing a display device to display a plurality of connected objects while receiving at least one selection input through an input device representative of selecting a first one of the connected objects while a second one of the connected objects remains unselected, maintaining a connection between the first and second object while changing positions of the first object and at least a first portion of the second object displayed through the display device, responsive to receiving first motion inputs through the input device representative of the selected first object being moved with a first motion that does not have a predetermined motion characteristic, and breaking the connection between the first and second objects, responsive to receiving second motion inputs through the input device representative of the selected first object being moved with a second motion that has the predetermined motion characteristic. | A system having a processor is provided that visually manipulates objects on a touch screen responsive to inputs through the touch screen. The processor may receive a selection of a first object while a second object remains unselected. Also the processor may be responsive to first motion inputs representative of the selected first object being moved with a first motion that does not have a predetermined motion characteristic, to maintain a connection between the first and second objects while changing the positions of the first object and at least a first portion of the second object. In addition, the processor may be responsive to second motion inputs representative of the selected first object being moved with a second motion that has the predetermined motion characteristic, to break the connection between the first and second objects.1. A system comprising:
at least one processor configured to cause a display device to display a plurality of connected objects and to receive at least one selection input through an input device representative of a selection of a first one of the connected objects while a second one of the connected objects remains unselected, wherein the at least one processor is configured responsive to first motion inputs received through the input device representative of the selected first object being moved with a first motion that does not have a predetermined motion characteristic, to maintain a connection between the first and second object while changing positions of the first object and at least a first portion of the second object, wherein the at least one processor is configured responsive to second motion inputs received through the input device representative of the selected first object being moved with a second motion that has the predetermined motion characteristic, to break the connection between the first and second objects. 2. The system according to claim 1, wherein the at least one processor is configured to maintain the connection between the first and second objects responsive to a determination that the first motion does not have the first characteristic, wherein the at least one processor is configured to break the connection between the first and second objects responsive to a determination that the second motion inputs are associated with movement of the selected first object and the first portion of the second object without moving a second portion of the second object and that the second motion has the predetermined motion characteristic. 3. The system according to claim 1, wherein the predetermined motion characteristic corresponds to a speed, an acceleration, a number of direction changes, an amount of time, a motion distance, or any combination thereof having at least one predetermined relationship with at least one predetermined threshold. 4. The system according to claim 3, wherein the at least one predetermined threshold represents a predetermined speed, wherein the predetermined motion characteristic corresponds to a motion speed that reaches the predetermined speed. 5. The system according to claim 3, wherein the at least one predetermined threshold represents a predetermined number of direction changes in a predetermined amount of time, wherein the predetermined motion characteristic corresponds to a motion with a number of direction changes that reaches the predetermined number of direction changes within the predetermined amount of time. 6. The system according to claim 5, wherein predetermined motion characteristic corresponds to a continuous back and forth shaking motion. 7. The system according to claim 3, wherein the first portion of the second object is directly connected to the first object, wherein the second portion of the second object is indirectly connected to the first object through the first portion of the second object, wherein responsive to the first motion inputs, the at least one processor is configured to automatically change the first portion of the second object to maintain the connection between the first and second objects, while the second portion of the first object remains stationary. 8. The system according to claim 7, wherein the at least one processor is operative to store data in a memory representative of an initial configuration of the second object before the first portion of the second object was automatically changed via the first motion inputs, wherein responsive to the second motion inputs, the at least one processor is configured automatically change a current configuration of the second object to correspond to its initial configuration. 9. The system according to claim 3, wherein the at least one processor is configured to store in a memory object data representative of positions of the first and second objects when the first and second objects were connected, wherein using the object data the at least one processor is configured to reconnect the first object to the second object responsive to third motion inputs through the input device representative of the selected first object being moved to a further position relative to the second object that is within a predetermined distance of corresponding to the position stored in the memory for when the first and second objects were connected. 10. The system according to claim 1, further comprising a memory, an application software component, and a touch screen comprised of the input device and the display device, wherein the application software component is comprised of instructions that when included in the memory and executed by the at least one processor, cause the at least one processor to manipulate the connected objects outputted through the touch screen responsive to the first and second motion inputs through the touch screen, wherein the application software component corresponds to a CAD software application that is operative to produce a CAD drawing based at least in part on the motion inputs through the touch screen. 11. A method comprising:
through operation of at least one processor, causing a display device to display a plurality of connected objects while receiving at least one selection input through an input device representative of selecting a first one of the connected objects while a second one of the connected objects remains unselected, through operation of the at least one processor, maintaining a connection between the first and second object while changing positions of the first object and at least a first portion of the second object displayed through the display device, responsive to receiving first motion inputs through the input device representative of the selected first object being moved with a first motion that does not have a predetermined motion characteristic, and through operation of the at least one processor, breaking the connection between the first and second objects, responsive to receiving second motion inputs through the input device representative of the selected first object being moved with a second motion that has the predetermined motion characteristic. 12. The method according to claim 11, further comprising:
wherein maintaining the connection between the first and second objects is carried out responsive to determining that the first motion does not have the first characteristic, and wherein breaking the connection between the first and second objects is carried out responsive to determining that the second motion inputs are associated with movement of the selected first object and the first portion of the second object without moving a second portion of the second object and that the second motion has the predetermined motion characteristic. 13. The method according to claim 11, wherein the predetermined motion characteristic corresponds to a speed, an acceleration, a number of direction changes, an amount of time, a motion distance, or any combination thereof having at least one predetermined relationship with at least one predetermined threshold. 14. The method according to claim 13, wherein the at least one predetermined threshold represents a predetermined speed, wherein the predetermined motion characteristic corresponds to a motion speed that reaches the predetermined speed. 15. The method according to claim 13, wherein the at least one predetermined threshold represents a predetermined number of direction changes in a predetermined amount of time, wherein the predetermined motion characteristic corresponds to a motion with a number of direction changes that reaches the predetermined number of direction changes within the predetermined amount of time. 16. The method according to claim 13, wherein predetermined motion characteristic corresponds to a continuous back and forth shaking motion. 17. The method according to claim 13, wherein the first portion of the second object is directly connected to the first object, wherein the second portion of the second object is indirectly connected to the first object through the first portion of the second object, further comprising:
responsive to the first motion inputs, through operation of the at least one processor changing the first portion of the second object to maintain the connection between the first and second objects, while the second portion of the first object remains stationary. 18. The method according to claim 17, further comprising:
through operation of the at least one processor, storing object data in a memory representative of an initial configuration of the second object before the first portion of the second object was changed via the first motion inputs, responsive to the second motion inputs, through operation of the at least one processor, changing a current configuration of the second object to correspond to its initial configuration. 19. The method according to claim 13, further comprising:
through operation of the at least one processor, storing object data in a memory representative of positions of the first and second objects when the first and second objects were connected, through operation of the at least one processor, using the object data to reconnect the first object to the second object responsive to third motion inputs through the input device representative of the selected first object being moved to a further position relative to the second object that is within a predetermined distance of corresponding to the position stored in the memory for when the first and second objects were connected. 20. A non-transitory computer readable medium encoded with executable instructions that when executed, cause at least one processor to carry out a method comprising:
causing a display device to display a plurality of connected objects while receiving at least one selection input through an input device representative of selecting a first one of the connected objects while a second one of the connected objects remains unselected, maintaining a connection between the first and second object while changing positions of the first object and at least a first portion of the second object displayed through the display device, responsive to receiving first motion inputs through the input device representative of the selected first object being moved with a first motion that does not have a predetermined motion characteristic, and breaking the connection between the first and second objects, responsive to receiving second motion inputs through the input device representative of the selected first object being moved with a second motion that has the predetermined motion characteristic. | 2,100 |
5,571 | 5,571 | 10,619,101 | 2,169 | The present invention is a method and system for monitoring and filtering of data transmission to permit the creation of a secure web-based “virtual meeting place” through which a scientist, business person, educator or other individual can use the Internet to link themselves or their group or student to others to work collaboratively and create a shared environment. A community is formed by having a person who is interested in participating in a collaborative project or just exchanging data on a given subject submit preliminary profile data to a digital storage center. The data may contain a description of the project and a general description of the of the collaboration level sought. A first filter system is employed to ascertain, verify and control the entrance of data to ensure the legitimacy of the entering party. A profile is then crated and, in conjunction with a search engine, the data storage center and other related locations are searched for compatible profiles and a community is created. The system also contains the capability of dynamic filtering and monitoring to provide a safe and secure community and to increase the perceived feeling of the nature of the community. | 1. An apparatus for community generation by monitoring and filtering data transmission to screen unwanted material comprising a community filter means to permit qualified individuals to join a specific community, profile creation means to describe each qualified individual, a hierarchical infrastructure for initially screening data to create a varying degrees of accessibility to input data, a dynamic search engine to permit those members of the community to search the data initially screened within the limit permitted by the hierarchical infrastructure, a dynamic filter controlled by a central location to permit monitoring and filtering of the data transmitted and structuring of the infrastructure and a flagging filter component to scan messages and data prior to delivery. | The present invention is a method and system for monitoring and filtering of data transmission to permit the creation of a secure web-based “virtual meeting place” through which a scientist, business person, educator or other individual can use the Internet to link themselves or their group or student to others to work collaboratively and create a shared environment. A community is formed by having a person who is interested in participating in a collaborative project or just exchanging data on a given subject submit preliminary profile data to a digital storage center. The data may contain a description of the project and a general description of the of the collaboration level sought. A first filter system is employed to ascertain, verify and control the entrance of data to ensure the legitimacy of the entering party. A profile is then crated and, in conjunction with a search engine, the data storage center and other related locations are searched for compatible profiles and a community is created. The system also contains the capability of dynamic filtering and monitoring to provide a safe and secure community and to increase the perceived feeling of the nature of the community.1. An apparatus for community generation by monitoring and filtering data transmission to screen unwanted material comprising a community filter means to permit qualified individuals to join a specific community, profile creation means to describe each qualified individual, a hierarchical infrastructure for initially screening data to create a varying degrees of accessibility to input data, a dynamic search engine to permit those members of the community to search the data initially screened within the limit permitted by the hierarchical infrastructure, a dynamic filter controlled by a central location to permit monitoring and filtering of the data transmitted and structuring of the infrastructure and a flagging filter component to scan messages and data prior to delivery. | 2,100 |
5,572 | 5,572 | 14,855,114 | 2,174 | A solution is provided for presenting content items of a digital magazine to a user of a digital magazine server, where a slide operation is performed with auto-aligning feature that allows an edge of a content item to be aligned with a predetermined snap location. In one aspect, the auto-aligning feature is performed by determining friction that allows the slide operation to conclude with an edge of a content item aligned with the predetermined snap location, based on a prediction of a slide operation with default friction applied, and applying the determined friction to execute the slide operation. In another aspect, the auto-aligning feature is performed by executing the slide operation with the default friction and shifting the content items such that an edge of a content item is aligned with the snap position. | 1. A computer-implemented method for presenting a digital magazine on a client device, the method comprising:
receiving a slide operation with a velocity from a user of the client device to slide a content panel being displayed on the client device, the content panel including a plurality of content items and two spatially neighboring content items of the plurality of content items sharing an edge, the plurality of the content items being displaced according to a page layout; comparing the velocity of the slide operation with a velocity threshold; and responsive to the velocity of the slide operation exceeding the velocity threshold, aligning a target edge between two content items with a snap position by automatically applying friction to the slide operation, the snap position representing a predetermined position of the content panel after the slide operation. 2. The method of claim 1, wherein automatically applying the friction to the slide operation comprises:
determining default friction of the slide operation based on the velocity of the slide operation; and determining the target edge from a plurality of edges separating the plurality of content items in response to the slide operation according to the default friction. 3. The method of claim 1, wherein automatically applying the friction to the slide operation comprises:
determining the friction to apply to the slide operation to align the target edge to a snap position; and executing the slide operation according to the determined friction. 4. The method of claim 1, further comprising:
determining a distance between the target edge and the snap position; and shifting the content panel by the determined distance to align the target edge with the snap position. 5. The method of claim 2, wherein determining the target edge comprises:
predicting an intermediate position of the content panel based on the default friction of the slide operation; and selecting an edge as the target edge from the edges separating the plurality of content items based on the intermediate position of the content panel, wherein the selected edge is closer to the snap position than other edges separating the content items. 6. The method of claim 2, wherein determining the target edge further comprises:
predicting an intermediate position of the content panel based on the default friction of the slide operation; and identifying two edges from the edges separating the plurality of content items based on the intermediate position of the content panel, one of the two identified edges being above the snap position and the other identified edge being below the snap position in the page layout. 7. The method of claim 6, further comprising:
determining a distance between each of the identified edges and the snap position; and selecting one of the identified edges as the target edge, wherein the selected edge has a shorter distance from the snap position than the distance between the other of the identified edges and the snap position. 8. The method of claim 3, wherein executing the slide operation according to the determined friction comprises:
applying the determined friction to the slide operation before the slide operation stops based on the default friction; and automatically aligning the target edge with the snap position. 9. The method of claim 1, further comprising:
generating an updated content panel, the updated content panel having the plurality of content items being displayed with the target edge being aligned with the snap position; and displaying the updated content panel to the user of the client device. 10. The method of claim 1, further comprising:
generating an updated content panel in response to a subsequent slide operation to the content panel; and displaying the updated content panel to the user of the client device. 11. A non-transitory computer-readable storage medium storing executable computer program instructions for presenting a digital magazine on a client device, the computer program instructions comprising instructions for:
receiving a slide operation with a velocity from a user of the client device to slide a content panel being displayed on the client device, the content panel including a plurality of content items and two spatially neighboring content items of the plurality of content items sharing an edge, the plurality of the content items being displaced according to a page layout; comparing the velocity of the slide operation with a velocity threshold; and responsive to the velocity of the slide operation exceeding the velocity threshold, aligning a target edge between two content items with a snap position by automatically applying friction to the slide operation, the snap position representing a predetermined position of the content panel after the slide operation. 12. The computer-readable storage medium of claim 11, wherein the computer program instructions for automatically applying the friction to the slide operation comprise instructions for:
determining default friction of the slide operation based on the velocity of the slide operation; and determining the target edge from a plurality of edges separating the plurality of content items in response to the slide operation according to the default friction. 13. The computer-readable storage medium of claim 11, wherein the computer program instructions for automatically applying the friction to the slide operation comprise instructions for:
determining the friction to apply to the slide operation to align the target edge to a snap position; and executing the slide operation according to the determined friction. 14. The computer-readable storage medium of claim 11, further comprising computer program instructions for:
determining a distance between the target edge and the snap position; and shifting the content panel by the determined distance to align the target edge with the snap position. 15. The computer-readable storage medium of claim 12, wherein the computer program instructions for determining the target edge comprise instructions for:
predicting an intermediate position of the content panel based on the default friction of the slide operation; and selecting an edge as the target edge from the edges separating the plurality of content items based on the intermediate position of the content panel, wherein the selected edge is closer to the snap position than other edges separating the content items. 16. The computer-readable storage medium of claim 12, wherein the computer program instructions for determining the target edge further comprise instructions for:
predicting an intermediate position of the content panel based on the default friction of the slide operation; and identifying two edges from the edges separating the plurality of content items based on the intermediate position of the content panel, one of the two identified edges being above the snap position and the other identified edge being below the snap position in the page layout. 17. The computer-readable storage medium of claim 16, further comprising computer program instructions for:
determining a distance between each of the identified edges and the snap position; and selecting one of the identified edges as the target edge, wherein the selected edge has a shorter distance from the snap position than the distance between the other of the identified edges and the snap position. 18. The computer-readable storage medium of claim 13, wherein the computer program instructions for executing the slide operation according to the determined friction comprise instructions for:
applying the determined friction to the slide operation before the slide operation stops based on the default friction; and automatically aligning the target edge with the snap position. 19. The computer-readable storage medium of claim 11, further comprising computer program instructions for:
generating an updated content panel, the updated content panel having the plurality of content items being displayed with the target edge being aligned with the snap position; and displaying the updated content panel to the user of the client device. 20. The computer-readable storage medium of claim 11, further comprising computer program instructions for:
generating an updated content panel in response to a subsequent slide operation to the content panel; and displaying the updated content panel to the user of the client device. | A solution is provided for presenting content items of a digital magazine to a user of a digital magazine server, where a slide operation is performed with auto-aligning feature that allows an edge of a content item to be aligned with a predetermined snap location. In one aspect, the auto-aligning feature is performed by determining friction that allows the slide operation to conclude with an edge of a content item aligned with the predetermined snap location, based on a prediction of a slide operation with default friction applied, and applying the determined friction to execute the slide operation. In another aspect, the auto-aligning feature is performed by executing the slide operation with the default friction and shifting the content items such that an edge of a content item is aligned with the snap position.1. A computer-implemented method for presenting a digital magazine on a client device, the method comprising:
receiving a slide operation with a velocity from a user of the client device to slide a content panel being displayed on the client device, the content panel including a plurality of content items and two spatially neighboring content items of the plurality of content items sharing an edge, the plurality of the content items being displaced according to a page layout; comparing the velocity of the slide operation with a velocity threshold; and responsive to the velocity of the slide operation exceeding the velocity threshold, aligning a target edge between two content items with a snap position by automatically applying friction to the slide operation, the snap position representing a predetermined position of the content panel after the slide operation. 2. The method of claim 1, wherein automatically applying the friction to the slide operation comprises:
determining default friction of the slide operation based on the velocity of the slide operation; and determining the target edge from a plurality of edges separating the plurality of content items in response to the slide operation according to the default friction. 3. The method of claim 1, wherein automatically applying the friction to the slide operation comprises:
determining the friction to apply to the slide operation to align the target edge to a snap position; and executing the slide operation according to the determined friction. 4. The method of claim 1, further comprising:
determining a distance between the target edge and the snap position; and shifting the content panel by the determined distance to align the target edge with the snap position. 5. The method of claim 2, wherein determining the target edge comprises:
predicting an intermediate position of the content panel based on the default friction of the slide operation; and selecting an edge as the target edge from the edges separating the plurality of content items based on the intermediate position of the content panel, wherein the selected edge is closer to the snap position than other edges separating the content items. 6. The method of claim 2, wherein determining the target edge further comprises:
predicting an intermediate position of the content panel based on the default friction of the slide operation; and identifying two edges from the edges separating the plurality of content items based on the intermediate position of the content panel, one of the two identified edges being above the snap position and the other identified edge being below the snap position in the page layout. 7. The method of claim 6, further comprising:
determining a distance between each of the identified edges and the snap position; and selecting one of the identified edges as the target edge, wherein the selected edge has a shorter distance from the snap position than the distance between the other of the identified edges and the snap position. 8. The method of claim 3, wherein executing the slide operation according to the determined friction comprises:
applying the determined friction to the slide operation before the slide operation stops based on the default friction; and automatically aligning the target edge with the snap position. 9. The method of claim 1, further comprising:
generating an updated content panel, the updated content panel having the plurality of content items being displayed with the target edge being aligned with the snap position; and displaying the updated content panel to the user of the client device. 10. The method of claim 1, further comprising:
generating an updated content panel in response to a subsequent slide operation to the content panel; and displaying the updated content panel to the user of the client device. 11. A non-transitory computer-readable storage medium storing executable computer program instructions for presenting a digital magazine on a client device, the computer program instructions comprising instructions for:
receiving a slide operation with a velocity from a user of the client device to slide a content panel being displayed on the client device, the content panel including a plurality of content items and two spatially neighboring content items of the plurality of content items sharing an edge, the plurality of the content items being displaced according to a page layout; comparing the velocity of the slide operation with a velocity threshold; and responsive to the velocity of the slide operation exceeding the velocity threshold, aligning a target edge between two content items with a snap position by automatically applying friction to the slide operation, the snap position representing a predetermined position of the content panel after the slide operation. 12. The computer-readable storage medium of claim 11, wherein the computer program instructions for automatically applying the friction to the slide operation comprise instructions for:
determining default friction of the slide operation based on the velocity of the slide operation; and determining the target edge from a plurality of edges separating the plurality of content items in response to the slide operation according to the default friction. 13. The computer-readable storage medium of claim 11, wherein the computer program instructions for automatically applying the friction to the slide operation comprise instructions for:
determining the friction to apply to the slide operation to align the target edge to a snap position; and executing the slide operation according to the determined friction. 14. The computer-readable storage medium of claim 11, further comprising computer program instructions for:
determining a distance between the target edge and the snap position; and shifting the content panel by the determined distance to align the target edge with the snap position. 15. The computer-readable storage medium of claim 12, wherein the computer program instructions for determining the target edge comprise instructions for:
predicting an intermediate position of the content panel based on the default friction of the slide operation; and selecting an edge as the target edge from the edges separating the plurality of content items based on the intermediate position of the content panel, wherein the selected edge is closer to the snap position than other edges separating the content items. 16. The computer-readable storage medium of claim 12, wherein the computer program instructions for determining the target edge further comprise instructions for:
predicting an intermediate position of the content panel based on the default friction of the slide operation; and identifying two edges from the edges separating the plurality of content items based on the intermediate position of the content panel, one of the two identified edges being above the snap position and the other identified edge being below the snap position in the page layout. 17. The computer-readable storage medium of claim 16, further comprising computer program instructions for:
determining a distance between each of the identified edges and the snap position; and selecting one of the identified edges as the target edge, wherein the selected edge has a shorter distance from the snap position than the distance between the other of the identified edges and the snap position. 18. The computer-readable storage medium of claim 13, wherein the computer program instructions for executing the slide operation according to the determined friction comprise instructions for:
applying the determined friction to the slide operation before the slide operation stops based on the default friction; and automatically aligning the target edge with the snap position. 19. The computer-readable storage medium of claim 11, further comprising computer program instructions for:
generating an updated content panel, the updated content panel having the plurality of content items being displayed with the target edge being aligned with the snap position; and displaying the updated content panel to the user of the client device. 20. The computer-readable storage medium of claim 11, further comprising computer program instructions for:
generating an updated content panel in response to a subsequent slide operation to the content panel; and displaying the updated content panel to the user of the client device. | 2,100 |
5,573 | 5,573 | 13,918,898 | 2,154 | Disclosed herein is a system and method for generating a user profile for a user based on the way the user interacts with consumable content in an application, such as an electronic book in an e-reader. The actions of the user with regards to the content are monitored and the associated with characteristics of the content. This association is used to build the user's profile of their likes and dislikes which are then provided to a recommender system to provide more relevant and personalize recommendations. | 1. A method for generating a profile for a user in a recommender system comprising:
detecting that the user has opened a consumable content in an application on a device; determining a set of characteristics for the consumable content; identifying at least one action performed by the user on the consumable content through the application; and updating the profile for the user based on the identified at least one action and the set of characteristics. 2. The method of claim 1 wherein determining a set of characteristics for the consumable content further comprises:
determining a subject matter for at least a portion of the consumable content. 3. The method of claim 1 further comprising:
receiving an indication from the device of a condition outside of the application; and
updating the profile for the user based on the received indication of the condition. 4. The method of claim 1 further comprising:
determining that the user has accessed a different application on the device;
identifying content on the different application;
determining if the content on the different application is related to the consumable content; and
updating the profile for the user when the content of the different application is determined to be related to the consumable content. 5. The method of claim 1 further comprising:
receiving information external from the application; and
updating the profile for the user with the external information. 6. The method of claim 5 further comprising associating the external information with the set of characteristics for the consumable content. 7. The method of claim 1 wherein the at least one action comprises at least one of:
turning a page,
returning to a previously viewed page;
skipping a chapter;
changing magnification and
scrolling the page. 8. The method of claim 1 further comprising:
determining that the user has opened a second consumable content in the application;
determining a second set of characteristics for the second consumable content;
identifying at least one action performed by the user on the second consumable content through the application; and
updating the profile for the user based on the identified at least one action and the set of characteristics for the second consumable content. 9. The method of claim 1 further comprising:
providing the profile to a recommender system to generate a list of recommendations. 10. The method of claim 1 wherein the profile comprises an entry for each of the at least one identified action for the consumable content. 11. The method of claim 10 further comprising:
identifying a second action performed by the user on the consumable content;
determining a time between the at least one identified action and the second action; and
updating the profile with the determined time between the at least one action and the second action. 12. A device comprising:
at least one processor; a memory configure to store at least one item of consumable content; an application configured to provide the user with consumable content; a monitoring application configured to monitor actions of the user related to the consumable content; and a user profile database including at least one personalized profile for the user and configured be updated by the monitoring application with information related to the consumable content and the monitored actions. 13. The device of claim 12 wherein the monitoring application is further configured to:
identify a set of characteristics for the consumable content. 14. The device of claim 12 wherein the monitoring application is further configured to:
identify a subject matter for at least a portion of the consumable content; and
associate a monitored action with the subject matter. 15. The device of claim 12 further comprising:
at least one sensor, the at least one sensor configured to detect at least one condition external to the application; and
wherein the monitoring application is configured to associate the at least one condition with the consumable content. 16. The device of claim 12 further comprising:
a second application separate from the application; and
wherein the monitoring application is configured to determine that the user has accessed the second application, to determine content in the second application and to determine if the content in the second application is related to the consumable content. 17. The device of claim 12 wherein the application is an e-reader application. 18. The device of claim 12 wherein the device is a standalone device. 19. A system for providing recommendations to a user comprising:
a device having an application configured to present consumable content to the user; a monitoring application configured to monitor actions performed by the user with respect to the consumable content and to associate the monitored action with a set of characteristics for the consumable content; a user profile including personalized user profile information related to how the user consumes the consumable content; a marketplace configured to provide the user with additional consumable content; and a recommender system configured to receive the user profile and to analyze the user profile to determine additional consumable content to recommend to the user based on the personalized user profile. 20. The system of claim 19 wherein the device is an e-reader device. | Disclosed herein is a system and method for generating a user profile for a user based on the way the user interacts with consumable content in an application, such as an electronic book in an e-reader. The actions of the user with regards to the content are monitored and the associated with characteristics of the content. This association is used to build the user's profile of their likes and dislikes which are then provided to a recommender system to provide more relevant and personalize recommendations.1. A method for generating a profile for a user in a recommender system comprising:
detecting that the user has opened a consumable content in an application on a device; determining a set of characteristics for the consumable content; identifying at least one action performed by the user on the consumable content through the application; and updating the profile for the user based on the identified at least one action and the set of characteristics. 2. The method of claim 1 wherein determining a set of characteristics for the consumable content further comprises:
determining a subject matter for at least a portion of the consumable content. 3. The method of claim 1 further comprising:
receiving an indication from the device of a condition outside of the application; and
updating the profile for the user based on the received indication of the condition. 4. The method of claim 1 further comprising:
determining that the user has accessed a different application on the device;
identifying content on the different application;
determining if the content on the different application is related to the consumable content; and
updating the profile for the user when the content of the different application is determined to be related to the consumable content. 5. The method of claim 1 further comprising:
receiving information external from the application; and
updating the profile for the user with the external information. 6. The method of claim 5 further comprising associating the external information with the set of characteristics for the consumable content. 7. The method of claim 1 wherein the at least one action comprises at least one of:
turning a page,
returning to a previously viewed page;
skipping a chapter;
changing magnification and
scrolling the page. 8. The method of claim 1 further comprising:
determining that the user has opened a second consumable content in the application;
determining a second set of characteristics for the second consumable content;
identifying at least one action performed by the user on the second consumable content through the application; and
updating the profile for the user based on the identified at least one action and the set of characteristics for the second consumable content. 9. The method of claim 1 further comprising:
providing the profile to a recommender system to generate a list of recommendations. 10. The method of claim 1 wherein the profile comprises an entry for each of the at least one identified action for the consumable content. 11. The method of claim 10 further comprising:
identifying a second action performed by the user on the consumable content;
determining a time between the at least one identified action and the second action; and
updating the profile with the determined time between the at least one action and the second action. 12. A device comprising:
at least one processor; a memory configure to store at least one item of consumable content; an application configured to provide the user with consumable content; a monitoring application configured to monitor actions of the user related to the consumable content; and a user profile database including at least one personalized profile for the user and configured be updated by the monitoring application with information related to the consumable content and the monitored actions. 13. The device of claim 12 wherein the monitoring application is further configured to:
identify a set of characteristics for the consumable content. 14. The device of claim 12 wherein the monitoring application is further configured to:
identify a subject matter for at least a portion of the consumable content; and
associate a monitored action with the subject matter. 15. The device of claim 12 further comprising:
at least one sensor, the at least one sensor configured to detect at least one condition external to the application; and
wherein the monitoring application is configured to associate the at least one condition with the consumable content. 16. The device of claim 12 further comprising:
a second application separate from the application; and
wherein the monitoring application is configured to determine that the user has accessed the second application, to determine content in the second application and to determine if the content in the second application is related to the consumable content. 17. The device of claim 12 wherein the application is an e-reader application. 18. The device of claim 12 wherein the device is a standalone device. 19. A system for providing recommendations to a user comprising:
a device having an application configured to present consumable content to the user; a monitoring application configured to monitor actions performed by the user with respect to the consumable content and to associate the monitored action with a set of characteristics for the consumable content; a user profile including personalized user profile information related to how the user consumes the consumable content; a marketplace configured to provide the user with additional consumable content; and a recommender system configured to receive the user profile and to analyze the user profile to determine additional consumable content to recommend to the user based on the personalized user profile. 20. The system of claim 19 wherein the device is an e-reader device. | 2,100 |
5,574 | 5,574 | 15,736,762 | 2,185 | An integrated circuit microprocessor device comprises a central processing unit (CPU) and a general purpose input or output subsystem ( 2 ) having at least one external connection ( 4 ). The external connection is configured to provide an input to or output from the device depending upon an associated setting in the general purpose input or output subsystem. At least one further module on the device is configured to be able to request at least a first or a second task which may control a state of the external connection, the general purpose input or output subsystem being configured, upon receipt of conflicting requests for the first and second tasks, to apply a predetermined priority to allow only one of the tasks to be applied to the external connection. | 1. An integrated circuit microprocessor device comprising a central processing unit (CPU) and a general purpose input or output subsystem having at least one external connection, the external connection being configured to provide an input to or output from the device depending upon an associated setting in the general purpose input or output subsystem, wherein at least one further module on the device is configured to be able to request at least a first or a second task which may control a state of said external connection, said general purpose input or output subsystem being configured, upon receipt of conflicting requests for said first and second tasks, to apply a predetermined priority to allow only one of the tasks to be applied to the external connection. 2. The device as claimed in claim 1, arranged to ignore signals from a non-prioritized task. 3. The device as claimed in claim 1, wherein the first task comprises assigning a logic high to the output. 4. The device as claimed in claim 1, wherein the second task comprises assigning a logic low to the output. 5. The device as claimed in claim 1, wherein the general purpose input output (GPIO) subsystem comprises a GPIO module arranged to manage the external connection(s) and an intermediate module arranged to apply said predetermined priority to control said external connection(s) via said GPIO module. 6. The device as claimed in claim 5, wherein the intermediate module comprises one or more channels which can be associated with the or each external connection and which is/are arranged to change the state of the associated external connection to either high or low. 7. The device as claimed in claim 5, wherein the intermediate module channel is arranged to receive signals from a plurality of channels connected to one or more further modules on the microprocessor. 8. The device as claimed in claim 7, arranged to receive said signals simultaneously. 9. The device as claimed in claim 1, wherein the predetermined priority is determined in software. | An integrated circuit microprocessor device comprises a central processing unit (CPU) and a general purpose input or output subsystem ( 2 ) having at least one external connection ( 4 ). The external connection is configured to provide an input to or output from the device depending upon an associated setting in the general purpose input or output subsystem. At least one further module on the device is configured to be able to request at least a first or a second task which may control a state of the external connection, the general purpose input or output subsystem being configured, upon receipt of conflicting requests for the first and second tasks, to apply a predetermined priority to allow only one of the tasks to be applied to the external connection.1. An integrated circuit microprocessor device comprising a central processing unit (CPU) and a general purpose input or output subsystem having at least one external connection, the external connection being configured to provide an input to or output from the device depending upon an associated setting in the general purpose input or output subsystem, wherein at least one further module on the device is configured to be able to request at least a first or a second task which may control a state of said external connection, said general purpose input or output subsystem being configured, upon receipt of conflicting requests for said first and second tasks, to apply a predetermined priority to allow only one of the tasks to be applied to the external connection. 2. The device as claimed in claim 1, arranged to ignore signals from a non-prioritized task. 3. The device as claimed in claim 1, wherein the first task comprises assigning a logic high to the output. 4. The device as claimed in claim 1, wherein the second task comprises assigning a logic low to the output. 5. The device as claimed in claim 1, wherein the general purpose input output (GPIO) subsystem comprises a GPIO module arranged to manage the external connection(s) and an intermediate module arranged to apply said predetermined priority to control said external connection(s) via said GPIO module. 6. The device as claimed in claim 5, wherein the intermediate module comprises one or more channels which can be associated with the or each external connection and which is/are arranged to change the state of the associated external connection to either high or low. 7. The device as claimed in claim 5, wherein the intermediate module channel is arranged to receive signals from a plurality of channels connected to one or more further modules on the microprocessor. 8. The device as claimed in claim 7, arranged to receive said signals simultaneously. 9. The device as claimed in claim 1, wherein the predetermined priority is determined in software. | 2,100 |
5,575 | 5,575 | 15,301,638 | 2,154 | A method for automatically generating and processing a number of protocol files of different types of an automation system of a technical plant includes identifying a number of relevant protocol files of different types from the generated protocol files based on at least one protocol parameter, transforming the identified relevant protocol files of different types into relevant standardized protocol files of the same type by using an agent-based software, analyzing and/or processing data sets of the relevant standardized protocol files of the same type, and outputting and/or saving the data sets of the relevant standardized protocol files. | 1.-10. (canceled) 11. A method for automatically processing a number of generated log files of different types of an automation system in a technical plant, comprising:
identifying a number of relevant log files of different types from the number of generated log files based on at least one log parameter; transforming the identified relevant log files of different types into relevant standardized log files of a same type by using an agent-based software; analyzing and/or processing data sets of the relevant standardized log files of the same type; and outputting and/or saving the data sets of the relevant standardized log files. 12. The method of claim 11, wherein the data sets of the relevant standardized log files are processed by statistical evaluation. 13. The method of claim 11, wherein the data sets of the relevant standardized log files are processed by time analysis. 14. The method of claim 11, wherein the data sets of the relevant standardized log files are processed by event analysis. 15. The method of claim 11, wherein the data sets of the relevant standardized log files are processed by pattern analysis. 16. The method of claim 11, wherein the data sets of the relevant standardized log files are processed by text analysis. 17. The method of claim 11, wherein the data sets of the relevant standardized log files are processed by sequence analysis. 18. The method of claim 11, wherein the data sets of the relevant standardized log files are processed by error analysis. 19. A technical plant, comprising an automation system which includes a number of generated log files of different types, said log files being automatically processed by identifying a number of relevant log files of different types from the number of generated log files based on at least one log parameter, transforming the identified relevant log files of different types into relevant standardized log files of a same type by using an agent-based software, analyzing and/or processing data sets of the relevant standardized log files of the same type, and outputting and/or saving the data sets of the relevant standardized log files. 20. The technical plant of claim 19, wherein the data sets of the relevant standardized log files are processed by statistical evaluation. 21. The technical plant of claim 19, wherein the data sets of the relevant standardized log files are processed by time analysis. 22. The technical plant of claim 19, wherein the data sets of the relevant standardized log files are processed by event analysis. 23. The technical plant of claim 19, wherein the data sets of the relevant standardized log files are processed by pattern analysis. 24. The technical plant of claim 19, wherein the data sets of the relevant standardized log files are processed by text analysis. 25. The technical plant of claim 19, wherein the data sets of the relevant standardized log files are processed by sequence analysis. 26. The technical plant of claim 19, wherein the data sets of the relevant standardized log files are processed by error analysis. 27. An automation system of a technical plant, comprising:
an operation and observation level; an automation level; a field level; and a communication system connecting the operation and observation level, the automation level and the field level, at least one member selected from the group consisting of the operation and observation level, the automation level, and the field level being configured to implement a method as set forth in claim 11. | A method for automatically generating and processing a number of protocol files of different types of an automation system of a technical plant includes identifying a number of relevant protocol files of different types from the generated protocol files based on at least one protocol parameter, transforming the identified relevant protocol files of different types into relevant standardized protocol files of the same type by using an agent-based software, analyzing and/or processing data sets of the relevant standardized protocol files of the same type, and outputting and/or saving the data sets of the relevant standardized protocol files.1.-10. (canceled) 11. A method for automatically processing a number of generated log files of different types of an automation system in a technical plant, comprising:
identifying a number of relevant log files of different types from the number of generated log files based on at least one log parameter; transforming the identified relevant log files of different types into relevant standardized log files of a same type by using an agent-based software; analyzing and/or processing data sets of the relevant standardized log files of the same type; and outputting and/or saving the data sets of the relevant standardized log files. 12. The method of claim 11, wherein the data sets of the relevant standardized log files are processed by statistical evaluation. 13. The method of claim 11, wherein the data sets of the relevant standardized log files are processed by time analysis. 14. The method of claim 11, wherein the data sets of the relevant standardized log files are processed by event analysis. 15. The method of claim 11, wherein the data sets of the relevant standardized log files are processed by pattern analysis. 16. The method of claim 11, wherein the data sets of the relevant standardized log files are processed by text analysis. 17. The method of claim 11, wherein the data sets of the relevant standardized log files are processed by sequence analysis. 18. The method of claim 11, wherein the data sets of the relevant standardized log files are processed by error analysis. 19. A technical plant, comprising an automation system which includes a number of generated log files of different types, said log files being automatically processed by identifying a number of relevant log files of different types from the number of generated log files based on at least one log parameter, transforming the identified relevant log files of different types into relevant standardized log files of a same type by using an agent-based software, analyzing and/or processing data sets of the relevant standardized log files of the same type, and outputting and/or saving the data sets of the relevant standardized log files. 20. The technical plant of claim 19, wherein the data sets of the relevant standardized log files are processed by statistical evaluation. 21. The technical plant of claim 19, wherein the data sets of the relevant standardized log files are processed by time analysis. 22. The technical plant of claim 19, wherein the data sets of the relevant standardized log files are processed by event analysis. 23. The technical plant of claim 19, wherein the data sets of the relevant standardized log files are processed by pattern analysis. 24. The technical plant of claim 19, wherein the data sets of the relevant standardized log files are processed by text analysis. 25. The technical plant of claim 19, wherein the data sets of the relevant standardized log files are processed by sequence analysis. 26. The technical plant of claim 19, wherein the data sets of the relevant standardized log files are processed by error analysis. 27. An automation system of a technical plant, comprising:
an operation and observation level; an automation level; a field level; and a communication system connecting the operation and observation level, the automation level and the field level, at least one member selected from the group consisting of the operation and observation level, the automation level, and the field level being configured to implement a method as set forth in claim 11. | 2,100 |
5,576 | 5,576 | 15,301,640 | 2,154 | A method for automatically processing log files of different types of an automation system, said method determining a message part of a data set of the log file. All contents of the respective data sets of the log files are concatenated. The data sets of all the log files are summarized in a summary file. The data sets of all the log files are chronologically sorted in the summary file. The data sets are compressed in the summary file. The compressed data sets in the summary file are coded. The compressed data sets are assigned to groups with associated group codes. The group code of the assigned group is decoded. The decoded group code is output as the alphanumeric message part of the log file. The alphanumeric message part of the log file is stored in a memory. | 1.-15. (canceled) 16. A method for automatically processing log files of different types of an automation system of a technical facility, said method comprising:
concatenating all contents of a data set of a log file; summarizing data sets of all log files in a summary file; chronologically sorting the data sets of the log files in the summary file; compressing the data sets in the summary file; coding the compressed data sets in the summary file by a numeric, alphabetic or alphanumeric code; sorting and assigning the compressed data sets established on the basis of the numeric, alphabetic or alphanumeric code to groups with associated group codes; decoding the group code of the assigned one of the groups; outputting the decoded group code as an alphanumeric message part of the log file; and storing the alphanumeric message part of the log file in a memory. 17. The method of claim 16, wherein during compression of the data set, the data set is processed such that a data length and/or a data content of the data set is reduced. 18. The method of claim 17, further comprising automatically inserting spaces for special characters contained in the data set and for at least two or more consecutive spaces resulting therefrom, removing consecutive spaces extending beyond a single space from the data set. 19. The method of claim 16, further comprising resolving the concatenation of the contents of the data set and removing resultant separate alphanumeric contents with fewer than four characters. 20. The method of claim 19, further comprising analyzing and unifying the resultant separate alphanumeric contents, assigning a reference word to each of the separate alphanumeric content and assigning a numeric code to each reference word. 21. The method of claim 20, further comprising converting the summary file with the separate alphanumeric contents established on the basis of the reference word and/or the numeric code into a two-dimensional alphanumeric code matrix. 22. The method of claim 21, wherein the numeric codes of the two-dimensional alphanumeric code matrix are sorted chronologically and/or as a function of character length. 23. The method of claim 21, wherein similar ones of the numeric codes of the two-dimensional alphanumeric code matrix are grouped by using a similarity operation. 24. The method of claim 23, wherein the similarity operation is a Levenshtein distance. 25. The method of claim 24, wherein when the numeric code being considered has a Levenshtein distance of zero to one of the groups, said numeric code being considered is assigned to said one of the groups. 26. The method of claim 24, wherein when the numeric code being considered has a Levenshtein distance of one to one of the groups, and when the numeric code being considered differs by only one digit from the one of the groups, said numeric code being considered is assigned to said one of the groups. 27. The method of claim 24, wherein a new numeric code being considered is compared to non-grouped numeric codes of a same length or to non-grouped numeric codes having a greater length of a maximum of one character. 28. The method of claim 27, wherein when the numeric code being considered has a Levenshtein distance of one to another non-grouped numeric code, a new group is formed from the numeric code being considered and the non-grouped numeric code such that
when the numeric code being considered and the non-grouped numeric code are of different lengths, the new group is assigned a shorter numeric code, and when the numeric code being considered and the non-grouped numeric code are of same length with at least one different digit, the new group is assigned the numeric code without the different digit. 29. The method of claim 24, wherein when the numeric code being considered is determined to have no Levenshtein distance to any other non-grouped numeric code that are less than two, the numeric code being considered is assigned to a new group. 30. A technical facility, comprising an automation system including log files of different types, said automation system configured to:
concatenate all contents of a data set of a log file; summarize data sets of all log files in a summary file; chronologically sort the data sets of the log files in the summary file; compress the data sets in the summary file; code the compressed data sets in the summary file by a numeric, alphabetic or alphanumeric code; sort and assign the compressed data sets established on the basis of the numeric, alphabetic or alphanumeric code to groups with associated group codes; decode the group code of the assigned one of the groups; output the decoded group code as an alphanumeric message part of the log file; and store the alphanumeric message part of the log file in a memory. 31. An automation system of a technical facility, comprising:
an operation and monitoring level; an automation level; a field level; and a communication system configured to connect the operation and monitoring level, the automation level and the field level to one another, at least one of the operation and monitoring level, the automation level and the field level being configured to: concatenate all contents of a data set of a log file; summarize data sets of all log files in a summary file; chronologically sort the data sets of the log files in the summary file; compress the data sets in the summary file; code the compressed data sets in the summary file by a numeric, alphabetic or alphanumeric code; sort and assign the compressed data sets established on the basis of the numeric, alphabetic or alphanumeric code to groups with associated group codes; decode the group code of the assigned one of the groups; output the decoded group code as an alphanumeric message part of the log file; and store the alphanumeric message part of the log file in a memory. | A method for automatically processing log files of different types of an automation system, said method determining a message part of a data set of the log file. All contents of the respective data sets of the log files are concatenated. The data sets of all the log files are summarized in a summary file. The data sets of all the log files are chronologically sorted in the summary file. The data sets are compressed in the summary file. The compressed data sets in the summary file are coded. The compressed data sets are assigned to groups with associated group codes. The group code of the assigned group is decoded. The decoded group code is output as the alphanumeric message part of the log file. The alphanumeric message part of the log file is stored in a memory.1.-15. (canceled) 16. A method for automatically processing log files of different types of an automation system of a technical facility, said method comprising:
concatenating all contents of a data set of a log file; summarizing data sets of all log files in a summary file; chronologically sorting the data sets of the log files in the summary file; compressing the data sets in the summary file; coding the compressed data sets in the summary file by a numeric, alphabetic or alphanumeric code; sorting and assigning the compressed data sets established on the basis of the numeric, alphabetic or alphanumeric code to groups with associated group codes; decoding the group code of the assigned one of the groups; outputting the decoded group code as an alphanumeric message part of the log file; and storing the alphanumeric message part of the log file in a memory. 17. The method of claim 16, wherein during compression of the data set, the data set is processed such that a data length and/or a data content of the data set is reduced. 18. The method of claim 17, further comprising automatically inserting spaces for special characters contained in the data set and for at least two or more consecutive spaces resulting therefrom, removing consecutive spaces extending beyond a single space from the data set. 19. The method of claim 16, further comprising resolving the concatenation of the contents of the data set and removing resultant separate alphanumeric contents with fewer than four characters. 20. The method of claim 19, further comprising analyzing and unifying the resultant separate alphanumeric contents, assigning a reference word to each of the separate alphanumeric content and assigning a numeric code to each reference word. 21. The method of claim 20, further comprising converting the summary file with the separate alphanumeric contents established on the basis of the reference word and/or the numeric code into a two-dimensional alphanumeric code matrix. 22. The method of claim 21, wherein the numeric codes of the two-dimensional alphanumeric code matrix are sorted chronologically and/or as a function of character length. 23. The method of claim 21, wherein similar ones of the numeric codes of the two-dimensional alphanumeric code matrix are grouped by using a similarity operation. 24. The method of claim 23, wherein the similarity operation is a Levenshtein distance. 25. The method of claim 24, wherein when the numeric code being considered has a Levenshtein distance of zero to one of the groups, said numeric code being considered is assigned to said one of the groups. 26. The method of claim 24, wherein when the numeric code being considered has a Levenshtein distance of one to one of the groups, and when the numeric code being considered differs by only one digit from the one of the groups, said numeric code being considered is assigned to said one of the groups. 27. The method of claim 24, wherein a new numeric code being considered is compared to non-grouped numeric codes of a same length or to non-grouped numeric codes having a greater length of a maximum of one character. 28. The method of claim 27, wherein when the numeric code being considered has a Levenshtein distance of one to another non-grouped numeric code, a new group is formed from the numeric code being considered and the non-grouped numeric code such that
when the numeric code being considered and the non-grouped numeric code are of different lengths, the new group is assigned a shorter numeric code, and when the numeric code being considered and the non-grouped numeric code are of same length with at least one different digit, the new group is assigned the numeric code without the different digit. 29. The method of claim 24, wherein when the numeric code being considered is determined to have no Levenshtein distance to any other non-grouped numeric code that are less than two, the numeric code being considered is assigned to a new group. 30. A technical facility, comprising an automation system including log files of different types, said automation system configured to:
concatenate all contents of a data set of a log file; summarize data sets of all log files in a summary file; chronologically sort the data sets of the log files in the summary file; compress the data sets in the summary file; code the compressed data sets in the summary file by a numeric, alphabetic or alphanumeric code; sort and assign the compressed data sets established on the basis of the numeric, alphabetic or alphanumeric code to groups with associated group codes; decode the group code of the assigned one of the groups; output the decoded group code as an alphanumeric message part of the log file; and store the alphanumeric message part of the log file in a memory. 31. An automation system of a technical facility, comprising:
an operation and monitoring level; an automation level; a field level; and a communication system configured to connect the operation and monitoring level, the automation level and the field level to one another, at least one of the operation and monitoring level, the automation level and the field level being configured to: concatenate all contents of a data set of a log file; summarize data sets of all log files in a summary file; chronologically sort the data sets of the log files in the summary file; compress the data sets in the summary file; code the compressed data sets in the summary file by a numeric, alphabetic or alphanumeric code; sort and assign the compressed data sets established on the basis of the numeric, alphabetic or alphanumeric code to groups with associated group codes; decode the group code of the assigned one of the groups; output the decoded group code as an alphanumeric message part of the log file; and store the alphanumeric message part of the log file in a memory. | 2,100 |
5,577 | 5,577 | 15,425,857 | 2,139 | Methods and apparatus for profile-guided preloading for virtualized resources are described. A block-level storage volume whose contents are to be populated via data transfers from a repository service is programmatically attached to a compute instance. An indication of data transfers from the repository to a block storage service implementing the volume is obtained, corresponding to a particular phase of program execution at the compute instance. A storage profile is generated, based at least in part on the indication of data transfers. The storage profile is subsequently used to pre-load data from the repository service on behalf of other compute instances. | 1. A system, comprising:
one or more computing devices configured to:
implement a plurality of compute instances at a virtualized compute service of a provider network, wherein a block-level storage volume implemented at a block storage service of the provider network is programmatically attached for network access by a particular compute instance of the plurality of compute instances, and wherein, in response to one or more I/O requests to the block-level storage volume from the particular compute instance, data is transferred from an object at a storage repository service of the provider network to populate the block-level storage volume;
obtain, corresponding to a particular phase of program execution at the particular compute instance, an indication of one or more data transfers from the object at the storage repository service to the block storage service;
generate, based at least in part on the indication of the one or more data transfers, a storage access profile associated with the particular phase;
store the storage access profile;
in response to a determination that the particular phase of program execution is to occur at a different compute instance of the provider network,
identify at least a portion of an object indicated by the storage access profile to be pre-loaded to populate a different block-level storage volume attached to the different compute instance; and
transfer the at least a portion of the object to the different block-level storage volume. 2. The system as recited in claim 1, wherein the storage repository service comprises a key-value store configured to store unstructured data objects accessible via a web-services interface. 3. The system as recited in claim 1, wherein the one or more computing devices are further configured to:
select the particular phase for profile generation based at least in part on one or more of: (a) a determination that the particular phase comprises a sequence of I/O requests expected to be repeated, with a probability above a threshold level, by one or more other compute instances, (b) a determination of performance costs associated with the one or more data transfers from the object at the storage repository service, or (c) a profiling request. 4. The system as recited in claim 1, wherein the object indicated by the storage access profile comprises a volume snapshot generated in response to a client request. 5. The system as recited in claim 1, wherein the one or more computing devices are further configured to:
in response to a determination that an I/O request from the different compute instance during the particular phase of program execution cannot be satisfied from the pre-loaded portion of the object,
store a record of the determination that the I/O request could not be satisfied; and
modify the storage access profile based at least in part on the record. 6. A method, comprising:
performing, by one or more computing devices:
programmatically attaching a block-level storage volume implemented at a block storage service of a provider network to a particular compute instance of a virtualized compute service, wherein, in response to one or more I/O requests to the block-level storage volume from the particular compute instance, the block storage service is configured to transfer data from an object at a storage repository service of the provider network to populate the block-level storage volume;
obtaining, corresponding to a particular phase of program execution at the particular compute instance, an indication of one or more data transfers from the object at the storage repository service to the block storage service;
generating, based at least in part on the indication of the one or more data transfers, a storage access profile associated with the particular phase, to be used to pre-load data from the object at the storage repository service on behalf of one or more other compute instances; and
storing the storage access profile. 7. The method as recited in claim 6, further comprising:
determining that a phase of program execution related to the particular phase is to occur at a different compute instance of the provider network; identifying at least a portion of an object indicated by the storage access profile to be pre-loaded to populate a different block-level storage volume attached to the different compute instance; and transferring the at least a portion of the object indicated by the storage access profile to populate the different block-level storage volume. 8. The method as recited in claim 6, further comprising performing, by the one or more computing devices:
implementing, at the storage repository service, a web services programmatic interface to provide access to the object. 9. The method as recited in claim 6, wherein the particular phase comprises a boot sequence of the particular compute instance. 10. The method as recited in claim 6, wherein the particular phase comprises a phase of execution of an application program. 11. The method as recited in claim 10, wherein the application comprises a database management system. 12. The method as recited in claim 6, wherein the object indicated by the storage access profile comprises a volume snapshot generated in response to a client request. 13. The method as recited in claim 6, further comprising performing, by the one or more computing devices:
storing a record of a determination that an I/O request generated during the particular phase could not be satisfied by data pre-loaded in accordance with the storage access profile; and modifying the storage access profile based at least in part on the record. 14. The method as recited in claim 6, further comprising performing, by the one or more computing devices:
pre-loading at least a portion of a block-level storage volume at a local storage device of a virtualization host at which a different compute instance is implemented, wherein said pre-loading comprises transferring at least a portion of an object from the storage repository service to the local storage device in accordance with the storage access profile. 15. The method as recited in claim 6, further comprising performing, by the one or more computing devices:
monitoring one or more resource consumption metrics at the provider network; identifying, from a candidate pre-load data set indicated in the storage access profile, in accordance with the one or more resource consumption metrics, a particular data unit to be transferred from the storage repository service, and a different data unit not to be transferred from the storage repository service, and transferring the particular data unit from the storage repository service to the block storage service. 16. A non-transitory computer-accessible storage medium storing program instructions that when executed on one or more processors:
obtain, from a collection of storage access profiles generated based at least in part on monitoring data transfers from a storage repository service of a provider network to a block storage service of the provider network, a particular storage access profile corresponding to a phase of program execution anticipated at a compute instance; identify, using the particular storage access profile, at least a portion of an object of the storage repository service to be pre-loaded to populate a block-level storage volume to be accessed from the compute instance; and initiate a transfer of at least a portion of the object from the storage repository to populate the block-level storage volume. 17. The non-transitory computer-accessible storage medium as recited in claim 16, wherein the storage repository service comprises a key-value store accessible via a web-services interface. 18. The non-transitory computer-accessible storage medium as recited in claim 16, wherein the instructions when executed on the one or more processors:
select the phase of program execution for generation of the particular storage access profile based at least in part on one or more of: (a) a determination that the phase comprises a sequence of I/O requests expected to be repeated, with a probability above a threshold level, by one or more other compute instances, (b) a determination of performance costs associated with one or more data transfers from the storage repository service to satisfy I/O requests generated during the phase, or (c) a profiling request; and generate the particular storage access profile. 19. The non-transitory computer-accessible storage medium as recited in claim 16, wherein the object at the storage repository comprises a volume snapshot generated in response to a client request. 20. The non-transitory computer-accessible storage medium as recited in claim 16, wherein the instructions when executed on the one or more processors:
in response to a determination that an I/O request from the compute instance during the phase of program execution cannot be satisfied from the transferred portion of the object,
store a record of the determination that the I/O request could not be satisfied; and
modify the particular storage access profile based at least in part on the record. | Methods and apparatus for profile-guided preloading for virtualized resources are described. A block-level storage volume whose contents are to be populated via data transfers from a repository service is programmatically attached to a compute instance. An indication of data transfers from the repository to a block storage service implementing the volume is obtained, corresponding to a particular phase of program execution at the compute instance. A storage profile is generated, based at least in part on the indication of data transfers. The storage profile is subsequently used to pre-load data from the repository service on behalf of other compute instances.1. A system, comprising:
one or more computing devices configured to:
implement a plurality of compute instances at a virtualized compute service of a provider network, wherein a block-level storage volume implemented at a block storage service of the provider network is programmatically attached for network access by a particular compute instance of the plurality of compute instances, and wherein, in response to one or more I/O requests to the block-level storage volume from the particular compute instance, data is transferred from an object at a storage repository service of the provider network to populate the block-level storage volume;
obtain, corresponding to a particular phase of program execution at the particular compute instance, an indication of one or more data transfers from the object at the storage repository service to the block storage service;
generate, based at least in part on the indication of the one or more data transfers, a storage access profile associated with the particular phase;
store the storage access profile;
in response to a determination that the particular phase of program execution is to occur at a different compute instance of the provider network,
identify at least a portion of an object indicated by the storage access profile to be pre-loaded to populate a different block-level storage volume attached to the different compute instance; and
transfer the at least a portion of the object to the different block-level storage volume. 2. The system as recited in claim 1, wherein the storage repository service comprises a key-value store configured to store unstructured data objects accessible via a web-services interface. 3. The system as recited in claim 1, wherein the one or more computing devices are further configured to:
select the particular phase for profile generation based at least in part on one or more of: (a) a determination that the particular phase comprises a sequence of I/O requests expected to be repeated, with a probability above a threshold level, by one or more other compute instances, (b) a determination of performance costs associated with the one or more data transfers from the object at the storage repository service, or (c) a profiling request. 4. The system as recited in claim 1, wherein the object indicated by the storage access profile comprises a volume snapshot generated in response to a client request. 5. The system as recited in claim 1, wherein the one or more computing devices are further configured to:
in response to a determination that an I/O request from the different compute instance during the particular phase of program execution cannot be satisfied from the pre-loaded portion of the object,
store a record of the determination that the I/O request could not be satisfied; and
modify the storage access profile based at least in part on the record. 6. A method, comprising:
performing, by one or more computing devices:
programmatically attaching a block-level storage volume implemented at a block storage service of a provider network to a particular compute instance of a virtualized compute service, wherein, in response to one or more I/O requests to the block-level storage volume from the particular compute instance, the block storage service is configured to transfer data from an object at a storage repository service of the provider network to populate the block-level storage volume;
obtaining, corresponding to a particular phase of program execution at the particular compute instance, an indication of one or more data transfers from the object at the storage repository service to the block storage service;
generating, based at least in part on the indication of the one or more data transfers, a storage access profile associated with the particular phase, to be used to pre-load data from the object at the storage repository service on behalf of one or more other compute instances; and
storing the storage access profile. 7. The method as recited in claim 6, further comprising:
determining that a phase of program execution related to the particular phase is to occur at a different compute instance of the provider network; identifying at least a portion of an object indicated by the storage access profile to be pre-loaded to populate a different block-level storage volume attached to the different compute instance; and transferring the at least a portion of the object indicated by the storage access profile to populate the different block-level storage volume. 8. The method as recited in claim 6, further comprising performing, by the one or more computing devices:
implementing, at the storage repository service, a web services programmatic interface to provide access to the object. 9. The method as recited in claim 6, wherein the particular phase comprises a boot sequence of the particular compute instance. 10. The method as recited in claim 6, wherein the particular phase comprises a phase of execution of an application program. 11. The method as recited in claim 10, wherein the application comprises a database management system. 12. The method as recited in claim 6, wherein the object indicated by the storage access profile comprises a volume snapshot generated in response to a client request. 13. The method as recited in claim 6, further comprising performing, by the one or more computing devices:
storing a record of a determination that an I/O request generated during the particular phase could not be satisfied by data pre-loaded in accordance with the storage access profile; and modifying the storage access profile based at least in part on the record. 14. The method as recited in claim 6, further comprising performing, by the one or more computing devices:
pre-loading at least a portion of a block-level storage volume at a local storage device of a virtualization host at which a different compute instance is implemented, wherein said pre-loading comprises transferring at least a portion of an object from the storage repository service to the local storage device in accordance with the storage access profile. 15. The method as recited in claim 6, further comprising performing, by the one or more computing devices:
monitoring one or more resource consumption metrics at the provider network; identifying, from a candidate pre-load data set indicated in the storage access profile, in accordance with the one or more resource consumption metrics, a particular data unit to be transferred from the storage repository service, and a different data unit not to be transferred from the storage repository service, and transferring the particular data unit from the storage repository service to the block storage service. 16. A non-transitory computer-accessible storage medium storing program instructions that when executed on one or more processors:
obtain, from a collection of storage access profiles generated based at least in part on monitoring data transfers from a storage repository service of a provider network to a block storage service of the provider network, a particular storage access profile corresponding to a phase of program execution anticipated at a compute instance; identify, using the particular storage access profile, at least a portion of an object of the storage repository service to be pre-loaded to populate a block-level storage volume to be accessed from the compute instance; and initiate a transfer of at least a portion of the object from the storage repository to populate the block-level storage volume. 17. The non-transitory computer-accessible storage medium as recited in claim 16, wherein the storage repository service comprises a key-value store accessible via a web-services interface. 18. The non-transitory computer-accessible storage medium as recited in claim 16, wherein the instructions when executed on the one or more processors:
select the phase of program execution for generation of the particular storage access profile based at least in part on one or more of: (a) a determination that the phase comprises a sequence of I/O requests expected to be repeated, with a probability above a threshold level, by one or more other compute instances, (b) a determination of performance costs associated with one or more data transfers from the storage repository service to satisfy I/O requests generated during the phase, or (c) a profiling request; and generate the particular storage access profile. 19. The non-transitory computer-accessible storage medium as recited in claim 16, wherein the object at the storage repository comprises a volume snapshot generated in response to a client request. 20. The non-transitory computer-accessible storage medium as recited in claim 16, wherein the instructions when executed on the one or more processors:
in response to a determination that an I/O request from the compute instance during the phase of program execution cannot be satisfied from the transferred portion of the object,
store a record of the determination that the I/O request could not be satisfied; and
modify the particular storage access profile based at least in part on the record. | 2,100 |
5,578 | 5,578 | 13,672,707 | 2,177 | Methods and systems are provided for procuring functions, including Web service functions, for use in a spreadsheet application. A Web service function manifest can be managed by a function marketplace. A client device running a spreadsheet application can request available functions from the function marketplace. Information about available functions can be received by the client device. A selection of a function can be made in order to receive the manifest associated with the selected function. A local copy of the manifest may be stored for repeated invocation. | 1. A method comprising:
requesting available functions from a central manifest location, the functions comprising at least one Web service function; receiving information indicating available functions; requesting a selection of one of the available functions; and receiving a manifest of the selected one of the available functions. 2. The method of claim 1, further comprising:
displaying a list of known functions by querying a local manifest file location and receiving the list of known functions from the local manifest file location, at least one of the known functions being received from the central manifest location. 3. The method of claim 1, the method further comprising:
sending an invocation of the function over a Web service in accordance with the manifest of the selected one of the available functions. 4. The method of claim 3, wherein the function comprises a representational state transfer (REST) application programming interface (API) Web service function. 5. The method of claim 3, wherein sending the invocation of the function over the Web service comprises:
executing the Web service function in a spreadsheet application; validating a license of the Web service function; performing a call and filter for Web service function having a valid license; and returning results within the spreadsheet application. 6. The method of claim 5, wherein performing the call and the filter comprises:
performing a Web service request to a Web service uniform resource location (URL) presented in the manifest; receiving a Web service response; and performing filtering of the Web service response according to a schema of the manifest. 7. The method of claim 1, further comprising:
displaying the selected function in a spreadsheet application; receiving an argument input in a cell of a spreadsheet; and executing the selected function. 8. The method of claim 1, further comprising:
receiving a trust setting for the selected one of the available functions. 9. The method of claim 1, wherein the central manifest location comprises an online marketplace, wherein the information indicating available functions comprises a list of available Web service functions from the online marketplace. 10. The method of claim 9, further comprising:
displaying the list of available Web service functions at a client device, wherein the selected one of the available functions is a Web function selected via an input device of the client device. 11. The method of claim 10, further comprising:
storing the manifest in a manifest file in a cache associated with a spreadsheet application of the client device. 12. The method of claim 11, further comprising:
locating known functions in the manifest file; and populating a list of known functions in the spreadsheet application. 13. The method of claim 11, further comprising:
displaying the selected Web function in a cell of the spreadsheet application; receiving an argument in one or more cells of the spreadsheet application according to an argument description of the Web function from the manifest; and calculating the Web function according to the argument. 14. The method of claim 13, wherein calculating the Web function according to the argument comprises:
verifying permission to use the Web function; invoking a Web service at the Web service URL after verifying the permission; filtering results received from the Web service according to the filter; and displaying the filtered results in the spreadsheet application. 15. A computer-readable storage medium storing instructions that when executed perform a method comprising:
requesting at a client device a list of available Web functions from an online marketplace; receiving the list of available Web functions from the online marketplace; displaying the list of available Web functions at the client device; receiving a selection of one of the available Web functions via an input device of the client device; receiving a manifest of the selected one of the available Web functions from the online marketplace, the manifest comprising a Web service URL, filter, and argument description; and storing the manifest in a manifest file in a cache associated with a spreadsheet application of the client device. 16. The medium of claim 15, wherein the method further comprises:
locating known functions in the manifest file; and populating a list of known functions in the spreadsheet application. 17. The medium of claim 15, wherein the method further comprises:
displaying the selected one of the available Web functions in a cell of the spreadsheet application; receiving an argument in one or more cells of the spreadsheet application according to the argument description; and calculating the Web function according to the argument. 18. The medium of claim 17, wherein calculating the Web function according to the argument comprises:
verifying permission to use the Web function; invoking a Web service at the Web service URL after verifying the permission; filtering results received from the Web service according to the filter; and displaying the filtered results in the spreadsheet application. 19. The medium of claim 15, wherein the method further comprises:
receiving a trust setting for the selected one of the available Web functions. 20. A system for providing web service functions within a spreadsheet application, the system comprising:
an insert function module configured to:
receive an insert function request from a user,
display a list of available Web functions from an online marketplace, and
receive a manifest of a selected one of the available Web functions from the online marketplace, the manifest comprising a Web service URL, filter, and argument description; and
a local cache for storing the manifest. | Methods and systems are provided for procuring functions, including Web service functions, for use in a spreadsheet application. A Web service function manifest can be managed by a function marketplace. A client device running a spreadsheet application can request available functions from the function marketplace. Information about available functions can be received by the client device. A selection of a function can be made in order to receive the manifest associated with the selected function. A local copy of the manifest may be stored for repeated invocation.1. A method comprising:
requesting available functions from a central manifest location, the functions comprising at least one Web service function; receiving information indicating available functions; requesting a selection of one of the available functions; and receiving a manifest of the selected one of the available functions. 2. The method of claim 1, further comprising:
displaying a list of known functions by querying a local manifest file location and receiving the list of known functions from the local manifest file location, at least one of the known functions being received from the central manifest location. 3. The method of claim 1, the method further comprising:
sending an invocation of the function over a Web service in accordance with the manifest of the selected one of the available functions. 4. The method of claim 3, wherein the function comprises a representational state transfer (REST) application programming interface (API) Web service function. 5. The method of claim 3, wherein sending the invocation of the function over the Web service comprises:
executing the Web service function in a spreadsheet application; validating a license of the Web service function; performing a call and filter for Web service function having a valid license; and returning results within the spreadsheet application. 6. The method of claim 5, wherein performing the call and the filter comprises:
performing a Web service request to a Web service uniform resource location (URL) presented in the manifest; receiving a Web service response; and performing filtering of the Web service response according to a schema of the manifest. 7. The method of claim 1, further comprising:
displaying the selected function in a spreadsheet application; receiving an argument input in a cell of a spreadsheet; and executing the selected function. 8. The method of claim 1, further comprising:
receiving a trust setting for the selected one of the available functions. 9. The method of claim 1, wherein the central manifest location comprises an online marketplace, wherein the information indicating available functions comprises a list of available Web service functions from the online marketplace. 10. The method of claim 9, further comprising:
displaying the list of available Web service functions at a client device, wherein the selected one of the available functions is a Web function selected via an input device of the client device. 11. The method of claim 10, further comprising:
storing the manifest in a manifest file in a cache associated with a spreadsheet application of the client device. 12. The method of claim 11, further comprising:
locating known functions in the manifest file; and populating a list of known functions in the spreadsheet application. 13. The method of claim 11, further comprising:
displaying the selected Web function in a cell of the spreadsheet application; receiving an argument in one or more cells of the spreadsheet application according to an argument description of the Web function from the manifest; and calculating the Web function according to the argument. 14. The method of claim 13, wherein calculating the Web function according to the argument comprises:
verifying permission to use the Web function; invoking a Web service at the Web service URL after verifying the permission; filtering results received from the Web service according to the filter; and displaying the filtered results in the spreadsheet application. 15. A computer-readable storage medium storing instructions that when executed perform a method comprising:
requesting at a client device a list of available Web functions from an online marketplace; receiving the list of available Web functions from the online marketplace; displaying the list of available Web functions at the client device; receiving a selection of one of the available Web functions via an input device of the client device; receiving a manifest of the selected one of the available Web functions from the online marketplace, the manifest comprising a Web service URL, filter, and argument description; and storing the manifest in a manifest file in a cache associated with a spreadsheet application of the client device. 16. The medium of claim 15, wherein the method further comprises:
locating known functions in the manifest file; and populating a list of known functions in the spreadsheet application. 17. The medium of claim 15, wherein the method further comprises:
displaying the selected one of the available Web functions in a cell of the spreadsheet application; receiving an argument in one or more cells of the spreadsheet application according to the argument description; and calculating the Web function according to the argument. 18. The medium of claim 17, wherein calculating the Web function according to the argument comprises:
verifying permission to use the Web function; invoking a Web service at the Web service URL after verifying the permission; filtering results received from the Web service according to the filter; and displaying the filtered results in the spreadsheet application. 19. The medium of claim 15, wherein the method further comprises:
receiving a trust setting for the selected one of the available Web functions. 20. A system for providing web service functions within a spreadsheet application, the system comprising:
an insert function module configured to:
receive an insert function request from a user,
display a list of available Web functions from an online marketplace, and
receive a manifest of a selected one of the available Web functions from the online marketplace, the manifest comprising a Web service URL, filter, and argument description; and
a local cache for storing the manifest. | 2,100 |
5,579 | 5,579 | 14,602,485 | 2,185 | A signal interface unit for use on an aircraft includes a microcontroller, at least one connector, and first and second communication links. The first communication link is connected between the microcontroller and the at least one connector. The microcontroller is configured to transmit and receive data on the first communication link. The second communication link is connected to the microcontroller. The microcontroller is configured to send and receive data on an aircraft data bus using the second communication link. | 1. A signal interface unit for use on an aircraft, the signal interface unit comprising:
a microcontroller; at least one connector; a first communication link connected between the microcontroller and the at least one connector, wherein the microcontroller is configured to transmit and receive data on the first communication link; and a second communication link connected to the microcontroller, wherein the microcontroller is configured to send and receive data on an aircraft data bus using the second communication link. 2. The signal interface unit of claim 1, wherein the first communication link is a high speed non-deterministic data link and the second communication link is a time deterministic link. 3. The signal interface unit of claim 2, wherein the first communication link is an Ethernet link and the second communication link is a time-triggered Ethernet link. 4. The signal interface unit of claim 1, further comprising:
a third communication link connected between the microcontroller and the at least one connector; and a fourth communication link connected between the microcontroller and the at least one connector. 5. The signal interface unit of claim 4, wherein the third communication link is an inter-integrated circuit link, and the fourth communication link is a high speed deterministic link. 6. The signal interface unit of claim 1, further comprising a power supply unit configured to provide power through the at least one connector. 7. The signal interface unit of claim 1, further comprising:
a data logger; and a plurality of sensors. 8. An aircraft system comprising:
a first interface unit comprising:
a controller configured to transmit and receive data through a first communication link; and
a second communication link configured to send and receive data to an external aircraft data bus; and
a first subsystem module configured to communicate with the first interface unit through the first communication link. 9. The aircraft system of claim 8, wherein the first communication link is a high-speed non-deterministic communication link, and wherein the second communication link is a time deterministic communication link. 10. The aircraft system of claim 8, wherein the first interface unit further comprises a third communication link and a fourth communication link, and wherein the first subsystem module is further configured to communicate with the interface unit through the third and fourth communication links. 11. The aircraft system of claim 10, wherein the third communication link is an inter-integrated circuit link, and the fourth communication link is a high speed deterministic link. 12. The aircraft system of claim 8, further comprising:
a second interface unit, wherein the first interface unit is configured to communicate with the second interface unit over the external aircraft data bus through the second communication link. 13. The aircraft system of claim 8, further comprising:
a plurality of second subsystem modules configured to communicate with the first interface unit through the first communication link. 14. The aircraft system of claim 8, further comprising:
a vehicle management system computer comprising:
a controller configured to execute control software; and
a fifth communication link configured to communicate with the external aircraft data bus, wherein the first interface unit communicates with the vehicle management system computer over the external aircraft data bus. | A signal interface unit for use on an aircraft includes a microcontroller, at least one connector, and first and second communication links. The first communication link is connected between the microcontroller and the at least one connector. The microcontroller is configured to transmit and receive data on the first communication link. The second communication link is connected to the microcontroller. The microcontroller is configured to send and receive data on an aircraft data bus using the second communication link.1. A signal interface unit for use on an aircraft, the signal interface unit comprising:
a microcontroller; at least one connector; a first communication link connected between the microcontroller and the at least one connector, wherein the microcontroller is configured to transmit and receive data on the first communication link; and a second communication link connected to the microcontroller, wherein the microcontroller is configured to send and receive data on an aircraft data bus using the second communication link. 2. The signal interface unit of claim 1, wherein the first communication link is a high speed non-deterministic data link and the second communication link is a time deterministic link. 3. The signal interface unit of claim 2, wherein the first communication link is an Ethernet link and the second communication link is a time-triggered Ethernet link. 4. The signal interface unit of claim 1, further comprising:
a third communication link connected between the microcontroller and the at least one connector; and a fourth communication link connected between the microcontroller and the at least one connector. 5. The signal interface unit of claim 4, wherein the third communication link is an inter-integrated circuit link, and the fourth communication link is a high speed deterministic link. 6. The signal interface unit of claim 1, further comprising a power supply unit configured to provide power through the at least one connector. 7. The signal interface unit of claim 1, further comprising:
a data logger; and a plurality of sensors. 8. An aircraft system comprising:
a first interface unit comprising:
a controller configured to transmit and receive data through a first communication link; and
a second communication link configured to send and receive data to an external aircraft data bus; and
a first subsystem module configured to communicate with the first interface unit through the first communication link. 9. The aircraft system of claim 8, wherein the first communication link is a high-speed non-deterministic communication link, and wherein the second communication link is a time deterministic communication link. 10. The aircraft system of claim 8, wherein the first interface unit further comprises a third communication link and a fourth communication link, and wherein the first subsystem module is further configured to communicate with the interface unit through the third and fourth communication links. 11. The aircraft system of claim 10, wherein the third communication link is an inter-integrated circuit link, and the fourth communication link is a high speed deterministic link. 12. The aircraft system of claim 8, further comprising:
a second interface unit, wherein the first interface unit is configured to communicate with the second interface unit over the external aircraft data bus through the second communication link. 13. The aircraft system of claim 8, further comprising:
a plurality of second subsystem modules configured to communicate with the first interface unit through the first communication link. 14. The aircraft system of claim 8, further comprising:
a vehicle management system computer comprising:
a controller configured to execute control software; and
a fifth communication link configured to communicate with the external aircraft data bus, wherein the first interface unit communicates with the vehicle management system computer over the external aircraft data bus. | 2,100 |
5,580 | 5,580 | 14,660,003 | 2,127 | Systems and methods for simulating fluid properties in a production system include receiving data from a sensor. The data represents a first property of a fluid that is measured by the sensor. A second property of the fluid is estimated based at least in part on the measured first property. A third property of the fluid is calculated using the estimated second property. Calculating the third property includes running a first simulation on a first simulator and running a second simulation on a second simulator. The first and second simulations at least partially overlap in the time domain. It is then determined whether results of the first and second simulations converge to a common value. | 1. A method for simulating fluid properties in a production system, comprising:
receiving data from a sensor, the data representing a first property of a fluid that is measured by the sensor; estimating a second property of the fluid based at least in part on the measured first property; calculating a third property of the fluid using the estimated second property, wherein calculating the third property comprises:
running a first simulation on a first of a plurality of simulators; and
running a second simulation on a second of the plurality of simulators, wherein the first and second simulations at least partially overlap in the time domain; and
determining whether results of the first and second simulations converge to a common value. 2. The method of claim 1, further comprising placing the first and second simulations in a queue. 3. The method of claim 2, wherein the first and second simulations are loaded into the first and second simulators in an order in which the first and second simulations are placed in the queue. 4. The method of claim 2, wherein the first and second simulations are loaded into the first and second simulators simultaneously. 5. The method of claim 2, further comprising:
placing a third simulation in the queue; determining whether one of the plurality of simulators is available to run the third simulation; and running the third simulation on a next available simulator of the plurality of simulators when it is determined that one of the plurality of simulators is available. 6. The method of claim 1, further comprising modifying the estimate for the second property when the results for the first and second simulations do not converge to the common value. 7. The method of claim 1, further comprising adjusting a setting of a pump or a compressor in response to the results. 8. The method of claim 1, wherein the first property is selected from the group consisting of pressure, temperature, flow rate, and composition. 9. The method of claim 8, wherein the second property is selected from the group consisting of pressure, temperature, flow rate, and composition. 10. The method of claim 9, wherein the third property is selected from the group consisting of pressure, temperature, flow rate, and composition. 11. A non-transitory computer-readable medium storing instructions that, when executed by at least one processor of a computing system, cause the computing system to perform operations, the operations comprising:
receiving data from a sensor, the data representing a first property of a fluid in a first flowline; estimating a second property of the fluid in the first flowline based at least in part on the measured first property; calculating a third property of the fluid in the first flowline using the estimated second property, wherein calculating the third property comprises:
running a first simulation on a first of a plurality of simulators; and
running a second simulation on a second of the plurality of simulators, wherein the first and second simulations at least partially overlap in the time domain; and
determining whether results of the first and second simulations converge to a common value. 12. The non-transitory computer-readable medium of claim 11, wherein the operations further comprise using the results as a fourth property of the fluid in a second flowline. 13. The non-transitory computer-readable medium of claim 12, wherein the operations further comprise estimating a fifth property of the fluid in the second flowline using the fourth property. 14. The non-transitory computer-readable medium of claim 13, wherein the operations further comprise calculating a sixth property of the fluid in the second flowline using the estimated fifth property in the second flowline. 15. The non-transitory computer-readable medium of claim 14, wherein a manifold, production equipment, or both is positioned between the first and second flowlines. 16. A computing system comprising:
one or more processors; and a memory system comprising one or more non-transitory computer-readable media storing instructions that, when executed by at least one of the one or more processors, cause the computing system to perform operations, the operations comprising:
receiving data from a sensor, the data representing a first property of a fluid that is measured by the sensor;
estimating a second property of the fluid based at least in part on the measured first property;
calculating a third property of the fluid using the estimated second property, wherein calculating the third property comprises:
running a first simulation on a first of a plurality of simulators; and
running a second simulation on a second of the plurality of simulators, wherein the first and second simulations at least partially overlap in the time domain; and
determining whether results of the first and second simulations converge to a common value. 17. The system of claim 16, wherein the system further comprises a piece of production equipment, and wherein a setting of the production equipment is adjusted in response to the results. 18. The system of claim 17, wherein the production equipment is selected from the group consisting of a pump and a compressor. 19. The system of claim 17, wherein adjusting the setting of the production equipment changes the first property, the second property, the third property, or a combination thereof. 20. The system of claim 17, wherein adjusting the setting of the production equipment changes a fourth property of the fluid. | Systems and methods for simulating fluid properties in a production system include receiving data from a sensor. The data represents a first property of a fluid that is measured by the sensor. A second property of the fluid is estimated based at least in part on the measured first property. A third property of the fluid is calculated using the estimated second property. Calculating the third property includes running a first simulation on a first simulator and running a second simulation on a second simulator. The first and second simulations at least partially overlap in the time domain. It is then determined whether results of the first and second simulations converge to a common value.1. A method for simulating fluid properties in a production system, comprising:
receiving data from a sensor, the data representing a first property of a fluid that is measured by the sensor; estimating a second property of the fluid based at least in part on the measured first property; calculating a third property of the fluid using the estimated second property, wherein calculating the third property comprises:
running a first simulation on a first of a plurality of simulators; and
running a second simulation on a second of the plurality of simulators, wherein the first and second simulations at least partially overlap in the time domain; and
determining whether results of the first and second simulations converge to a common value. 2. The method of claim 1, further comprising placing the first and second simulations in a queue. 3. The method of claim 2, wherein the first and second simulations are loaded into the first and second simulators in an order in which the first and second simulations are placed in the queue. 4. The method of claim 2, wherein the first and second simulations are loaded into the first and second simulators simultaneously. 5. The method of claim 2, further comprising:
placing a third simulation in the queue; determining whether one of the plurality of simulators is available to run the third simulation; and running the third simulation on a next available simulator of the plurality of simulators when it is determined that one of the plurality of simulators is available. 6. The method of claim 1, further comprising modifying the estimate for the second property when the results for the first and second simulations do not converge to the common value. 7. The method of claim 1, further comprising adjusting a setting of a pump or a compressor in response to the results. 8. The method of claim 1, wherein the first property is selected from the group consisting of pressure, temperature, flow rate, and composition. 9. The method of claim 8, wherein the second property is selected from the group consisting of pressure, temperature, flow rate, and composition. 10. The method of claim 9, wherein the third property is selected from the group consisting of pressure, temperature, flow rate, and composition. 11. A non-transitory computer-readable medium storing instructions that, when executed by at least one processor of a computing system, cause the computing system to perform operations, the operations comprising:
receiving data from a sensor, the data representing a first property of a fluid in a first flowline; estimating a second property of the fluid in the first flowline based at least in part on the measured first property; calculating a third property of the fluid in the first flowline using the estimated second property, wherein calculating the third property comprises:
running a first simulation on a first of a plurality of simulators; and
running a second simulation on a second of the plurality of simulators, wherein the first and second simulations at least partially overlap in the time domain; and
determining whether results of the first and second simulations converge to a common value. 12. The non-transitory computer-readable medium of claim 11, wherein the operations further comprise using the results as a fourth property of the fluid in a second flowline. 13. The non-transitory computer-readable medium of claim 12, wherein the operations further comprise estimating a fifth property of the fluid in the second flowline using the fourth property. 14. The non-transitory computer-readable medium of claim 13, wherein the operations further comprise calculating a sixth property of the fluid in the second flowline using the estimated fifth property in the second flowline. 15. The non-transitory computer-readable medium of claim 14, wherein a manifold, production equipment, or both is positioned between the first and second flowlines. 16. A computing system comprising:
one or more processors; and a memory system comprising one or more non-transitory computer-readable media storing instructions that, when executed by at least one of the one or more processors, cause the computing system to perform operations, the operations comprising:
receiving data from a sensor, the data representing a first property of a fluid that is measured by the sensor;
estimating a second property of the fluid based at least in part on the measured first property;
calculating a third property of the fluid using the estimated second property, wherein calculating the third property comprises:
running a first simulation on a first of a plurality of simulators; and
running a second simulation on a second of the plurality of simulators, wherein the first and second simulations at least partially overlap in the time domain; and
determining whether results of the first and second simulations converge to a common value. 17. The system of claim 16, wherein the system further comprises a piece of production equipment, and wherein a setting of the production equipment is adjusted in response to the results. 18. The system of claim 17, wherein the production equipment is selected from the group consisting of a pump and a compressor. 19. The system of claim 17, wherein adjusting the setting of the production equipment changes the first property, the second property, the third property, or a combination thereof. 20. The system of claim 17, wherein adjusting the setting of the production equipment changes a fourth property of the fluid. | 2,100 |
5,581 | 5,581 | 14,857,391 | 2,179 | Processing multiple inputs received across simultaneously displayed applications. In an embodiment, a computing device displays a first application on a first portion of a display device, and simultaneously displays a second application on a second, different, portion of the display device. The computing device receives a first user input in connection with the first portion of the display device, and, at substantially the same time, also receives a second user input in connection with the second portion of the display device. The computing device routes the first user input to the first application based on the first user input having been received in connection with first portion of the display device, and, at substantially the same time, also routes the second user input to the second application based on the second user input having been received in connection with the second portion of the display device. | 1. A computing device for processing multiple inputs received across simultaneously displayed applications, the computing device comprising:
one or more processors; a display device; and a storage medium having stored thereon executable instructions that are executable by the one or more processors to configure the computing device to perform at least the following:
display a first application on a first portion of the display device, and simultaneously display a second application on a second, different, portion of the display device;
receive a first user input in connection with the first portion of the display device;
receive a second user input in connection with the second portion of the display device, the first user input and the second user input being received at substantially the same time;
route the first user input to the first application based on the first user input having been received in connection with first portion of the display device; and
route the second user input to the second application based on the second user input having been received in connection with the second portion of the display device, the second user input being routed to the second application substantially at the same time as routing the first user input to the first application. 2. The computing device of claim 1, the executable instructions including instructions that are executable by the one or more processors to configure the computing device to:
route the first user input to a first secondary input event processing thread that is running in parallel to a first main operating system event processing thread of the first application. 3. The computing device of claim 2, the executable instructions including instructions that are executable by the one or more processors to configure the computing device to:
route the second user input to a second secondary input event processing thread that is running in parallel to a second main operating system event processing thread of the second application. 4. The computing device of claim 1, the executable instructions including instructions that are executable by the one or more processors to configure the computing device to:
determine a type of the first user input; and determine a type of the second user input. 5. The computing device of claim 4, the executable instructions including instructions that are executable by the one or more processors to configure the computing device to:
when determining the type of the first user input, determine that the first user input is from a first type of object; and when determining the type of the second user input, determine that the second user input is from a second type of object that is different than the first type of object. 6. The computing device of claim 5, wherein the first type of object comprises a finger, and the second type of object comprises a stylus. 7. The computing device of claim 5, the executable instructions including instructions that are executable by the one or more processors to configure the computing device to:
route only user input from the first type of object to the first application; and route only user input from the second type of object to the second application. 8. The computing device of claim 1, the executable instructions including instructions that are executable by the one or more processors to configure the computing device to:
synchronize the first and second user interface components, including sending the first user input to the second application associated with the second user interface component. 9. The computing device of claim 1, the executable instructions including instructions that are executable by the one or more processors to configure the computing device to:
transmit the first user input and the second touch input in a single transmission frame. 10. The computing device of claim 1, wherein the display device includes a digitizer, and wherein one or more of the first user input and the second user input comprises a touch user input. 11. The computing device of claim 1, wherein the display device includes a digitizer, and wherein one or more of the first user input and the second user input comprises a stylus user input. 12. A computing device for processing multiple inputs received across simultaneously displayed applications, the computing device comprising:
one or more processors; a display device; one or more user input devices that are associated with the display device; and a storage medium having stored thereon executable instructions that are executable by the one or more processors to configure the computing device to perform at least the following:
display a first application in a first portion of the display device;
while displaying the first application in the first portion of the display device, simultaneously display a second application in a second and different portion of the display device;
simultaneously receive, at the one or more user input devices, both (i) a first user input that is detected by the one or more user input devices to be directed at the first portion of the display device, and (ii) a second user input that is detected by the one or more user input devices to be directed at the second portion of the display device;
simultaneously route both (i) the first user input to the first application based at least on the first user input being detected to be directed at the first portion of the display device, and (ii) the second user input to the second application based at least on the second user input being detected to be directed at the second portion of the display device. 13. The computing device of claim 12, the one or more user input devices comprising one or more digitizers that detect touch-based user input. 14. The computing device of claim 12, the one or more user input devices comprising one or more digitizers that detect stylus-based user input. 15. The computing device of claim 12, the one or more user input devices comprising one or more digitizers that detect both touch-based user input and stylus-based user input, the executable instructions including instructions that are executable by the one or more processors to configure the computing device to:
distinguish between touch-based user input and stylus-based user input at the one or more user input devices. 16. The computing device of claim 15, the executable instructions including instructions that are executable by the one or more processors to configure the computing device to:
route only touch-based user input to the first application; and route only stylus-based user input to the second application. 17. The computing device of claim 15, the executable instructions including instructions that are executable by the one or more processors to configure the computing device to:
route only touch-based user input to the first application; and route stylus-based user input to one or both of the first application and the second application. 18. The computing device of claim 15, the executable instructions including instructions that are executable by the one or more processors to configure the computing device to:
route only stylus-based user input to the first application; and route touch-based user input to one or both of the first application and the second application. 19. The computing device of claim 12, the executable instructions including instructions that are executable by the one or more processors to configure the computing device to:
route the first user input to a first secondary input event processing thread that is running in parallel to a first main operating system event processing thread of the first application; and route the second user input to a second secondary input event processing thread that is running in parallel to a second main operating system event processing thread of the second application. 20. A method, implemented at a computing device that includes one or more processors and a display device, the method for processing multiple inputs received across simultaneously displayed applications, the method comprising:
displaying a first application on a first portion of the display device, while simultaneously displaying a second application on a second, different, portion of the display device; receiving a first user input in connection with the first portion of the display device; receiving a second user input in connection with the second portion of the display device, the first user input and the second user input being received at substantially the same time; routing the first user input to the first application based on the first user input having been received in connection with first portion of the display device; and routing the second user input to the second application based on the second user input having been received in connection with the second portion of the display device, the second user input being routed to the second application substantially at the same time as routing the first user input to the first application. | Processing multiple inputs received across simultaneously displayed applications. In an embodiment, a computing device displays a first application on a first portion of a display device, and simultaneously displays a second application on a second, different, portion of the display device. The computing device receives a first user input in connection with the first portion of the display device, and, at substantially the same time, also receives a second user input in connection with the second portion of the display device. The computing device routes the first user input to the first application based on the first user input having been received in connection with first portion of the display device, and, at substantially the same time, also routes the second user input to the second application based on the second user input having been received in connection with the second portion of the display device.1. A computing device for processing multiple inputs received across simultaneously displayed applications, the computing device comprising:
one or more processors; a display device; and a storage medium having stored thereon executable instructions that are executable by the one or more processors to configure the computing device to perform at least the following:
display a first application on a first portion of the display device, and simultaneously display a second application on a second, different, portion of the display device;
receive a first user input in connection with the first portion of the display device;
receive a second user input in connection with the second portion of the display device, the first user input and the second user input being received at substantially the same time;
route the first user input to the first application based on the first user input having been received in connection with first portion of the display device; and
route the second user input to the second application based on the second user input having been received in connection with the second portion of the display device, the second user input being routed to the second application substantially at the same time as routing the first user input to the first application. 2. The computing device of claim 1, the executable instructions including instructions that are executable by the one or more processors to configure the computing device to:
route the first user input to a first secondary input event processing thread that is running in parallel to a first main operating system event processing thread of the first application. 3. The computing device of claim 2, the executable instructions including instructions that are executable by the one or more processors to configure the computing device to:
route the second user input to a second secondary input event processing thread that is running in parallel to a second main operating system event processing thread of the second application. 4. The computing device of claim 1, the executable instructions including instructions that are executable by the one or more processors to configure the computing device to:
determine a type of the first user input; and determine a type of the second user input. 5. The computing device of claim 4, the executable instructions including instructions that are executable by the one or more processors to configure the computing device to:
when determining the type of the first user input, determine that the first user input is from a first type of object; and when determining the type of the second user input, determine that the second user input is from a second type of object that is different than the first type of object. 6. The computing device of claim 5, wherein the first type of object comprises a finger, and the second type of object comprises a stylus. 7. The computing device of claim 5, the executable instructions including instructions that are executable by the one or more processors to configure the computing device to:
route only user input from the first type of object to the first application; and route only user input from the second type of object to the second application. 8. The computing device of claim 1, the executable instructions including instructions that are executable by the one or more processors to configure the computing device to:
synchronize the first and second user interface components, including sending the first user input to the second application associated with the second user interface component. 9. The computing device of claim 1, the executable instructions including instructions that are executable by the one or more processors to configure the computing device to:
transmit the first user input and the second touch input in a single transmission frame. 10. The computing device of claim 1, wherein the display device includes a digitizer, and wherein one or more of the first user input and the second user input comprises a touch user input. 11. The computing device of claim 1, wherein the display device includes a digitizer, and wherein one or more of the first user input and the second user input comprises a stylus user input. 12. A computing device for processing multiple inputs received across simultaneously displayed applications, the computing device comprising:
one or more processors; a display device; one or more user input devices that are associated with the display device; and a storage medium having stored thereon executable instructions that are executable by the one or more processors to configure the computing device to perform at least the following:
display a first application in a first portion of the display device;
while displaying the first application in the first portion of the display device, simultaneously display a second application in a second and different portion of the display device;
simultaneously receive, at the one or more user input devices, both (i) a first user input that is detected by the one or more user input devices to be directed at the first portion of the display device, and (ii) a second user input that is detected by the one or more user input devices to be directed at the second portion of the display device;
simultaneously route both (i) the first user input to the first application based at least on the first user input being detected to be directed at the first portion of the display device, and (ii) the second user input to the second application based at least on the second user input being detected to be directed at the second portion of the display device. 13. The computing device of claim 12, the one or more user input devices comprising one or more digitizers that detect touch-based user input. 14. The computing device of claim 12, the one or more user input devices comprising one or more digitizers that detect stylus-based user input. 15. The computing device of claim 12, the one or more user input devices comprising one or more digitizers that detect both touch-based user input and stylus-based user input, the executable instructions including instructions that are executable by the one or more processors to configure the computing device to:
distinguish between touch-based user input and stylus-based user input at the one or more user input devices. 16. The computing device of claim 15, the executable instructions including instructions that are executable by the one or more processors to configure the computing device to:
route only touch-based user input to the first application; and route only stylus-based user input to the second application. 17. The computing device of claim 15, the executable instructions including instructions that are executable by the one or more processors to configure the computing device to:
route only touch-based user input to the first application; and route stylus-based user input to one or both of the first application and the second application. 18. The computing device of claim 15, the executable instructions including instructions that are executable by the one or more processors to configure the computing device to:
route only stylus-based user input to the first application; and route touch-based user input to one or both of the first application and the second application. 19. The computing device of claim 12, the executable instructions including instructions that are executable by the one or more processors to configure the computing device to:
route the first user input to a first secondary input event processing thread that is running in parallel to a first main operating system event processing thread of the first application; and route the second user input to a second secondary input event processing thread that is running in parallel to a second main operating system event processing thread of the second application. 20. A method, implemented at a computing device that includes one or more processors and a display device, the method for processing multiple inputs received across simultaneously displayed applications, the method comprising:
displaying a first application on a first portion of the display device, while simultaneously displaying a second application on a second, different, portion of the display device; receiving a first user input in connection with the first portion of the display device; receiving a second user input in connection with the second portion of the display device, the first user input and the second user input being received at substantially the same time; routing the first user input to the first application based on the first user input having been received in connection with first portion of the display device; and routing the second user input to the second application based on the second user input having been received in connection with the second portion of the display device, the second user input being routed to the second application substantially at the same time as routing the first user input to the first application. | 2,100 |
5,582 | 5,582 | 15,005,073 | 2,177 | A computer-implemented method of enhancing data in a screenshot can include capturing a screenshot of content presented on a display and identifying within the content at least a first element comprising first semantic data. A first semantic representation of the first semantic data can be generated and the first semantic representation can be associated with the first element. The first semantic representation and the screenshot can be output. | 1-20. (canceled) 21. A computer-implemented method, comprising:
capturing a static graphical image of content presented on a display of a computer system; identifying, within the content, a first element including first semantic data; generating a first semantic representation of the first semantic data; and associating the first semantic representation with the first element. 22. The method of claim 21, further comprising:
identifying a second element having a hierarchical relationship with the first element; generating a hierarchical representation of the hierarchical relationship between the first element and the second element; and associating the hierarchical representation with the first element, wherein the first element is a parent element and the second element is a child element. 23. The method of claim 22, wherein
the second element is not within the static graphical image. 24. The method of claim 22, wherein
the second element is identified by recursive processing the hierarchical relationship. 25. The method of claim 24, wherein
the recursive processing is limited to a defined number of levels. 26. The method of claim 22, wherein
the hierarchical relationship is determined by an identified spatial relationship between the first element and the second element. 27. A computer hardware system, comprising:
at least one hardware processor configured to perform and/or initiate:
capturing a static graphical image of content presented on a display of a computer system;
identifying, within the content, a first element including first semantic data;
generating a first semantic representation of the first semantic data; and
associating the first semantic representation with the first element. 28. The system of claim 27, wherein the at least one hardware processor is further configured to perform and/or initiate:
identifying a second element having a hierarchical relationship with the first element; generating a hierarchical representation of the hierarchical relationship between the first element and the second element; and associating the hierarchical representation with the first element, wherein the first element is a parent element and the second element is a child element. 29. The system of claim 28, wherein
the second element is not within the static graphical image. 30. The system of claim 28, wherein
the second element is identified by recursive processing the hierarchical relationship. 31. The system of claim 30, wherein
the recursive processing is limited to a defined number of levels. 32. The system of claim 28, wherein
the hierarchical relationship is determined by an identified spatial relationship between the first element and the second element. 33. A computer program product, comprising:
a computer-usable storage device having stored therein computer-usable program code, the computer-usable program code, which when executed by a computer hardware system, causes the computer hardware system to perform:
capturing a static graphical image of content presented on a display of a computer system;
identifying, within the content, a first element including first semantic data;
generating a first semantic representation of the first semantic data;
associating the first semantic representation with the first element, wherein
the computer-usable storage device does not consist of a transitory, propagating signal. 34. The computer program product of claim 33, wherein the computer-usable program code further causes the computer hardware system to perform:
identifying a second element having a hierarchical relationship with the first element; generating a hierarchical representation of the hierarchical relationship between the first element and the second element; and associating the hierarchical representation with the first element, wherein the first element is a parent element and the second element is a child element. 35. The computer program product of claim 34, wherein
the second element is not within the static graphical image. 36. The computer program product of claim 34, wherein
the second element is identified by recursive processing the hierarchical relationship. 37. The computer program product of claim 36, wherein
the recursive processing is limited to a defined number of levels. 38. The computer program product of claim 34, wherein
the hierarchical relationship is determined by an identified spatial relationship between the first element and the second element. | A computer-implemented method of enhancing data in a screenshot can include capturing a screenshot of content presented on a display and identifying within the content at least a first element comprising first semantic data. A first semantic representation of the first semantic data can be generated and the first semantic representation can be associated with the first element. The first semantic representation and the screenshot can be output.1-20. (canceled) 21. A computer-implemented method, comprising:
capturing a static graphical image of content presented on a display of a computer system; identifying, within the content, a first element including first semantic data; generating a first semantic representation of the first semantic data; and associating the first semantic representation with the first element. 22. The method of claim 21, further comprising:
identifying a second element having a hierarchical relationship with the first element; generating a hierarchical representation of the hierarchical relationship between the first element and the second element; and associating the hierarchical representation with the first element, wherein the first element is a parent element and the second element is a child element. 23. The method of claim 22, wherein
the second element is not within the static graphical image. 24. The method of claim 22, wherein
the second element is identified by recursive processing the hierarchical relationship. 25. The method of claim 24, wherein
the recursive processing is limited to a defined number of levels. 26. The method of claim 22, wherein
the hierarchical relationship is determined by an identified spatial relationship between the first element and the second element. 27. A computer hardware system, comprising:
at least one hardware processor configured to perform and/or initiate:
capturing a static graphical image of content presented on a display of a computer system;
identifying, within the content, a first element including first semantic data;
generating a first semantic representation of the first semantic data; and
associating the first semantic representation with the first element. 28. The system of claim 27, wherein the at least one hardware processor is further configured to perform and/or initiate:
identifying a second element having a hierarchical relationship with the first element; generating a hierarchical representation of the hierarchical relationship between the first element and the second element; and associating the hierarchical representation with the first element, wherein the first element is a parent element and the second element is a child element. 29. The system of claim 28, wherein
the second element is not within the static graphical image. 30. The system of claim 28, wherein
the second element is identified by recursive processing the hierarchical relationship. 31. The system of claim 30, wherein
the recursive processing is limited to a defined number of levels. 32. The system of claim 28, wherein
the hierarchical relationship is determined by an identified spatial relationship between the first element and the second element. 33. A computer program product, comprising:
a computer-usable storage device having stored therein computer-usable program code, the computer-usable program code, which when executed by a computer hardware system, causes the computer hardware system to perform:
capturing a static graphical image of content presented on a display of a computer system;
identifying, within the content, a first element including first semantic data;
generating a first semantic representation of the first semantic data;
associating the first semantic representation with the first element, wherein
the computer-usable storage device does not consist of a transitory, propagating signal. 34. The computer program product of claim 33, wherein the computer-usable program code further causes the computer hardware system to perform:
identifying a second element having a hierarchical relationship with the first element; generating a hierarchical representation of the hierarchical relationship between the first element and the second element; and associating the hierarchical representation with the first element, wherein the first element is a parent element and the second element is a child element. 35. The computer program product of claim 34, wherein
the second element is not within the static graphical image. 36. The computer program product of claim 34, wherein
the second element is identified by recursive processing the hierarchical relationship. 37. The computer program product of claim 36, wherein
the recursive processing is limited to a defined number of levels. 38. The computer program product of claim 34, wherein
the hierarchical relationship is determined by an identified spatial relationship between the first element and the second element. | 2,100 |
5,583 | 5,583 | 14,659,337 | 2,191 | A non-transitory computer-readable storage medium may comprise instructions for determining health statuses of multiple virtual machine templates stored thereon. When executed by at least one processor, the instructions may be configured to cause a health status server to at least run multiple scripts against multiple virtual machines, each of the multiple virtual machines being generated from one of the multiple virtual machine templates, and generate, for each of the multiple virtual machines, an output report indicating success or failure for each of the multiple scripts. | 1. A non-transitory computer-readable storage medium comprising instructions for determining health statuses of multiple virtual machine templates stored thereon that, when executed by at least one processor, are configured to cause a health status server to at least:
in response to a change to a script, run the changed script against multiple virtual machines, each of the multiple virtual machines being generated from one of the multiple virtual machine templates; and generate, for each of the multiple virtual machines, an output report indicating success or failure for the virtual machine against the changed script. 2. The non-transitory computer-readable storage medium of claim 1, wherein the changed script runs concurrently against each of the multiple machines. 3. The non-transitory computer-readable storage medium of claim 1, wherein the changed script runs as background processes against the multiple virtual machines while other applications are running on the multiple virtual machines. 4. The non-transitory computer-readable storage medium of claim 1, wherein the instructions are further configured to cause the health server to run different sets of scripts for different customers. 5. The non-transitory computer-readable storage medium of claim 1, further comprising, based on at least one of the virtual machines failing a test based on the changed script, receiving modifications to the virtual machines and propagating the modifications from the virtual machines to the virtual machine templates. 6. A non-transitory computer-readable storage medium comprising instructions for determining health statuses of multiple virtual machine templates stored thereon that, when executed by at least one processor, are configured to cause a health status server to at least:
launch a virtual machine from a virtual machine template; run at least a first script and a second script against the launched virtual machine; determine whether a first job running on the launched virtual machine passes the first script and whether a second job running on the launched virtual machine passes the second script; output a report indicating that the first job did not pass the first script and the second job passed the second script; modify the launched virtual machine based on the report indicating that the first job did not pass the first script; determine that the modified virtual machine passed both the first test and the second test; and decommission the modified virtual machine based on the determination that the modified virtual machine passed both the first test and the second test. 7. The non-transitory computer-readable storage medium of claim 6, wherein the first script and the second script are run concurrently against the virtual machine. 8. The non-transitory computer-readable storage medium of claim 6, wherein the first script prompts the virtual machine to execute a boot file and the second script prompts the virtual machine to execute an operating system file. 9. The non-transitory computer-readable storage medium of claim 6, wherein the first script prompts the virtual machine to read data from a third-party database and the second script prompts the virtual machine to write data to the third-party database. 10. The non-transitory computer-readable storage medium of claim 6, wherein the first script prompts the virtual machine to launch a third-party application and the second script prompts the virtual machine to call a third-party application programming interface (API). 11. The non-transitory computer-readable storage medium of claim 6, wherein the first script compares execution of a file included in the virtual machine to a governmental regulation requirement and the second script implements a security threat against the virtual machine. 12. The non-transitory computer-readable storage medium of claim 6, wherein the first script requests connection to the virtual machine via a specified port and the second script requests the virtual machine to start and stop a service. 13. The non-transitory computer-readable storage medium of claim 6, wherein the running at least the first script and the second script includes running at least the first script and the second script concurrently against the virtual machine. 14. The non-transitory computer-readable storage medium of claim 6, wherein instructions are configured to cause the health status server to perform the launching, running, determining, and outputting on multiple virtual machine templates at regular intervals. 15. The non-transitory computer-readable storage medium of claim 6, wherein the launching, running, determining, and outputting are performed as background jobs on multiple virtual machine templates. 16. The non-transitory computer-readable storage medium of claim 6, wherein the launching, running, determining whether the first job passes the first script and the second job passes the second script, and outputting are performed on multiple virtual machine templates in response to an administrator adding a new script. 17. (canceled) 18. The non-transitory computer-readable storage medium of claim 6, wherein the instructions are further configured to cause the health status server to implement modifications to the virtual machine template based on the modifications to the virtual machine. 19. (canceled) 20. A non-transitory computer-readable storage medium comprising instructions for determining health statuses of multiple virtual machine templates stored thereon that, when executed by at least one processor, are configured to cause a health status server to at least:
launch a virtual machine from a virtual machine template; concurrently run at least a first script and a second script against the virtual machine as background jobs; determine that a first job does not pass the first script and that a second job passes the second script; output a report indicating that the first job did not pass and that the second job passed; receive modification input based on the report indicating that the first job did not pass; modify the virtual machine based on the received modification input; implement modifications to the virtual machine template based on the modifications to the virtual machine; run at least the first script against the modified virtual machine; and decommission the modified virtual machine in response to determining that the first job passed the first script. 21. The non-transitory computer-readable storage medium of claim 1, wherein the changed script determines whether the multiple virtual machines have corrupted or missing dynamic link library (DLL) files. 22. The non-transitory computer-readable storage medium of claim 1, wherein the changed script determines whether the multiple virtual machines have corrupted system files. | A non-transitory computer-readable storage medium may comprise instructions for determining health statuses of multiple virtual machine templates stored thereon. When executed by at least one processor, the instructions may be configured to cause a health status server to at least run multiple scripts against multiple virtual machines, each of the multiple virtual machines being generated from one of the multiple virtual machine templates, and generate, for each of the multiple virtual machines, an output report indicating success or failure for each of the multiple scripts.1. A non-transitory computer-readable storage medium comprising instructions for determining health statuses of multiple virtual machine templates stored thereon that, when executed by at least one processor, are configured to cause a health status server to at least:
in response to a change to a script, run the changed script against multiple virtual machines, each of the multiple virtual machines being generated from one of the multiple virtual machine templates; and generate, for each of the multiple virtual machines, an output report indicating success or failure for the virtual machine against the changed script. 2. The non-transitory computer-readable storage medium of claim 1, wherein the changed script runs concurrently against each of the multiple machines. 3. The non-transitory computer-readable storage medium of claim 1, wherein the changed script runs as background processes against the multiple virtual machines while other applications are running on the multiple virtual machines. 4. The non-transitory computer-readable storage medium of claim 1, wherein the instructions are further configured to cause the health server to run different sets of scripts for different customers. 5. The non-transitory computer-readable storage medium of claim 1, further comprising, based on at least one of the virtual machines failing a test based on the changed script, receiving modifications to the virtual machines and propagating the modifications from the virtual machines to the virtual machine templates. 6. A non-transitory computer-readable storage medium comprising instructions for determining health statuses of multiple virtual machine templates stored thereon that, when executed by at least one processor, are configured to cause a health status server to at least:
launch a virtual machine from a virtual machine template; run at least a first script and a second script against the launched virtual machine; determine whether a first job running on the launched virtual machine passes the first script and whether a second job running on the launched virtual machine passes the second script; output a report indicating that the first job did not pass the first script and the second job passed the second script; modify the launched virtual machine based on the report indicating that the first job did not pass the first script; determine that the modified virtual machine passed both the first test and the second test; and decommission the modified virtual machine based on the determination that the modified virtual machine passed both the first test and the second test. 7. The non-transitory computer-readable storage medium of claim 6, wherein the first script and the second script are run concurrently against the virtual machine. 8. The non-transitory computer-readable storage medium of claim 6, wherein the first script prompts the virtual machine to execute a boot file and the second script prompts the virtual machine to execute an operating system file. 9. The non-transitory computer-readable storage medium of claim 6, wherein the first script prompts the virtual machine to read data from a third-party database and the second script prompts the virtual machine to write data to the third-party database. 10. The non-transitory computer-readable storage medium of claim 6, wherein the first script prompts the virtual machine to launch a third-party application and the second script prompts the virtual machine to call a third-party application programming interface (API). 11. The non-transitory computer-readable storage medium of claim 6, wherein the first script compares execution of a file included in the virtual machine to a governmental regulation requirement and the second script implements a security threat against the virtual machine. 12. The non-transitory computer-readable storage medium of claim 6, wherein the first script requests connection to the virtual machine via a specified port and the second script requests the virtual machine to start and stop a service. 13. The non-transitory computer-readable storage medium of claim 6, wherein the running at least the first script and the second script includes running at least the first script and the second script concurrently against the virtual machine. 14. The non-transitory computer-readable storage medium of claim 6, wherein instructions are configured to cause the health status server to perform the launching, running, determining, and outputting on multiple virtual machine templates at regular intervals. 15. The non-transitory computer-readable storage medium of claim 6, wherein the launching, running, determining, and outputting are performed as background jobs on multiple virtual machine templates. 16. The non-transitory computer-readable storage medium of claim 6, wherein the launching, running, determining whether the first job passes the first script and the second job passes the second script, and outputting are performed on multiple virtual machine templates in response to an administrator adding a new script. 17. (canceled) 18. The non-transitory computer-readable storage medium of claim 6, wherein the instructions are further configured to cause the health status server to implement modifications to the virtual machine template based on the modifications to the virtual machine. 19. (canceled) 20. A non-transitory computer-readable storage medium comprising instructions for determining health statuses of multiple virtual machine templates stored thereon that, when executed by at least one processor, are configured to cause a health status server to at least:
launch a virtual machine from a virtual machine template; concurrently run at least a first script and a second script against the virtual machine as background jobs; determine that a first job does not pass the first script and that a second job passes the second script; output a report indicating that the first job did not pass and that the second job passed; receive modification input based on the report indicating that the first job did not pass; modify the virtual machine based on the received modification input; implement modifications to the virtual machine template based on the modifications to the virtual machine; run at least the first script against the modified virtual machine; and decommission the modified virtual machine in response to determining that the first job passed the first script. 21. The non-transitory computer-readable storage medium of claim 1, wherein the changed script determines whether the multiple virtual machines have corrupted or missing dynamic link library (DLL) files. 22. The non-transitory computer-readable storage medium of claim 1, wherein the changed script determines whether the multiple virtual machines have corrupted system files. | 2,100 |
5,584 | 5,584 | 14,803,963 | 2,124 | A method for providing personalized healthcare for a patient is provided. The method may include receiving information indicative of a patient, retrieving a record associated with the patient, receiving a query identifying a healthcare related issue associated with the patient, performing analytics via a statistical discovery component and a natural language processing component configured to interface with respective portions of heterogeneous data sources to selectively identify correlations between genomic profile information of the patient and selected data of the data sources, applying a selected risk model based on the query; and providing a response to the query including information associated with clinical decision support tailored to an identity of the user, the user being a selected one of a patient, a researcher and a clinician. | 1. A personalized healthcare system, the system comprising:
a data platform scalable to include a plurality of data sources, the data sources including at least a clinical research database, genomic data, and a patient health record database, the patient health record database comprising a record for each of a population of patients, a plurality of genetic markers, and a plurality of clinical parameters associated with the patients; an analytics platform comprising at least a statistical discovery component and a natural language processing component configured to interface with respective portions of the data sources to selectively identify correlations based on analysis of contents of the data sources responsive to a query; a modeling component configured to apply a selected risk model based on the query; and a user interface component configured to enable a user to provide the query, and to generate a response to the query, the response providing information associated with clinical decision support tailored to an identity of the user, the user being a selected one of a patient, a researcher and a clinician. 2. The system of claim 1, wherein the statistical discovery component interfaces with portions of the data including structured data, and the natural language processing component interfaces with unstructured data. 3. The system of claim 2, wherein the statistical discovery component interfaces with the genomic data and portions of the clinical research database and the patient health record database that include structured data, and the natural language processing component interfaces with portions of the clinical research database and the patient health record database that include unstructured data such as laboratory data. 4. The system of claim 1, wherein the modeling component is configured to identify the selected risk model based on the query and generate the response to indicate a degree of risk of the patient having a condition associated with the selected risk model based at least in part on the genetic markers and clinical parameters of the patient and selected portions of the genetic data. 5. The system of claim 1, wherein the modeling component further comprises a rules engine configured to evaluate the data sources relative to the patient and generate a risk score based on clinical parameters and a genomic profile of the patient for a selected condition. 6. The system of claim 1, wherein the modeling component further comprises a rules engine configured to evaluate the data sources relative to the patient and generate a risk score based on clinical parameters and a genomic profile of the patient for each of a plurality of conditions. 7. The system of claim 5, wherein the risk score comprises a composite risk score for a condition based on the clinical parameters, genomic profile and a proteomic profile. 8. The system of claim 5, wherein additional patient care results are integrated into the patient health record database to progressively generate an updated risk score. 9. The system of claim 1, wherein the plurality of clinical parameters associated with the patient include at least one of an age, a weight, a blood pressure, and a temperature of the patient. 10. The system of claim 1, wherein the user interface comprises a patient dashboard configured to communicate each of a likelihood of a condition, and healthcare treatment options associated with the condition. 11. The system of claim 1, wherein the response comprises information on drug variants and risks based on a pharmacogenomic profile generated for the patient based on gene variance analysis. 12. The system of claim 10, wherein the information on drug variants includes an identification of benefits correlated to a selected drug based on the pharmacogenomic profile of the patient. 13. The system of claim 10, wherein the information on drug variants includes an identification of negative side effects correlated to a drug to be avoided based on the pharmacogenomic profile of the patient. 14. The system of claim 1, wherein the selected risk model comprises a risk model that is selected based on a drug or disease identified in the query, and based on a genetic profile of the patient. 15. A method for providing personalized healthcare for a patient comprising:
receiving information indicative of a patient; retrieving a record associated with the patient; receiving a query identifying a healthcare related issue associated with the patient; performing analytics via a statistical discovery component and a natural language processing component configured to interface with respective portions of heterogeneous data sources to selectively identify correlations between genomic profile information of the patient and selected data of the data sources; applying a selected risk model based on the query; and providing a response to the query including information associated with clinical decision support tailored to an identity of the user, the user being a selected one of a patient, a researcher and a clinician. 16. The method of claim 14, wherein the statistical discovery component interfaces with genomic data, and the natural language processing component interfaces with unstructured data in a clinical research database and a patient health record database of the heterogeneous data sources. 17. The method of claim 14, wherein providing the response comprises information on drug variants and risks based on a pharmacogenomic profile generated for the patient based on gene variance analysis. 18. The method of claim 17, wherein the information on drug variants includes an identification of benefits correlated to a selected drug based on the pharmacogenomic profile of the patient. 19. The method of claim 17, wherein the information on drug variants includes an identification of negative side effects correlated to a drug to be avoided based on the pharmacogenomic profile of the patient. 20. The method of claim 14, wherein the selected risk model comprises a risk model that is selected based on a drug or disease identified in the query, and based on a genetic profile of the patient. | A method for providing personalized healthcare for a patient is provided. The method may include receiving information indicative of a patient, retrieving a record associated with the patient, receiving a query identifying a healthcare related issue associated with the patient, performing analytics via a statistical discovery component and a natural language processing component configured to interface with respective portions of heterogeneous data sources to selectively identify correlations between genomic profile information of the patient and selected data of the data sources, applying a selected risk model based on the query; and providing a response to the query including information associated with clinical decision support tailored to an identity of the user, the user being a selected one of a patient, a researcher and a clinician.1. A personalized healthcare system, the system comprising:
a data platform scalable to include a plurality of data sources, the data sources including at least a clinical research database, genomic data, and a patient health record database, the patient health record database comprising a record for each of a population of patients, a plurality of genetic markers, and a plurality of clinical parameters associated with the patients; an analytics platform comprising at least a statistical discovery component and a natural language processing component configured to interface with respective portions of the data sources to selectively identify correlations based on analysis of contents of the data sources responsive to a query; a modeling component configured to apply a selected risk model based on the query; and a user interface component configured to enable a user to provide the query, and to generate a response to the query, the response providing information associated with clinical decision support tailored to an identity of the user, the user being a selected one of a patient, a researcher and a clinician. 2. The system of claim 1, wherein the statistical discovery component interfaces with portions of the data including structured data, and the natural language processing component interfaces with unstructured data. 3. The system of claim 2, wherein the statistical discovery component interfaces with the genomic data and portions of the clinical research database and the patient health record database that include structured data, and the natural language processing component interfaces with portions of the clinical research database and the patient health record database that include unstructured data such as laboratory data. 4. The system of claim 1, wherein the modeling component is configured to identify the selected risk model based on the query and generate the response to indicate a degree of risk of the patient having a condition associated with the selected risk model based at least in part on the genetic markers and clinical parameters of the patient and selected portions of the genetic data. 5. The system of claim 1, wherein the modeling component further comprises a rules engine configured to evaluate the data sources relative to the patient and generate a risk score based on clinical parameters and a genomic profile of the patient for a selected condition. 6. The system of claim 1, wherein the modeling component further comprises a rules engine configured to evaluate the data sources relative to the patient and generate a risk score based on clinical parameters and a genomic profile of the patient for each of a plurality of conditions. 7. The system of claim 5, wherein the risk score comprises a composite risk score for a condition based on the clinical parameters, genomic profile and a proteomic profile. 8. The system of claim 5, wherein additional patient care results are integrated into the patient health record database to progressively generate an updated risk score. 9. The system of claim 1, wherein the plurality of clinical parameters associated with the patient include at least one of an age, a weight, a blood pressure, and a temperature of the patient. 10. The system of claim 1, wherein the user interface comprises a patient dashboard configured to communicate each of a likelihood of a condition, and healthcare treatment options associated with the condition. 11. The system of claim 1, wherein the response comprises information on drug variants and risks based on a pharmacogenomic profile generated for the patient based on gene variance analysis. 12. The system of claim 10, wherein the information on drug variants includes an identification of benefits correlated to a selected drug based on the pharmacogenomic profile of the patient. 13. The system of claim 10, wherein the information on drug variants includes an identification of negative side effects correlated to a drug to be avoided based on the pharmacogenomic profile of the patient. 14. The system of claim 1, wherein the selected risk model comprises a risk model that is selected based on a drug or disease identified in the query, and based on a genetic profile of the patient. 15. A method for providing personalized healthcare for a patient comprising:
receiving information indicative of a patient; retrieving a record associated with the patient; receiving a query identifying a healthcare related issue associated with the patient; performing analytics via a statistical discovery component and a natural language processing component configured to interface with respective portions of heterogeneous data sources to selectively identify correlations between genomic profile information of the patient and selected data of the data sources; applying a selected risk model based on the query; and providing a response to the query including information associated with clinical decision support tailored to an identity of the user, the user being a selected one of a patient, a researcher and a clinician. 16. The method of claim 14, wherein the statistical discovery component interfaces with genomic data, and the natural language processing component interfaces with unstructured data in a clinical research database and a patient health record database of the heterogeneous data sources. 17. The method of claim 14, wherein providing the response comprises information on drug variants and risks based on a pharmacogenomic profile generated for the patient based on gene variance analysis. 18. The method of claim 17, wherein the information on drug variants includes an identification of benefits correlated to a selected drug based on the pharmacogenomic profile of the patient. 19. The method of claim 17, wherein the information on drug variants includes an identification of negative side effects correlated to a drug to be avoided based on the pharmacogenomic profile of the patient. 20. The method of claim 14, wherein the selected risk model comprises a risk model that is selected based on a drug or disease identified in the query, and based on a genetic profile of the patient. | 2,100 |
5,585 | 5,585 | 15,465,418 | 2,138 | A computer-implemented method according to one embodiment includes identifying a plurality of segment files within an object storage system, determining all data blocks associated with the plurality of segment files within the object storage system, and mapping all the data blocks associated with the plurality of segment files to a single new file within the object storage system. | 1. A computer-implemented method, comprising:
identifying a plurality of segment files within an object storage system; determining all data blocks associated with the plurality of segment files within the object storage system; and mapping all the data blocks associated with the plurality of segment files to a single new file within the object storage system. 2. The computer-implemented method of claim 1, wherein each of the plurality of segment files represents a portion of an object stored within the object storage system. 3. The computer-implemented method of claim 1, wherein the plurality of segment files are identified in response to a completion of an uploading of the plurality of segment files to the object storage system. 4. The computer-implemented method of claim 1, wherein the plurality of segment files are identified in response to a completion of an uploading of a descriptor file associated with a single object to the object storage system. 5. The computer-implemented method of claim 4, wherein the descriptor file identifies each of the plurality of segment files as belonging to the single object within the object storage system. 6. The computer-implemented method of claim 1, wherein determining all the data blocks associated with the plurality of segment files includes determining, for each of the plurality of segment files, all data blocks identified within an inode for that segment file. 7. The computer-implemented method of claim 6, wherein for each of the plurality of segment files, the inode for that segment file identifies a location of all data blocks associated with that segment file. 8. The computer-implemented method of claim 7, wherein for each of the plurality of segment files, the data blocks associated with that segment file indicate one or more physical locations within the object storage system where data for that segment file is stored. 9. The computer-implemented method of claim 1, wherein mapping all the data blocks associated with the plurality of segment files includes creating the single new file for an entire object within the object storage system, where the single new file includes a single inode storing information about an entire object within the object storage system. 10. The computer-implemented method of claim 9, wherein mapping all the data blocks associated with the plurality of segment files includes reassigning all of the data blocks associated with the plurality of segment files to the single inode of the single new file for the entire object. 11. A computer program product for performing object consolidation within an object storage system, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, wherein the computer readable storage medium is not a transitory signal per se, the program instructions executable by a processor to cause the processor to perform a method comprising:
identifying a plurality of segment files within the object storage system, utilizing the processor; determining all data blocks associated with the plurality of segment files within the object storage system, utilizing the processor; and mapping all the data blocks associated with the plurality of segment files to a single new file within the object storage system, utilizing the processor. 12. The computer program product of claim 11, wherein each of the plurality of segment files represents a portion of an object stored within the object storage system. 13. The computer program product of claim 11, wherein the plurality of segment files are identified in response to a completion of an uploading of the plurality of segment files to the object storage system. 14. The computer program product of claim 11, wherein the plurality of segment files are identified in response to a completion of an uploading of a descriptor file associated with a single object to the object storage system. 15. The computer program product of claim 14, wherein the descriptor file identifies each of the plurality of segment files as belonging to the single object within the object storage system. 16. The computer program product of claim 11, wherein determining all the data blocks associated with the plurality of segment files includes determining, for each of the plurality of segment files, all data blocks identified within an inode for that segment file, utilizing the processor. 17. The computer program product of claim 16, wherein for each of the plurality of segment files, the inode for that segment file identifies a location of all data blocks associated with that segment file. 18. The computer program product of claim 17, wherein for each of the plurality of segment files, the data blocks associated with that segment file indicate one or more physical locations within the object storage system where data for that segment file is stored. 19. The computer program product of claim 11, wherein mapping all the data blocks associated with the plurality of segment files includes creating the single new file for an entire object within the object storage system, utilizing the processor, where the single new file includes a single inode storing information about an entire object within the object storage system. 20. A system, comprising:
a processor; and logic integrated with the processor, executable by the processor, or integrated with and executable by the processor, the logic being configured to: identify a plurality of segment files within an object storage system; determine all data blocks associated with the plurality of segment files within the object storage system; and map all the data blocks associated with the plurality of segment files to a single new file within the object storage system. | A computer-implemented method according to one embodiment includes identifying a plurality of segment files within an object storage system, determining all data blocks associated with the plurality of segment files within the object storage system, and mapping all the data blocks associated with the plurality of segment files to a single new file within the object storage system.1. A computer-implemented method, comprising:
identifying a plurality of segment files within an object storage system; determining all data blocks associated with the plurality of segment files within the object storage system; and mapping all the data blocks associated with the plurality of segment files to a single new file within the object storage system. 2. The computer-implemented method of claim 1, wherein each of the plurality of segment files represents a portion of an object stored within the object storage system. 3. The computer-implemented method of claim 1, wherein the plurality of segment files are identified in response to a completion of an uploading of the plurality of segment files to the object storage system. 4. The computer-implemented method of claim 1, wherein the plurality of segment files are identified in response to a completion of an uploading of a descriptor file associated with a single object to the object storage system. 5. The computer-implemented method of claim 4, wherein the descriptor file identifies each of the plurality of segment files as belonging to the single object within the object storage system. 6. The computer-implemented method of claim 1, wherein determining all the data blocks associated with the plurality of segment files includes determining, for each of the plurality of segment files, all data blocks identified within an inode for that segment file. 7. The computer-implemented method of claim 6, wherein for each of the plurality of segment files, the inode for that segment file identifies a location of all data blocks associated with that segment file. 8. The computer-implemented method of claim 7, wherein for each of the plurality of segment files, the data blocks associated with that segment file indicate one or more physical locations within the object storage system where data for that segment file is stored. 9. The computer-implemented method of claim 1, wherein mapping all the data blocks associated with the plurality of segment files includes creating the single new file for an entire object within the object storage system, where the single new file includes a single inode storing information about an entire object within the object storage system. 10. The computer-implemented method of claim 9, wherein mapping all the data blocks associated with the plurality of segment files includes reassigning all of the data blocks associated with the plurality of segment files to the single inode of the single new file for the entire object. 11. A computer program product for performing object consolidation within an object storage system, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, wherein the computer readable storage medium is not a transitory signal per se, the program instructions executable by a processor to cause the processor to perform a method comprising:
identifying a plurality of segment files within the object storage system, utilizing the processor; determining all data blocks associated with the plurality of segment files within the object storage system, utilizing the processor; and mapping all the data blocks associated with the plurality of segment files to a single new file within the object storage system, utilizing the processor. 12. The computer program product of claim 11, wherein each of the plurality of segment files represents a portion of an object stored within the object storage system. 13. The computer program product of claim 11, wherein the plurality of segment files are identified in response to a completion of an uploading of the plurality of segment files to the object storage system. 14. The computer program product of claim 11, wherein the plurality of segment files are identified in response to a completion of an uploading of a descriptor file associated with a single object to the object storage system. 15. The computer program product of claim 14, wherein the descriptor file identifies each of the plurality of segment files as belonging to the single object within the object storage system. 16. The computer program product of claim 11, wherein determining all the data blocks associated with the plurality of segment files includes determining, for each of the plurality of segment files, all data blocks identified within an inode for that segment file, utilizing the processor. 17. The computer program product of claim 16, wherein for each of the plurality of segment files, the inode for that segment file identifies a location of all data blocks associated with that segment file. 18. The computer program product of claim 17, wherein for each of the plurality of segment files, the data blocks associated with that segment file indicate one or more physical locations within the object storage system where data for that segment file is stored. 19. The computer program product of claim 11, wherein mapping all the data blocks associated with the plurality of segment files includes creating the single new file for an entire object within the object storage system, utilizing the processor, where the single new file includes a single inode storing information about an entire object within the object storage system. 20. A system, comprising:
a processor; and logic integrated with the processor, executable by the processor, or integrated with and executable by the processor, the logic being configured to: identify a plurality of segment files within an object storage system; determine all data blocks associated with the plurality of segment files within the object storage system; and map all the data blocks associated with the plurality of segment files to a single new file within the object storage system. | 2,100 |
5,586 | 5,586 | 15,585,890 | 2,185 | A method is disclosed to estimate energy consumed by a component in a microcontroller during operation including identifying “event” activities, where the energy consumed by the component may be determined by the number of events executed by the component, and “duration” activities, where the energy consumed may be determined by the duration of time required to execute of the activity, and determining the energy consumed by the component based on the number of events/duration of time and an energy coefficient which corresponds to the amount of energy consumed by the component to execute the activity, under given operating conditions. In an embodiment, data transfers at a bus interface may represent event activities. Apparatus to estimate the energy consumed is disclosed including bus monitors to receive signals representing data transfers at a bus interface and provide signals indicating the number of data transfers executed. | 1. An integrated circuit (IC) device comprising:
a component disposed within the IC device, the component comprising a bus interface; and an energy estimating circuit disposed within the IC device, the energy estimating circuit coupled to the bus interface and configured to:
receive data transfer signals indicating data transfers via the bus interface;
determine a first number of data transfers based on the data transfer signals;
determine a first measure of energy consumption by the component associated with the first number of data transfers and a first energy coefficient, wherein the first energy coefficient corresponds to an amount of energy consumed associated with one data transfer; and
store the first measure of energy consumption. 2. The IC device of claim 1, further comprising:
a bus monitor coupled between the bus interface and the energy estimating circuit, wherein the bus monitor is configured to receive bus interface signals from the bus interface and to provide bus monitor signals based on the bus interface signals to the energy estimating circuit, and wherein the data transfer signals comprise the bus monitor signals. 3. The IC device of claim 2, wherein the bus monitor is configured to receive bus interface signals from one of an Advanced High-Performance Bus (AHB) interface, an Advanced eXtensible Interface (“AXI”) and an x86-compatible bus interface. 4. The IC device of claim 1, wherein the energy estimating circuit further comprises a first counter circuit configured to receive the data transfer signals. 5. The IC device of claim 1, wherein the energy estimating circuit is further configured to:
receive event signals indicating events executed by the component; determine a first number of events executed based on the event signals; determine a second measure of energy consumption of the component associated with the first number of events and a second energy coefficient, wherein the second energy coefficient corresponds to an amount of energy associated with one of the events; receive duration activity signals indicating a first active time during which the component execute a first duration activity; determine a first duration of the first active time associated with the first duration activity; and determine a third measure of energy consumption of the component associated with the first duration and a third energy coefficient, wherein the third energy coefficient corresponds to an amount of power associated with the first duration activity; wherein an energy estimating circuit is further configured to store the second measure of energy consumption and the third measure of energy consumption. 6. The IC device of claim 5, wherein the energy estimating circuit further comprises a first counter circuit configured to receive the data transfer signals, a second counter circuit configured to receive the event signals, and a third counter circuit configured to receive the duration activity signals. 7. The IC device of claim 1, wherein the energy estimating circuit is further configured to receive the data transfer signals, determine the first measure of energy consumption, and store the first measure of energy consumption during runtime operation. 8. The IC device of claim 7, wherein one or more components of the IC device are configured to adjust operational settings during runtime operation based on the first measure of energy consumption. 9. The IC device of claim 1, wherein the first energy coefficient further corresponds to a first operating condition. 10. An apparatus comprising:
a microcontroller comprising:
a component disposed within the microcontroller, the component comprising a bus interface; and
an energy estimating circuit disposed within the microcontroller, wherein the energy estimating circuit is coupled to the bus interface and is configured to receive data transfer signals indicating data transfers via the bus interface, to determine a first number of data transfers based on the data transfer signals, and to provide data transfer count signals indicating the first number of data transfers; and
an external system coupled to the microcontroller. 11. The apparatus of claim 10, wherein the external system is configured to:
receive the data transfer count signals; determine a first measure of energy consumption of the component associated with the data transfer count signals and a first energy coefficient, wherein the first energy coefficient corresponds to an amount of energy associated with one data transfer; and store the first measure of energy consumption. 12. The apparatus of claim 11, wherein the external system is a debug environment running on a host system. 13. The apparatus of claim 10, wherein the energy estimating circuit is further configured to:
determine a first measure of energy consumption of the component associated with the data transfer signals and a first energy coefficient, wherein the first energy coefficient corresponds to an amount of energy associated with one data transfer; and store the first measure of energy consumption; wherein the external system is configured to access the first measure of energy consumption. 14. The apparatus of claim 10, wherein the microcontroller further comprises a bus monitor coupled between the bus interface and the energy estimating circuit, wherein the bus monitor is configured to receive bus interface signals from the bus interface and to provide bus monitor signals based on the bus interface signals to the energy estimating circuit, and wherein the data transfer signals comprise the bus monitor signals. 15. The apparatus of claim 11, wherein:
the energy estimating circuit is further configured to:
receive event signals indicating events executed by the component;
determine a first number of events executed based on the event signals;
provide event count signals indicating the first number of events executed;
receive duration activity signals indicating a first active time during which the component execute a first duration activity;
determine a first duration of the first active time based on the duration activity signals; and
provide duration signals indicating the first duration; and
the external system is further configured to:
receive the event count signals and determine a second measure of energy consumption of the component associated with the event count signals and a second energy coefficient, wherein the second energy coefficient corresponds to an amount of energy associated with one of the events; and
receive the duration activity signals and determine a third measure of energy consumption of the component associated with the duration activity signals and a third energy coefficient, wherein the third energy coefficient corresponds to an amount of power associated with the first duration activity;
the external system is further configured to store the second measure of energy consumption and the third measure of energy consumption. 16. A method of determining an energy consumption of a component disposed within an integrated circuit (IC) device, the method comprising:
receiving, by an energy estimating circuitry disposed within the IC device, data transfer signals indicating data transfers at a bus interface of the component; determining, by the energy estimating circuitry, a first number of data transfers based on the data transfer signals; determining, by the energy estimating circuitry, the energy consumption based on the first number of data transfers and a first energy coefficient, wherein the first energy coefficient corresponds to an amount of energy consumed by the component to execute one data transfer; and providing, by the energy estimating circuitry, energy consumption signals indicating the energy consumption. 17. The method of claim 16, further comprising:
receiving, by a bus monitor, a plurality of data signals from the bus interface indicating data transfers at the bus interface; providing, by the bus monitor, bus monitor signals based on the data signals; and receiving, by the energy estimating circuitry, the bus monitor signals; wherein the data transfer signals comprise the bus monitor signals. 18. The method of claim 16, wherein the energy estimating circuitry are components of the IC device and wherein the receiving, determining, and providing are performed during runtime operation. 19. The method of claim 18, further comprising adjusting operational settings of the IC device during runtime operation based on the energy consumption signals. 20. The method of claim 16, wherein the IC device is coupled to an external system configured to receive the energy consumption signals. 21. The method of claim 20, wherein the external system is a debug environment running on a host system. | A method is disclosed to estimate energy consumed by a component in a microcontroller during operation including identifying “event” activities, where the energy consumed by the component may be determined by the number of events executed by the component, and “duration” activities, where the energy consumed may be determined by the duration of time required to execute of the activity, and determining the energy consumed by the component based on the number of events/duration of time and an energy coefficient which corresponds to the amount of energy consumed by the component to execute the activity, under given operating conditions. In an embodiment, data transfers at a bus interface may represent event activities. Apparatus to estimate the energy consumed is disclosed including bus monitors to receive signals representing data transfers at a bus interface and provide signals indicating the number of data transfers executed.1. An integrated circuit (IC) device comprising:
a component disposed within the IC device, the component comprising a bus interface; and an energy estimating circuit disposed within the IC device, the energy estimating circuit coupled to the bus interface and configured to:
receive data transfer signals indicating data transfers via the bus interface;
determine a first number of data transfers based on the data transfer signals;
determine a first measure of energy consumption by the component associated with the first number of data transfers and a first energy coefficient, wherein the first energy coefficient corresponds to an amount of energy consumed associated with one data transfer; and
store the first measure of energy consumption. 2. The IC device of claim 1, further comprising:
a bus monitor coupled between the bus interface and the energy estimating circuit, wherein the bus monitor is configured to receive bus interface signals from the bus interface and to provide bus monitor signals based on the bus interface signals to the energy estimating circuit, and wherein the data transfer signals comprise the bus monitor signals. 3. The IC device of claim 2, wherein the bus monitor is configured to receive bus interface signals from one of an Advanced High-Performance Bus (AHB) interface, an Advanced eXtensible Interface (“AXI”) and an x86-compatible bus interface. 4. The IC device of claim 1, wherein the energy estimating circuit further comprises a first counter circuit configured to receive the data transfer signals. 5. The IC device of claim 1, wherein the energy estimating circuit is further configured to:
receive event signals indicating events executed by the component; determine a first number of events executed based on the event signals; determine a second measure of energy consumption of the component associated with the first number of events and a second energy coefficient, wherein the second energy coefficient corresponds to an amount of energy associated with one of the events; receive duration activity signals indicating a first active time during which the component execute a first duration activity; determine a first duration of the first active time associated with the first duration activity; and determine a third measure of energy consumption of the component associated with the first duration and a third energy coefficient, wherein the third energy coefficient corresponds to an amount of power associated with the first duration activity; wherein an energy estimating circuit is further configured to store the second measure of energy consumption and the third measure of energy consumption. 6. The IC device of claim 5, wherein the energy estimating circuit further comprises a first counter circuit configured to receive the data transfer signals, a second counter circuit configured to receive the event signals, and a third counter circuit configured to receive the duration activity signals. 7. The IC device of claim 1, wherein the energy estimating circuit is further configured to receive the data transfer signals, determine the first measure of energy consumption, and store the first measure of energy consumption during runtime operation. 8. The IC device of claim 7, wherein one or more components of the IC device are configured to adjust operational settings during runtime operation based on the first measure of energy consumption. 9. The IC device of claim 1, wherein the first energy coefficient further corresponds to a first operating condition. 10. An apparatus comprising:
a microcontroller comprising:
a component disposed within the microcontroller, the component comprising a bus interface; and
an energy estimating circuit disposed within the microcontroller, wherein the energy estimating circuit is coupled to the bus interface and is configured to receive data transfer signals indicating data transfers via the bus interface, to determine a first number of data transfers based on the data transfer signals, and to provide data transfer count signals indicating the first number of data transfers; and
an external system coupled to the microcontroller. 11. The apparatus of claim 10, wherein the external system is configured to:
receive the data transfer count signals; determine a first measure of energy consumption of the component associated with the data transfer count signals and a first energy coefficient, wherein the first energy coefficient corresponds to an amount of energy associated with one data transfer; and store the first measure of energy consumption. 12. The apparatus of claim 11, wherein the external system is a debug environment running on a host system. 13. The apparatus of claim 10, wherein the energy estimating circuit is further configured to:
determine a first measure of energy consumption of the component associated with the data transfer signals and a first energy coefficient, wherein the first energy coefficient corresponds to an amount of energy associated with one data transfer; and store the first measure of energy consumption; wherein the external system is configured to access the first measure of energy consumption. 14. The apparatus of claim 10, wherein the microcontroller further comprises a bus monitor coupled between the bus interface and the energy estimating circuit, wherein the bus monitor is configured to receive bus interface signals from the bus interface and to provide bus monitor signals based on the bus interface signals to the energy estimating circuit, and wherein the data transfer signals comprise the bus monitor signals. 15. The apparatus of claim 11, wherein:
the energy estimating circuit is further configured to:
receive event signals indicating events executed by the component;
determine a first number of events executed based on the event signals;
provide event count signals indicating the first number of events executed;
receive duration activity signals indicating a first active time during which the component execute a first duration activity;
determine a first duration of the first active time based on the duration activity signals; and
provide duration signals indicating the first duration; and
the external system is further configured to:
receive the event count signals and determine a second measure of energy consumption of the component associated with the event count signals and a second energy coefficient, wherein the second energy coefficient corresponds to an amount of energy associated with one of the events; and
receive the duration activity signals and determine a third measure of energy consumption of the component associated with the duration activity signals and a third energy coefficient, wherein the third energy coefficient corresponds to an amount of power associated with the first duration activity;
the external system is further configured to store the second measure of energy consumption and the third measure of energy consumption. 16. A method of determining an energy consumption of a component disposed within an integrated circuit (IC) device, the method comprising:
receiving, by an energy estimating circuitry disposed within the IC device, data transfer signals indicating data transfers at a bus interface of the component; determining, by the energy estimating circuitry, a first number of data transfers based on the data transfer signals; determining, by the energy estimating circuitry, the energy consumption based on the first number of data transfers and a first energy coefficient, wherein the first energy coefficient corresponds to an amount of energy consumed by the component to execute one data transfer; and providing, by the energy estimating circuitry, energy consumption signals indicating the energy consumption. 17. The method of claim 16, further comprising:
receiving, by a bus monitor, a plurality of data signals from the bus interface indicating data transfers at the bus interface; providing, by the bus monitor, bus monitor signals based on the data signals; and receiving, by the energy estimating circuitry, the bus monitor signals; wherein the data transfer signals comprise the bus monitor signals. 18. The method of claim 16, wherein the energy estimating circuitry are components of the IC device and wherein the receiving, determining, and providing are performed during runtime operation. 19. The method of claim 18, further comprising adjusting operational settings of the IC device during runtime operation based on the energy consumption signals. 20. The method of claim 16, wherein the IC device is coupled to an external system configured to receive the energy consumption signals. 21. The method of claim 20, wherein the external system is a debug environment running on a host system. | 2,100 |
5,587 | 5,587 | 15,267,256 | 2,178 | A display apparatus with touch sensing and force sensing functions includes a display panel, a first touch device, a conductive layer and a dielectric layer. The first touch device includes multiple touch sensing pads. The conductive layer includes multiple force sensing pads electrically connected to each other, where the touch sensing pads separately overlap the corresponding force sensing pads in a vertical projection direction. The dielectric layer is disposed between the conductive layer and the first touch device. The touch sensing pads, the dielectric layer and the force sensing pads form a force sensing device. | 1. A display apparatus with touch sensing and force sensing functions, comprising:
a display panel; a first touch device, comprising a plurality of touch sensing pads; a conductive layer, comprising a plurality of force sensing pads, wherein the touch sensing pads overlap the corresponding force sensing pads, respectively in a vertical projection direction; and a dielectric layer, disposed between the conductive layer and the first touch device, wherein the touch sensing pads, the dielectric layer and the force sensing pads form a force sensing device. 2. The display apparatus with touch sensing and force sensing functions according to claim 1, wherein an area of at least one of the touch sensing pads is greater than or equal to an area of one of the force sensing pads. 3. The display apparatus with touch sensing and force sensing functions according to claim 1, wherein at least one of the force sensing pads has a mesh structure that substantially covers one side of the display panel. 4. The display apparatus with touch sensing and force sensing functions according to claim 1, further comprising an outer frame, wherein the display panel is disposed in the outer frame, and the conductive layer is a part of the outer frame. 5. The display apparatus with touch sensing and force sensing functions according to claim 1, further comprising a backlight module, wherein the backlight module is located between the conductive layer and the display panel. 6. The display apparatus with touch sensing and force sensing functions according to claim 1, further comprising a backlight module, wherein the conductive layer is located between the backlight module and the display panel. 7. The display apparatus with touch sensing and force sensing functions according to claim 1, wherein the force sensing device further comprises a flexible board, and wherein the conductive layer is disposed between the dielectric layer and the flexible board. 8. The display apparatus with touch sensing and force sensing functions according to claim 1, further comprising a backlight module, disposed under the display panel, wherein the backlight module comprises:
a light guide plate; and at least one optical sheet, disposed between the light guide plate and the display panel, wherein the light guide plate and the at least one optical sheet are disposed between the display panel and the conductive layer. 9. The display apparatus with touch sensing and force sensing functions according to claim 8, wherein a material of the conductive layer comprises metal. 10. The display apparatus with touch sensing and force sensing functions according to claim 8, wherein a material of the conductive layer is made of transparent conductive material, the backlight module further comprises a reflective sheet, and the conductive layer is disposed between the light guide plate and the reflective sheet. 11. The display apparatus with touch sensing and force sensing functions according to claim 1, wherein a material of the conductive layer comprises a transparent conductive material, the conductive layer is disposed above the display panel, and the dielectric layer is disposed between the conductive layer and the display panel. 12. The display apparatus with touch sensing and force sensing functions according to claim 1, wherein the dielectric layer comprises an elastic dielectric layer, and the elastic dielectric layer comprises an optical clear adhesive (Optical Clear Adhesive, OCA) or a UV glue (UV glue). 13. The display apparatus with touch sensing and force sensing functions according to claim 1, further comprising a second touch device, wherein the first touch device is disposed outside the display panel, and the second touch device is disposed in the display panel. 14. The display apparatus with touch sensing and force sensing functions according to claim 1, wherein the dielectric layer comprises a gas with a thickness between 50 micrometers and 1000 micrometers. 15. A display apparatus with touch sensing and force sensing functions, comprising:
a display panel, having a plurality of pixels; a first touch device, overlapping at least one of the pixels, wherein the first touch device comprises a plurality of touch sensing pads; a conductive layer, overlapping at least one of the pixels, wherein the conductive layer comprises a plurality of force sensing pads; and a dielectric layer, disposed between the conductive layer and the first touch device, wherein the touch sensing pads, the dielectric layer and the force sensing pads form a force sensing device. 16. A method for driving a display apparatus with touch sensing and force sensing functions, comprising:
providing the display apparatus with touch sensing and force sensing functions, the display apparatus comprising: a display panel; a first touch device, comprising a plurality of touch sensing pads; a conductive layer, comprising a plurality of force sensing pads, wherein the touch sensing pads overlap the corresponding force sensing pads, respectively in a vertical projection direction; and a dielectric layer, disposed between the conductive layer and the first touch device, wherein the touch sensing pads, the dielectric layer and the force sensing pads form a force sensing device; in a force detection period, providing a common signal to the conductive layer, and detecting, by using the first touch device, a force sensing signal corresponding to a force; and in a touch detection period, transmitting at least one touch drive signal to the first touch device, and detecting at least one touch sensing signal from the first touch device, wherein the force detection period does not overlap the touch detection period. 17. The method for driving a display apparatus with touch sensing and force sensing functions according to claim 16, wherein the first touch device is disposed in the display panel, and the method further comprises: in a display period, providing a display signal to the display panel, wherein the touch detection period is in the display period. 18. The method for driving a display apparatus with touch sensing and force sensing functions according to claim 17, wherein the display panel comprises a plurality of scanning lines, the step of providing the display signal comprises sequentially providing a plurality of scanning signals to the corresponding scanning lines, and the step of transmitting the at least one touch drive signal comprises transmitting a plurality of touch drive signals to the corresponding touch sensing pads, wherein an interval for transmitting the touch drive signals does not overlap an interval for providing the scanning signals. 19. The method for driving a display apparatus with touch sensing and force sensing functions according to claim 16, wherein the first touch device is disposed outside the display panel, and the method further comprises: in a display period, providing a display signal to the display panel, wherein the display period overlaps at least one of the force detection period and the touch detection period. 20. A method for driving a display apparatus with touch sensing and force sensing functions, comprising:
providing the display apparatus with touch sensing and force sensing functions, comprising: a display panel; a first touch device, disposed outside the display panel, wherein the first touch device comprises a plurality of touch sensing pads; a second touch device, disposed in the display panel; a conductive layer, comprising a plurality of force sensing pads, wherein the touch sensing pads overlap the corresponding force sensing pads, respectively in a vertical projection direction; and a dielectric layer, disposed between the conductive layer and the first touch device, wherein the touch sensing pads, the dielectric layer and the force sensing pads form a force sensing device; in a force detection period, providing a common signal to the conductive layer, and detecting, by using the first touch device, a force sensing signal corresponding to a force; and in a touch detection period, transmitting at least one touch drive signal to the second touch device, and detecting at least one touch sensing signal from the second touch device. | A display apparatus with touch sensing and force sensing functions includes a display panel, a first touch device, a conductive layer and a dielectric layer. The first touch device includes multiple touch sensing pads. The conductive layer includes multiple force sensing pads electrically connected to each other, where the touch sensing pads separately overlap the corresponding force sensing pads in a vertical projection direction. The dielectric layer is disposed between the conductive layer and the first touch device. The touch sensing pads, the dielectric layer and the force sensing pads form a force sensing device.1. A display apparatus with touch sensing and force sensing functions, comprising:
a display panel; a first touch device, comprising a plurality of touch sensing pads; a conductive layer, comprising a plurality of force sensing pads, wherein the touch sensing pads overlap the corresponding force sensing pads, respectively in a vertical projection direction; and a dielectric layer, disposed between the conductive layer and the first touch device, wherein the touch sensing pads, the dielectric layer and the force sensing pads form a force sensing device. 2. The display apparatus with touch sensing and force sensing functions according to claim 1, wherein an area of at least one of the touch sensing pads is greater than or equal to an area of one of the force sensing pads. 3. The display apparatus with touch sensing and force sensing functions according to claim 1, wherein at least one of the force sensing pads has a mesh structure that substantially covers one side of the display panel. 4. The display apparatus with touch sensing and force sensing functions according to claim 1, further comprising an outer frame, wherein the display panel is disposed in the outer frame, and the conductive layer is a part of the outer frame. 5. The display apparatus with touch sensing and force sensing functions according to claim 1, further comprising a backlight module, wherein the backlight module is located between the conductive layer and the display panel. 6. The display apparatus with touch sensing and force sensing functions according to claim 1, further comprising a backlight module, wherein the conductive layer is located between the backlight module and the display panel. 7. The display apparatus with touch sensing and force sensing functions according to claim 1, wherein the force sensing device further comprises a flexible board, and wherein the conductive layer is disposed between the dielectric layer and the flexible board. 8. The display apparatus with touch sensing and force sensing functions according to claim 1, further comprising a backlight module, disposed under the display panel, wherein the backlight module comprises:
a light guide plate; and at least one optical sheet, disposed between the light guide plate and the display panel, wherein the light guide plate and the at least one optical sheet are disposed between the display panel and the conductive layer. 9. The display apparatus with touch sensing and force sensing functions according to claim 8, wherein a material of the conductive layer comprises metal. 10. The display apparatus with touch sensing and force sensing functions according to claim 8, wherein a material of the conductive layer is made of transparent conductive material, the backlight module further comprises a reflective sheet, and the conductive layer is disposed between the light guide plate and the reflective sheet. 11. The display apparatus with touch sensing and force sensing functions according to claim 1, wherein a material of the conductive layer comprises a transparent conductive material, the conductive layer is disposed above the display panel, and the dielectric layer is disposed between the conductive layer and the display panel. 12. The display apparatus with touch sensing and force sensing functions according to claim 1, wherein the dielectric layer comprises an elastic dielectric layer, and the elastic dielectric layer comprises an optical clear adhesive (Optical Clear Adhesive, OCA) or a UV glue (UV glue). 13. The display apparatus with touch sensing and force sensing functions according to claim 1, further comprising a second touch device, wherein the first touch device is disposed outside the display panel, and the second touch device is disposed in the display panel. 14. The display apparatus with touch sensing and force sensing functions according to claim 1, wherein the dielectric layer comprises a gas with a thickness between 50 micrometers and 1000 micrometers. 15. A display apparatus with touch sensing and force sensing functions, comprising:
a display panel, having a plurality of pixels; a first touch device, overlapping at least one of the pixels, wherein the first touch device comprises a plurality of touch sensing pads; a conductive layer, overlapping at least one of the pixels, wherein the conductive layer comprises a plurality of force sensing pads; and a dielectric layer, disposed between the conductive layer and the first touch device, wherein the touch sensing pads, the dielectric layer and the force sensing pads form a force sensing device. 16. A method for driving a display apparatus with touch sensing and force sensing functions, comprising:
providing the display apparatus with touch sensing and force sensing functions, the display apparatus comprising: a display panel; a first touch device, comprising a plurality of touch sensing pads; a conductive layer, comprising a plurality of force sensing pads, wherein the touch sensing pads overlap the corresponding force sensing pads, respectively in a vertical projection direction; and a dielectric layer, disposed between the conductive layer and the first touch device, wherein the touch sensing pads, the dielectric layer and the force sensing pads form a force sensing device; in a force detection period, providing a common signal to the conductive layer, and detecting, by using the first touch device, a force sensing signal corresponding to a force; and in a touch detection period, transmitting at least one touch drive signal to the first touch device, and detecting at least one touch sensing signal from the first touch device, wherein the force detection period does not overlap the touch detection period. 17. The method for driving a display apparatus with touch sensing and force sensing functions according to claim 16, wherein the first touch device is disposed in the display panel, and the method further comprises: in a display period, providing a display signal to the display panel, wherein the touch detection period is in the display period. 18. The method for driving a display apparatus with touch sensing and force sensing functions according to claim 17, wherein the display panel comprises a plurality of scanning lines, the step of providing the display signal comprises sequentially providing a plurality of scanning signals to the corresponding scanning lines, and the step of transmitting the at least one touch drive signal comprises transmitting a plurality of touch drive signals to the corresponding touch sensing pads, wherein an interval for transmitting the touch drive signals does not overlap an interval for providing the scanning signals. 19. The method for driving a display apparatus with touch sensing and force sensing functions according to claim 16, wherein the first touch device is disposed outside the display panel, and the method further comprises: in a display period, providing a display signal to the display panel, wherein the display period overlaps at least one of the force detection period and the touch detection period. 20. A method for driving a display apparatus with touch sensing and force sensing functions, comprising:
providing the display apparatus with touch sensing and force sensing functions, comprising: a display panel; a first touch device, disposed outside the display panel, wherein the first touch device comprises a plurality of touch sensing pads; a second touch device, disposed in the display panel; a conductive layer, comprising a plurality of force sensing pads, wherein the touch sensing pads overlap the corresponding force sensing pads, respectively in a vertical projection direction; and a dielectric layer, disposed between the conductive layer and the first touch device, wherein the touch sensing pads, the dielectric layer and the force sensing pads form a force sensing device; in a force detection period, providing a common signal to the conductive layer, and detecting, by using the first touch device, a force sensing signal corresponding to a force; and in a touch detection period, transmitting at least one touch drive signal to the second touch device, and detecting at least one touch sensing signal from the second touch device. | 2,100 |
5,588 | 5,588 | 15,044,165 | 2,154 | Techniques are provided for automatically generating a hierarchical representation of a navigation order within a web browsing session in conjunction with a traversing of a plurality of websites within the browsing session: flagging a subset of the plurality of websites; displaying a user interface in conjunction with the browser such that the user interface provides a traversal control with respect to the subset in accordance with the hierarchical representation; and traversing the subset utilizing the traversal control. | 1. A method, comprising;
automatically generating a hierarchical representation of a navigation order within a web browsing session in conjunction with a traversing of a plurality of websites within the browsing session; flagging a subset of the plurality of websites; displaying a user interface in conjunction with the browser such that the user interface provides a traversal control with respect to the subset in accordance with the hierarchical representation; and traversing the subset utilizing the traversal control. 2. The method of claim 1, wherein the user interface provides a capability to select and display a website of the plurality of websites. 3. The method of claim wherein the user interface provides a capability to reorder the hierarchical representation. 4. The method of claim 1, wherein the user interface provides a capability to remove a website from the hierarchical representation. 5. The method of claim 1, further comprising:
detecting an end of the browser session; and removing the subset form the hierarchical representation in response to the detecting. 6. The method of claim 1, further comprising:
automatically generating a second hierarchical representation of a second navigation order within the we browsing session in conjunction with a second traversing of a second plurality of websites within the browsing session; flagging a second subset of the second plurality of websites; displaying the user interface in conjunction with the browser such that the user interface provides the traversal control with respect to the second subset in accordance with the second hierarchical representation; and traversing the second subset utilizing the traversal control. 7. The method of claim 1, further comprising:
generating a traversal history corresponding to the traversing of the subset utilizing the traversal control; and utilizing the traversal history to determine a particular website of the plurality of websites to focus on during the traversing. | Techniques are provided for automatically generating a hierarchical representation of a navigation order within a web browsing session in conjunction with a traversing of a plurality of websites within the browsing session: flagging a subset of the plurality of websites; displaying a user interface in conjunction with the browser such that the user interface provides a traversal control with respect to the subset in accordance with the hierarchical representation; and traversing the subset utilizing the traversal control.1. A method, comprising;
automatically generating a hierarchical representation of a navigation order within a web browsing session in conjunction with a traversing of a plurality of websites within the browsing session; flagging a subset of the plurality of websites; displaying a user interface in conjunction with the browser such that the user interface provides a traversal control with respect to the subset in accordance with the hierarchical representation; and traversing the subset utilizing the traversal control. 2. The method of claim 1, wherein the user interface provides a capability to select and display a website of the plurality of websites. 3. The method of claim wherein the user interface provides a capability to reorder the hierarchical representation. 4. The method of claim 1, wherein the user interface provides a capability to remove a website from the hierarchical representation. 5. The method of claim 1, further comprising:
detecting an end of the browser session; and removing the subset form the hierarchical representation in response to the detecting. 6. The method of claim 1, further comprising:
automatically generating a second hierarchical representation of a second navigation order within the we browsing session in conjunction with a second traversing of a second plurality of websites within the browsing session; flagging a second subset of the second plurality of websites; displaying the user interface in conjunction with the browser such that the user interface provides the traversal control with respect to the second subset in accordance with the second hierarchical representation; and traversing the second subset utilizing the traversal control. 7. The method of claim 1, further comprising:
generating a traversal history corresponding to the traversing of the subset utilizing the traversal control; and utilizing the traversal history to determine a particular website of the plurality of websites to focus on during the traversing. | 2,100 |
5,589 | 5,589 | 14,549,952 | 2,176 | During operation of a program, various different editing actions can be performed on data (e.g., image or video data) in a document. The data includes multiple objects, each of which is a user-selectable element of the data, such as a line, a shape, or a filter applied to the data. A record of actions taken on objects in the data is maintained, and the actions can be undone. A document-based undo operation can be performed, which undoes the last action performed in the document. An object-based undo can also be performed, which undoes the last action performed on a selected one or more objects in the document. A document-based redo operation can be performed, which redoes the last action undone in the document. An object-based redo can also be performed, which redoes the last action undone on a selected one or more objects in the document. | 1. A method comprising:
adding, in response to a user edit to data of a document, a session to an undo record in a last in first out manner, the session indicating an action performed as part of the user edit as well as one or more objects of the data on which the action was performed, each of the one or more objects comprising a user-selectable element of the data; in response to receiving a document-based undo request, performing a document-based undo operation by undoing an action in a session at a top of the undo record; and in response to receiving an object-based undo request, performing an object-based undo operation by
identifying a topmost session of the undo record that includes a first selected object,
percolating the identified session to the top of the undo record, and
undoing the action in the identified session. 2. A method as recited in claim 1, the method further comprising:
in response to receiving the document-based undo request, moving the session at the top of the undo record to a top of a redo record; and in response to receiving the object-based undo request, moving the identified session to the top of the redo record. 3. A method as recited in claim 2, the method further comprising, in response to receiving a document-based redo request:
redoing an action in a particular session at the top of the redo record; and moving the particular session to the top of the undo record. 4. A method as recited in claim 2, the method further comprising, in response to receiving an object-based redo request, performing an object-based redo operation by:
identifying a topmost session of the redo record that includes a second selected object; percolating the identified session of the redo record to the top of the redo record; redoing the action in the identified session of the redo record; and moving the identified session of the redo record to the top of the undo record. 5. A method as recited in claim 4, the method further comprising:
in response to receiving a document-based redo request, performing a document-based redo operation by redoing an action in a particular session at a top of the redo record, and moving the particular session to the top of the undo record; and performing each of the document-based undo operation, the object-based undo operation, the object-based redo operation, and the document-based redo operation multiple times in any order. 6. A method as recited in claim 1, the first selected object comprising a single user-selected object. 7. A method as recited in claim 1, the first selected object comprising one of multiple user-selected objects, and the identifying comprising identifying a topmost session of the undo record that includes, as one of one or more objects of the session, at least one of the multiple user-selected objects. 8. A method as recited in claim 7, further comprising displaying feedback indicating the multiple user-selected objects. 9. A method as recited in claim 7, the multiple user-selected objects including one or more objects that are invisible or partially obscured to a user. 10. A method as recited in claim 1, the method further comprising automatically selecting one or more objects based on data being displayed, and the identifying comprising identifying a session that includes at least one of the one or more objects. 11. A method comprising:
storing multiple sessions in an undo record in a last in first out manner, each of the multiple sessions indicating an action performed on data of a document as well as one or more objects of the data on which the action was performed, each of the one or more objects comprising a user-selectable element of the data; performing a document-based undo operation by undoing an action in a session at a top of the undo record; and performing an object-based undo operation by
identifying a topmost session of the undo record that includes a first selected object,
percolating the identified session to the top of the undo record, and
undoing the action in the identified session. 12. A method as recited in claim 11, the performing the document-based undo operation further comprising moving the session at the top of the undo record to a top of a redo record, and the performing the object-based undo operation further comprising moving the identified session to the top of the redo record. 13. A method as recited in claim 12, the method further comprising, performing a document-based redo operation by redoing an action in a particular session at the top of the redo record, and moving the particular session to the top of the undo record. 14. A method as recited in claim 12, the method further comprising performing an object-based redo operation by:
identifying a topmost session of the redo record that includes a second selected object; percolating the identified session of the redo record to the top of the redo record; redoing the action in the identified session of the redo record; and moving the identified session of the redo record to the top of the undo record. 15. A computing device comprising:
an input module configured to receive user inputs to the computing device, the user inputs identifying actions performed on data of a document displayed by the computing device; an action logging module configured to store multiple sessions, in an undo record in a last in first out manner, each session of the multiple sessions indicating an action performed as part of a user input as well as one or more objects of the data on which the action was performed, each of the one or more objects comprising a user-selectable element of the data; and an action undo module configured to:
perform a document-based undo operation by undoing an action in a session at a top of the undo record, and
perform an object-based undo operation by identifying a topmost session of the undo record that includes a first selected object, percolating the identified session to the top of the undo record, and undoing the action in the identified session. 16. A computing device as recited in claim 15, the first selected object being at least one object of one or more user-selected objects. 17. A computing device as recited in claim 15, the first selected object being at least one of one or more automatically selected objects that are automatically selected in a hierarchical manner based on which of multiple hierarchical levels of the document is being operated on. 18. A computing device as recited in claim 15, the action undo module being further configured to perform the document-based undo operation by moving the session at the top of the undo record to a top of a redo record, and perform the object-based undo operation by moving the identified session to the top of the redo record. 19. A computing device as recited in claim 18, further comprising an action redo module configured to perform a document-based redo operation by redoing an action in a particular session at the top of the redo record, and moving the particular session to the top of the undo record. 20. A computing device as recited in claim 18, further comprising an action redo module configured to perform an object-based redo operation by:
identifying a topmost session of the redo record that includes a second selected object; percolating the identified session of the redo record to the top of the redo record; redoing the action in the identified session of the redo record; and moving the identified session of the redo record to the top of the undo record. | During operation of a program, various different editing actions can be performed on data (e.g., image or video data) in a document. The data includes multiple objects, each of which is a user-selectable element of the data, such as a line, a shape, or a filter applied to the data. A record of actions taken on objects in the data is maintained, and the actions can be undone. A document-based undo operation can be performed, which undoes the last action performed in the document. An object-based undo can also be performed, which undoes the last action performed on a selected one or more objects in the document. A document-based redo operation can be performed, which redoes the last action undone in the document. An object-based redo can also be performed, which redoes the last action undone on a selected one or more objects in the document.1. A method comprising:
adding, in response to a user edit to data of a document, a session to an undo record in a last in first out manner, the session indicating an action performed as part of the user edit as well as one or more objects of the data on which the action was performed, each of the one or more objects comprising a user-selectable element of the data; in response to receiving a document-based undo request, performing a document-based undo operation by undoing an action in a session at a top of the undo record; and in response to receiving an object-based undo request, performing an object-based undo operation by
identifying a topmost session of the undo record that includes a first selected object,
percolating the identified session to the top of the undo record, and
undoing the action in the identified session. 2. A method as recited in claim 1, the method further comprising:
in response to receiving the document-based undo request, moving the session at the top of the undo record to a top of a redo record; and in response to receiving the object-based undo request, moving the identified session to the top of the redo record. 3. A method as recited in claim 2, the method further comprising, in response to receiving a document-based redo request:
redoing an action in a particular session at the top of the redo record; and moving the particular session to the top of the undo record. 4. A method as recited in claim 2, the method further comprising, in response to receiving an object-based redo request, performing an object-based redo operation by:
identifying a topmost session of the redo record that includes a second selected object; percolating the identified session of the redo record to the top of the redo record; redoing the action in the identified session of the redo record; and moving the identified session of the redo record to the top of the undo record. 5. A method as recited in claim 4, the method further comprising:
in response to receiving a document-based redo request, performing a document-based redo operation by redoing an action in a particular session at a top of the redo record, and moving the particular session to the top of the undo record; and performing each of the document-based undo operation, the object-based undo operation, the object-based redo operation, and the document-based redo operation multiple times in any order. 6. A method as recited in claim 1, the first selected object comprising a single user-selected object. 7. A method as recited in claim 1, the first selected object comprising one of multiple user-selected objects, and the identifying comprising identifying a topmost session of the undo record that includes, as one of one or more objects of the session, at least one of the multiple user-selected objects. 8. A method as recited in claim 7, further comprising displaying feedback indicating the multiple user-selected objects. 9. A method as recited in claim 7, the multiple user-selected objects including one or more objects that are invisible or partially obscured to a user. 10. A method as recited in claim 1, the method further comprising automatically selecting one or more objects based on data being displayed, and the identifying comprising identifying a session that includes at least one of the one or more objects. 11. A method comprising:
storing multiple sessions in an undo record in a last in first out manner, each of the multiple sessions indicating an action performed on data of a document as well as one or more objects of the data on which the action was performed, each of the one or more objects comprising a user-selectable element of the data; performing a document-based undo operation by undoing an action in a session at a top of the undo record; and performing an object-based undo operation by
identifying a topmost session of the undo record that includes a first selected object,
percolating the identified session to the top of the undo record, and
undoing the action in the identified session. 12. A method as recited in claim 11, the performing the document-based undo operation further comprising moving the session at the top of the undo record to a top of a redo record, and the performing the object-based undo operation further comprising moving the identified session to the top of the redo record. 13. A method as recited in claim 12, the method further comprising, performing a document-based redo operation by redoing an action in a particular session at the top of the redo record, and moving the particular session to the top of the undo record. 14. A method as recited in claim 12, the method further comprising performing an object-based redo operation by:
identifying a topmost session of the redo record that includes a second selected object; percolating the identified session of the redo record to the top of the redo record; redoing the action in the identified session of the redo record; and moving the identified session of the redo record to the top of the undo record. 15. A computing device comprising:
an input module configured to receive user inputs to the computing device, the user inputs identifying actions performed on data of a document displayed by the computing device; an action logging module configured to store multiple sessions, in an undo record in a last in first out manner, each session of the multiple sessions indicating an action performed as part of a user input as well as one or more objects of the data on which the action was performed, each of the one or more objects comprising a user-selectable element of the data; and an action undo module configured to:
perform a document-based undo operation by undoing an action in a session at a top of the undo record, and
perform an object-based undo operation by identifying a topmost session of the undo record that includes a first selected object, percolating the identified session to the top of the undo record, and undoing the action in the identified session. 16. A computing device as recited in claim 15, the first selected object being at least one object of one or more user-selected objects. 17. A computing device as recited in claim 15, the first selected object being at least one of one or more automatically selected objects that are automatically selected in a hierarchical manner based on which of multiple hierarchical levels of the document is being operated on. 18. A computing device as recited in claim 15, the action undo module being further configured to perform the document-based undo operation by moving the session at the top of the undo record to a top of a redo record, and perform the object-based undo operation by moving the identified session to the top of the redo record. 19. A computing device as recited in claim 18, further comprising an action redo module configured to perform a document-based redo operation by redoing an action in a particular session at the top of the redo record, and moving the particular session to the top of the undo record. 20. A computing device as recited in claim 18, further comprising an action redo module configured to perform an object-based redo operation by:
identifying a topmost session of the redo record that includes a second selected object; percolating the identified session of the redo record to the top of the redo record; redoing the action in the identified session of the redo record; and moving the identified session of the redo record to the top of the undo record. | 2,100 |
5,590 | 5,590 | 13,609,102 | 2,142 | Methods and systems for simulating light interaction and physical materials in a graphical user interface (GUI) of a resource-constrained device are provided. Simulating physical materials, such as glass and metal, in a GUI can allow a user to feel more natural in interacting with the GUI. The user experience can be further enhanced if the simulated physical materials in the GUI can interact with the device's environment in a manner similar to how the actual physical materials would interact. However, continually polling various sensors can be resource-intensive, especially for resource-constrained mobile devices. Accordingly, a mobile device can intelligently determine whether to begin a reduced detail mode, and then render user interface objects in the reduced detail mode to conserve resources. | 1. A computer-implemented graphical user interface method, comprising:
receiving sensor data from one or more sensors disposed within a mobile device; determining, based on the sensor data, to begin a reduced detail mode; and generating at least one graphical user interface object in the reduced detail mode, wherein the at least one graphical user interface object is generated based on additional sensor data. 2. The method of claim 1, wherein generating the at least one graphical user interface object includes simulating light interaction with the at least one graphical user interface object based on the additional sensor data. 3. The method of claim 2, wherein simulating light interaction based on the additional sensor data includes simulating light interaction based on one or both of motion and orientation data. 4. The method of claim 2, wherein simulating light interaction includes alpha compositing one or more light source layers, and wherein the one or more light source layers change based on one or both of motion and orientation data. 5. The method of claim 1, wherein the determining is based on motion data. 6. The method of claim 5, wherein the determining includes determining a motion value based on the motion data and determining that the motion value is outside a predetermined range. 7. The method of claim 1, wherein generating the at least one graphical user interface object in the reduced detail mode includes selecting, from a set of at least first and second assets, the first asset, wherein the first asset is of lower quality than the second asset. 8. The method of claim 1, wherein generating the at least one graphical user interface object in the reduced detail mode includes selecting, from a set of at least first and second rendering algorithms, a first rendering algorithm, wherein the first rendering algorithm is less computationally intensive than the second rendering algorithm. 9. The method of claim 8, wherein the first rendering algorithm includes selecting a pre-rendered asset and the second rendering algorithm includes rendering a three-dimensional asset. 10. The method of claim 1, wherein generating the at least one graphical user interface object in the reduced detail mode includes reducing one or both of a frequency of polling sensors and a frame rate. 11. The method of claim 1, wherein generating the at least one graphical user interface object in the reduced detail mode includes generating the at least one graphical user interface object based on a detail level. 12. The method of claim 11, further comprising determining the detail level based on a bell curve function of motion data. 13. A non-transitory computer readable storage medium having stored therein instructions, which when executed by a mobile device having one or more sensors, cause the device to perform a method comprising:
receiving sensor data from the one or more sensors; determining, based on the sensor data, to begin a reduced detail mode; and generating at least one graphical user interface object in the reduced detail mode, wherein the at least one graphical user interface object is generated based on additional sensor data. 14. The non-transitory computer readable storage medium of claim 13, wherein generating the at least one graphical user interface object includes simulating light interaction with the at least one graphical user interface object based on the additional sensor data. 15. The non-transitory computer readable storage medium of claim 14, wherein simulating light interaction based on the additional sensor data includes simulating light interaction based on one or both of motion and orientation data. 16. The non-transitory computer readable storage medium of claim 14, wherein simulating light interaction includes alpha compositing one or more light source layers, and wherein the one or more light source layers change based on one or both of motion and orientation data. 17. The non-transitory computer readable storage medium of claim 13, wherein the determining is based on motion data. 18. The non-transitory computer readable storage medium of claim 17, wherein the determining includes determining a motion value based on the motion data and determining that the motion value is outside a predetermined range. 19. The non-transitory computer readable storage medium of claim 13, wherein generating the at least one graphical user interface object in the reduced detail mode includes selecting, from a set of at least first and second assets, the first asset, wherein the first asset is of lower quality than the second asset. 20. The non-transitory computer readable storage medium of claim 13, wherein generating the at least one graphical user interface object in the reduced detail mode includes selecting, from a set of at least first and second rendering algorithms, a first rendering algorithm, wherein the first rendering algorithm is less computationally intensive than the second rendering algorithm. 21. The non-transitory computer readable storage medium of claim 20, wherein the first rendering algorithm includes selecting a pre-rendered asset and the second rendering algorithm includes rendering a three-dimensional asset. 22. The non-transitory computer readable storage medium of claim 13, wherein generating the at least one graphical user interface object in the reduced detail mode includes reducing one or both of a frequency of polling sensors and a frame rate. 23. The non-transitory computer readable storage medium of claim 13, wherein generating the at least one graphical user interface object in the reduced detail mode includes generating the at least one graphical user interface object based on a detail level. 24. The non-transitory computer readable storage medium of claim 23, the method further comprising determining the detail level based on a bell curve function of motion data. 25. A mobile device, comprising:
one or more processors; a memory; one or more sensors; and one or more programs stored in the memory, wherein the one or more programs are configured to be executed by the one or more processors, the one or more programs including instructions for: receiving sensor data from the one or more sensors; determining, based on the sensor data, to begin a reduced detail mode; and generating at least one graphical user interface object in the reduced detail mode, wherein the at least one graphical user interface object is generated based on additional sensor data. | Methods and systems for simulating light interaction and physical materials in a graphical user interface (GUI) of a resource-constrained device are provided. Simulating physical materials, such as glass and metal, in a GUI can allow a user to feel more natural in interacting with the GUI. The user experience can be further enhanced if the simulated physical materials in the GUI can interact with the device's environment in a manner similar to how the actual physical materials would interact. However, continually polling various sensors can be resource-intensive, especially for resource-constrained mobile devices. Accordingly, a mobile device can intelligently determine whether to begin a reduced detail mode, and then render user interface objects in the reduced detail mode to conserve resources.1. A computer-implemented graphical user interface method, comprising:
receiving sensor data from one or more sensors disposed within a mobile device; determining, based on the sensor data, to begin a reduced detail mode; and generating at least one graphical user interface object in the reduced detail mode, wherein the at least one graphical user interface object is generated based on additional sensor data. 2. The method of claim 1, wherein generating the at least one graphical user interface object includes simulating light interaction with the at least one graphical user interface object based on the additional sensor data. 3. The method of claim 2, wherein simulating light interaction based on the additional sensor data includes simulating light interaction based on one or both of motion and orientation data. 4. The method of claim 2, wherein simulating light interaction includes alpha compositing one or more light source layers, and wherein the one or more light source layers change based on one or both of motion and orientation data. 5. The method of claim 1, wherein the determining is based on motion data. 6. The method of claim 5, wherein the determining includes determining a motion value based on the motion data and determining that the motion value is outside a predetermined range. 7. The method of claim 1, wherein generating the at least one graphical user interface object in the reduced detail mode includes selecting, from a set of at least first and second assets, the first asset, wherein the first asset is of lower quality than the second asset. 8. The method of claim 1, wherein generating the at least one graphical user interface object in the reduced detail mode includes selecting, from a set of at least first and second rendering algorithms, a first rendering algorithm, wherein the first rendering algorithm is less computationally intensive than the second rendering algorithm. 9. The method of claim 8, wherein the first rendering algorithm includes selecting a pre-rendered asset and the second rendering algorithm includes rendering a three-dimensional asset. 10. The method of claim 1, wherein generating the at least one graphical user interface object in the reduced detail mode includes reducing one or both of a frequency of polling sensors and a frame rate. 11. The method of claim 1, wherein generating the at least one graphical user interface object in the reduced detail mode includes generating the at least one graphical user interface object based on a detail level. 12. The method of claim 11, further comprising determining the detail level based on a bell curve function of motion data. 13. A non-transitory computer readable storage medium having stored therein instructions, which when executed by a mobile device having one or more sensors, cause the device to perform a method comprising:
receiving sensor data from the one or more sensors; determining, based on the sensor data, to begin a reduced detail mode; and generating at least one graphical user interface object in the reduced detail mode, wherein the at least one graphical user interface object is generated based on additional sensor data. 14. The non-transitory computer readable storage medium of claim 13, wherein generating the at least one graphical user interface object includes simulating light interaction with the at least one graphical user interface object based on the additional sensor data. 15. The non-transitory computer readable storage medium of claim 14, wherein simulating light interaction based on the additional sensor data includes simulating light interaction based on one or both of motion and orientation data. 16. The non-transitory computer readable storage medium of claim 14, wherein simulating light interaction includes alpha compositing one or more light source layers, and wherein the one or more light source layers change based on one or both of motion and orientation data. 17. The non-transitory computer readable storage medium of claim 13, wherein the determining is based on motion data. 18. The non-transitory computer readable storage medium of claim 17, wherein the determining includes determining a motion value based on the motion data and determining that the motion value is outside a predetermined range. 19. The non-transitory computer readable storage medium of claim 13, wherein generating the at least one graphical user interface object in the reduced detail mode includes selecting, from a set of at least first and second assets, the first asset, wherein the first asset is of lower quality than the second asset. 20. The non-transitory computer readable storage medium of claim 13, wherein generating the at least one graphical user interface object in the reduced detail mode includes selecting, from a set of at least first and second rendering algorithms, a first rendering algorithm, wherein the first rendering algorithm is less computationally intensive than the second rendering algorithm. 21. The non-transitory computer readable storage medium of claim 20, wherein the first rendering algorithm includes selecting a pre-rendered asset and the second rendering algorithm includes rendering a three-dimensional asset. 22. The non-transitory computer readable storage medium of claim 13, wherein generating the at least one graphical user interface object in the reduced detail mode includes reducing one or both of a frequency of polling sensors and a frame rate. 23. The non-transitory computer readable storage medium of claim 13, wherein generating the at least one graphical user interface object in the reduced detail mode includes generating the at least one graphical user interface object based on a detail level. 24. The non-transitory computer readable storage medium of claim 23, the method further comprising determining the detail level based on a bell curve function of motion data. 25. A mobile device, comprising:
one or more processors; a memory; one or more sensors; and one or more programs stored in the memory, wherein the one or more programs are configured to be executed by the one or more processors, the one or more programs including instructions for: receiving sensor data from the one or more sensors; determining, based on the sensor data, to begin a reduced detail mode; and generating at least one graphical user interface object in the reduced detail mode, wherein the at least one graphical user interface object is generated based on additional sensor data. | 2,100 |
5,591 | 5,591 | 14,564,432 | 2,159 | An XML fragmenting mechanism uses an XML schema for the XML file to split up the XML file in a hierarchal structure of data blocks for storage in a storage system with a limited block size such as a cluster coordination service. The XML fragmenting mechanism creates an XML file map to document the structure of the XML file in the storage system. The XML fragmenting mechanism stores the data blocks in the storage system according to the XML file map and supports retrieval of all or part of the data in a format that supports XML validation. | 1. An apparatus comprising:
at least one processor; a memory coupled to the at least one processor; an extensible markup language (XML) file with a parent element and a child element corresponding to the parent element; an XML schema corresponding to the XML file; and an XML fragmenting mechanism residing in the memory and executed by the at least one processor that intelligently splits the XML file based on the XML schema into a plurality of data blocks that have a pre-determined maximum size, wherein the XML fragmenting mechanism stores the plurality of data blocks by placing a first data block corresponding to a parent element in a first location and a second data block corresponding to a child element in a second location. 2. The apparatus of claim 1 wherein the parent element and the child element are converted to a binary state and stored in the first and second data blocks. 3. The apparatus of claim 1 wherein the XML fragmenting mechanism stores the first and second data blocks into a data storage system in a hierarchal structure. 4. The apparatus of claim 3 wherein the XML fragmenting mechanism creates an XML map that indicates the storage location of the first and second data blocks in data storage system. 5. The apparatus of claim 4 wherein the XML map is stored in the data storage system. 6. The apparatus of claim 3 wherein the data storage system is a cluster coordination service. 7. The apparatus of claim 1 wherein the XML fragmenting mechanism stores the first data block corresponding to the parent element in a base directory and stores the second data block corresponding to the child element in a sub-directory under the base directory. 8. The apparatus of claim 3 wherein the XML fragmenting mechanism retrieves data blocks from the data storage system and builds a valid output XML file from a subset that is less than all the objects in the XML file. 9. The apparatus of claim 3 wherein the XML fragmenting mechanism retrieves data blocks from the data storage system and builds a valid output XML file that represents the XML file before fragmentation. 10. An apparatus comprising:
at least one processor; a memory coupled to the at least one processor; an extensible markup language (XML) file with a parent element and a child element corresponding to the parent element; an XML schema corresponding to the XML file; an XML fragmenting mechanism residing in the memory and executed by the at least one processor that splits the XML file based on the XML schema into a plurality of data blocks that have a pre-determined maximum size, wherein the XML fragmenting mechanism creates an XML map that indicates storage locations of the plurality of data blocks in a hierarchal structure in a cluster coordination service, and stores the plurality of data blocks in the cluster coordination service by placing a first data block corresponding to a parent element in a base directory and a second data block corresponding to a child element in a sub-directory under the base directory; and wherein the XML fragmenting mechanism retrieves data blocks from the data storage system and builds a valid output XML file from a subset of the XML file. 11-20. (canceled) | An XML fragmenting mechanism uses an XML schema for the XML file to split up the XML file in a hierarchal structure of data blocks for storage in a storage system with a limited block size such as a cluster coordination service. The XML fragmenting mechanism creates an XML file map to document the structure of the XML file in the storage system. The XML fragmenting mechanism stores the data blocks in the storage system according to the XML file map and supports retrieval of all or part of the data in a format that supports XML validation.1. An apparatus comprising:
at least one processor; a memory coupled to the at least one processor; an extensible markup language (XML) file with a parent element and a child element corresponding to the parent element; an XML schema corresponding to the XML file; and an XML fragmenting mechanism residing in the memory and executed by the at least one processor that intelligently splits the XML file based on the XML schema into a plurality of data blocks that have a pre-determined maximum size, wherein the XML fragmenting mechanism stores the plurality of data blocks by placing a first data block corresponding to a parent element in a first location and a second data block corresponding to a child element in a second location. 2. The apparatus of claim 1 wherein the parent element and the child element are converted to a binary state and stored in the first and second data blocks. 3. The apparatus of claim 1 wherein the XML fragmenting mechanism stores the first and second data blocks into a data storage system in a hierarchal structure. 4. The apparatus of claim 3 wherein the XML fragmenting mechanism creates an XML map that indicates the storage location of the first and second data blocks in data storage system. 5. The apparatus of claim 4 wherein the XML map is stored in the data storage system. 6. The apparatus of claim 3 wherein the data storage system is a cluster coordination service. 7. The apparatus of claim 1 wherein the XML fragmenting mechanism stores the first data block corresponding to the parent element in a base directory and stores the second data block corresponding to the child element in a sub-directory under the base directory. 8. The apparatus of claim 3 wherein the XML fragmenting mechanism retrieves data blocks from the data storage system and builds a valid output XML file from a subset that is less than all the objects in the XML file. 9. The apparatus of claim 3 wherein the XML fragmenting mechanism retrieves data blocks from the data storage system and builds a valid output XML file that represents the XML file before fragmentation. 10. An apparatus comprising:
at least one processor; a memory coupled to the at least one processor; an extensible markup language (XML) file with a parent element and a child element corresponding to the parent element; an XML schema corresponding to the XML file; an XML fragmenting mechanism residing in the memory and executed by the at least one processor that splits the XML file based on the XML schema into a plurality of data blocks that have a pre-determined maximum size, wherein the XML fragmenting mechanism creates an XML map that indicates storage locations of the plurality of data blocks in a hierarchal structure in a cluster coordination service, and stores the plurality of data blocks in the cluster coordination service by placing a first data block corresponding to a parent element in a base directory and a second data block corresponding to a child element in a sub-directory under the base directory; and wherein the XML fragmenting mechanism retrieves data blocks from the data storage system and builds a valid output XML file from a subset of the XML file. 11-20. (canceled) | 2,100 |
5,592 | 5,592 | 15,204,943 | 2,169 | Techniques for recommending mobile device activities, such as accessing mobile applications and/or mobile Web pages, are described. Some embodiments provide an Activity Recommendation System (“ARS”) configured to recommend relevant activities for a user to perform with a mobile device, based on context of the mobile device. In one embodiment, the ARS recommends mobile applications based content items (e.g., Web pages, images, videos) that are being currently accessed via the mobile device. The ARS may process information about mobile applications and content items to determine semantic information, such as entities and/or categories referenced or associated therewith. The ARS may then use the semantic information to determine mobile applications that have semantic information that is at least similar to that of a content item accessed via a mobile device. | 1-31. (canceled) 32. A computer-implemented method for discovering mobile applications, the method comprising:
generating in a data store of a computing system an index of semantic information for multiple mobile applications from a plurality of sources including at least one of a Web site, a blog, a news feed, a video feed, a social network, an application store, and/or an information service, the semantic information including identified entities and/or categories related to the multiple mobile applications, wherein the identification is performed using natural language processing techniques; receiving a semantic search query, the query specifying at least one entity or category; determining from the index one or more of the multiple mobile applications that have associated semantic information matching the received semantic search query or that have associated semantic information that is related to the received semantic search query through an entity and/or category that is related to an entity and/or category stored in the index of semantic information; and transmitting indications of the determined one or more mobile applications in response to the semantic search query. 33. The method of claim 32 wherein generating the index includes processing information about each of the multiple mobile applications, including at least one of a summary of the application, a description of the application, a title for the application, instructions for using the application, and a review of the application. 34. The method of claim 33 wherein processing the information about each of the multiple mobile applications includes determining an entity and/or a category referenced by the processed information and storing a relationship between the entity and/or category referenced and a corresponding entity and/or category stored in the data store. 35. The method of claim 32 wherein generating the index includes storing a mapping between an entity or category and one or more of the multiple mobile applications that are related to the entity or category. 36. The method of claim 32 wherein determining from the index the one or more mobile applications that have associated semantic information matching the received semantic search query includes accessing the index to locate mobile applications that are mapped to the entity or category specified by the semantic search query. 37. The method of claim 32 wherein receiving the semantic search query includes receiving a search query that requests mobile applications about a specified entity or category, and wherein determining from the index the one or more mobile applications includes locating one or more mobile applications that are about the specified entity or category. 38. The method of claim 32 wherein receiving the semantic search query includes receiving a search query that requests mobile applications that are indirectly related to a specified entity or category, and wherein determining from the index the one or more mobile applications includes locating one or more mobile applications that are about an entity or category that is related to the specified entity or category. 39. The method of claim 32 wherein the multiple mobile applications include applications that execute at least in part on mobile devices. 40. The method of claim 32 wherein the multiple mobile applications include Web sites configured for use by mobile devices. 41. The method of claim 32 wherein receiving the semantic search query includes receiving the semantic search query from a mobile application recommender module executing on a mobile device, the recommender module configured to transmit the semantic search query in response to receiving indication of access to a content item accessed via the mobile device, the content item referencing the specified at least one entity or category. 42. A computing system configured to discover mobile applications comprising:
a computer processor; a memory; code logic that is stored in the memory and that is configured, when executed by the computer processor, to:
generate an index in a data store in the memory of the computing system of semantic information for multiple mobile applications from a plurality of sources including at least one of a Web site, a blog, a news feed, a video feed, a social network, an application store, and/or an information service, the semantic information including identified entities and/or categories related to the multiple mobile applications, wherein the identification is performed using natural language processing techniques;
receive a semantic search query, the query specifying at least one entity or category;
determine from the index one or more of the multiple mobile applications that have associated semantic information matching the received semantic search query or that have associated semantic information that is related to the received semantic search query through an entity and/or category that is related to an entity and/or category stored in the index of semantic information; and
transmit indications of the determined one or more mobile applications in response to the semantic search query. 43. The computing system of claim 42 wherein the code logic includes software instructions for execution in the memory of the computing system. 44. The computing system of claim 42 wherein the code logic includes an activity recommendation system. 45. The computing system of claim 44 wherein the activity recommendation system includes a client portion executing on a mobile device. 46. The computing system of claim 42 wherein the code logic is configured to recommend activities to at least one of a personal digital assistant, a smart phone, a laptop computer, a notebook computer, a mobile phone, and/or a third-party application. 47. The computing system of claim 42 wherein the mobile device is a tablet computer. 48. The computing system of claim 42 wherein the data store includes an application index and an entity store. 49. The computing system of claim 42 wherein the code logic generates the index about each of the multiple mobile applications by determining an entity and/or a category referenced by the semantic information and storing a relationship between the to entity and/or category referenced and the corresponding entity and/or category in the data store. 50. A non-transitory computer-readable medium containing instructions for controlling a computer processor to discover mobile applications by performing method comprising:
generating in a data store of a computing system an index of semantic information for multiple mobile applications from a plurality of sources including at least one of a Web site, a blog, a news feed, a video feed, a social network, an application store, and/or an information service, the semantic information including identified entities and/or categories related to the multiple mobile applications, wherein the identification is performed using natural language processing techniques; receiving a semantic search query, the query specifying at least one entity or category; determining from the index one or more of the multiple mobile applications that have associated semantic information matching the received semantic search query or that have associated semantic information that is related to the received semantic search query through an entity and/or category that is related to an entity and/or category stored in the index of semantic information; and transmitting indications of the determined one or more mobile applications in response to the semantic search query. 51. The computer-readable medium of claim 50 wherein the instructions are code logic, a portion of which is stored and executes on a mobile device. | Techniques for recommending mobile device activities, such as accessing mobile applications and/or mobile Web pages, are described. Some embodiments provide an Activity Recommendation System (“ARS”) configured to recommend relevant activities for a user to perform with a mobile device, based on context of the mobile device. In one embodiment, the ARS recommends mobile applications based content items (e.g., Web pages, images, videos) that are being currently accessed via the mobile device. The ARS may process information about mobile applications and content items to determine semantic information, such as entities and/or categories referenced or associated therewith. The ARS may then use the semantic information to determine mobile applications that have semantic information that is at least similar to that of a content item accessed via a mobile device.1-31. (canceled) 32. A computer-implemented method for discovering mobile applications, the method comprising:
generating in a data store of a computing system an index of semantic information for multiple mobile applications from a plurality of sources including at least one of a Web site, a blog, a news feed, a video feed, a social network, an application store, and/or an information service, the semantic information including identified entities and/or categories related to the multiple mobile applications, wherein the identification is performed using natural language processing techniques; receiving a semantic search query, the query specifying at least one entity or category; determining from the index one or more of the multiple mobile applications that have associated semantic information matching the received semantic search query or that have associated semantic information that is related to the received semantic search query through an entity and/or category that is related to an entity and/or category stored in the index of semantic information; and transmitting indications of the determined one or more mobile applications in response to the semantic search query. 33. The method of claim 32 wherein generating the index includes processing information about each of the multiple mobile applications, including at least one of a summary of the application, a description of the application, a title for the application, instructions for using the application, and a review of the application. 34. The method of claim 33 wherein processing the information about each of the multiple mobile applications includes determining an entity and/or a category referenced by the processed information and storing a relationship between the entity and/or category referenced and a corresponding entity and/or category stored in the data store. 35. The method of claim 32 wherein generating the index includes storing a mapping between an entity or category and one or more of the multiple mobile applications that are related to the entity or category. 36. The method of claim 32 wherein determining from the index the one or more mobile applications that have associated semantic information matching the received semantic search query includes accessing the index to locate mobile applications that are mapped to the entity or category specified by the semantic search query. 37. The method of claim 32 wherein receiving the semantic search query includes receiving a search query that requests mobile applications about a specified entity or category, and wherein determining from the index the one or more mobile applications includes locating one or more mobile applications that are about the specified entity or category. 38. The method of claim 32 wherein receiving the semantic search query includes receiving a search query that requests mobile applications that are indirectly related to a specified entity or category, and wherein determining from the index the one or more mobile applications includes locating one or more mobile applications that are about an entity or category that is related to the specified entity or category. 39. The method of claim 32 wherein the multiple mobile applications include applications that execute at least in part on mobile devices. 40. The method of claim 32 wherein the multiple mobile applications include Web sites configured for use by mobile devices. 41. The method of claim 32 wherein receiving the semantic search query includes receiving the semantic search query from a mobile application recommender module executing on a mobile device, the recommender module configured to transmit the semantic search query in response to receiving indication of access to a content item accessed via the mobile device, the content item referencing the specified at least one entity or category. 42. A computing system configured to discover mobile applications comprising:
a computer processor; a memory; code logic that is stored in the memory and that is configured, when executed by the computer processor, to:
generate an index in a data store in the memory of the computing system of semantic information for multiple mobile applications from a plurality of sources including at least one of a Web site, a blog, a news feed, a video feed, a social network, an application store, and/or an information service, the semantic information including identified entities and/or categories related to the multiple mobile applications, wherein the identification is performed using natural language processing techniques;
receive a semantic search query, the query specifying at least one entity or category;
determine from the index one or more of the multiple mobile applications that have associated semantic information matching the received semantic search query or that have associated semantic information that is related to the received semantic search query through an entity and/or category that is related to an entity and/or category stored in the index of semantic information; and
transmit indications of the determined one or more mobile applications in response to the semantic search query. 43. The computing system of claim 42 wherein the code logic includes software instructions for execution in the memory of the computing system. 44. The computing system of claim 42 wherein the code logic includes an activity recommendation system. 45. The computing system of claim 44 wherein the activity recommendation system includes a client portion executing on a mobile device. 46. The computing system of claim 42 wherein the code logic is configured to recommend activities to at least one of a personal digital assistant, a smart phone, a laptop computer, a notebook computer, a mobile phone, and/or a third-party application. 47. The computing system of claim 42 wherein the mobile device is a tablet computer. 48. The computing system of claim 42 wherein the data store includes an application index and an entity store. 49. The computing system of claim 42 wherein the code logic generates the index about each of the multiple mobile applications by determining an entity and/or a category referenced by the semantic information and storing a relationship between the to entity and/or category referenced and the corresponding entity and/or category in the data store. 50. A non-transitory computer-readable medium containing instructions for controlling a computer processor to discover mobile applications by performing method comprising:
generating in a data store of a computing system an index of semantic information for multiple mobile applications from a plurality of sources including at least one of a Web site, a blog, a news feed, a video feed, a social network, an application store, and/or an information service, the semantic information including identified entities and/or categories related to the multiple mobile applications, wherein the identification is performed using natural language processing techniques; receiving a semantic search query, the query specifying at least one entity or category; determining from the index one or more of the multiple mobile applications that have associated semantic information matching the received semantic search query or that have associated semantic information that is related to the received semantic search query through an entity and/or category that is related to an entity and/or category stored in the index of semantic information; and transmitting indications of the determined one or more mobile applications in response to the semantic search query. 51. The computer-readable medium of claim 50 wherein the instructions are code logic, a portion of which is stored and executes on a mobile device. | 2,100 |
5,593 | 5,593 | 14,482,105 | 2,165 | Examples disclosed herein provide systems, methods, and software for attaching an application to a computing system. In one example, a method of attaching at least one application to the computing system includes identifying an application attach triggering event, and identifying at least one application based on the application attach triggering event. The method further includes attaching an application volume to the computing system that contains the at least one application, and filtering one or more applications from the application volume that are not the at least one application | 1. A method of attaching at least one application to a computing system, the method comprising:
in a processing system, identifying an application attach triggering event for the computing system; identifying the at least one application based on the application attach triggering event; attaching an application volume to the computing system that contains the at least one application; and filtering one or more applications from the application volume that are not the at least one application. 2. The method of claim 1 wherein attaching the application volume to the computing system that contains the at least one application comprises mounting the application volume to the computing system. 3. The method of claim 1 wherein the computing system comprises a physical computing system. 4. The method of claim 1 wherein the computing system comprises a virtual machine. 5. The method of claim 1 further comprising, in response to attaching the application volume, making the at least one application available for execution on the computing system. 6. The method of claim 5 wherein making the at least one application available for execution on the computing system comprises overlaying elements of the at least one application in a file system for the computing system. 7. The method of claim 5 wherein filtering the one or more applications from the application volume that are not the at least one application comprises preventing execution of the one or more applications on the computing system. 8. The method of claim 7 wherein preventing execution of the one or more applications on the computing system comprises preventing access to the one or more applications in a file system for the computing system. 9. The method of claim 1 wherein identifying the application attach triggering event comprises receiving a user application selection on the computing system. 10. The method of claim 1 wherein identifying the application attach triggering event comprises receiving a command from an administrator to attach the at least one application to the computing system. 11. A computer apparatus to attach at least one application to an attachable computing system, the computer apparatus comprising:
processing instructions that direct a computing system, when executed by the computing system, to:
identify an application attach triggering event for the attachable computing system;
identify the at least one application based on the application attach triggering event;
attach an application volume to the attachable computing system that contains the at least one application; and
filter one or more applications from the application volume that are not the at least one application; and
one or more non-transitory computer readable media that store the processing instructions. 12. The computer apparatus of claim 11 wherein the processing instructions to attach the application volume to the attachable computing system that contains the at least one application direct the computing system to mount the application volume to the attachable computing system. 13. The computer apparatus of claim 11 wherein the attachable computing system comprises a physical computing system. 14. The computer apparatus of claim 11 wherein the attachable computing system comprises a virtual machine. 15. The computer apparatus of claim 11 wherein the processing instructions further direct the computing system to, in response to attaching the application volume, make the at least one application available for execution on the attachable computing system. 16. The computer apparatus of claim 15 wherein the processing instructions to make the at least one application available for execution on the attachable computing system direct the computing system to overlay elements of the at least one application within a file system for the attachable computing system. 17. The computer apparatus of claim 15 wherein the processing instructions to filter the one or more applications from the application volume that are not the at least one application direct the computing system to prevent execution of the one or more applications on the attachable computing system. 18. The computer apparatus of claim 17 wherein the processing instructions to prevent execution of the one or more applications on the attachable computing system direct the computing system to prevent access to the one or more applications in a file system for the attachable computing system. 19. The computer apparatus of claim 11 wherein the processing instructions to identify the application attach triggering event direct the computing system to receive a user application selection on the attachable computing system. 20. The computer apparatus of claim 11 wherein the processing instructions to identify the application attach triggering event direct the computing system to receive a command from an administrator to attach the at least one application to the attachable computing system. | Examples disclosed herein provide systems, methods, and software for attaching an application to a computing system. In one example, a method of attaching at least one application to the computing system includes identifying an application attach triggering event, and identifying at least one application based on the application attach triggering event. The method further includes attaching an application volume to the computing system that contains the at least one application, and filtering one or more applications from the application volume that are not the at least one application1. A method of attaching at least one application to a computing system, the method comprising:
in a processing system, identifying an application attach triggering event for the computing system; identifying the at least one application based on the application attach triggering event; attaching an application volume to the computing system that contains the at least one application; and filtering one or more applications from the application volume that are not the at least one application. 2. The method of claim 1 wherein attaching the application volume to the computing system that contains the at least one application comprises mounting the application volume to the computing system. 3. The method of claim 1 wherein the computing system comprises a physical computing system. 4. The method of claim 1 wherein the computing system comprises a virtual machine. 5. The method of claim 1 further comprising, in response to attaching the application volume, making the at least one application available for execution on the computing system. 6. The method of claim 5 wherein making the at least one application available for execution on the computing system comprises overlaying elements of the at least one application in a file system for the computing system. 7. The method of claim 5 wherein filtering the one or more applications from the application volume that are not the at least one application comprises preventing execution of the one or more applications on the computing system. 8. The method of claim 7 wherein preventing execution of the one or more applications on the computing system comprises preventing access to the one or more applications in a file system for the computing system. 9. The method of claim 1 wherein identifying the application attach triggering event comprises receiving a user application selection on the computing system. 10. The method of claim 1 wherein identifying the application attach triggering event comprises receiving a command from an administrator to attach the at least one application to the computing system. 11. A computer apparatus to attach at least one application to an attachable computing system, the computer apparatus comprising:
processing instructions that direct a computing system, when executed by the computing system, to:
identify an application attach triggering event for the attachable computing system;
identify the at least one application based on the application attach triggering event;
attach an application volume to the attachable computing system that contains the at least one application; and
filter one or more applications from the application volume that are not the at least one application; and
one or more non-transitory computer readable media that store the processing instructions. 12. The computer apparatus of claim 11 wherein the processing instructions to attach the application volume to the attachable computing system that contains the at least one application direct the computing system to mount the application volume to the attachable computing system. 13. The computer apparatus of claim 11 wherein the attachable computing system comprises a physical computing system. 14. The computer apparatus of claim 11 wherein the attachable computing system comprises a virtual machine. 15. The computer apparatus of claim 11 wherein the processing instructions further direct the computing system to, in response to attaching the application volume, make the at least one application available for execution on the attachable computing system. 16. The computer apparatus of claim 15 wherein the processing instructions to make the at least one application available for execution on the attachable computing system direct the computing system to overlay elements of the at least one application within a file system for the attachable computing system. 17. The computer apparatus of claim 15 wherein the processing instructions to filter the one or more applications from the application volume that are not the at least one application direct the computing system to prevent execution of the one or more applications on the attachable computing system. 18. The computer apparatus of claim 17 wherein the processing instructions to prevent execution of the one or more applications on the attachable computing system direct the computing system to prevent access to the one or more applications in a file system for the attachable computing system. 19. The computer apparatus of claim 11 wherein the processing instructions to identify the application attach triggering event direct the computing system to receive a user application selection on the attachable computing system. 20. The computer apparatus of claim 11 wherein the processing instructions to identify the application attach triggering event direct the computing system to receive a command from an administrator to attach the at least one application to the attachable computing system. | 2,100 |
5,594 | 5,594 | 13,158,992 | 2,163 | A new approach is proposed that contemplates systems and methods to examine and determine quality of objects cited by citations in a search result based on a citation graph that includes citing subjects, citations, and cited objects. First, influence scores of a plurality of subjects/sources that compose the citations of the objects in the search result are calculated. The quality of the objects cited by the subjects can then be determined by examining the influence scores for the subjects of the citations. Finally, the cited objects selected can be presented to a user or provided to a thirty party for further processing together with the relevant citations and citing subjects. | 1. A system, comprising:
a citation search engine, which in operation,
sets and adjusts one or more of citation searching and ranking criteria and mechanisms based on user specification and/or internal statistical data;
retrieves a plurality of citations composed by a plurality of subjects citing a plurality of objects that fit the searching criteria;
an influence evaluation engine, which in operation, calculates influence scores of the plurality of subjects that compose the plurality of citations citing the plurality of objects; an object selection engine, which in operation,
calculates influence scores of the plurality of objects in the plurality of citations based on the influence scores of the plurality of subjects and the ranking criteria;
selects as a search result the plurality of objects based on both matching of the objects with the searching criteria as well as the influence scores of the objects. 2. The system of claim 1, wherein:
each of the plurality of subjects has an opinion wherein expression of the opinion is explicit, expressed, implicit, or imputed through any other technique. 3. The system of claim 1, wherein:
each of the plurality of subjects is one of: representation of a person, web log, and entities representing Internet authors or users of social media services, user of microblogging services, users of social networks, reviewer who provides expressions of opinion, reviews, or other information useful for the estimation of influence. 4. The system of claim 1, wherein:
each of the plurality of objects is one of: Internet web sites, blogs, videos, books, films, music, image, video, documents, data files, objects for sale, objects that are reviewed or recommended or cited, subjects/authors, natural or legal persons, citations, or any entities that are associated with a Uniform Resource Identifier (URI). 5. The system of claim 1, wherein:
each of the plurality of citations includes one or more of: expression of opinions on the objects, expressions of authors in the form of Tweets, blog posts, reviews of objects on Internet web sites Wikipedia entries, postings to social media, postings to websites, postings in the form of reviews, recommendations, or any other form of citation made to mailing lists, newsgroups, discussion forums, comments to websites or any other form of Internet publication. 6. The system of claim 1, wherein:
each of the plurality of citations is made by a subject regarding an object, a subject regarding another subject, or an object regarding another object. 7. The system of claim 1, wherein:
the citation search engine enables a citation centric search process that focuses on influence of the plurality subjects that cite the plurality of objects. 8. The system of claim 1, wherein:
the citation search engine accepts and enforces a plurality of criteria on citation searching, retrieving and ranking, each of which is either be explicitly described by a user or best guessed by the system based on internal statistical data. 9. The system of claim 8, wherein:
the plurality of criteria include one or more of constraints for the plurality of citations, type of the plurality of objects cited, and ranking bias of the cited objects. 10. The system of claim 1, wherein:
the influence score of each of the plurality of subjects indicates degree to which the subject's opinion influences other subjects and/or a community of subjects. 11. The system of claim 1, wherein:
the influence score of each of the plurality of objects indicates collective opinions of the plurality of subjects citing the object. 12. The system of claim 1, wherein:
some of the plurality of subjects are related to each other via an influence network or community. 13. The system of claim 12, wherein:
the influence evaluation engine calculates the influence scores of the plurality of subjects based on their authorities in the influence network. 14. The system of claim 1, wherein:
the influence evaluation engine calculates the influence scores of the plurality of subjects on one or more dimensions that are related to one or more of the objects cited by the subjects, form of the citations, and search terms. 15. The system of claim 1, wherein:
the influence evaluation engine determines an influence score for a first subject in the plurality of subjects at least partly based on how often the first subject is cited or referenced by one or more second subjects in the plurality of subjects. 16. The system of claim 15, wherein:
each of the one or more second objects references a citation of an object by the first subject. 17. The system of claim 15, wherein:
the influence evaluation engine computes the number of the citations of the first subject by the second subjects as the citation score and takes into account the influence of the second subjects citing the first subject in the citation score. 18. The system of claim 1, wherein:
the influence evaluation engine calculates the influence scores of the plurality of subjects based on a citation graph having the plurality of subjects and the plurality of objects as its entities and the plurality of citations as its edges. 19. The system of claim 18, wherein:
the influence evaluation engine allows for attribution of influence on the plurality of subjects to data sources to be estimated and distributed based on the citation graph. 20. The system of claim 18, wherein:
the influence evaluation engine estimates the influence score of each entity from one or more of count of actual requests for data, opinion, or searches relating to or originating from other entities, entities with direct links to the entity or with a path in the citation graph. 21. The system of claim 18, wherein:
the influence evaluation engine adjusts the influence score of each entity in the citation graph by metrics relating to the citation graph comprising all entities or a subset of all linked entities in the citation graph. 22. The system of claim 1, wherein:
the ranking criteria include one or more of: influence scores of the citing subjects, date or time, and geographical location associated with the objects. 23. The system of claim 1, wherein:
the object selection engine determines qualities of the cited objects by examining the distribution of the influence scores of the subjects citing the objects in the search results. 24. The system of claim 23, wherein:
one measure of the influence distribution is the citation ratio of the number of citations from influential and non-influential subjects. 25. The system of claim 23, wherein:
the object selection engine accepts only those objects that show up in the search results if their citation ratios from influential and non-influential subjects are above a certain threshold while others can be marked as spam if the ratio of their citation ratios from the influential and non-influential subjects fall below the certain threshold. 26. The system of claim 1, wherein:
the object selection engine calculates and ranks the plurality of objects by treating citations of the objects as connections having positive or negative scores in the weighted citation graph. 27. The system of claim 26, wherein:
the object selection engine propagates negative citation scores through the citation graph to identify one or more spammers and to reduce their influence on the search result. 28. The system of claim 1, wherein:
the object selection engine presents the search results of cited objects to a user who issues the search request or provides the generated search results to a third party for further processing. 29. The system of claim 28, wherein:
the object selection engine presents to the user a score computed from a function combining the count of citations and the influence of the subjects of the citations along with the search result of the objects. 30. The system of claim 28, wherein:
the object selection engine selects for display of every object in the search result, one or more citations and the subjects of the citations on the basis of criteria such as the recency or the influence of their citing subjects relative to the other citations in the search result. 31. The system of claim 30, wherein:
the object selection engine displays the selected citations and/or subjects in such a way that the relationship between the search result, the citations and the subjects of the citations are made transparent to a user. 32. A method, comprising:
setting and adjusting one or more of citation searching, retrieving, and ranking criteria and mechanisms based on user specification and/or internal statistical data; retrieving a plurality of citations composed by a plurality of subjects citing a plurality of objects that fit the searching criteria; calculating influence scores of the plurality of subjects that compose the plurality of citations citing the plurality of objects; calculating influence scores of the plurality of objects in the plurality of citations based on the influence scores of the plurality of subjects and the ranking criteria; selecting as a search result the plurality of objects based on both matching of the objects with the searching criteria as well as the influence scores of the objects. 33. The method of claim 32, further comprising:
enabling a citation centric search process that focuses on influence of the plurality subjects that cite the plurality of objects. 34. The method of claim 32, further comprising:
accepting and enforcing a plurality of criteria on citation searching, retrieving and ranking, each of which is either be explicitly described by a user or best guessed by the system based on internal statistical data. 35. The method of claim 32, further comprising:
calculating the influence scores of the plurality of subjects based on their authorities in an influence network. 36. The method of claim 32, further comprising:
calculating the influence scores of the plurality of subjects on one or more dimensions that are related to one or more of the objects cited by the subjects, form of the citations, and search terms. 37. The method of claim 32, further comprising:
determining an influence score for a first subject in the plurality of subjects at least partly based on how often the first subject is cited or referenced by one or more second subjects in the plurality of subjects. 38. The method of claim 37, further comprising:
computing the number of the citations of the first subject by the second subjects as the citation score and takes into account the influence of the second subjects citing the first subject in the citation score. 39. The method of claim 32, further comprising:
calculating the influence scores of the plurality of subjects based on a citation graph having the plurality of subjects and the plurality of objects as its entities and the plurality of citations as its edges. 40. The method of claim 39, further comprising:
determining the influence scores for each entity within the citation graph on a specific given dimension. 41. The method of claim 39, further comprising:
estimating the influence score of each entity from one or more of count of actual requests for data, opinion, or searches relating to or originating from other entities, entities with direct links to the entity or with a path in the citation graph. 42. The method of claim 39, further comprising:
adjusting the influence score of each entity in the citation graph by metrics relating to the citation graph comprising all entities or a subset of all linked entities in the citation graph. 43. The method of claim 32, further comprising:
determining qualities of the cited objects by examining the distribution of the influence scores of the subjects citing the objects in the search results. 44. The method of claim 43, further comprising:
accepting only those objects that show up in the search results if their citation ratios from influential and non-influential subjects are above a certain threshold while others can be marked as spam if the ratio of their citation ratios from the influential and non-influential subjects fall below the certain threshold. 45. The method of claim 32, further comprising:
calculating and ranking the plurality of objects by treating citations of the objects as connections having positive or negative scores in the weighted citation graph. 46. The method of claim 45, further comprising:
propagating negative citation scores through the citation graph to identify one or more spammers and to reduce their influence on the search result. 47. The method of claim 32, further comprising:
presenting the search results of cited objects to a user who issues the search request or provides the generated search results to a third party for further processing. 48. The method of claim 47, further comprising:
presenting to the user a score computed from a function combining the count of citations and the influence of the subjects of the citations along with the search result of the objects. 49. The method of claim 47, further comprising:
selecting for display of every object in the search result, one or more citations and the subjects of the citations on the basis of criteria such as the recency or the influence of their citing subjects relative to the other citations in the search result. 50. The method of claim 49, further comprising:
displaying the selected citations and/or subjects in such a way that the relationship between the search result, the citations and the subjects of the citations are made transparent to a user. | A new approach is proposed that contemplates systems and methods to examine and determine quality of objects cited by citations in a search result based on a citation graph that includes citing subjects, citations, and cited objects. First, influence scores of a plurality of subjects/sources that compose the citations of the objects in the search result are calculated. The quality of the objects cited by the subjects can then be determined by examining the influence scores for the subjects of the citations. Finally, the cited objects selected can be presented to a user or provided to a thirty party for further processing together with the relevant citations and citing subjects.1. A system, comprising:
a citation search engine, which in operation,
sets and adjusts one or more of citation searching and ranking criteria and mechanisms based on user specification and/or internal statistical data;
retrieves a plurality of citations composed by a plurality of subjects citing a plurality of objects that fit the searching criteria;
an influence evaluation engine, which in operation, calculates influence scores of the plurality of subjects that compose the plurality of citations citing the plurality of objects; an object selection engine, which in operation,
calculates influence scores of the plurality of objects in the plurality of citations based on the influence scores of the plurality of subjects and the ranking criteria;
selects as a search result the plurality of objects based on both matching of the objects with the searching criteria as well as the influence scores of the objects. 2. The system of claim 1, wherein:
each of the plurality of subjects has an opinion wherein expression of the opinion is explicit, expressed, implicit, or imputed through any other technique. 3. The system of claim 1, wherein:
each of the plurality of subjects is one of: representation of a person, web log, and entities representing Internet authors or users of social media services, user of microblogging services, users of social networks, reviewer who provides expressions of opinion, reviews, or other information useful for the estimation of influence. 4. The system of claim 1, wherein:
each of the plurality of objects is one of: Internet web sites, blogs, videos, books, films, music, image, video, documents, data files, objects for sale, objects that are reviewed or recommended or cited, subjects/authors, natural or legal persons, citations, or any entities that are associated with a Uniform Resource Identifier (URI). 5. The system of claim 1, wherein:
each of the plurality of citations includes one or more of: expression of opinions on the objects, expressions of authors in the form of Tweets, blog posts, reviews of objects on Internet web sites Wikipedia entries, postings to social media, postings to websites, postings in the form of reviews, recommendations, or any other form of citation made to mailing lists, newsgroups, discussion forums, comments to websites or any other form of Internet publication. 6. The system of claim 1, wherein:
each of the plurality of citations is made by a subject regarding an object, a subject regarding another subject, or an object regarding another object. 7. The system of claim 1, wherein:
the citation search engine enables a citation centric search process that focuses on influence of the plurality subjects that cite the plurality of objects. 8. The system of claim 1, wherein:
the citation search engine accepts and enforces a plurality of criteria on citation searching, retrieving and ranking, each of which is either be explicitly described by a user or best guessed by the system based on internal statistical data. 9. The system of claim 8, wherein:
the plurality of criteria include one or more of constraints for the plurality of citations, type of the plurality of objects cited, and ranking bias of the cited objects. 10. The system of claim 1, wherein:
the influence score of each of the plurality of subjects indicates degree to which the subject's opinion influences other subjects and/or a community of subjects. 11. The system of claim 1, wherein:
the influence score of each of the plurality of objects indicates collective opinions of the plurality of subjects citing the object. 12. The system of claim 1, wherein:
some of the plurality of subjects are related to each other via an influence network or community. 13. The system of claim 12, wherein:
the influence evaluation engine calculates the influence scores of the plurality of subjects based on their authorities in the influence network. 14. The system of claim 1, wherein:
the influence evaluation engine calculates the influence scores of the plurality of subjects on one or more dimensions that are related to one or more of the objects cited by the subjects, form of the citations, and search terms. 15. The system of claim 1, wherein:
the influence evaluation engine determines an influence score for a first subject in the plurality of subjects at least partly based on how often the first subject is cited or referenced by one or more second subjects in the plurality of subjects. 16. The system of claim 15, wherein:
each of the one or more second objects references a citation of an object by the first subject. 17. The system of claim 15, wherein:
the influence evaluation engine computes the number of the citations of the first subject by the second subjects as the citation score and takes into account the influence of the second subjects citing the first subject in the citation score. 18. The system of claim 1, wherein:
the influence evaluation engine calculates the influence scores of the plurality of subjects based on a citation graph having the plurality of subjects and the plurality of objects as its entities and the plurality of citations as its edges. 19. The system of claim 18, wherein:
the influence evaluation engine allows for attribution of influence on the plurality of subjects to data sources to be estimated and distributed based on the citation graph. 20. The system of claim 18, wherein:
the influence evaluation engine estimates the influence score of each entity from one or more of count of actual requests for data, opinion, or searches relating to or originating from other entities, entities with direct links to the entity or with a path in the citation graph. 21. The system of claim 18, wherein:
the influence evaluation engine adjusts the influence score of each entity in the citation graph by metrics relating to the citation graph comprising all entities or a subset of all linked entities in the citation graph. 22. The system of claim 1, wherein:
the ranking criteria include one or more of: influence scores of the citing subjects, date or time, and geographical location associated with the objects. 23. The system of claim 1, wherein:
the object selection engine determines qualities of the cited objects by examining the distribution of the influence scores of the subjects citing the objects in the search results. 24. The system of claim 23, wherein:
one measure of the influence distribution is the citation ratio of the number of citations from influential and non-influential subjects. 25. The system of claim 23, wherein:
the object selection engine accepts only those objects that show up in the search results if their citation ratios from influential and non-influential subjects are above a certain threshold while others can be marked as spam if the ratio of their citation ratios from the influential and non-influential subjects fall below the certain threshold. 26. The system of claim 1, wherein:
the object selection engine calculates and ranks the plurality of objects by treating citations of the objects as connections having positive or negative scores in the weighted citation graph. 27. The system of claim 26, wherein:
the object selection engine propagates negative citation scores through the citation graph to identify one or more spammers and to reduce their influence on the search result. 28. The system of claim 1, wherein:
the object selection engine presents the search results of cited objects to a user who issues the search request or provides the generated search results to a third party for further processing. 29. The system of claim 28, wherein:
the object selection engine presents to the user a score computed from a function combining the count of citations and the influence of the subjects of the citations along with the search result of the objects. 30. The system of claim 28, wherein:
the object selection engine selects for display of every object in the search result, one or more citations and the subjects of the citations on the basis of criteria such as the recency or the influence of their citing subjects relative to the other citations in the search result. 31. The system of claim 30, wherein:
the object selection engine displays the selected citations and/or subjects in such a way that the relationship between the search result, the citations and the subjects of the citations are made transparent to a user. 32. A method, comprising:
setting and adjusting one or more of citation searching, retrieving, and ranking criteria and mechanisms based on user specification and/or internal statistical data; retrieving a plurality of citations composed by a plurality of subjects citing a plurality of objects that fit the searching criteria; calculating influence scores of the plurality of subjects that compose the plurality of citations citing the plurality of objects; calculating influence scores of the plurality of objects in the plurality of citations based on the influence scores of the plurality of subjects and the ranking criteria; selecting as a search result the plurality of objects based on both matching of the objects with the searching criteria as well as the influence scores of the objects. 33. The method of claim 32, further comprising:
enabling a citation centric search process that focuses on influence of the plurality subjects that cite the plurality of objects. 34. The method of claim 32, further comprising:
accepting and enforcing a plurality of criteria on citation searching, retrieving and ranking, each of which is either be explicitly described by a user or best guessed by the system based on internal statistical data. 35. The method of claim 32, further comprising:
calculating the influence scores of the plurality of subjects based on their authorities in an influence network. 36. The method of claim 32, further comprising:
calculating the influence scores of the plurality of subjects on one or more dimensions that are related to one or more of the objects cited by the subjects, form of the citations, and search terms. 37. The method of claim 32, further comprising:
determining an influence score for a first subject in the plurality of subjects at least partly based on how often the first subject is cited or referenced by one or more second subjects in the plurality of subjects. 38. The method of claim 37, further comprising:
computing the number of the citations of the first subject by the second subjects as the citation score and takes into account the influence of the second subjects citing the first subject in the citation score. 39. The method of claim 32, further comprising:
calculating the influence scores of the plurality of subjects based on a citation graph having the plurality of subjects and the plurality of objects as its entities and the plurality of citations as its edges. 40. The method of claim 39, further comprising:
determining the influence scores for each entity within the citation graph on a specific given dimension. 41. The method of claim 39, further comprising:
estimating the influence score of each entity from one or more of count of actual requests for data, opinion, or searches relating to or originating from other entities, entities with direct links to the entity or with a path in the citation graph. 42. The method of claim 39, further comprising:
adjusting the influence score of each entity in the citation graph by metrics relating to the citation graph comprising all entities or a subset of all linked entities in the citation graph. 43. The method of claim 32, further comprising:
determining qualities of the cited objects by examining the distribution of the influence scores of the subjects citing the objects in the search results. 44. The method of claim 43, further comprising:
accepting only those objects that show up in the search results if their citation ratios from influential and non-influential subjects are above a certain threshold while others can be marked as spam if the ratio of their citation ratios from the influential and non-influential subjects fall below the certain threshold. 45. The method of claim 32, further comprising:
calculating and ranking the plurality of objects by treating citations of the objects as connections having positive or negative scores in the weighted citation graph. 46. The method of claim 45, further comprising:
propagating negative citation scores through the citation graph to identify one or more spammers and to reduce their influence on the search result. 47. The method of claim 32, further comprising:
presenting the search results of cited objects to a user who issues the search request or provides the generated search results to a third party for further processing. 48. The method of claim 47, further comprising:
presenting to the user a score computed from a function combining the count of citations and the influence of the subjects of the citations along with the search result of the objects. 49. The method of claim 47, further comprising:
selecting for display of every object in the search result, one or more citations and the subjects of the citations on the basis of criteria such as the recency or the influence of their citing subjects relative to the other citations in the search result. 50. The method of claim 49, further comprising:
displaying the selected citations and/or subjects in such a way that the relationship between the search result, the citations and the subjects of the citations are made transparent to a user. | 2,100 |
5,595 | 5,595 | 15,374,171 | 2,198 | Systems and methods for compliance illusions with haptics are disclosed. One illustrative system described herein includes a user interface device including: a sensor configured to detect a gesture; a haptic output device configured to output haptic effects; and a processor coupled to the sensor and the haptic output device, the processor configured to: receive a sensor signal from the sensor; determine a user interaction in mixed reality; determine a haptic effect based in part on the sensor signal and the user interaction; and transmit a haptic signal associated with the haptic effect to the haptic output device. | 1. A system comprising:
a user interface device comprising:
a sensor configured to detect a gesture;
a haptic output device configured to output haptic effects; and
a processor coupled to the sensor and the haptic output device, the processor configured to:
receive a sensor signal from the sensor;
determine a user interaction with a virtual object;
determine a haptic effect based in part on the sensor signal and the user interaction; and
transmit a haptic signal associated with the haptic effect to the haptic output device. 2. The system of claim 1, wherein the haptic signal comprises a sinusoidal carrier wave comprising an envelope and wherein the processor is configured to vary the magnitude of the envelope based in part on a pressure of the gesture. 3. The system of claim 1, wherein the haptic effect is configured to simulate compliance of the virtual object. 4. The system of claim 1, wherein the gesture comprises movement between a first location and a second location and wherein determining a haptic effect comprises determining a haptic effect that changes based in part on a function of a distance between the first location and the second location. 5. The system of claim 4, wherein the processor is configured to change one or more of the frequency, amplitude, grain size, grain magnitude, or grain density of the haptic effect based in part on the distance. 6. The system of claim 4, wherein the first location and the second location comprise positions in mixed reality. 7. The system of claim 4, wherein the first location and the second location comprise positions in real space. 8. The system of claim 1, wherein the processor is part of a remote device communicatively coupled to the user interface device. 9. The system of claim 1, wherein the processor is a component of the user interface device, and wherein the user interface device comprises a wearable device or a handheld device. 10. The system of claim 1, wherein the sensor is configured to detect the pressure from a user's grip and the haptic output device is configured to output haptic effects to the user's palm. 11. The system of claim 1, wherein the haptic output device comprises one or more of: a piezoelectric actuator, an electric motor, an electro-magnetic actuator, a voice coil, a shape memory alloy, an electro-active polymer, a solenoid, an eccentric rotating mass motor, a linear resonant actuator, or an electrostatic output device. 12. A method comprising:
receiving a sensor signal from a sensor configured to detect a gesture; determining a user interaction with a virtual object; determining a haptic effect based in part on the sensor signal and the user interaction; and outputting a haptic signal associated with the haptic effect to a haptic output device configured to output haptic effects. 13. The method of claim 12, wherein the haptic signal comprises a sinusoidal carrier wave comprising an envelope and further comprising varying the magnitude of the envelope based in part on a pressure of the gesture. 14. The method of claim 12, further comprising outputting a display signal associated with mixed reality. 15. The method of claim 12, wherein the haptic effect is configured to simulate compliance of the virtual object. 16. The method of claim 12, wherein the gesture comprises movement between a first location and a second location and wherein determining a haptic effect comprises determining a haptic effect that changes based in part on a function of a distance between the first location and the second location. 17. The method of claim 16, further comprising changing one or more of the frequency, amplitude, grain size, grain magnitude, or grain density of the haptic effect based in part on the distance. 18. The method of claim 16, wherein the first location and the second location comprise positions in mixed reality. 19. The method of claim 16, wherein the first location and the second location comprise positions in real space. 20. The method of claim 12, wherein the sensor is configured to detect the pressure from a user's grip and the haptic output device is configured to output haptic effects to the user's palm. 21. A non-transitory computer readable medium comprising program code, which when executed by a processor is configured to cause the processor to:
receive a sensor signal from a sensor configured to detect a gesture; determine a user interaction with a virtual object; determine a haptic effect based in part on the sensor signal and the user interaction; and output a haptic signal associated with the haptic effect to a haptic output device configured to output haptic effects. | Systems and methods for compliance illusions with haptics are disclosed. One illustrative system described herein includes a user interface device including: a sensor configured to detect a gesture; a haptic output device configured to output haptic effects; and a processor coupled to the sensor and the haptic output device, the processor configured to: receive a sensor signal from the sensor; determine a user interaction in mixed reality; determine a haptic effect based in part on the sensor signal and the user interaction; and transmit a haptic signal associated with the haptic effect to the haptic output device.1. A system comprising:
a user interface device comprising:
a sensor configured to detect a gesture;
a haptic output device configured to output haptic effects; and
a processor coupled to the sensor and the haptic output device, the processor configured to:
receive a sensor signal from the sensor;
determine a user interaction with a virtual object;
determine a haptic effect based in part on the sensor signal and the user interaction; and
transmit a haptic signal associated with the haptic effect to the haptic output device. 2. The system of claim 1, wherein the haptic signal comprises a sinusoidal carrier wave comprising an envelope and wherein the processor is configured to vary the magnitude of the envelope based in part on a pressure of the gesture. 3. The system of claim 1, wherein the haptic effect is configured to simulate compliance of the virtual object. 4. The system of claim 1, wherein the gesture comprises movement between a first location and a second location and wherein determining a haptic effect comprises determining a haptic effect that changes based in part on a function of a distance between the first location and the second location. 5. The system of claim 4, wherein the processor is configured to change one or more of the frequency, amplitude, grain size, grain magnitude, or grain density of the haptic effect based in part on the distance. 6. The system of claim 4, wherein the first location and the second location comprise positions in mixed reality. 7. The system of claim 4, wherein the first location and the second location comprise positions in real space. 8. The system of claim 1, wherein the processor is part of a remote device communicatively coupled to the user interface device. 9. The system of claim 1, wherein the processor is a component of the user interface device, and wherein the user interface device comprises a wearable device or a handheld device. 10. The system of claim 1, wherein the sensor is configured to detect the pressure from a user's grip and the haptic output device is configured to output haptic effects to the user's palm. 11. The system of claim 1, wherein the haptic output device comprises one or more of: a piezoelectric actuator, an electric motor, an electro-magnetic actuator, a voice coil, a shape memory alloy, an electro-active polymer, a solenoid, an eccentric rotating mass motor, a linear resonant actuator, or an electrostatic output device. 12. A method comprising:
receiving a sensor signal from a sensor configured to detect a gesture; determining a user interaction with a virtual object; determining a haptic effect based in part on the sensor signal and the user interaction; and outputting a haptic signal associated with the haptic effect to a haptic output device configured to output haptic effects. 13. The method of claim 12, wherein the haptic signal comprises a sinusoidal carrier wave comprising an envelope and further comprising varying the magnitude of the envelope based in part on a pressure of the gesture. 14. The method of claim 12, further comprising outputting a display signal associated with mixed reality. 15. The method of claim 12, wherein the haptic effect is configured to simulate compliance of the virtual object. 16. The method of claim 12, wherein the gesture comprises movement between a first location and a second location and wherein determining a haptic effect comprises determining a haptic effect that changes based in part on a function of a distance between the first location and the second location. 17. The method of claim 16, further comprising changing one or more of the frequency, amplitude, grain size, grain magnitude, or grain density of the haptic effect based in part on the distance. 18. The method of claim 16, wherein the first location and the second location comprise positions in mixed reality. 19. The method of claim 16, wherein the first location and the second location comprise positions in real space. 20. The method of claim 12, wherein the sensor is configured to detect the pressure from a user's grip and the haptic output device is configured to output haptic effects to the user's palm. 21. A non-transitory computer readable medium comprising program code, which when executed by a processor is configured to cause the processor to:
receive a sensor signal from a sensor configured to detect a gesture; determine a user interaction with a virtual object; determine a haptic effect based in part on the sensor signal and the user interaction; and output a haptic signal associated with the haptic effect to a haptic output device configured to output haptic effects. | 2,100 |
5,596 | 5,596 | 14,345,767 | 2,117 | A pump unit ( 2 ) has an electrical drive motor ( 5 ) and a control device ( 4 ) for controlling the drive motor ( 5 ), wherein said control device ( 4 ) includes at least one microprocessor ( 8 ) and storage means ( 6 ) which is able to store at least one control program executable by said microprocessor ( 8 ), wherein said control device ( 4 ) includes or communicates with a programming module ( 7 ) by which at least one user application can be created and/or modified and stored in said storage means, wherein said programming module ( 7 ) is designed such that at least one input parameter ( 13 ), at least one operator ( 10 ) and at least one action ( 14 ) can be chosen as program elements and combined to generate at least one user function ( 18 ) of said user application which can be executed by said microprocessor. | 1-17. (canceled) 18. A pump unit (2) having an electrical drive motor (5) and a control device (4) for controlling the drive motor (5), wherein said control device (4) comprises at least one microprocessor (8) and storage means (6) configured to store at least one control program executable by said microprocessor (8), wherein said control device (4) comprises or communicates with a programming module (7) by which at least one user application is created and/or modified and stored in said storage means, wherein said programming module (7) is designed such that at least one input parameter (13), at least one operator (10) and at least one action (14) are chosen as program elements and combined to generate at least one user function (18) of said user application which is executed by said microprocessor. 19. The pump unit according to claim 18, wherein the control device (4) with said microprocessor (8) and said storage means (6) are located in at least one electronic housing arranged at said drive motor (5) or in a housing of said drive motor (5). 20. The pump unit according to claim 19, wherein said programming module (7) is arranged in said at least one electronic housing. 21. The pump unit according to claim 18, wherein said programming module (7) forms a unit separated from the other parts of said control device (4) and connected with said control device via a data interface. 22. The pump unit according to claim 21, wherein said data interface comprises a network connection. 23. The pump unit according to claim 22, wherein the network connection is an internet connection (44). 24. The pump unit according to claim 18, wherein said programming module (7) is a software module. 25. The pump unit according to claim 18, wherein said programming module (7) is designed such that several input parameters (13), several operators (10) and/or several actions (14) of said drive motor (5) can be chosen as program elements and combined to generate at least one user function (18) of said user application. 26. The pump unit according to claim 18, wherein said programming module (7) is designed such that at least one action of an external device can be chosen as a program element. 27. The pump unit according to claim 18, wherein said programming module (7) is designed such that at least one action of the drive motor or a further user function can be chosen as program elements. 28. The pump unit according to claim 18, wherein said at least one input parameter (13) is provided by at least one sensor arranged in said pump unit, at least one external sensor, a computing device, data storage means and/or a data network. 29. The pump unit according to claim 18, wherein the actions (14) of said drive motor (5) comprise a switching on and off and/or a speed adjustment of said drive motor (5). 30. The pump unit according to claim 18, wherein said programming module (7) comprises at least one display (30) and at least one input device (28). 31. The pump unit according to claim 30, wherein said programming module comprises at least one display (30) showing several program elements which can be chosen and combined for creating at least one user function (18) of said user application. 32. The pump unit according to claim 30, wherein said display (30) is a touch screen display and acts as an input device. 33. The pump unit according to claim 18, wherein said programming module (7) is designed such that program functions can be stored manually or automatically from an external storage means or a data network into said storage means (6). 34. The pump unit according to claim 18, wherein the programming module (7) is designed such that it may communicate with an external device to change settings of said device. 35. The pump unit according to claim 18, wherein said pump unit (2) is a recirculation pump. | A pump unit ( 2 ) has an electrical drive motor ( 5 ) and a control device ( 4 ) for controlling the drive motor ( 5 ), wherein said control device ( 4 ) includes at least one microprocessor ( 8 ) and storage means ( 6 ) which is able to store at least one control program executable by said microprocessor ( 8 ), wherein said control device ( 4 ) includes or communicates with a programming module ( 7 ) by which at least one user application can be created and/or modified and stored in said storage means, wherein said programming module ( 7 ) is designed such that at least one input parameter ( 13 ), at least one operator ( 10 ) and at least one action ( 14 ) can be chosen as program elements and combined to generate at least one user function ( 18 ) of said user application which can be executed by said microprocessor.1-17. (canceled) 18. A pump unit (2) having an electrical drive motor (5) and a control device (4) for controlling the drive motor (5), wherein said control device (4) comprises at least one microprocessor (8) and storage means (6) configured to store at least one control program executable by said microprocessor (8), wherein said control device (4) comprises or communicates with a programming module (7) by which at least one user application is created and/or modified and stored in said storage means, wherein said programming module (7) is designed such that at least one input parameter (13), at least one operator (10) and at least one action (14) are chosen as program elements and combined to generate at least one user function (18) of said user application which is executed by said microprocessor. 19. The pump unit according to claim 18, wherein the control device (4) with said microprocessor (8) and said storage means (6) are located in at least one electronic housing arranged at said drive motor (5) or in a housing of said drive motor (5). 20. The pump unit according to claim 19, wherein said programming module (7) is arranged in said at least one electronic housing. 21. The pump unit according to claim 18, wherein said programming module (7) forms a unit separated from the other parts of said control device (4) and connected with said control device via a data interface. 22. The pump unit according to claim 21, wherein said data interface comprises a network connection. 23. The pump unit according to claim 22, wherein the network connection is an internet connection (44). 24. The pump unit according to claim 18, wherein said programming module (7) is a software module. 25. The pump unit according to claim 18, wherein said programming module (7) is designed such that several input parameters (13), several operators (10) and/or several actions (14) of said drive motor (5) can be chosen as program elements and combined to generate at least one user function (18) of said user application. 26. The pump unit according to claim 18, wherein said programming module (7) is designed such that at least one action of an external device can be chosen as a program element. 27. The pump unit according to claim 18, wherein said programming module (7) is designed such that at least one action of the drive motor or a further user function can be chosen as program elements. 28. The pump unit according to claim 18, wherein said at least one input parameter (13) is provided by at least one sensor arranged in said pump unit, at least one external sensor, a computing device, data storage means and/or a data network. 29. The pump unit according to claim 18, wherein the actions (14) of said drive motor (5) comprise a switching on and off and/or a speed adjustment of said drive motor (5). 30. The pump unit according to claim 18, wherein said programming module (7) comprises at least one display (30) and at least one input device (28). 31. The pump unit according to claim 30, wherein said programming module comprises at least one display (30) showing several program elements which can be chosen and combined for creating at least one user function (18) of said user application. 32. The pump unit according to claim 30, wherein said display (30) is a touch screen display and acts as an input device. 33. The pump unit according to claim 18, wherein said programming module (7) is designed such that program functions can be stored manually or automatically from an external storage means or a data network into said storage means (6). 34. The pump unit according to claim 18, wherein the programming module (7) is designed such that it may communicate with an external device to change settings of said device. 35. The pump unit according to claim 18, wherein said pump unit (2) is a recirculation pump. | 2,100 |
5,597 | 5,597 | 15,077,235 | 2,122 | A mobile energy storage system and a method are provided for supplying power to entities at disparate locations. The system includes a set of vehicles. Each of the vehicles in the set includes a battery set having one or more batteries for storing power. Each of the vehicles in the set further includes a power connector having an end connected to the battery set and another end for connecting to a power transfer switch at the entities. The system also includes a central server for scheduling vehicles in the set to provide power to the entities responsive to energy charging requests issued by the entities. | 1. A mobile energy storage system for supplying power to entities at disparate locations, the system comprising:
a set of vehicles, each including:
a battery set having one or more batteries for storing power; and
a power connector having an end connected to the battery set and another end for connecting to a power transfer switch at the entities; and
a central server for scheduling vehicles in the set to provide power to the entities responsive to energy charging requests issued by the entities. 2. The system of claim 1, further comprising a robotic arm to connect the other end of the power connector to the power transfer switch. 3. The system of claim 2, wherein the power connector is comprised within at least part of the robotic arm. 4. The system of claim 1, wherein the vehicle is an autonomous vehicle. 5. The system of claim 1, further comprising a Global Positioning System navigation system for locating the entities to which power is to be supplied. 6. The system of claim 1, further comprising a camera and computer processing system for at least one of vehicle navigation, vehicle parking, locating the power transfer switch, and connecting the other end of the power connector to the power transfer switch. 7. The system of claim 1, further comprising proximity sensors for at least one of vehicle navigation, vehicle parking, locating the power transfer switch, and connecting the other end of the connector to the power transfer switch. 8. The system of claim 1, further comprising a solar panel for at least one of charging the battery set and powering on-board vehicle electronics. 9. The system of claim 1, further comprising an inverter for connecting Direct Current power from the battery set to Alternating Current for use by the entities. 10. The system of claim 1, wherein the central server is implemented in a cloud configuration. 11. The system of claim 1, wherein at least of the entities have disparate energy charging requirements. 12. The system of claim 1, wherein the central server schedules vehicles using at least one of fair scheduling, round robin scheduling, location dependent scheduling, and price bidding dependent scheduling. 13. The system of claim 1, wherein the central server receives vehicle specific data from each of the vehicles, and schedules the vehicles using the vehicle specific data, the vehicle specific data comprising a vehicle location, an energy availability, and cost information. 14. The system of claim 13, wherein the central server receives traffic information, and schedules the vehicles using the traffic information. 15. The system of claim 1, wherein each of the vehicles receives traffic information and modifies its path to a given one of the entities using the traffic information. 16. The system of claim 1, wherein each of the entities further comprises, in addition to the power transfer switch:
a panel meter for monitoring power usage; and a local server for controlling the power transfer switch and for issuing the energy charging requests. 17. The system of claim 16, wherein the power transfer switch at each of the entities is configured to receive power from a power grid, and switch to battery power at at least one of particular times and under particular conditions. 18. The system of claim 16, wherein the particular times are dynamically variable. 19. A method for supplying mobile energy to entities at disparate locations, the method comprising:
configuring a set of vehicles to each include:
a battery set having one or more batteries for storing power; and
a power connector having an end connected to the battery set and another end for connecting to a power transfer switch at the entities; and
configuring a central server to schedule vehicles in the set to provide power to the entities responsive to energy charging requests issued by the entities. 20. The method of claim 19, wherein the central server receives vehicle specific data from each of the vehicles, and schedules the vehicles using the vehicle specific data, the vehicle specific data comprising a vehicle location, an energy availability, and cost information. | A mobile energy storage system and a method are provided for supplying power to entities at disparate locations. The system includes a set of vehicles. Each of the vehicles in the set includes a battery set having one or more batteries for storing power. Each of the vehicles in the set further includes a power connector having an end connected to the battery set and another end for connecting to a power transfer switch at the entities. The system also includes a central server for scheduling vehicles in the set to provide power to the entities responsive to energy charging requests issued by the entities.1. A mobile energy storage system for supplying power to entities at disparate locations, the system comprising:
a set of vehicles, each including:
a battery set having one or more batteries for storing power; and
a power connector having an end connected to the battery set and another end for connecting to a power transfer switch at the entities; and
a central server for scheduling vehicles in the set to provide power to the entities responsive to energy charging requests issued by the entities. 2. The system of claim 1, further comprising a robotic arm to connect the other end of the power connector to the power transfer switch. 3. The system of claim 2, wherein the power connector is comprised within at least part of the robotic arm. 4. The system of claim 1, wherein the vehicle is an autonomous vehicle. 5. The system of claim 1, further comprising a Global Positioning System navigation system for locating the entities to which power is to be supplied. 6. The system of claim 1, further comprising a camera and computer processing system for at least one of vehicle navigation, vehicle parking, locating the power transfer switch, and connecting the other end of the power connector to the power transfer switch. 7. The system of claim 1, further comprising proximity sensors for at least one of vehicle navigation, vehicle parking, locating the power transfer switch, and connecting the other end of the connector to the power transfer switch. 8. The system of claim 1, further comprising a solar panel for at least one of charging the battery set and powering on-board vehicle electronics. 9. The system of claim 1, further comprising an inverter for connecting Direct Current power from the battery set to Alternating Current for use by the entities. 10. The system of claim 1, wherein the central server is implemented in a cloud configuration. 11. The system of claim 1, wherein at least of the entities have disparate energy charging requirements. 12. The system of claim 1, wherein the central server schedules vehicles using at least one of fair scheduling, round robin scheduling, location dependent scheduling, and price bidding dependent scheduling. 13. The system of claim 1, wherein the central server receives vehicle specific data from each of the vehicles, and schedules the vehicles using the vehicle specific data, the vehicle specific data comprising a vehicle location, an energy availability, and cost information. 14. The system of claim 13, wherein the central server receives traffic information, and schedules the vehicles using the traffic information. 15. The system of claim 1, wherein each of the vehicles receives traffic information and modifies its path to a given one of the entities using the traffic information. 16. The system of claim 1, wherein each of the entities further comprises, in addition to the power transfer switch:
a panel meter for monitoring power usage; and a local server for controlling the power transfer switch and for issuing the energy charging requests. 17. The system of claim 16, wherein the power transfer switch at each of the entities is configured to receive power from a power grid, and switch to battery power at at least one of particular times and under particular conditions. 18. The system of claim 16, wherein the particular times are dynamically variable. 19. A method for supplying mobile energy to entities at disparate locations, the method comprising:
configuring a set of vehicles to each include:
a battery set having one or more batteries for storing power; and
a power connector having an end connected to the battery set and another end for connecting to a power transfer switch at the entities; and
configuring a central server to schedule vehicles in the set to provide power to the entities responsive to energy charging requests issued by the entities. 20. The method of claim 19, wherein the central server receives vehicle specific data from each of the vehicles, and schedules the vehicles using the vehicle specific data, the vehicle specific data comprising a vehicle location, an energy availability, and cost information. | 2,100 |
5,598 | 5,598 | 15,521,760 | 2,185 | Examples disclosed herein involve a first connector that facilitates access to a system, a second connector that facilitates access to the same system, and an adapter controller to facilitate concatenating functionality of the first connector and the second connector when the apparatus is communicatively coupled to the system via the first connector and the second connector; and establish a high speed connection between the system and the apparatus via the first connector and the second connector. | 1. An apparatus comprising:
a first connector that facilitates access to a system; a second connector that facilitates access to the same system; and an adapter controller to:
facilitate concatenating functionality of the first connector and the second connector when the apparatus is communicatively coupled to the system via the first connector and the second connector; and
establish a high speed connection between the system and the apparatus via the first connector and the second connector. 2. The apparatus as defined in claim 1, wherein the high speed connection is further established between the system and a peripheral device connected to the apparatus. 3. The apparatus as defined in claim 2, wherein the high speed connection is further established between the system and the peripheral device via at least one of an I/O controller, a repeater, a switch, or a hub. 4. The apparatus as defined in claim 2, wherein the adapter controller establishes the high speed connection between the system and the apparatus based on a type of a peripheral device or a type of I/O controller between the apparatus and the peripheral device. 5. The apparatus as defined in claim 1, wherein the adapter controller facilitates concatenating the functionality of the first connector and the second connector by instructing a controller of the system to allocate resources of the system to the first connector and the second connector to establish the high speed connection. 6. The apparatus as defined in claim 1, wherein the adapter controller concatenates the functionality of the first connector the and second connector by instructing the system to:
establish a connection between the first connector and one of:
a central processing unit of the system via a first peripheral component interconnect connection,
a graphics controller of the system via a first display port connection, or
a platform controller hub via a first universal serial bus connection; and
establish a connection between the second connector and one of:
the central processing unit of the system via a second peripheral component interconnect connection,
the graphics controller of the system via a second display port connection, or
the platform controller hub via a second universal serial bus connection. 7. The apparatus as defined in claim 1, wherein the first connector and the second connector are at a fixed physical configuration that matches corresponding connectors of the system to facilitate access to the system via the first connector and the second connector. 8. The apparatus as defined in claim 1, wherein the high speed connection provides a higher speed connection than if the peripheral device were connected to the system platform via one of either the first connector or the second connector. 9. A method comprising:
identifying a connection from a connection adapter to a system platform, the connection established via a first connector of the system platform and a second connector of the system platform; and instructing, via a processor of the connection adapter, the system platform to concatenate resources of the first connector and resources of the second connector such that the concatenated resources provide a high speed connection to a peripheral device via the connection adapter. 10. The method as defined in claim 9, further comprising:
identifying a type of the peripheral device or a type of an I/O controller for the peripheral device; and instructing the system platform to concatenate the resources of the first connector and the resources of the second connector based on the type of the peripheral device or the type of the I/O controller, respectively. 11. The method as defined in claim 9, further comprising:
establishing the high speed connection between the system platform and the peripheral device via an I/O controller for the peripheral device. 12. The method as defined in claim 11, wherein the I/O controller comprises at least one of a repeater, a switch, or a hub. 13. A non-transitory computer readable storage medium comprising executable instructions that, when executed, cause a machine to at least:
concatenate resources of a first connector and a second connector in response to receiving instructions from a connection adapter by adjusting flexible input/output lanes connected to the first connector and the second connector; and establish a high speed communication link using the concatenated resources with a peripheral device via the adapter through the first connector and the second connector. 14. The non-transitory computer readable storage medium of claim 13, wherein the executable instructions further cause the machine to:
concatenate the resources of the first connector and the second connector by establishing communication links between components of the machine and the first and second connectors as indicated in the instructions from the connection adapter. 15. The non-transitory computer readable storage medium of claim 13, wherein the executable instructions further cause the machine to:
receive communication settings from the connection adapter for establishing the communication link. | Examples disclosed herein involve a first connector that facilitates access to a system, a second connector that facilitates access to the same system, and an adapter controller to facilitate concatenating functionality of the first connector and the second connector when the apparatus is communicatively coupled to the system via the first connector and the second connector; and establish a high speed connection between the system and the apparatus via the first connector and the second connector.1. An apparatus comprising:
a first connector that facilitates access to a system; a second connector that facilitates access to the same system; and an adapter controller to:
facilitate concatenating functionality of the first connector and the second connector when the apparatus is communicatively coupled to the system via the first connector and the second connector; and
establish a high speed connection between the system and the apparatus via the first connector and the second connector. 2. The apparatus as defined in claim 1, wherein the high speed connection is further established between the system and a peripheral device connected to the apparatus. 3. The apparatus as defined in claim 2, wherein the high speed connection is further established between the system and the peripheral device via at least one of an I/O controller, a repeater, a switch, or a hub. 4. The apparatus as defined in claim 2, wherein the adapter controller establishes the high speed connection between the system and the apparatus based on a type of a peripheral device or a type of I/O controller between the apparatus and the peripheral device. 5. The apparatus as defined in claim 1, wherein the adapter controller facilitates concatenating the functionality of the first connector and the second connector by instructing a controller of the system to allocate resources of the system to the first connector and the second connector to establish the high speed connection. 6. The apparatus as defined in claim 1, wherein the adapter controller concatenates the functionality of the first connector the and second connector by instructing the system to:
establish a connection between the first connector and one of:
a central processing unit of the system via a first peripheral component interconnect connection,
a graphics controller of the system via a first display port connection, or
a platform controller hub via a first universal serial bus connection; and
establish a connection between the second connector and one of:
the central processing unit of the system via a second peripheral component interconnect connection,
the graphics controller of the system via a second display port connection, or
the platform controller hub via a second universal serial bus connection. 7. The apparatus as defined in claim 1, wherein the first connector and the second connector are at a fixed physical configuration that matches corresponding connectors of the system to facilitate access to the system via the first connector and the second connector. 8. The apparatus as defined in claim 1, wherein the high speed connection provides a higher speed connection than if the peripheral device were connected to the system platform via one of either the first connector or the second connector. 9. A method comprising:
identifying a connection from a connection adapter to a system platform, the connection established via a first connector of the system platform and a second connector of the system platform; and instructing, via a processor of the connection adapter, the system platform to concatenate resources of the first connector and resources of the second connector such that the concatenated resources provide a high speed connection to a peripheral device via the connection adapter. 10. The method as defined in claim 9, further comprising:
identifying a type of the peripheral device or a type of an I/O controller for the peripheral device; and instructing the system platform to concatenate the resources of the first connector and the resources of the second connector based on the type of the peripheral device or the type of the I/O controller, respectively. 11. The method as defined in claim 9, further comprising:
establishing the high speed connection between the system platform and the peripheral device via an I/O controller for the peripheral device. 12. The method as defined in claim 11, wherein the I/O controller comprises at least one of a repeater, a switch, or a hub. 13. A non-transitory computer readable storage medium comprising executable instructions that, when executed, cause a machine to at least:
concatenate resources of a first connector and a second connector in response to receiving instructions from a connection adapter by adjusting flexible input/output lanes connected to the first connector and the second connector; and establish a high speed communication link using the concatenated resources with a peripheral device via the adapter through the first connector and the second connector. 14. The non-transitory computer readable storage medium of claim 13, wherein the executable instructions further cause the machine to:
concatenate the resources of the first connector and the second connector by establishing communication links between components of the machine and the first and second connectors as indicated in the instructions from the connection adapter. 15. The non-transitory computer readable storage medium of claim 13, wherein the executable instructions further cause the machine to:
receive communication settings from the connection adapter for establishing the communication link. | 2,100 |
5,599 | 5,599 | 14,263,439 | 2,156 | Streaming data is populated to an in-memory data table and a continuous query is executed against an in-memory data table using a database interface to perform analytical operations on the populated in-memory data table. Results from the analytical operations performed are streamed to consuming applications. | 1. A method, comprising:
defining a Streaming Data Table (SDT); accessing a database interface to create an instance of the SDT in memory; receiving streaming data from at least one streaming source over a network; and populating the streaming data into the instance of the SDT through the database interface. 2. The method of claim 1, wherein defining further includes receiving a Data Definition Language (DDL) statement for defining the instance of the SDT. 3. The method of claim 2, wherein receiving further includes identifying at least one extended Structure Query Language (SQL) statements within the DDL statement. 4. The method of claim 3, wherein identifying further includes identifying a first extended SQL statement as a size for housing the streaming data in the memory. 5. The method of claim 4, wherein identifying further includes identifying a second extended SQL statement as a total number of processing units in a parallel processing database environment for simultaneously accessing the instance and other instances of the SDT. 6. The method of claim 5, wherein identifying further includes identifying a third extended SQL statement as a total size for each of the instance and other instances in the memory. 7. The method of claim 1, wherein defining further includes defining the instance of the SDT based on a single source for the streaming data. 8. The method of claim 1, wherein defining further includes defining the instance of the SDT based on multiple sources for the streaming data. 9. The method of claim 1, wherein defining further includes defining access control and security on the instance of the SDT through the database interface. 10. A method, comprising:
accessing a Streaming Data Table (SDT) from memory using a database interface to acquire portions of streaming data housed in fields of the SDT; processing one or more operations on the portions of the streaming data based on each portion's field identifier within the SDT; and streaming continuous results from processing the one or more operations to one or more consuming applications. 11. The method of claim 10 further comprising, processing the method as multiple independent execution instances. 12. The method of claim 11, wherein processing further includes operating each instance on a different processing unit of a parallel processing database environment, wherein each instance operates in parallel to remaining instances, and wherein each instance operates on a different and unique portion of the streaming data housed in an independent SDT instance of the SDT uniquely accessible to that instance. 13. The method of claim 10, wherein accessing further includes continuously accessing the SDT for processing as various portions of the streaming data are updated. 14. The method of claim 10, wherein processing further includes performing custom operations as user defined functions defined in the database interface. 15. The method of claim 10, wherein processing further includes continuously processing the operations as the portions are updated within the SDT. 16. The method of claim 10, wherein processing further includes processing each of the operations in a predefined order based on the field identifiers. 17. The method of claim 16, wherein processing further includes processing at least two operations on a same portion of the streaming data acquired from the SDT from a single field identifier. 18. A processor-implemented system, comprising:
a memory having at least one instance of a Streaming Data Table (SDT) with fields of the SDT having a unique portion of streaming data; and a SDT manager adapted and configured to: i) execute on at least one processor, ii) define and create the at least one instance of the SDT, and iii) populate each unique portion of the streaming data to that portion's designated field; and a streaming engine adapted and configured to: i) execute as multiple independent instances on multiple processing units of a parallel processing database environment, ii) continuously access the fields of the SDT as each field is updated with the streaming data, iii) continuously process operations on each portion of the streaming data with each update to produce results, and iv) stream the results as produced to consuming applications. 19. The system of claim 18, wherein the SDT manager is further adapted and configured, in ii), to use one or more extended Data Definition Language (DDL) statements to define the SDT. 20. The system of claim 18, wherein the streaming engine is further adapted and configured, in ii), to ensure each independent instance accesses and processes different portions of the streaming data housed in the fields of the SDT from remaining independent instances. | Streaming data is populated to an in-memory data table and a continuous query is executed against an in-memory data table using a database interface to perform analytical operations on the populated in-memory data table. Results from the analytical operations performed are streamed to consuming applications.1. A method, comprising:
defining a Streaming Data Table (SDT); accessing a database interface to create an instance of the SDT in memory; receiving streaming data from at least one streaming source over a network; and populating the streaming data into the instance of the SDT through the database interface. 2. The method of claim 1, wherein defining further includes receiving a Data Definition Language (DDL) statement for defining the instance of the SDT. 3. The method of claim 2, wherein receiving further includes identifying at least one extended Structure Query Language (SQL) statements within the DDL statement. 4. The method of claim 3, wherein identifying further includes identifying a first extended SQL statement as a size for housing the streaming data in the memory. 5. The method of claim 4, wherein identifying further includes identifying a second extended SQL statement as a total number of processing units in a parallel processing database environment for simultaneously accessing the instance and other instances of the SDT. 6. The method of claim 5, wherein identifying further includes identifying a third extended SQL statement as a total size for each of the instance and other instances in the memory. 7. The method of claim 1, wherein defining further includes defining the instance of the SDT based on a single source for the streaming data. 8. The method of claim 1, wherein defining further includes defining the instance of the SDT based on multiple sources for the streaming data. 9. The method of claim 1, wherein defining further includes defining access control and security on the instance of the SDT through the database interface. 10. A method, comprising:
accessing a Streaming Data Table (SDT) from memory using a database interface to acquire portions of streaming data housed in fields of the SDT; processing one or more operations on the portions of the streaming data based on each portion's field identifier within the SDT; and streaming continuous results from processing the one or more operations to one or more consuming applications. 11. The method of claim 10 further comprising, processing the method as multiple independent execution instances. 12. The method of claim 11, wherein processing further includes operating each instance on a different processing unit of a parallel processing database environment, wherein each instance operates in parallel to remaining instances, and wherein each instance operates on a different and unique portion of the streaming data housed in an independent SDT instance of the SDT uniquely accessible to that instance. 13. The method of claim 10, wherein accessing further includes continuously accessing the SDT for processing as various portions of the streaming data are updated. 14. The method of claim 10, wherein processing further includes performing custom operations as user defined functions defined in the database interface. 15. The method of claim 10, wherein processing further includes continuously processing the operations as the portions are updated within the SDT. 16. The method of claim 10, wherein processing further includes processing each of the operations in a predefined order based on the field identifiers. 17. The method of claim 16, wherein processing further includes processing at least two operations on a same portion of the streaming data acquired from the SDT from a single field identifier. 18. A processor-implemented system, comprising:
a memory having at least one instance of a Streaming Data Table (SDT) with fields of the SDT having a unique portion of streaming data; and a SDT manager adapted and configured to: i) execute on at least one processor, ii) define and create the at least one instance of the SDT, and iii) populate each unique portion of the streaming data to that portion's designated field; and a streaming engine adapted and configured to: i) execute as multiple independent instances on multiple processing units of a parallel processing database environment, ii) continuously access the fields of the SDT as each field is updated with the streaming data, iii) continuously process operations on each portion of the streaming data with each update to produce results, and iv) stream the results as produced to consuming applications. 19. The system of claim 18, wherein the SDT manager is further adapted and configured, in ii), to use one or more extended Data Definition Language (DDL) statements to define the SDT. 20. The system of claim 18, wherein the streaming engine is further adapted and configured, in ii), to ensure each independent instance accesses and processes different portions of the streaming data housed in the fields of the SDT from remaining independent instances. | 2,100 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.