Unnamed: 0
int64 0
350k
| ApplicationNumber
int64 9.75M
96.1M
| ArtUnit
int64 1.6k
3.99k
| Abstract
stringlengths 7
8.37k
| Claims
stringlengths 3
292k
| abstract-claims
stringlengths 68
293k
| TechCenter
int64 1.6k
3.9k
|
|---|---|---|---|---|---|---|
5,100 | 15,369,735 | 2,126 | In certain implementations, a user request to add a new concept may be received. A set of media item recommendations may be caused to be loaded on a user interface for presentation to a user responsive to the user request to add the new concept. The media item recommendation set may include a set of recommendations loaded on an on-screen portion of the user interface and a set of recommendations loaded on an off-screen portion of the user interface. The on-screen user interface portion is visible to the user at a first time. The off-screen user interface portion is not being visible to the user at the first time. A user selection of one or more recommendations of the on-screen recommendation set is received. The off-screen recommendation set may be caused to be updated on the user interface during the presentation of the media item recommendation set based on the user recommendation selection. | 1. A system for updating, on a user interface, recommendations in real-time based on user selection of media item recommendations provided via the user interface, the system comprising:
one or more hardware processors configured by machine-readable instructions to:
receive a user request to add a new concept;
cause a set of media item recommendations to be loaded on a user interface for presentation to a user responsive to the user request to add the new concept, the media item recommendation set comprising a set of recommendations loaded on an on-screen portion of the user interface and a set of recommendations loaded on an off-screen portion of the user interface, the on screen user interface portion being visible to the user at a first time, and the off-screen user interface portion not being visible to the user at the first time;
receive a user selection of one or more recommendations of the on-screen recommendation set;
identify, based on the user recommendation selection, one or more recommendations of the on-screen recommendation set that are not included in the user recommendation selection; and
cause, based on the user recommendation selection, the off-screen recommendation set to be updated on the user interface during the presentation of the media item recommendation set. 2. The system of claim 1, wherein no removal, from the on-screen recommendation set loaded on the on-screen user interface portion visible to the user at the first time, of a recommendation of the on-screen recommendation set that is not included in the user recommendation selection occurs from the user recommendation selection. 3. The system of claim 1, wherein the one or more hardware processors are configured by machine-readable instructions to cause, based on the user recommendation selection, the on-screen recommendation set loaded on the on-screen user interface portion visible to the user at the first time to be updated on the user interface during the presentation of the media item recommendation set. 4. The system of claim 1, wherein the one or more hardware processors are configured by machine-readable instructions to cause the off-screen recommendation set to be updated by causing, based on the user recommendation selection, the off-screen recommendation set to be updated on the user interface before receiving a user manipulation of the user interface that causes at least some of the off-screen user interface portion not visible to the user at the first time to become visible to the user. 5. The system of claim 4, wherein the user manipulation corresponds to a user request to bring on-screen on the user interface at least some of the off-screen user interface portion not visible to the user at the first time. 6. The system of claim 4, wherein the user manipulation corresponds to user scrolling. 7. The system of claim 1, wherein the one or more hardware processors are configured by machine-readable instructions to:
identify one or more new recommendations as having one or more characteristics similar to one or more recommendations of the on-screen recommendation set that are included in the user recommendation selection; and cause the off-screen recommendation set to be updated on the user interface by causing the off-screen recommendation set to be updated with the new recommendations during the presentation of the media item recommendation set. 8. The system of claim 7, wherein the one or more hardware processors are configured by machine-readable instructions to identify the new recommendations for updating the media item recommendation set based on the new recommendations being more similar to one or more recommendations of the on-screen recommendation set that are included in the user recommendation selection than one or more recommendations of the on-screen recommendation set that are not included in the user recommendation selection. 9. The system of claim 1, wherein the one or more hardware processors are configured by machine-readable instructions to cause the off-screen recommendation set to be updated on the user interface by causing, based on the user recommendation selection, one or more recommendations of the off-screen recommendation set to be replaced with one or more new recommendations during the presentation of the media item recommendation set. 10. The system of claim 1, wherein the one or more hardware processors are configured by machine-readable instructions to cause the off-screen recommendation set to be updated on the user interface by causing, based on the user recommendation selection, reordering of recommendations of the off-screen recommendation set during the presentation of the media item recommendation set. 11. The system of claim 1, wherein the one or more hardware processors are further configured by machine-readable instructions to:
identify, as positive examples, based on the user recommendation selection, one or more recommendations of the on-screen recommendation set that are included in the user recommendation selection; and generate an indication on the user interface that the new concept has been learned based on a threshold number of positive examples being identified during the presentation of the media item recommendation set. 12. The system of claim 1, wherein the user request to add the new concept comprises a user-provided definition of the new concept, the user-provided definition comprising one or more words describing the new concept. 13. The system of claim 1, wherein the one or more hardware processors are configured by machine-readable instructions to cause the media item recommendation set to be loaded on the user interface by causing graphical representations of recommended media items to be loaded on the user interface for presentation to the user. 14. The system of claim 13, wherein the graphical representations of the recommended media items comprises thumbnail images of the recommended media items. 15. The system of claim 13, wherein the recommended media items comprises one or more of images, animations, videos, or audios. 16. The system of claim 1, wherein the one or more hardware processors are configured by machine-readable instructions to:
cause a set of concept categories to be presented on the user interface; and receive a user selection of a concept category of the concept category set, wherein the user request to add the new concept is a request to add the new concept to the user-selected concept category. 17. The system of claim 16, wherein concept categories of the concept category set are represented as category tiles on the user interface. 18. The system of claim 16, wherein concept categories of the concept category set comprises one or more of recently created concepts, people, places, things, times, favorites, interests, or categories provided by other users. 19. A method for updating, on a user interface, recommendations in real-time based on user selection of media item recommendations provided via the user interface, the method being performed by one or more hardware processors configured by machine-readable instructions that, when executed by the one or more hardware processors, perform the method, the method comprising:
receiving a user request to add a new concept; causing a set of media item recommendations to be loaded on a user interface for presentation to a user responsive to the user request to add the new concept, the media item recommendation set comprising a set of recommendations loaded on an on-screen portion of the user interface and a set of recommendations loaded on an off-screen portion of the user interface, the on-screen user interface portion being visible to the user at a first time, and the off-screen user interface portion not being visible to the user at the first time; receiving a user selection of one or more recommendations of the on-screen recommendation set; identifying, based on the user recommendation selection, one or more recommendations of the on-screen recommendation set that are not included in the user recommendation selection; and causing, based on the user recommendation selection, the off-screen recommendation set to be updated on the user interface during the presentation of the media item recommendation set. 20. The system of claim 19, wherein no removal, from the on-screen recommendation set loaded on the on-screen user interface portion visible to the user at the first time, of a recommendation of the on-screen recommendation set that is not included in the user recommendation selection occurs from the user recommendation selection. | In certain implementations, a user request to add a new concept may be received. A set of media item recommendations may be caused to be loaded on a user interface for presentation to a user responsive to the user request to add the new concept. The media item recommendation set may include a set of recommendations loaded on an on-screen portion of the user interface and a set of recommendations loaded on an off-screen portion of the user interface. The on-screen user interface portion is visible to the user at a first time. The off-screen user interface portion is not being visible to the user at the first time. A user selection of one or more recommendations of the on-screen recommendation set is received. The off-screen recommendation set may be caused to be updated on the user interface during the presentation of the media item recommendation set based on the user recommendation selection.1. A system for updating, on a user interface, recommendations in real-time based on user selection of media item recommendations provided via the user interface, the system comprising:
one or more hardware processors configured by machine-readable instructions to:
receive a user request to add a new concept;
cause a set of media item recommendations to be loaded on a user interface for presentation to a user responsive to the user request to add the new concept, the media item recommendation set comprising a set of recommendations loaded on an on-screen portion of the user interface and a set of recommendations loaded on an off-screen portion of the user interface, the on screen user interface portion being visible to the user at a first time, and the off-screen user interface portion not being visible to the user at the first time;
receive a user selection of one or more recommendations of the on-screen recommendation set;
identify, based on the user recommendation selection, one or more recommendations of the on-screen recommendation set that are not included in the user recommendation selection; and
cause, based on the user recommendation selection, the off-screen recommendation set to be updated on the user interface during the presentation of the media item recommendation set. 2. The system of claim 1, wherein no removal, from the on-screen recommendation set loaded on the on-screen user interface portion visible to the user at the first time, of a recommendation of the on-screen recommendation set that is not included in the user recommendation selection occurs from the user recommendation selection. 3. The system of claim 1, wherein the one or more hardware processors are configured by machine-readable instructions to cause, based on the user recommendation selection, the on-screen recommendation set loaded on the on-screen user interface portion visible to the user at the first time to be updated on the user interface during the presentation of the media item recommendation set. 4. The system of claim 1, wherein the one or more hardware processors are configured by machine-readable instructions to cause the off-screen recommendation set to be updated by causing, based on the user recommendation selection, the off-screen recommendation set to be updated on the user interface before receiving a user manipulation of the user interface that causes at least some of the off-screen user interface portion not visible to the user at the first time to become visible to the user. 5. The system of claim 4, wherein the user manipulation corresponds to a user request to bring on-screen on the user interface at least some of the off-screen user interface portion not visible to the user at the first time. 6. The system of claim 4, wherein the user manipulation corresponds to user scrolling. 7. The system of claim 1, wherein the one or more hardware processors are configured by machine-readable instructions to:
identify one or more new recommendations as having one or more characteristics similar to one or more recommendations of the on-screen recommendation set that are included in the user recommendation selection; and cause the off-screen recommendation set to be updated on the user interface by causing the off-screen recommendation set to be updated with the new recommendations during the presentation of the media item recommendation set. 8. The system of claim 7, wherein the one or more hardware processors are configured by machine-readable instructions to identify the new recommendations for updating the media item recommendation set based on the new recommendations being more similar to one or more recommendations of the on-screen recommendation set that are included in the user recommendation selection than one or more recommendations of the on-screen recommendation set that are not included in the user recommendation selection. 9. The system of claim 1, wherein the one or more hardware processors are configured by machine-readable instructions to cause the off-screen recommendation set to be updated on the user interface by causing, based on the user recommendation selection, one or more recommendations of the off-screen recommendation set to be replaced with one or more new recommendations during the presentation of the media item recommendation set. 10. The system of claim 1, wherein the one or more hardware processors are configured by machine-readable instructions to cause the off-screen recommendation set to be updated on the user interface by causing, based on the user recommendation selection, reordering of recommendations of the off-screen recommendation set during the presentation of the media item recommendation set. 11. The system of claim 1, wherein the one or more hardware processors are further configured by machine-readable instructions to:
identify, as positive examples, based on the user recommendation selection, one or more recommendations of the on-screen recommendation set that are included in the user recommendation selection; and generate an indication on the user interface that the new concept has been learned based on a threshold number of positive examples being identified during the presentation of the media item recommendation set. 12. The system of claim 1, wherein the user request to add the new concept comprises a user-provided definition of the new concept, the user-provided definition comprising one or more words describing the new concept. 13. The system of claim 1, wherein the one or more hardware processors are configured by machine-readable instructions to cause the media item recommendation set to be loaded on the user interface by causing graphical representations of recommended media items to be loaded on the user interface for presentation to the user. 14. The system of claim 13, wherein the graphical representations of the recommended media items comprises thumbnail images of the recommended media items. 15. The system of claim 13, wherein the recommended media items comprises one or more of images, animations, videos, or audios. 16. The system of claim 1, wherein the one or more hardware processors are configured by machine-readable instructions to:
cause a set of concept categories to be presented on the user interface; and receive a user selection of a concept category of the concept category set, wherein the user request to add the new concept is a request to add the new concept to the user-selected concept category. 17. The system of claim 16, wherein concept categories of the concept category set are represented as category tiles on the user interface. 18. The system of claim 16, wherein concept categories of the concept category set comprises one or more of recently created concepts, people, places, things, times, favorites, interests, or categories provided by other users. 19. A method for updating, on a user interface, recommendations in real-time based on user selection of media item recommendations provided via the user interface, the method being performed by one or more hardware processors configured by machine-readable instructions that, when executed by the one or more hardware processors, perform the method, the method comprising:
receiving a user request to add a new concept; causing a set of media item recommendations to be loaded on a user interface for presentation to a user responsive to the user request to add the new concept, the media item recommendation set comprising a set of recommendations loaded on an on-screen portion of the user interface and a set of recommendations loaded on an off-screen portion of the user interface, the on-screen user interface portion being visible to the user at a first time, and the off-screen user interface portion not being visible to the user at the first time; receiving a user selection of one or more recommendations of the on-screen recommendation set; identifying, based on the user recommendation selection, one or more recommendations of the on-screen recommendation set that are not included in the user recommendation selection; and causing, based on the user recommendation selection, the off-screen recommendation set to be updated on the user interface during the presentation of the media item recommendation set. 20. The system of claim 19, wherein no removal, from the on-screen recommendation set loaded on the on-screen user interface portion visible to the user at the first time, of a recommendation of the on-screen recommendation set that is not included in the user recommendation selection occurs from the user recommendation selection. | 2,100 |
5,101 | 15,137,436 | 2,158 | A system and method for facilitating the accurate entry of information into a highly structured database by initially extracting information from a plurality of nonuniformly formatted source data streams, e.g., documents/files, and subsequent interactions with users before storing the accepted and/or modified information into the database. Embodiments of the present invention provide an interactive path for each user (e.g., the author of the source document/file) to interactively modify the extracted data, e.g., according to the source document/file. Preferably, this interactive path is provided via the Internet and the extracted information can be modified by editing and/or selectively copying portions of the source documents/files to supplement and/or modify the extracted information. | 1. A method for facilitating via an interactive path a transfer of resume data to a service provider, the method comprising:
(a) receiving, by a service provider via an interactive path with a job applicant, digital data comprising a resume of the job applicant, the interactive path provided via a remote communication interface; (b) extracting, by the service provider, a plurality of data strings from the resume; (c) sending, by the service provider via the interactive path to the job applicant, an inquiry form asking the job applicant a supplemental question; (d) receiving, by the service provider via the interactive path from the job applicant, a data string responsive to the supplemental question; and (e) sending, by the service provider via the interactive path to the job applicant, a structured form comprising a plurality of fields, a first field of the plurality of fields accommodating an extracted data string from the resume and a second field of the plurality of fields accommodating the data string responsive to the supplemental question. 2. The method of claim 1, wherein step (a) further comprises receiving, by the service provider via the interactive path, digital data representing a source data stream from the job applicant, the source data stream containing data corresponding to multiple discernable data strings. 3. The method of claim 1, wherein step (a) further comprising receiving, by the service provider, a request from the job applicant for a web page to begin a process via the interactive path of interactively transferring the resume to the service provider. 4. The method of claim 2, further comprising sending, by the service provider via the interactive path, the web page for display by a browser used by the job applicant. 5. The method of claim 1, wherein step (a) further comprises storing, by the service providers, the resume to a database. 6. The method of claim 1, wherein step (b), further comprises extracting, by the service provider, the plurality of data strings according to syntactical rules. 7. The method of claim 1, wherein step (b), further comprises storing, by the service provider, the extracted plurality of data strings to a database. 8. The method of claim 1, wherein step (c) further comprises sending, by the service provider via the interactive path, a web page comprising the inquiry form. 9. The method of claim 1, wherein step (d) further comprises receiving, by the service provider via the interactive path from the job applicant, a filled-in inquiry form. 10. The method of claim 1, wherein step (e) further comprises sending, by the service provider via the interactive path to the job applicant, a web page comprising the structured form. 11. The method of claim 1, wherein step (e) further comprises receiving, by the service provider via the interactive path from the job applicant, one of acceptance or modification of data of the plurality of fields of the structured form. 12. The method of claim 1, wherein step (e) further comprises receiving, by the service provider via the interactive path from the job applicant, modification of data in the one or more fields of the plurality of fields of the structured form. 13. A system for facilitating via an interactive path a transfer of resume data to a service provider, the system comprising:
a remote communication interface of a service provider receiving digital data comprising a resume of a job applicant, the remote communication interface providing an interactive path with the job applicant; an extractor extracting a plurality of data strings from the resume; a form generator sending via the interactive path to the job applicant, an inquiry form asking the job applicant a supplemental question; and wherein the service provider receives via the interactive path from the job applicant, a data string responsive to the supplemental question; and wherein the form generator sends via the interactive path to the job applicant, a structured form comprising a plurality of fields, a first field of the plurality of fields accommodating an extracted data string from the resume and a second field of the plurality of fields accommodating the data string responsive to the supplemental question. 14. The system of claim 13, wherein the service provider receives via the interactive path digital data representing a source data stream from the job applicant, the source data stream containing data corresponding to multiple discernable data strings. 15. The system of claim 13, wherein the remote communication interface receives a request from the job applicant for a web page to begin a process via the interactive path of interactively transferring the resume to the service provider. 16. The system of claim 15, wherein the form generator sends via the interactive path the web page for display by a browser used by the job applicant. 17. The system of claim 13, further comprising a database to store the resume. 18. The system of claim 13, wherein the extractor extracts the plurality of data strings according to syntactical rules. 19. The system of claim 13, wherein a database stores the extracted plurality of data strings. 20. The system of claim 13, wherein the form generator sends, via the interactive path, a web page comprising the inquiry form. 21. The system of claim 13, wherein the service provider receives via the interactive path from the job applicant a filled-in inquiry form. 22. The system of claim 13, wherein the form generator sends via the interactive path to the job applicant a web page comprising the structured form. 23. The system of claim 13, wherein the service provider receives via the interactive path from the job applicant, one of acceptance or modification of data of the plurality of fields of the structured form. 24. The system of claim 13, wherein the service provider receives via the interactive path from the job applicant, modification of data in the one or more fields of the plurality of fields of the structured form. | A system and method for facilitating the accurate entry of information into a highly structured database by initially extracting information from a plurality of nonuniformly formatted source data streams, e.g., documents/files, and subsequent interactions with users before storing the accepted and/or modified information into the database. Embodiments of the present invention provide an interactive path for each user (e.g., the author of the source document/file) to interactively modify the extracted data, e.g., according to the source document/file. Preferably, this interactive path is provided via the Internet and the extracted information can be modified by editing and/or selectively copying portions of the source documents/files to supplement and/or modify the extracted information.1. A method for facilitating via an interactive path a transfer of resume data to a service provider, the method comprising:
(a) receiving, by a service provider via an interactive path with a job applicant, digital data comprising a resume of the job applicant, the interactive path provided via a remote communication interface; (b) extracting, by the service provider, a plurality of data strings from the resume; (c) sending, by the service provider via the interactive path to the job applicant, an inquiry form asking the job applicant a supplemental question; (d) receiving, by the service provider via the interactive path from the job applicant, a data string responsive to the supplemental question; and (e) sending, by the service provider via the interactive path to the job applicant, a structured form comprising a plurality of fields, a first field of the plurality of fields accommodating an extracted data string from the resume and a second field of the plurality of fields accommodating the data string responsive to the supplemental question. 2. The method of claim 1, wherein step (a) further comprises receiving, by the service provider via the interactive path, digital data representing a source data stream from the job applicant, the source data stream containing data corresponding to multiple discernable data strings. 3. The method of claim 1, wherein step (a) further comprising receiving, by the service provider, a request from the job applicant for a web page to begin a process via the interactive path of interactively transferring the resume to the service provider. 4. The method of claim 2, further comprising sending, by the service provider via the interactive path, the web page for display by a browser used by the job applicant. 5. The method of claim 1, wherein step (a) further comprises storing, by the service providers, the resume to a database. 6. The method of claim 1, wherein step (b), further comprises extracting, by the service provider, the plurality of data strings according to syntactical rules. 7. The method of claim 1, wherein step (b), further comprises storing, by the service provider, the extracted plurality of data strings to a database. 8. The method of claim 1, wherein step (c) further comprises sending, by the service provider via the interactive path, a web page comprising the inquiry form. 9. The method of claim 1, wherein step (d) further comprises receiving, by the service provider via the interactive path from the job applicant, a filled-in inquiry form. 10. The method of claim 1, wherein step (e) further comprises sending, by the service provider via the interactive path to the job applicant, a web page comprising the structured form. 11. The method of claim 1, wherein step (e) further comprises receiving, by the service provider via the interactive path from the job applicant, one of acceptance or modification of data of the plurality of fields of the structured form. 12. The method of claim 1, wherein step (e) further comprises receiving, by the service provider via the interactive path from the job applicant, modification of data in the one or more fields of the plurality of fields of the structured form. 13. A system for facilitating via an interactive path a transfer of resume data to a service provider, the system comprising:
a remote communication interface of a service provider receiving digital data comprising a resume of a job applicant, the remote communication interface providing an interactive path with the job applicant; an extractor extracting a plurality of data strings from the resume; a form generator sending via the interactive path to the job applicant, an inquiry form asking the job applicant a supplemental question; and wherein the service provider receives via the interactive path from the job applicant, a data string responsive to the supplemental question; and wherein the form generator sends via the interactive path to the job applicant, a structured form comprising a plurality of fields, a first field of the plurality of fields accommodating an extracted data string from the resume and a second field of the plurality of fields accommodating the data string responsive to the supplemental question. 14. The system of claim 13, wherein the service provider receives via the interactive path digital data representing a source data stream from the job applicant, the source data stream containing data corresponding to multiple discernable data strings. 15. The system of claim 13, wherein the remote communication interface receives a request from the job applicant for a web page to begin a process via the interactive path of interactively transferring the resume to the service provider. 16. The system of claim 15, wherein the form generator sends via the interactive path the web page for display by a browser used by the job applicant. 17. The system of claim 13, further comprising a database to store the resume. 18. The system of claim 13, wherein the extractor extracts the plurality of data strings according to syntactical rules. 19. The system of claim 13, wherein a database stores the extracted plurality of data strings. 20. The system of claim 13, wherein the form generator sends, via the interactive path, a web page comprising the inquiry form. 21. The system of claim 13, wherein the service provider receives via the interactive path from the job applicant a filled-in inquiry form. 22. The system of claim 13, wherein the form generator sends via the interactive path to the job applicant a web page comprising the structured form. 23. The system of claim 13, wherein the service provider receives via the interactive path from the job applicant, one of acceptance or modification of data of the plurality of fields of the structured form. 24. The system of claim 13, wherein the service provider receives via the interactive path from the job applicant, modification of data in the one or more fields of the plurality of fields of the structured form. | 2,100 |
5,102 | 14,575,819 | 2,119 | A system for enhancing a flow of a fluid induced by a rod pumping unit is provided. The system includes one or more sensors and a pumping control unit configured to control stroke movement of the rod pumping unit. The pumping control unit is configured to: (a) initiate at least one stroke of the rod pumping unit; (b) receive sensor data from the one or more sensors; (c) upon determination of a violation of a first set of constraints, make a first adjustment to the current stroke timing, and return to step (a); (d) upon determination of a violation of a second set of constraints, make a second adjustment to the current stroke timing, and return to step (a); and (e) upon determination of no violation of at least one set of constraints make a third adjustment to the current stroke timing, and return to step (a). | 1. A system for enhancing a flow of a fluid induced by a rod pumping unit, said system comprising:
one or more sensors configured to monitor one or more conditions of the rod pumping unit and generate signals representing sensor data based on the one or more conditions; and a pumping control unit comprising a processor and a memory, said pumping control unit in communication with said one or more sensors, said pumping control unit configured to control stroke movement of the rod pumping unit, thereby controlling the flow of the fluid induced by the rod pumping unit, said pumping control unit configured to:
(a) initiate at least one stroke of the rod pumping unit, wherein the at least one stroke is based on current stroke timing data, wherein the current stroke timing data includes a value for strokes per minute (SPM);
(b) receive signals representing sensor data from the one or more sensors;
(c) upon a determination of, based on the sensor data, a violation of a first set of constraints, make a first adjustment to the current stroke timing, and return to step (a);
(d) upon a determination of, based on the sensor data, a violation of a second set of constraints, make a second adjustment to the current stroke timing, and return to step (a); and
(e) upon a determination of, based on the sensor data, no violation of at least one set of constraints, make a third adjustment to the current stroke timing, and return to step (a). 2. The system in accordance with claim 1, wherein said pumping control unit further configured to, upon a determination of, based on the sensor data, a violation of a third set of constraints, make a fourth adjustment to the current stroke timing, and return to step (a). 3. The system in accordance with claim 1, wherein the third adjustment increases the value for SPM to increase the flow of fluid induced. 4. The system in accordance with claim 1, wherein said pumping control unit further configured to, upon a determination that the current stroke timing exceeds total time available for a stroke, perform at least one of reduce the value for SPM, and reverse one or more previously made adjustments. 5. The system in accordance with claim 1, wherein the first set of constraints based on one or more load and power specifications of the rod pumping unit. 6. The system in accordance with claim 1, wherein the second set of constraints based on one or more buckling criterion. 7. The system in accordance with claim 2, wherein the third set of constraints based on one or more fatigue criterion. 8. The system in accordance with claim 1, wherein the current stroke timing further includes at least one of an upstroke acceleration time, an upstroke deceleration time, a downstroke acceleration time, a downstroke deceleration time, an upstroke time, and an upper velocity parameter. 9. The system in accordance with claim 1, wherein the at least one stroke includes a plurality of stages which include an upstroke acceleration stage, an upstroke deceleration stage, a downstroke acceleration stage, a downstroke deceleration stage, and a constant velocity stage. 10. The system in accordance with claim 9, wherein said pumping control unit further configured to:
determine a stage of the plurality of stages of the at least one stroke that the first constraint was violated; determine last adjustment made to current stroke timing; and make the first adjustment based on the determined stage and the last adjustment made. 11. The system in accordance with claim 2, wherein said pumping control unit further configured to store at least one of a last action made and a last fail mode based on which set of constraints was violated. 12. The system in accordance with claim 11, wherein wherein upon a determination of, based on the sensor data, a violation of the third set of constraints, said pumping control unit further configured to make the fourth adjustment based on an amount of violation of the third set of constraints, the last action made, and the last fail mode. 13. The system in accordance with claim 1, wherein said pumping control unit further configured to:
simulate a recently made adjustment to the current stroke timing by stepping through steps (c) and (d); and upon a determination of no violation of at least one set of constraints return to step (a). 14. A computer-based method for enhancing a flow of a fluid induced by a rod pumping unit, said method implemented using a pumping control unit in communication with a memory, said method comprising:
(a) initiating at least one stroke of the rod pumping unit, wherein the at least one stroke is based on current stroke timing data, wherein the current stroke timing data includes a value for strokes per minute (SPM); (b) receiving signals representing sensor data from one or more sensors, wherein the one or more sensors are configured to monitor one or more conditions of the rod pumping unit and generate signals representing sensor data based on the one or more conditions; (c) upon determining, based on the sensor data, a violation of a first set of constraints, make a first adjustment to the current stroke timing, and return to step (a); (d) upon determining, based on the sensor data, a violation of a second set of constraints, make a second adjustment to the current stroke timing, and return to step (a); and (e) upon determining, based on the sensor data, no violation of at least one set of constraints, make a third adjustment to the current stroke timing, and return to step (a). 15. The method in accordance with claim 14 further comprising upon determining, based on the sensor data, a violation of a third set of constraints, make a fourth adjustment to the current stroke timing, and return to step (a). 16. The method in accordance with claim 14 further comprising upon determining that the current stroke timing exceeds total time available for a stroke, perform at least one of reduce the value for SPM, and reverse one or more previously made adjustments. 17. The method in accordance with claim 14, wherein the first set of constraints based on one or more load and power specifications of the rod pumping unit. 18. The method in accordance with claim 14, wherein the second set of constraints based on one or more buckling criterion. 19. The method in accordance with claim 15, wherein the third set of constraints based on one or more fatigue criterion. 20. The method in accordance with claim 14, wherein the current stroke timing further includes at least one of an upstroke acceleration time, an upstroke deceleration time, a downstroke acceleration time, a downstroke deceleration time, an upstroke time, and an upper velocity parameter. 21. The method in accordance with claim 14, wherein the at least one stroke includes a plurality of stages which include an upstroke acceleration stage, an upstroke deceleration stage, a downstroke acceleration stage, a downstroke deceleration stage, and a constant velocity stage. 22. A computer-readable storage device having processor-executable instructions embodied thereon, for enhancing a flow of a fluid induced by a rod pumping unit, wherein when executed by a pumping control unit communicatively coupled to a memory, the processor-executable instructions cause the pumping control unit to:
(a) initiate at least one stroke of the rod pumping unit, wherein the at least one stroke is based on current stroke timing data, wherein the current stroke timing data includes a value for strokes per minute (SPM); (b) receive signals representing sensor data from one or more sensors, wherein the one or more sensors are configured to monitor one or more conditions of the rod pumping unit and generate signals representing sensor data based on the one or more conditions; (c) upon a determination of, based on the sensor data, a violation of a first set of constraints, make a first adjustment to the current stroke timing, and return to step (a); (d) upon a determination of, based on the sensor data, a violation of a second set of constraints, make a second adjustment to the current stroke timing, and return to step (a); and (e) upon a determination of, based on the sensor data, no violation of at least one set of constraints, make a third adjustment to current stroke timing, and return to step (a). 23. The computer readable storage device of claim 22, wherein the processor-executable instructions cause the pumping control unit to upon a determination of, based on the sensor data, a violation of a third set of constraints, make a fourth adjustment to the current stroke timing, and return to step (a). 24. The computer readable storage device of claim 22, wherein the processor-executable instructions cause the pumping control unit to upon a determination that the current stroke timing exceeds total time available for a stroke, perform as least one of reduce the value for SPM, and reverse one or more previously made adjustments. 25. The computer readable storage device of claim 22, wherein the first set of constraints based on one or more load and power specifications of the rod pumping unit. 26. The computer readable storage device of claim 22, wherein the second set of constraints based on one or more buckling criterion. 27. The computer readable storage device of claim 23, wherein the third set of constraints based on one or more fatigue criterion. 28. The computer readable storage device of claim 22, wherein the current stroke timing further includes at least one of an upstroke acceleration time, an upstroke deceleration time, a downstroke acceleration time, a downstroke deceleration time, an upstroke time, and an upper velocity parameter. 29. The computer readable storage device of claim 22, wherein the at least one stroke includes a plurality of stages which include an upstroke acceleration stage, an upstroke deceleration stage, a downstroke acceleration stage, a downstroke deceleration stage, and a constant velocity stage. | A system for enhancing a flow of a fluid induced by a rod pumping unit is provided. The system includes one or more sensors and a pumping control unit configured to control stroke movement of the rod pumping unit. The pumping control unit is configured to: (a) initiate at least one stroke of the rod pumping unit; (b) receive sensor data from the one or more sensors; (c) upon determination of a violation of a first set of constraints, make a first adjustment to the current stroke timing, and return to step (a); (d) upon determination of a violation of a second set of constraints, make a second adjustment to the current stroke timing, and return to step (a); and (e) upon determination of no violation of at least one set of constraints make a third adjustment to the current stroke timing, and return to step (a).1. A system for enhancing a flow of a fluid induced by a rod pumping unit, said system comprising:
one or more sensors configured to monitor one or more conditions of the rod pumping unit and generate signals representing sensor data based on the one or more conditions; and a pumping control unit comprising a processor and a memory, said pumping control unit in communication with said one or more sensors, said pumping control unit configured to control stroke movement of the rod pumping unit, thereby controlling the flow of the fluid induced by the rod pumping unit, said pumping control unit configured to:
(a) initiate at least one stroke of the rod pumping unit, wherein the at least one stroke is based on current stroke timing data, wherein the current stroke timing data includes a value for strokes per minute (SPM);
(b) receive signals representing sensor data from the one or more sensors;
(c) upon a determination of, based on the sensor data, a violation of a first set of constraints, make a first adjustment to the current stroke timing, and return to step (a);
(d) upon a determination of, based on the sensor data, a violation of a second set of constraints, make a second adjustment to the current stroke timing, and return to step (a); and
(e) upon a determination of, based on the sensor data, no violation of at least one set of constraints, make a third adjustment to the current stroke timing, and return to step (a). 2. The system in accordance with claim 1, wherein said pumping control unit further configured to, upon a determination of, based on the sensor data, a violation of a third set of constraints, make a fourth adjustment to the current stroke timing, and return to step (a). 3. The system in accordance with claim 1, wherein the third adjustment increases the value for SPM to increase the flow of fluid induced. 4. The system in accordance with claim 1, wherein said pumping control unit further configured to, upon a determination that the current stroke timing exceeds total time available for a stroke, perform at least one of reduce the value for SPM, and reverse one or more previously made adjustments. 5. The system in accordance with claim 1, wherein the first set of constraints based on one or more load and power specifications of the rod pumping unit. 6. The system in accordance with claim 1, wherein the second set of constraints based on one or more buckling criterion. 7. The system in accordance with claim 2, wherein the third set of constraints based on one or more fatigue criterion. 8. The system in accordance with claim 1, wherein the current stroke timing further includes at least one of an upstroke acceleration time, an upstroke deceleration time, a downstroke acceleration time, a downstroke deceleration time, an upstroke time, and an upper velocity parameter. 9. The system in accordance with claim 1, wherein the at least one stroke includes a plurality of stages which include an upstroke acceleration stage, an upstroke deceleration stage, a downstroke acceleration stage, a downstroke deceleration stage, and a constant velocity stage. 10. The system in accordance with claim 9, wherein said pumping control unit further configured to:
determine a stage of the plurality of stages of the at least one stroke that the first constraint was violated; determine last adjustment made to current stroke timing; and make the first adjustment based on the determined stage and the last adjustment made. 11. The system in accordance with claim 2, wherein said pumping control unit further configured to store at least one of a last action made and a last fail mode based on which set of constraints was violated. 12. The system in accordance with claim 11, wherein wherein upon a determination of, based on the sensor data, a violation of the third set of constraints, said pumping control unit further configured to make the fourth adjustment based on an amount of violation of the third set of constraints, the last action made, and the last fail mode. 13. The system in accordance with claim 1, wherein said pumping control unit further configured to:
simulate a recently made adjustment to the current stroke timing by stepping through steps (c) and (d); and upon a determination of no violation of at least one set of constraints return to step (a). 14. A computer-based method for enhancing a flow of a fluid induced by a rod pumping unit, said method implemented using a pumping control unit in communication with a memory, said method comprising:
(a) initiating at least one stroke of the rod pumping unit, wherein the at least one stroke is based on current stroke timing data, wherein the current stroke timing data includes a value for strokes per minute (SPM); (b) receiving signals representing sensor data from one or more sensors, wherein the one or more sensors are configured to monitor one or more conditions of the rod pumping unit and generate signals representing sensor data based on the one or more conditions; (c) upon determining, based on the sensor data, a violation of a first set of constraints, make a first adjustment to the current stroke timing, and return to step (a); (d) upon determining, based on the sensor data, a violation of a second set of constraints, make a second adjustment to the current stroke timing, and return to step (a); and (e) upon determining, based on the sensor data, no violation of at least one set of constraints, make a third adjustment to the current stroke timing, and return to step (a). 15. The method in accordance with claim 14 further comprising upon determining, based on the sensor data, a violation of a third set of constraints, make a fourth adjustment to the current stroke timing, and return to step (a). 16. The method in accordance with claim 14 further comprising upon determining that the current stroke timing exceeds total time available for a stroke, perform at least one of reduce the value for SPM, and reverse one or more previously made adjustments. 17. The method in accordance with claim 14, wherein the first set of constraints based on one or more load and power specifications of the rod pumping unit. 18. The method in accordance with claim 14, wherein the second set of constraints based on one or more buckling criterion. 19. The method in accordance with claim 15, wherein the third set of constraints based on one or more fatigue criterion. 20. The method in accordance with claim 14, wherein the current stroke timing further includes at least one of an upstroke acceleration time, an upstroke deceleration time, a downstroke acceleration time, a downstroke deceleration time, an upstroke time, and an upper velocity parameter. 21. The method in accordance with claim 14, wherein the at least one stroke includes a plurality of stages which include an upstroke acceleration stage, an upstroke deceleration stage, a downstroke acceleration stage, a downstroke deceleration stage, and a constant velocity stage. 22. A computer-readable storage device having processor-executable instructions embodied thereon, for enhancing a flow of a fluid induced by a rod pumping unit, wherein when executed by a pumping control unit communicatively coupled to a memory, the processor-executable instructions cause the pumping control unit to:
(a) initiate at least one stroke of the rod pumping unit, wherein the at least one stroke is based on current stroke timing data, wherein the current stroke timing data includes a value for strokes per minute (SPM); (b) receive signals representing sensor data from one or more sensors, wherein the one or more sensors are configured to monitor one or more conditions of the rod pumping unit and generate signals representing sensor data based on the one or more conditions; (c) upon a determination of, based on the sensor data, a violation of a first set of constraints, make a first adjustment to the current stroke timing, and return to step (a); (d) upon a determination of, based on the sensor data, a violation of a second set of constraints, make a second adjustment to the current stroke timing, and return to step (a); and (e) upon a determination of, based on the sensor data, no violation of at least one set of constraints, make a third adjustment to current stroke timing, and return to step (a). 23. The computer readable storage device of claim 22, wherein the processor-executable instructions cause the pumping control unit to upon a determination of, based on the sensor data, a violation of a third set of constraints, make a fourth adjustment to the current stroke timing, and return to step (a). 24. The computer readable storage device of claim 22, wherein the processor-executable instructions cause the pumping control unit to upon a determination that the current stroke timing exceeds total time available for a stroke, perform as least one of reduce the value for SPM, and reverse one or more previously made adjustments. 25. The computer readable storage device of claim 22, wherein the first set of constraints based on one or more load and power specifications of the rod pumping unit. 26. The computer readable storage device of claim 22, wherein the second set of constraints based on one or more buckling criterion. 27. The computer readable storage device of claim 23, wherein the third set of constraints based on one or more fatigue criterion. 28. The computer readable storage device of claim 22, wherein the current stroke timing further includes at least one of an upstroke acceleration time, an upstroke deceleration time, a downstroke acceleration time, a downstroke deceleration time, an upstroke time, and an upper velocity parameter. 29. The computer readable storage device of claim 22, wherein the at least one stroke includes a plurality of stages which include an upstroke acceleration stage, an upstroke deceleration stage, a downstroke acceleration stage, a downstroke deceleration stage, and a constant velocity stage. | 2,100 |
5,103 | 14,089,663 | 2,175 | An information display system is described herein that separates rendering of information from receiving that information so that the rendering portion can be quickly displayed to the user and the data can arrive as it is available to provide further detail. The rendering portion creates a hardware surface measured to fill the area to be consumed by the list box or other control. Independently, the information retrieval portion queries information from a server or other source and processes the information as it is received. The system can then perform a transformation on the previously created hardware surface to insert the information in the rendered control without re-laying out the entire control or recreating user interface elements. Moving a surface is a cheaper operation for a CPU and can easily be accelerated using a GPU. | 1. A computing device for displaying a user interface, the computing device comprising:
a memory configured to store instructions; and a processor configured to execute the stored instructions, wherein execution of the stored instructions causes the computing device to:
send information retrieval requests to one or more remote devices requesting information items;
while waiting for the requested information items, independently render a display that includes multiple interface elements, the multiple interface elements being individually associated with respective ones of the requested information items;
receive at least one of the requested information items;
determine which of the multiple interface elements is associated with the at least one received information item;
bind the at least one received information item to the determined interface element; and
update the display with the at least one received information item. 2. The computing device of claim 1, wherein rendition of the display includes:
receiving layout information for the display, the layout information defining a visible area and a precached area. 3. The computing device of claim 2, wherein rendition of the display includes:
rendering the precached area of the user interface, the precached area being larger than the visible area. 4. The computing device of claim 1, wherein rendition of the display includes:
rendering the display based on layout information. 5. The computing device of claim 4, wherein the layout information includes descriptions of sizes for portions of the display that are to be allocated to each of the requested information items. 6. The computing device of claim 4, wherein the layout information includes information describing a size of a screen of the computing device. 7. The computing device of claim 1, wherein:
the display includes a number of reusable interface elements; and execution of the stored instructions also causes the computing device to:
reuse, in response to a scrolling of information items into a visible area, the reusable interface elements to display information items. 8. A computing device-implemented method for displaying a user interface on the computing device, the method comprising:
receiving layout information for a user interface to be at least partially displayed by the computing device, wherein the user interface includes a visible area and a precached area, wherein the user interface is associated with each of a plurality of user interface items, and wherein the plurality of user interface items includes at least one user interface item that has yet to be received by the computing device; rendering, based at least in part on the received layout information, the user interface before receipt of the at least one user interface item that has yet to be received by the computing device; displaying, by the computing device, a first portion of the rendered user interface, the first portion representing a first area of the user interface; receiving a request to display a second portion of the rendered user interface, the second portion representing a second area of the user interface that is at least partially non-overlapping with the first area; and in response to the received request, displaying, by the computing device, the second portion of the rendered user interface. 9. The method of claim 8, wherein the layout information includes:
descriptions of sizes for portions of the user interface that are to be allocated to each of the plurality of user interface items; and information describing a size of a screen of the computing device. 10. The method of claim 8, wherein rendering the user interface includes:
determining screen coordinates for the user interface, a size of the user interface, and a size of the first portion and of the second portion. 11. The method of claim 8, wherein rendering the user interface includes:
rendering the precached area of the user interface, the precached area being larger than the first portion. 12. The method of claim 8, wherein:
the user interface includes a fixed number of reusable user interface elements; and the method further comprises:
reusing, in response to a scrolling of user interface items into a visible area, the fixed number of user interface elements to display user interface items of the plurality of user interface items. 13. The method of claim 8, wherein the plurality of user interface items including a greater number of user interface items than are to be simultaneously displayed by the computing device. 14. The method of claim 8, wherein displaying the second portion includes:
displaying the second portion without rerendering the user interface. 15. A computer-readable storage medium having instructions stored therein for performing operations that display a user interface on a computing device, the operations comprising:
sending information retrieval requests to one or more remote devices requesting information items; while waiting for the requested information items, independently rendering a display that includes multiple interface elements, the multiple interface elements being individually associated with respective ones of the requested information items; receiving at least one of the requested information items; determining which of the multiple interface elements is associated with the at least one received information item; binding the at least one received information item to the determined interface element; and updating the display with the at least one received information item. 16. The computer-readable storage medium of claim 15, wherein the rendering of the display includes:
rendering the display before receiving of any of the requested information items. 17. The computer-readable storage medium of claim 15, wherein the rendering of the display includes:
rendering the display based on layout information, the layout information defining a visible area and a precached area. 18. The computer-readable storage medium of claim 17, wherein the rendering of the display includes:
rendering the precached area of the user interface, the precached area being larger than the visible area. 19. The computer-readable storage medium of claim 17, wherein the layout information includes:
descriptions of sizes for portions of the display that are to be allocated to each of the requested information items; and information describing a size of a screen of the computing device. 20. The computer-readable storage medium of claim 15, wherein:
the display includes a number of reusable interface elements; and the operations further include:
reusing, in response to a scrolling of information items into a visible area, the reusable interface elements to display information items. | An information display system is described herein that separates rendering of information from receiving that information so that the rendering portion can be quickly displayed to the user and the data can arrive as it is available to provide further detail. The rendering portion creates a hardware surface measured to fill the area to be consumed by the list box or other control. Independently, the information retrieval portion queries information from a server or other source and processes the information as it is received. The system can then perform a transformation on the previously created hardware surface to insert the information in the rendered control without re-laying out the entire control or recreating user interface elements. Moving a surface is a cheaper operation for a CPU and can easily be accelerated using a GPU.1. A computing device for displaying a user interface, the computing device comprising:
a memory configured to store instructions; and a processor configured to execute the stored instructions, wherein execution of the stored instructions causes the computing device to:
send information retrieval requests to one or more remote devices requesting information items;
while waiting for the requested information items, independently render a display that includes multiple interface elements, the multiple interface elements being individually associated with respective ones of the requested information items;
receive at least one of the requested information items;
determine which of the multiple interface elements is associated with the at least one received information item;
bind the at least one received information item to the determined interface element; and
update the display with the at least one received information item. 2. The computing device of claim 1, wherein rendition of the display includes:
receiving layout information for the display, the layout information defining a visible area and a precached area. 3. The computing device of claim 2, wherein rendition of the display includes:
rendering the precached area of the user interface, the precached area being larger than the visible area. 4. The computing device of claim 1, wherein rendition of the display includes:
rendering the display based on layout information. 5. The computing device of claim 4, wherein the layout information includes descriptions of sizes for portions of the display that are to be allocated to each of the requested information items. 6. The computing device of claim 4, wherein the layout information includes information describing a size of a screen of the computing device. 7. The computing device of claim 1, wherein:
the display includes a number of reusable interface elements; and execution of the stored instructions also causes the computing device to:
reuse, in response to a scrolling of information items into a visible area, the reusable interface elements to display information items. 8. A computing device-implemented method for displaying a user interface on the computing device, the method comprising:
receiving layout information for a user interface to be at least partially displayed by the computing device, wherein the user interface includes a visible area and a precached area, wherein the user interface is associated with each of a plurality of user interface items, and wherein the plurality of user interface items includes at least one user interface item that has yet to be received by the computing device; rendering, based at least in part on the received layout information, the user interface before receipt of the at least one user interface item that has yet to be received by the computing device; displaying, by the computing device, a first portion of the rendered user interface, the first portion representing a first area of the user interface; receiving a request to display a second portion of the rendered user interface, the second portion representing a second area of the user interface that is at least partially non-overlapping with the first area; and in response to the received request, displaying, by the computing device, the second portion of the rendered user interface. 9. The method of claim 8, wherein the layout information includes:
descriptions of sizes for portions of the user interface that are to be allocated to each of the plurality of user interface items; and information describing a size of a screen of the computing device. 10. The method of claim 8, wherein rendering the user interface includes:
determining screen coordinates for the user interface, a size of the user interface, and a size of the first portion and of the second portion. 11. The method of claim 8, wherein rendering the user interface includes:
rendering the precached area of the user interface, the precached area being larger than the first portion. 12. The method of claim 8, wherein:
the user interface includes a fixed number of reusable user interface elements; and the method further comprises:
reusing, in response to a scrolling of user interface items into a visible area, the fixed number of user interface elements to display user interface items of the plurality of user interface items. 13. The method of claim 8, wherein the plurality of user interface items including a greater number of user interface items than are to be simultaneously displayed by the computing device. 14. The method of claim 8, wherein displaying the second portion includes:
displaying the second portion without rerendering the user interface. 15. A computer-readable storage medium having instructions stored therein for performing operations that display a user interface on a computing device, the operations comprising:
sending information retrieval requests to one or more remote devices requesting information items; while waiting for the requested information items, independently rendering a display that includes multiple interface elements, the multiple interface elements being individually associated with respective ones of the requested information items; receiving at least one of the requested information items; determining which of the multiple interface elements is associated with the at least one received information item; binding the at least one received information item to the determined interface element; and updating the display with the at least one received information item. 16. The computer-readable storage medium of claim 15, wherein the rendering of the display includes:
rendering the display before receiving of any of the requested information items. 17. The computer-readable storage medium of claim 15, wherein the rendering of the display includes:
rendering the display based on layout information, the layout information defining a visible area and a precached area. 18. The computer-readable storage medium of claim 17, wherein the rendering of the display includes:
rendering the precached area of the user interface, the precached area being larger than the visible area. 19. The computer-readable storage medium of claim 17, wherein the layout information includes:
descriptions of sizes for portions of the display that are to be allocated to each of the requested information items; and information describing a size of a screen of the computing device. 20. The computer-readable storage medium of claim 15, wherein:
the display includes a number of reusable interface elements; and the operations further include:
reusing, in response to a scrolling of information items into a visible area, the reusable interface elements to display information items. | 2,100 |
5,104 | 15,149,163 | 2,191 | Locating program code units stored on digital data storage includes defining a software module fragment by assigning a software module fragment label to selected program code units, creating a module fragment list defining a software module, said list comprising a set of said software module fragments, receiving a request to retrieve the program code units of a specified software module from the digital data storage, and converting, using a processor, the module fragment list of the specified module into a list of physical locations for resolving the locations of the corresponding program code units on the digital data storage using said labels. | 1-20. (canceled) 21. A computer-implemented method, comprising:
associating a label to a program code unit of a software module to define a software module fragment; generating, using a plurality of software module fragments respectively associated with a plurality of different program code units, a module fragment list that defines the software module; receiving a request to retrieve the program code units from a data storage device; converting, based upon the received request and using labels associated with the program code units, the module fragment list into a list of physical locations, wherein the list of physical locations correspond to locations of the program code units within the data storage device. 22. The method of claim 21, wherein
each of the program code units are a source code file. 23. The method of claim 21, further comprising:
retrieving, from the data storage device, the program code units of the software module. 24. The method of claim 23, further comprising:
compiling the retrieved program code units. 25. The method of claim 21, wherein
the converting includes searching, using the labels, the data storage device for program code units related to the software module. 26. The method of claim 25, wherein
the searching is limited to a hierarchical structure, within the data storage device, associated within the software module. 27. The method of claim 21, wherein
the module fragment list is an ordered list based on a position of the software module fragment in the software module. 28. A computer hardware system, comprising:
a hardware processor configured to initiate the following executable operations:
associating a label to a program code unit of a software module to define a software module fragment;
generating, using a plurality of software module fragments respectively associated with a plurality of different program code units, a module fragment list that defines the software module;
receiving a request to retrieve the program code units from a data storage device;
converting, based upon the received request and using labels associated with the program code units, the module fragment list into a list of physical locations, wherein
the list of physical locations correspond to locations of the program code units within the data storage device. 29. The system of claim 28, wherein
each of the program code units are a source code file. 30. The system of claim 28, wherein the hardware processor is further configured to initiate the following executable operation:
retrieving, from the data storage device, the program code units of the software module. 31. The system of claim 30, wherein the hardware processor is further configured to initiate the following executable operation:
compiling the retrieved program code units. 32. The system of claim 28, wherein
the converting includes searching, using the labels, the data storage device for program code units related to the software module. 33. The system of claim 32, wherein
the searching is limited to a hierarchical structure, within the data storage device, associated within the software module. 34. The system of claim 28, wherein
the module fragment list is an ordered list based on a position of the software module fragment in the software module. 35. A computer program product, comprising:
a computer-readable storage medium having stored thereon program code that, when executed by a computer hardware system, configures the computer hardware system to perform:
associating a label to a program code unit of a software module to define a software module fragment;
generating, using a plurality of software module fragments respectively associated with a plurality of different program code units, a module fragment list that defines the software module;
receiving a request to retrieve the program code units from a data storage device;
converting, based upon the received request and using labels associated with the program code units, the module fragment list into a list of physical locations, wherein
the list of physical locations correspond to locations of the program code units within the data storage device. 36. The computer program product of claim 35, wherein
each of the program code units are a source code file. 37. The computer program product of claim 35, wherein program code further configures the computer hardware system to perform:
retrieving, from the data storage device, the program code units of the software module. 38. The computer program product of claim 37, wherein program code further configures the computer hardware system to perform:
compiling the retrieved program code units. 39. The computer program product of claim 35, wherein
the converting includes searching, using the labels, the data storage device for program code units related to the software module. 40. The computer program product of claim 39, wherein
the searching is limited to a hierarchical structure, within the data storage device, associated within the software module. | Locating program code units stored on digital data storage includes defining a software module fragment by assigning a software module fragment label to selected program code units, creating a module fragment list defining a software module, said list comprising a set of said software module fragments, receiving a request to retrieve the program code units of a specified software module from the digital data storage, and converting, using a processor, the module fragment list of the specified module into a list of physical locations for resolving the locations of the corresponding program code units on the digital data storage using said labels.1-20. (canceled) 21. A computer-implemented method, comprising:
associating a label to a program code unit of a software module to define a software module fragment; generating, using a plurality of software module fragments respectively associated with a plurality of different program code units, a module fragment list that defines the software module; receiving a request to retrieve the program code units from a data storage device; converting, based upon the received request and using labels associated with the program code units, the module fragment list into a list of physical locations, wherein the list of physical locations correspond to locations of the program code units within the data storage device. 22. The method of claim 21, wherein
each of the program code units are a source code file. 23. The method of claim 21, further comprising:
retrieving, from the data storage device, the program code units of the software module. 24. The method of claim 23, further comprising:
compiling the retrieved program code units. 25. The method of claim 21, wherein
the converting includes searching, using the labels, the data storage device for program code units related to the software module. 26. The method of claim 25, wherein
the searching is limited to a hierarchical structure, within the data storage device, associated within the software module. 27. The method of claim 21, wherein
the module fragment list is an ordered list based on a position of the software module fragment in the software module. 28. A computer hardware system, comprising:
a hardware processor configured to initiate the following executable operations:
associating a label to a program code unit of a software module to define a software module fragment;
generating, using a plurality of software module fragments respectively associated with a plurality of different program code units, a module fragment list that defines the software module;
receiving a request to retrieve the program code units from a data storage device;
converting, based upon the received request and using labels associated with the program code units, the module fragment list into a list of physical locations, wherein
the list of physical locations correspond to locations of the program code units within the data storage device. 29. The system of claim 28, wherein
each of the program code units are a source code file. 30. The system of claim 28, wherein the hardware processor is further configured to initiate the following executable operation:
retrieving, from the data storage device, the program code units of the software module. 31. The system of claim 30, wherein the hardware processor is further configured to initiate the following executable operation:
compiling the retrieved program code units. 32. The system of claim 28, wherein
the converting includes searching, using the labels, the data storage device for program code units related to the software module. 33. The system of claim 32, wherein
the searching is limited to a hierarchical structure, within the data storage device, associated within the software module. 34. The system of claim 28, wherein
the module fragment list is an ordered list based on a position of the software module fragment in the software module. 35. A computer program product, comprising:
a computer-readable storage medium having stored thereon program code that, when executed by a computer hardware system, configures the computer hardware system to perform:
associating a label to a program code unit of a software module to define a software module fragment;
generating, using a plurality of software module fragments respectively associated with a plurality of different program code units, a module fragment list that defines the software module;
receiving a request to retrieve the program code units from a data storage device;
converting, based upon the received request and using labels associated with the program code units, the module fragment list into a list of physical locations, wherein
the list of physical locations correspond to locations of the program code units within the data storage device. 36. The computer program product of claim 35, wherein
each of the program code units are a source code file. 37. The computer program product of claim 35, wherein program code further configures the computer hardware system to perform:
retrieving, from the data storage device, the program code units of the software module. 38. The computer program product of claim 37, wherein program code further configures the computer hardware system to perform:
compiling the retrieved program code units. 39. The computer program product of claim 35, wherein
the converting includes searching, using the labels, the data storage device for program code units related to the software module. 40. The computer program product of claim 39, wherein
the searching is limited to a hierarchical structure, within the data storage device, associated within the software module. | 2,100 |
5,105 | 14,210,109 | 2,177 | Systems, methods, and software are described herein to support view-based storage. A service application that provides a user interface to a service receives data communicated by the service and identifies at least a service item to present in at least one of various views rendered in the user interface. The service application then identifies with which of the views to associate the service item and stores the service item in association with an identified view or views. | 1. One or more computer readable storage media having program instructions stored thereon comprising a service application for facilitating a user interface to a service that, when executed by a processing system, directs the processing system to at least:
identify, from data communicated by the service, at least a service item to present in at least one of a plurality of views rendered in the user interface to the service; identify with which of the plurality of views to associate the service item; and store the service item in association with at least a view of the plurality of views identified for association with the service item. 2. The one or more computer readable storage media of claim 1 wherein, to store the service item in association with at least the view, the service application directs the processing system to store the service item in a data structure that comprises a plurality of components associated with the view and having a presentation format ready for presentation in the view when rendered in the user interface to the service. 3. The one or more computer readable storage media of claim 2 wherein, to store the service item in association with the view, the service application directs the processing system to translate a format of the service item into the presentation format and add the service item to the plurality of components in the data structure. 4. The one or more computer readable storage media of claim 3 wherein, in response to a user navigating in the user interface from a preceding view of the plurality of views to the view, the service application further directs the processing system to communicate a request to a file system to retrieve the data structure associated with the view and to surface the plurality of components in the user interface, including the service item. 5. The computer readable storage media of claim 1 wherein the service application further directs the processing system to translate the service item to a presentation format prior to storing the service item in association with the view, wherein the presentation format comprises a format in which to present the service item in the user interface. 6. The computer readable media of claim 5 wherein each of the plurality of views corresponds to a different one of a plurality of data structures in which to store a plurality of components for each of the plurality of views in the presentation format. 7. The computer readable storage media of claim 6 wherein to identify with which of the plurality of views to associate the service item, the service application directs the processing system to identify a subset of the plurality of views comprising more than one of the plurality of views and wherein, to store the service item in association with at least the view of the plurality of views identified for association with the service item, the service application directs the processing system to store the service item in a subset of the plurality of data structures that correspond to the subset of the plurality of views. 8. The computer readable storage media of claim 7 wherein the service application further directs the processing system to identify an order in which to store the service item in the subset of the plurality of data structures based at least in part on a priority assigned to each of the plurality of views. 9. The computer readable media of claim 1 wherein the service comprises at least one of an email service and a calendar service and wherein the service item comprises at least one of an email and a calendar item. 10. An apparatus comprising
one or more computer readable storage media; and program instructions stored on the one or more computer readable storage media and comprising an email application executable by a processing system to at least render a user interface to a service, wherein the email application comprises:
a service module that when executed directs the processing system to identify data from the service comprising an email for presentation in at least one of a plurality of views in the user interface and identify with which of the plurality of views to associate the email; and
a storage module that when executed directs the processing system to store the service item in association with at least a view of the plurality of views identified for association with the service item. 11. The apparatus of claim 10 wherein, to store the email in association with at least the view, the storage module directs the processing system to store the email in a data structure that comprises a plurality of components associated with the view and formatted for surfacing in the view. 12. The apparatus of claim 11 wherein, to store the email in association with the view, the storage module directs the processing system to add the email to the plurality of components in the data structure in a format suitable for surfacing the email in the view. 13. The apparatus of claim 12 wherein, in response to a user navigating in the user interface from a preceding view of the plurality of views to the view, the storage module further directs the processing system to communicate a request to a file system to retrieve the data structure associated with the view, and wherein the program instructions further comprise view module that when executed directs the processing system to communicate the data structure to a user interface system that surfaces the plurality of components and the email in the user interface to present the view. 14. The apparatus of claim 10 wherein the storage module further directs the processing system to translate the email to a presentation format prior to storing the email in association with the view, wherein the presentation format comprises a format in which to present the email in the user interface. 15. The apparatus of claim 14 wherein each of the plurality of views corresponds to a different one of a plurality of data structures in which to store a plurality of components for each of the plurality of views in the presentation format, and wherein the plurality of views comprises an inbox view, a sent messages view, and a preview view. 16. The apparatus of claim 15 wherein to identify with which of the plurality of views to associate the service item, the email application directs the processing system to identify a subset of the plurality of views comprising more than one of the plurality of views and wherein, to store the service item in association with at least the view of the plurality of views identified for association with the service item, the service application directs the processing system to store the service item in a subset of the plurality of data structures that correspond to the subset of the plurality of views. 17. The apparatus of claim 16 wherein the service module further directs the processing system to identify an order in which to store the service item in the subset of the plurality of data structures based at least in part on a priority assigned to each of the plurality of views. 18. The apparatus of claim 10 further comprising the processing system and a user interface system, wherein the processing system executes the program instructions and wherein the user interface system displays the view in the user interface. 19. A method for facilitating a user interface to a service comprising:
receiving data from the service comprising a plurality of service items for presentation in at least one of a plurality of views rendered in the user interface to the service; identifying in which of a plurality of data structures corresponding to the plurality of views to store each of the plurality of service items; in response to an event associated with at least a service item of the plurality of service items that triggers a transition from an initial view of the plurality of views to a subsequent view of the plurality of views, retrieving a data structure of the plurality of data structures corresponding to the subsequent view; and processing the data structure to render the subsequent view in the user interface. 20. The method of claim 19 wherein the service comprises an email service, wherein the plurality of service items comprises a plurality of emails, wherein the initial view comprises a view of an email inbox, wherein the subsequent view comprises a view of a folder, and wherein the method further comprises:
identifying an order in which to store the plurality of service items in the plurality of data structures based at least in part on a priority assigned to each of the plurality of views. | Systems, methods, and software are described herein to support view-based storage. A service application that provides a user interface to a service receives data communicated by the service and identifies at least a service item to present in at least one of various views rendered in the user interface. The service application then identifies with which of the views to associate the service item and stores the service item in association with an identified view or views.1. One or more computer readable storage media having program instructions stored thereon comprising a service application for facilitating a user interface to a service that, when executed by a processing system, directs the processing system to at least:
identify, from data communicated by the service, at least a service item to present in at least one of a plurality of views rendered in the user interface to the service; identify with which of the plurality of views to associate the service item; and store the service item in association with at least a view of the plurality of views identified for association with the service item. 2. The one or more computer readable storage media of claim 1 wherein, to store the service item in association with at least the view, the service application directs the processing system to store the service item in a data structure that comprises a plurality of components associated with the view and having a presentation format ready for presentation in the view when rendered in the user interface to the service. 3. The one or more computer readable storage media of claim 2 wherein, to store the service item in association with the view, the service application directs the processing system to translate a format of the service item into the presentation format and add the service item to the plurality of components in the data structure. 4. The one or more computer readable storage media of claim 3 wherein, in response to a user navigating in the user interface from a preceding view of the plurality of views to the view, the service application further directs the processing system to communicate a request to a file system to retrieve the data structure associated with the view and to surface the plurality of components in the user interface, including the service item. 5. The computer readable storage media of claim 1 wherein the service application further directs the processing system to translate the service item to a presentation format prior to storing the service item in association with the view, wherein the presentation format comprises a format in which to present the service item in the user interface. 6. The computer readable media of claim 5 wherein each of the plurality of views corresponds to a different one of a plurality of data structures in which to store a plurality of components for each of the plurality of views in the presentation format. 7. The computer readable storage media of claim 6 wherein to identify with which of the plurality of views to associate the service item, the service application directs the processing system to identify a subset of the plurality of views comprising more than one of the plurality of views and wherein, to store the service item in association with at least the view of the plurality of views identified for association with the service item, the service application directs the processing system to store the service item in a subset of the plurality of data structures that correspond to the subset of the plurality of views. 8. The computer readable storage media of claim 7 wherein the service application further directs the processing system to identify an order in which to store the service item in the subset of the plurality of data structures based at least in part on a priority assigned to each of the plurality of views. 9. The computer readable media of claim 1 wherein the service comprises at least one of an email service and a calendar service and wherein the service item comprises at least one of an email and a calendar item. 10. An apparatus comprising
one or more computer readable storage media; and program instructions stored on the one or more computer readable storage media and comprising an email application executable by a processing system to at least render a user interface to a service, wherein the email application comprises:
a service module that when executed directs the processing system to identify data from the service comprising an email for presentation in at least one of a plurality of views in the user interface and identify with which of the plurality of views to associate the email; and
a storage module that when executed directs the processing system to store the service item in association with at least a view of the plurality of views identified for association with the service item. 11. The apparatus of claim 10 wherein, to store the email in association with at least the view, the storage module directs the processing system to store the email in a data structure that comprises a plurality of components associated with the view and formatted for surfacing in the view. 12. The apparatus of claim 11 wherein, to store the email in association with the view, the storage module directs the processing system to add the email to the plurality of components in the data structure in a format suitable for surfacing the email in the view. 13. The apparatus of claim 12 wherein, in response to a user navigating in the user interface from a preceding view of the plurality of views to the view, the storage module further directs the processing system to communicate a request to a file system to retrieve the data structure associated with the view, and wherein the program instructions further comprise view module that when executed directs the processing system to communicate the data structure to a user interface system that surfaces the plurality of components and the email in the user interface to present the view. 14. The apparatus of claim 10 wherein the storage module further directs the processing system to translate the email to a presentation format prior to storing the email in association with the view, wherein the presentation format comprises a format in which to present the email in the user interface. 15. The apparatus of claim 14 wherein each of the plurality of views corresponds to a different one of a plurality of data structures in which to store a plurality of components for each of the plurality of views in the presentation format, and wherein the plurality of views comprises an inbox view, a sent messages view, and a preview view. 16. The apparatus of claim 15 wherein to identify with which of the plurality of views to associate the service item, the email application directs the processing system to identify a subset of the plurality of views comprising more than one of the plurality of views and wherein, to store the service item in association with at least the view of the plurality of views identified for association with the service item, the service application directs the processing system to store the service item in a subset of the plurality of data structures that correspond to the subset of the plurality of views. 17. The apparatus of claim 16 wherein the service module further directs the processing system to identify an order in which to store the service item in the subset of the plurality of data structures based at least in part on a priority assigned to each of the plurality of views. 18. The apparatus of claim 10 further comprising the processing system and a user interface system, wherein the processing system executes the program instructions and wherein the user interface system displays the view in the user interface. 19. A method for facilitating a user interface to a service comprising:
receiving data from the service comprising a plurality of service items for presentation in at least one of a plurality of views rendered in the user interface to the service; identifying in which of a plurality of data structures corresponding to the plurality of views to store each of the plurality of service items; in response to an event associated with at least a service item of the plurality of service items that triggers a transition from an initial view of the plurality of views to a subsequent view of the plurality of views, retrieving a data structure of the plurality of data structures corresponding to the subsequent view; and processing the data structure to render the subsequent view in the user interface. 20. The method of claim 19 wherein the service comprises an email service, wherein the plurality of service items comprises a plurality of emails, wherein the initial view comprises a view of an email inbox, wherein the subsequent view comprises a view of a folder, and wherein the method further comprises:
identifying an order in which to store the plurality of service items in the plurality of data structures based at least in part on a priority assigned to each of the plurality of views. | 2,100 |
5,106 | 14,868,562 | 2,129 | Method for mapping a 3D grid or mesh from a faulted subsurface domain to a continuous design domain, wherein the grid may be used to represent a discrete model of a subsurface material property (such as permeability) to use, for example, in a reservoir simulator. The mapping is geometry-based, not physics-based. The mapping is determined by an iterative optimization procedure designed to penalize deformation of tessellated mesh cells ( 703 ) in the design domain compared to their geometric quality in the faulted domain ( 701 ), but subject to stitching constraints ( 702 ) appearing as a penalty term or Lagrange multiplier term in the optimization objective function to influence the final mesh to co-locate pairs of points identified on opposite sides of a fault as having been located together before the fault occurred. | 1. A method for generating a model of a material property of a faulted subsurface region for hydrocarbon prospecting or reservoir development, said method comprising:
generating, using a computer, a mapping of a model mesh representing a physical domain of the subsurface region, with faults, to an optimized mesh representing a continuous design space in which all faults are removed, said mapping being designed to minimize deformation in mesh cells; assigning values of the material property to continuous volumes in the optimized mesh to generate a model of the material property in the design space, and using that to generate a model of the material property in the faulted physical domain; and using the model of the material property in the faulted physical domain for hydrocarbon prospecting or reservoir development in the subsurface region. 2. The method of claim 1, wherein minimizing deformation in mesh cells comprises:
generating a tessellated mesh dividing the physical domain into cells, and recording geometric quality of each cell; designing stitching constraints to stitch together discontinuities at fault boundaries, or alternatively stitching discontinuities by node relocation, thereby truncating cells at fault boundaries; and optimizing the mesh in an iterative optimization procedure, subject to the stitching constraints, with the optimization aimed at minimizing degradation in geometric quality from the recorded geometric quality due to the stitching constraints, wherein all mesh nodes are free to move, or all mesh nodes are free to move except mesh nodes associated with the stitching together of discontinuities at fault boundaries, which mesh nodes are relocated to an average position and held fixed there. 3. The method of claim 2, wherein the mesh is optimized to adjust locations of mesh nodes under influence of the constraints. 4. The method of claim 2, wherein the optimization procedure penalizes worst quality cells based on a global grid quality measure computed by adding together quality metrics computed on cells in the mesh. 5. The method of claim 4, wherein the quality metrics computed on every cell in the mesh are based on combining a shape quality indicator with a size metric. 6. The method of claim 5, wherein the shape quality indicator is based on a Jacobian of a mapping from a unit square to a general quadrilateral cell. 7. The method of claim 2, wherein all cells in the generated tessellated mesh have edges that do not cross horizon or fault surfaces. 8. The method of claim 2, wherein stitching discontinuities at fault boundaries includes stitching boundary points on a surface of discontinuity. 9. The method of claim 8, wherein stitching discontinuities at fault boundaries further includes parameterizing the surface of discontinuity and stitching pairs of points intermediate between said boundary points. 10. The method of claim 2, wherein the stitching constraints are based on minimizing distance between two points, on opposite sides of a fault boundary, to be stitched together, said two points having been determined to be co-located before the fault occurred. 11. The method of claim 10, wherein the stitching constraints are imposed by including, in a cost or objective function that is being minimized in the optimization, a term containing an expression for said distance between two points to be stitched together, expressed with a Lagrange multiplier or as a penalty term. 12. The method of claim 2, wherein the generated tessellated mesh is cut or non-conforming across discontinuities. | Method for mapping a 3D grid or mesh from a faulted subsurface domain to a continuous design domain, wherein the grid may be used to represent a discrete model of a subsurface material property (such as permeability) to use, for example, in a reservoir simulator. The mapping is geometry-based, not physics-based. The mapping is determined by an iterative optimization procedure designed to penalize deformation of tessellated mesh cells ( 703 ) in the design domain compared to their geometric quality in the faulted domain ( 701 ), but subject to stitching constraints ( 702 ) appearing as a penalty term or Lagrange multiplier term in the optimization objective function to influence the final mesh to co-locate pairs of points identified on opposite sides of a fault as having been located together before the fault occurred.1. A method for generating a model of a material property of a faulted subsurface region for hydrocarbon prospecting or reservoir development, said method comprising:
generating, using a computer, a mapping of a model mesh representing a physical domain of the subsurface region, with faults, to an optimized mesh representing a continuous design space in which all faults are removed, said mapping being designed to minimize deformation in mesh cells; assigning values of the material property to continuous volumes in the optimized mesh to generate a model of the material property in the design space, and using that to generate a model of the material property in the faulted physical domain; and using the model of the material property in the faulted physical domain for hydrocarbon prospecting or reservoir development in the subsurface region. 2. The method of claim 1, wherein minimizing deformation in mesh cells comprises:
generating a tessellated mesh dividing the physical domain into cells, and recording geometric quality of each cell; designing stitching constraints to stitch together discontinuities at fault boundaries, or alternatively stitching discontinuities by node relocation, thereby truncating cells at fault boundaries; and optimizing the mesh in an iterative optimization procedure, subject to the stitching constraints, with the optimization aimed at minimizing degradation in geometric quality from the recorded geometric quality due to the stitching constraints, wherein all mesh nodes are free to move, or all mesh nodes are free to move except mesh nodes associated with the stitching together of discontinuities at fault boundaries, which mesh nodes are relocated to an average position and held fixed there. 3. The method of claim 2, wherein the mesh is optimized to adjust locations of mesh nodes under influence of the constraints. 4. The method of claim 2, wherein the optimization procedure penalizes worst quality cells based on a global grid quality measure computed by adding together quality metrics computed on cells in the mesh. 5. The method of claim 4, wherein the quality metrics computed on every cell in the mesh are based on combining a shape quality indicator with a size metric. 6. The method of claim 5, wherein the shape quality indicator is based on a Jacobian of a mapping from a unit square to a general quadrilateral cell. 7. The method of claim 2, wherein all cells in the generated tessellated mesh have edges that do not cross horizon or fault surfaces. 8. The method of claim 2, wherein stitching discontinuities at fault boundaries includes stitching boundary points on a surface of discontinuity. 9. The method of claim 8, wherein stitching discontinuities at fault boundaries further includes parameterizing the surface of discontinuity and stitching pairs of points intermediate between said boundary points. 10. The method of claim 2, wherein the stitching constraints are based on minimizing distance between two points, on opposite sides of a fault boundary, to be stitched together, said two points having been determined to be co-located before the fault occurred. 11. The method of claim 10, wherein the stitching constraints are imposed by including, in a cost or objective function that is being minimized in the optimization, a term containing an expression for said distance between two points to be stitched together, expressed with a Lagrange multiplier or as a penalty term. 12. The method of claim 2, wherein the generated tessellated mesh is cut or non-conforming across discontinuities. | 2,100 |
5,107 | 13,944,459 | 2,174 | A method for manual intervention in a dialing process includes maintaining a list of records containing phone numbers in a database stored on a computer readable storage medium, receiving at a computer and from the user a click for each of the records within the list of records in the database stored on the computer readable storage medium, and storing on a computer readable storage medium a record of the click, an identity of the user performing the click, and an association between the click and one of the records within the list of records. For each click, the method provides for electronically communicating the corresponding phone number of one of the records within the list to a dialing device for dialing the phone number. The method may further include dialing the phone number using the dialing device. | 1. A method for manual intervention in a dialing process, the method comprising:
(a) maintaining a list of records containing phone numbers in a database stored on a non-transitory computer readable storage medium; (b) providing a user interface in operative communication with the database, wherein the user interface is configured to present a user with a target for clicking; (c) receiving at a computer and from a user using the user interface, a click on the target for each of a plurality of individual records within the one or more lists of records in the database stored on the non-transitory computer readable storage medium; (d) storing within the database and on the non-transitory computer readable storage medium a record of the click for each of the plurality of individual records, an identity of the user performing the click for each of the plurality of individual records, and an association between the click and a corresponding record for each of the plurality of records; and (e) for each click electronically communicating the corresponding phone number of one of the records within the one or more lists to a dialing device for dialing the phone number. 2. The method of claim 1 wherein the user interface provides for receiving multiple clicks and queuing each of the associated individual records for dialing. 3. The method of claim 2 wherein the multiple clicks are limited to a maximum clicks ahead constraint. 4. The method of claim 2 wherein the user interface provides for assigning a plurality of different access rights to different users. 5. The method of claim 4 wherein a user assigned administrator access rights is provided access to modify the one or more lists. 6. The method of claim 5 wherein the user assigned administrator access rights is further provided access to schedule the one or more lists. 7. The method of claim 1 further comprising dialing the phone number using the dialing device. 8. The method of claim 1 wherein the user interface includes an icon and wherein the icon is the target of the click for each of the plurality of individual records within the one or more lists of records. 9. The method of claim 8 wherein the click is performed by positioning a mouse pointer on the icon and depressing a button of a mouse. 10. The method of claim 9 wherein the phone numbers are phone numbers for unauthorized cell phones. 11. The method of claim 1 further comprising determining if phone numbers are unauthorized cell phone numbers, for phone numbers which are unauthorized cell phone numbers, placing the phone numbers in one or more of the list of records containing the phone numbers, and for phone numbers which are not unauthorized cell phone numbers sending the phone numbers directly to the dialing device. 12. The method of claim 1 further comprising providing a cloud-based service and providing a manual clicker application to the user through the cloud-based server wherein the cloud-based service provides for performing steps (a)-(e). 13. The method of claim 1 further comprising displaying to a user through the user interface a number of clicks performed within the one or more lists. 14. The method of claim 13 further comprising displaying to a user through the user interface a number of clicks remaining to be performed with the one or more lists. 15. A method for providing a cloud-based service to provide for manual intervention in a dialing process, the method comprising:
maintaining a list of records containing unauthorized phone numbers in a database stored on a non-transitory computer readable storage medium; providing access to a manual clicker application through a server configured to access the database; providing a user interface to a user of the manual clicker application, the user interface configured to receive clicks from a user; receiving a plurality of clicks from the user targeted at an icon of the user interface; storing within the database a record of each of the plurality of clicks from the user and associating each of the plurality of clicks from the user with one of the records and a corresponding unauthorized phone number; electronically communicating to a dialing device each of the corresponding unauthorized phone numbers after storing the record of each click. 16. The method of claim 15 further comprising dialing each of the corresponding unauthorized phone numbers using the dialing device. 17. The method of claim 15 wherein the clicks are performed by a user using a mouse. 18. The method of claim 15 further comprising displaying to a user through the user interface a number of clicks performed with the list of records. 19. The method of claim 18 further comprising displaying to a user through the user interface a number of clicks remaining to be performed with the list of records. 20. The method of claim 15 further comprising notifying the user when there has been a click for every one of the records in the list of records. 21. The method of claim 15 further comprising receiving a selection of the list by the user through the user interface. 22. The method of claim 15 further comprising determining if phone numbers are unauthorized cell phone numbers, for phone numbers which are unauthorized cell phone numbers, placing the unauthorized cell phone numbers in the list of records and for phone numbers which are not unauthorized cell phone numbers sending the phone numbers directly to the dialing device. | A method for manual intervention in a dialing process includes maintaining a list of records containing phone numbers in a database stored on a computer readable storage medium, receiving at a computer and from the user a click for each of the records within the list of records in the database stored on the computer readable storage medium, and storing on a computer readable storage medium a record of the click, an identity of the user performing the click, and an association between the click and one of the records within the list of records. For each click, the method provides for electronically communicating the corresponding phone number of one of the records within the list to a dialing device for dialing the phone number. The method may further include dialing the phone number using the dialing device.1. A method for manual intervention in a dialing process, the method comprising:
(a) maintaining a list of records containing phone numbers in a database stored on a non-transitory computer readable storage medium; (b) providing a user interface in operative communication with the database, wherein the user interface is configured to present a user with a target for clicking; (c) receiving at a computer and from a user using the user interface, a click on the target for each of a plurality of individual records within the one or more lists of records in the database stored on the non-transitory computer readable storage medium; (d) storing within the database and on the non-transitory computer readable storage medium a record of the click for each of the plurality of individual records, an identity of the user performing the click for each of the plurality of individual records, and an association between the click and a corresponding record for each of the plurality of records; and (e) for each click electronically communicating the corresponding phone number of one of the records within the one or more lists to a dialing device for dialing the phone number. 2. The method of claim 1 wherein the user interface provides for receiving multiple clicks and queuing each of the associated individual records for dialing. 3. The method of claim 2 wherein the multiple clicks are limited to a maximum clicks ahead constraint. 4. The method of claim 2 wherein the user interface provides for assigning a plurality of different access rights to different users. 5. The method of claim 4 wherein a user assigned administrator access rights is provided access to modify the one or more lists. 6. The method of claim 5 wherein the user assigned administrator access rights is further provided access to schedule the one or more lists. 7. The method of claim 1 further comprising dialing the phone number using the dialing device. 8. The method of claim 1 wherein the user interface includes an icon and wherein the icon is the target of the click for each of the plurality of individual records within the one or more lists of records. 9. The method of claim 8 wherein the click is performed by positioning a mouse pointer on the icon and depressing a button of a mouse. 10. The method of claim 9 wherein the phone numbers are phone numbers for unauthorized cell phones. 11. The method of claim 1 further comprising determining if phone numbers are unauthorized cell phone numbers, for phone numbers which are unauthorized cell phone numbers, placing the phone numbers in one or more of the list of records containing the phone numbers, and for phone numbers which are not unauthorized cell phone numbers sending the phone numbers directly to the dialing device. 12. The method of claim 1 further comprising providing a cloud-based service and providing a manual clicker application to the user through the cloud-based server wherein the cloud-based service provides for performing steps (a)-(e). 13. The method of claim 1 further comprising displaying to a user through the user interface a number of clicks performed within the one or more lists. 14. The method of claim 13 further comprising displaying to a user through the user interface a number of clicks remaining to be performed with the one or more lists. 15. A method for providing a cloud-based service to provide for manual intervention in a dialing process, the method comprising:
maintaining a list of records containing unauthorized phone numbers in a database stored on a non-transitory computer readable storage medium; providing access to a manual clicker application through a server configured to access the database; providing a user interface to a user of the manual clicker application, the user interface configured to receive clicks from a user; receiving a plurality of clicks from the user targeted at an icon of the user interface; storing within the database a record of each of the plurality of clicks from the user and associating each of the plurality of clicks from the user with one of the records and a corresponding unauthorized phone number; electronically communicating to a dialing device each of the corresponding unauthorized phone numbers after storing the record of each click. 16. The method of claim 15 further comprising dialing each of the corresponding unauthorized phone numbers using the dialing device. 17. The method of claim 15 wherein the clicks are performed by a user using a mouse. 18. The method of claim 15 further comprising displaying to a user through the user interface a number of clicks performed with the list of records. 19. The method of claim 18 further comprising displaying to a user through the user interface a number of clicks remaining to be performed with the list of records. 20. The method of claim 15 further comprising notifying the user when there has been a click for every one of the records in the list of records. 21. The method of claim 15 further comprising receiving a selection of the list by the user through the user interface. 22. The method of claim 15 further comprising determining if phone numbers are unauthorized cell phone numbers, for phone numbers which are unauthorized cell phone numbers, placing the unauthorized cell phone numbers in the list of records and for phone numbers which are not unauthorized cell phone numbers sending the phone numbers directly to the dialing device. | 2,100 |
5,108 | 15,090,754 | 2,162 | A method and system for identifying results of a query that includes a type predicate is provided. A search system maintains a collection of facts that includes a triple for each fact and a type table that maps entities of the facts to their corresponding type. The search system uses the type table to speed up the process of identifying the search results when the query includes a non-type query triple and a type query triple. A type query triple is a triple that has a type predicate, rather than a non-type predicate. To execute a query that contains a non-type query triple and a type query triple, the search system identifies the triples of the collection that match the non-type query triple. The search system then uses the type table to determine which of the identified triples match the type query triple for inclusion in the search results. | 1. A computer-readable storage medium that is not a transitory, propagating signal storing computer-executable instructions for controlling a computing system to provide results for a query by performing a method comprising:
receiving a query having a non-type query triple and a type query triple, the non-type query triple having a subject, a non-type predicate, and an object, the type query triple having a subject, a type predicate, and an object, the subjects and objects being entities; retrieving, from a fact table of triples, triples that match the non-type query triple; for each retrieved triple, when a type for an entity of the retrieved triple is specified by the query,
retrieving from a type table an entry for the entity; and
when the retrieved entry indicates that that entity is not associated with that type, indicating that the retrieved triple does not match the query; and
providing as the results of the received query the retrieved triples except the retrieved triples that have been indicated as not matching the query. 2. The computer-readable storage medium of claim 1 wherein the method further includes, before receiving the query,
identifying triples in the fact table that have a type predicate; and
generating the type table based on the identified triples. 3. The computer-readable storage medium of claim 2 further including removing the identified triples from the fact table. 4. The computer-readable storage medium of claim 1 including generating an augmented query for the query that includes a subject, a subject type, a predicate, an object, and an object type. 5. The computer-readable storage medium of claim 4 wherein when the subject of the non-type query triple matches the subject of the type query triple, setting the subject type to the object of the type query triple. 6. The computer-readable storage medium of claim 4 wherein when the object of the non-type query triple matches the subject of the type query triple, setting the object type to the object of the type query triple. 7. The computer-readable storage medium of claim 1 wherein the query includes multiple non-type query triples and wherein the retrieved triples match each of the non-type query triples. 8. The computer-readable storage medium of claim 1 wherein the query includes multiple type query triples and wherein a retrieved triple is indicated as not matching the query when an entity of the retrieved triple that matches the subject of any type query triple does not have a type that matches the object of that type query triple. 9. A computing system for identifying results of a query based on triples, the computing system comprising:
computer-readable storage storing:
a fact table having triples, each triple having a subject, a predicate, and an object, the subject and object being entities;
a type table having a mapping from entities to one or more types of those entities, the type table having one entry for each of a plurality of entities that maps to the one or more types of that entity;
a query having one or more non-type query triples and one or more type query triples, each non-type query triple having a subject, a non-type predicate, and an object, and each type query triple having a subject, a type predicate, and an object;
computer-executable instructions that retrieve from the fact table triples that match the one or more non-type query triples;
computer-executable instructions that, for each retrieved triple, when an entity of the retrieved triple matches the subject of a type query triple and the type table does not have a mapping from the entity of the retrieved triple to the object of that type query triple with the matching subject, excluding the retrieved triple from the results of the query; and
computer-executable instructions that provide as the results of the received query the retrieved triples that have not been excluded from the results of the query; and
a processor for executing the computer-executable instructions stored in the computer-readable storage. 10. The computing system of claim 9 wherein the computer-readable storage includes computer-executable instructions that add to the type table triples of the fact table that have a type predicate. 11. The computing system of claim 10 wherein the computer-readable storage includes computer-executable instructions that remove from the fact table triples that have a type predicate. 12. The computing system of claim 9 wherein the computer-readable storage includes computer-executable instructions that, for each non-type query triple, generate an augmented query triple that includes a subject, a subject type, a predicate, an object, and an object type. 13. The computing system of claim 12 wherein the computer-readable storage includes computer-executable instructions that, when the subject of a non-type query triple matches the subject of a type query triple, sets the subject type of the augmented query triple for that non-type query triple to the object of that type query triple. 14. The computing system of claim 12 wherein the computer-readable storage includes computer-executable instructions that, when the object of a non-type query triple matches the subject of a type query triple, sets the object type of the augmented query triple for that non-type query triple to the object of that type query triple. 15. A method performed by a computing system for identifying results of a query, the method comprising:
providing a query having a non-type query triple and a type query triple, the non-type query triple having a subject, a non-type predicate, and an object, the type query triple having a subject, a type predicate, and an object, the subjects and objects being entities; identifying by the computing system triples of a fact table that match the non-type query triple; for each identified triple, when an entity of the identified triple matches the subject of the type query triple and the entity does not have a type that matches the object of the type query triple as indicated by a type table that maps entities to types, indicating by the computing system that that identified triple is to not be included in the results of the query; and providing as the results of the query the identified triples that have not been indicated to not be included in the results of the query. 16. (canceled) 17. The method of claim 15 including, prior to identifying triples that match the non-type query triple, selecting triples from the fact table that have a type predicate, and for each selected triple, adding to the type table a mapping from the subject of that selected triple to the object of that selected triple. 18. The method of claim 15 including removal of the selected triples from the fact table. 19. The method of claim 15 including generating an augmented query for the query that includes a subject, a subject type, a predicate, an object, and an object type. 20. The method of claim 19 wherein when the subject of the non-type query triple matches the subject of the type query triple, setting the subject type to the object of the type query triple, and when the object of the non-type query triple matches the subject of the type query triple, setting the object type to the object of the type query triple. 21. A computing system of one or more nodes for processing queries, the computing system comprising:
computer-readable storage of the one or more nodes that store:
a fact table storing facts represented as triples, each triple having a subject, predicate, and object, the subjects and objects being entities;
a type table that, for each of a plurality of entities, maps that entity to one or more types; and
instructions of a search engine that include instructions to:
receive a query that includes multiple query triples, each query triple having a subject, predicate, and object, and at least one of the query triples being an augmented query triple additionally having a subject type;
for each query triple, identify a set of triples of the fact table that match the subject, predicate, and object of the query triple; and when the query triple is an augmented query triple, filtering out from the set of triples those triples having a subject that does not match the subject type of the augmented query triple as determined by accessing the type table;
providing as results of the query an intersection of the identified sets. 22. A method performed by a computing system for identifying results of a query, the method comprising:
providing a query having a non-type query triple and a type query triple; identifying by the computing system triples of a fact table that match the non-type query triple; for each identified triple, when an entity of the identified triple matches a subject of the type query triple and the entity does not have a type that matches the object of the type query triple as indicated by a type table, indicating by the computing system that that identified triple is to not be included in the results of the query; and providing as the results of the query the identified triples that have not been indicated to not be included in the results of the query. 23. The method of claim 22 further comprising determining whether the entity has a type that matches the object of the type query triple based on whether the type table maps that entity to the object of the type query triple. | A method and system for identifying results of a query that includes a type predicate is provided. A search system maintains a collection of facts that includes a triple for each fact and a type table that maps entities of the facts to their corresponding type. The search system uses the type table to speed up the process of identifying the search results when the query includes a non-type query triple and a type query triple. A type query triple is a triple that has a type predicate, rather than a non-type predicate. To execute a query that contains a non-type query triple and a type query triple, the search system identifies the triples of the collection that match the non-type query triple. The search system then uses the type table to determine which of the identified triples match the type query triple for inclusion in the search results.1. A computer-readable storage medium that is not a transitory, propagating signal storing computer-executable instructions for controlling a computing system to provide results for a query by performing a method comprising:
receiving a query having a non-type query triple and a type query triple, the non-type query triple having a subject, a non-type predicate, and an object, the type query triple having a subject, a type predicate, and an object, the subjects and objects being entities; retrieving, from a fact table of triples, triples that match the non-type query triple; for each retrieved triple, when a type for an entity of the retrieved triple is specified by the query,
retrieving from a type table an entry for the entity; and
when the retrieved entry indicates that that entity is not associated with that type, indicating that the retrieved triple does not match the query; and
providing as the results of the received query the retrieved triples except the retrieved triples that have been indicated as not matching the query. 2. The computer-readable storage medium of claim 1 wherein the method further includes, before receiving the query,
identifying triples in the fact table that have a type predicate; and
generating the type table based on the identified triples. 3. The computer-readable storage medium of claim 2 further including removing the identified triples from the fact table. 4. The computer-readable storage medium of claim 1 including generating an augmented query for the query that includes a subject, a subject type, a predicate, an object, and an object type. 5. The computer-readable storage medium of claim 4 wherein when the subject of the non-type query triple matches the subject of the type query triple, setting the subject type to the object of the type query triple. 6. The computer-readable storage medium of claim 4 wherein when the object of the non-type query triple matches the subject of the type query triple, setting the object type to the object of the type query triple. 7. The computer-readable storage medium of claim 1 wherein the query includes multiple non-type query triples and wherein the retrieved triples match each of the non-type query triples. 8. The computer-readable storage medium of claim 1 wherein the query includes multiple type query triples and wherein a retrieved triple is indicated as not matching the query when an entity of the retrieved triple that matches the subject of any type query triple does not have a type that matches the object of that type query triple. 9. A computing system for identifying results of a query based on triples, the computing system comprising:
computer-readable storage storing:
a fact table having triples, each triple having a subject, a predicate, and an object, the subject and object being entities;
a type table having a mapping from entities to one or more types of those entities, the type table having one entry for each of a plurality of entities that maps to the one or more types of that entity;
a query having one or more non-type query triples and one or more type query triples, each non-type query triple having a subject, a non-type predicate, and an object, and each type query triple having a subject, a type predicate, and an object;
computer-executable instructions that retrieve from the fact table triples that match the one or more non-type query triples;
computer-executable instructions that, for each retrieved triple, when an entity of the retrieved triple matches the subject of a type query triple and the type table does not have a mapping from the entity of the retrieved triple to the object of that type query triple with the matching subject, excluding the retrieved triple from the results of the query; and
computer-executable instructions that provide as the results of the received query the retrieved triples that have not been excluded from the results of the query; and
a processor for executing the computer-executable instructions stored in the computer-readable storage. 10. The computing system of claim 9 wherein the computer-readable storage includes computer-executable instructions that add to the type table triples of the fact table that have a type predicate. 11. The computing system of claim 10 wherein the computer-readable storage includes computer-executable instructions that remove from the fact table triples that have a type predicate. 12. The computing system of claim 9 wherein the computer-readable storage includes computer-executable instructions that, for each non-type query triple, generate an augmented query triple that includes a subject, a subject type, a predicate, an object, and an object type. 13. The computing system of claim 12 wherein the computer-readable storage includes computer-executable instructions that, when the subject of a non-type query triple matches the subject of a type query triple, sets the subject type of the augmented query triple for that non-type query triple to the object of that type query triple. 14. The computing system of claim 12 wherein the computer-readable storage includes computer-executable instructions that, when the object of a non-type query triple matches the subject of a type query triple, sets the object type of the augmented query triple for that non-type query triple to the object of that type query triple. 15. A method performed by a computing system for identifying results of a query, the method comprising:
providing a query having a non-type query triple and a type query triple, the non-type query triple having a subject, a non-type predicate, and an object, the type query triple having a subject, a type predicate, and an object, the subjects and objects being entities; identifying by the computing system triples of a fact table that match the non-type query triple; for each identified triple, when an entity of the identified triple matches the subject of the type query triple and the entity does not have a type that matches the object of the type query triple as indicated by a type table that maps entities to types, indicating by the computing system that that identified triple is to not be included in the results of the query; and providing as the results of the query the identified triples that have not been indicated to not be included in the results of the query. 16. (canceled) 17. The method of claim 15 including, prior to identifying triples that match the non-type query triple, selecting triples from the fact table that have a type predicate, and for each selected triple, adding to the type table a mapping from the subject of that selected triple to the object of that selected triple. 18. The method of claim 15 including removal of the selected triples from the fact table. 19. The method of claim 15 including generating an augmented query for the query that includes a subject, a subject type, a predicate, an object, and an object type. 20. The method of claim 19 wherein when the subject of the non-type query triple matches the subject of the type query triple, setting the subject type to the object of the type query triple, and when the object of the non-type query triple matches the subject of the type query triple, setting the object type to the object of the type query triple. 21. A computing system of one or more nodes for processing queries, the computing system comprising:
computer-readable storage of the one or more nodes that store:
a fact table storing facts represented as triples, each triple having a subject, predicate, and object, the subjects and objects being entities;
a type table that, for each of a plurality of entities, maps that entity to one or more types; and
instructions of a search engine that include instructions to:
receive a query that includes multiple query triples, each query triple having a subject, predicate, and object, and at least one of the query triples being an augmented query triple additionally having a subject type;
for each query triple, identify a set of triples of the fact table that match the subject, predicate, and object of the query triple; and when the query triple is an augmented query triple, filtering out from the set of triples those triples having a subject that does not match the subject type of the augmented query triple as determined by accessing the type table;
providing as results of the query an intersection of the identified sets. 22. A method performed by a computing system for identifying results of a query, the method comprising:
providing a query having a non-type query triple and a type query triple; identifying by the computing system triples of a fact table that match the non-type query triple; for each identified triple, when an entity of the identified triple matches a subject of the type query triple and the entity does not have a type that matches the object of the type query triple as indicated by a type table, indicating by the computing system that that identified triple is to not be included in the results of the query; and providing as the results of the query the identified triples that have not been indicated to not be included in the results of the query. 23. The method of claim 22 further comprising determining whether the entity has a type that matches the object of the type query triple based on whether the type table maps that entity to the object of the type query triple. | 2,100 |
5,109 | 14,620,653 | 2,163 | A media apparatus for mapping a plurality of media files across multiple media sources may include a database of previously stored content information including a plurality of previously stored content entries, each content entry including a previously stored filename and previously stored metadata. The apparatus may also include a controller programmed to receive first content information representative of at least one first media file from at least one first media source, the first content information including a first media filename for the at least one first media file, determine if the first media filename matches the previously stored filename, derive first metadata from the first content information, and determine if the first metadata matches any of the previously stored metadata in response to determining that the first media filename failed to match the previously stored filename to associate the first media file with one of the previously stored content entries. | 1. A media apparatus for mapping a plurality of media files across multiple media sources, comprising:
a database of previously stored content information including a plurality of previously stored content entries, each content entry including a previously stored filename and previously stored metadata; a controller programmed to:
receive first content information representative of at least one first media file from at least one first media source, the first content information including a first media filename for the at least one first media file;
determine if the first media filename matches the previously stored filename;
derive first metadata from the first content information; and
determine if the first metadata matches any of the previously stored metadata in response to determining that the first media filename failed to match the previously stored filename to associate the first media file with one of the previously stored content entries. 2. The apparatus of claim 1, wherein the controller is further programmed to store the first content information in the database and to associate the first content information with the content entry corresponding to the previously stored metadata, in response to the first metadata matching the previously stored metadata. 3. The apparatus of claim 2, wherein the controller is further programmed to determine if first media characteristics of the first content information matches previously stored media characteristics of the previously stored content information in response to the first metadata failing to match the previously stored metadata. 4. The apparatus of claim 3, wherein the first media characteristics and the previously stored media characteristics include at least one of an estimated tempo, a spectral flatness, a bandwidth, a number of beats per minute and a runtime. 5. The apparatus of claim 1, wherein the controller is further programmed to determine if a first hash value of the first content information matches a previously stored hash value of the previously stored content information in response to the first media filename failing to match the previously stored filename. 6. The apparatus of claim 5, wherein the controller is further programmed to determine if the first metadata of the first content information matches the previously stored metadata in response to the first hash value failing to match the previously stored hash value. 7. The apparatus of claim 6, wherein the controller is further programmed to determine if a first normalized filename of the first content information matches a previously stored normalized filename of the previously stored content information in response to the first metadata failing to match the previously stored metadata. 8. A media apparatus for mapping a plurality of media files across multiple media sources, comprising:
a controller programmed to:
receive first content information representative of at least one first media file from at least one first media source, the first content information including a first media filename for the at least one first media file;
determine if the first media filename matches a previously stored filename;
derive first metadata from the first content information; and
determine if the first metadata matches previously stored metadata, in response to the first media filename failing to match the previously stored filename. 9. The apparatus of claim 8, wherein the controller is further programmed to store the first content information in a database and to associate the first media file with a previously stored media file corresponding to the previously stored metadata, in response to the first metadata matching the previously stored metadata. 10. The apparatus of claim 9, wherein the controller is further programmed to determine if first media characteristics of the first content information matches previously stored media characteristics in response to the first metadata failing to match the previously stored metadata. 11. The apparatus of claim 10, wherein the first media characteristics and the previously stored media characteristics include at least one of an estimated tempo, a spectral flatness, a bandwidth, a number of beats per minute and a runtime. 12. The apparatus of claim 8, wherein the controller is further programmed to determine if a first hash value of the first content information matches a previously stored hash value in response to the first media filename failing to match the previously stored filename. 13. The apparatus of claim 12, wherein the controller is further programmed to determine if the first metadata matches the previously stored metadata in response to the first hash value failing to match the previously stored hash value. 14. The apparatus of claim 13, wherein the controller is further programmed to determine if a first normalized filename of the first content information matches a previously stored normalized filename in response to the first metadata failing to match the previously stored metadata. 15. A non-transitory computer-readable medium tangibly embodying computer-executable instructions of a software program, the software program being executable by a processor of a computing device to provide operations comprising:
receiving first content information representative of at least one first media file from at least one media source, the first content information including a first media filename for the at least one first media file; determining if the first media filename matches a previously stored filename; deriving first metadata from the first content information; and determining if the first metadata matches previously stored metadata, in response to the first media filename failing to match the previously stored filename. 16. The medium of claim 15, further comprising storing the first content information in a database and associating the first content information with the previously stored filename in response to the first metadata matching the previously stored filename. 17. The medium of claim 16, further comprising determining whether first media characteristics of the first content information matches previously stored media characteristics in response to the first metadata failing to match the previously stored metadata. 18. The medium of claim 17, wherein the first media characteristics and the previously stored media characteristics include at least one of an estimated tempo, a spectral flatness, a bandwidth, a number of beats per minute and a runtime. 19. The medium of claim 15, further comprising determining whether a first hash value of the first content information matches a previously stored hash value in response to the first media filename failing to match the previously stored filename. 20. The medium of claim 19, further comprising determining whether the first metadata of the first metadata matches previously stored metadata in response to the first hash value failing to match the previously stored hash value. | A media apparatus for mapping a plurality of media files across multiple media sources may include a database of previously stored content information including a plurality of previously stored content entries, each content entry including a previously stored filename and previously stored metadata. The apparatus may also include a controller programmed to receive first content information representative of at least one first media file from at least one first media source, the first content information including a first media filename for the at least one first media file, determine if the first media filename matches the previously stored filename, derive first metadata from the first content information, and determine if the first metadata matches any of the previously stored metadata in response to determining that the first media filename failed to match the previously stored filename to associate the first media file with one of the previously stored content entries.1. A media apparatus for mapping a plurality of media files across multiple media sources, comprising:
a database of previously stored content information including a plurality of previously stored content entries, each content entry including a previously stored filename and previously stored metadata; a controller programmed to:
receive first content information representative of at least one first media file from at least one first media source, the first content information including a first media filename for the at least one first media file;
determine if the first media filename matches the previously stored filename;
derive first metadata from the first content information; and
determine if the first metadata matches any of the previously stored metadata in response to determining that the first media filename failed to match the previously stored filename to associate the first media file with one of the previously stored content entries. 2. The apparatus of claim 1, wherein the controller is further programmed to store the first content information in the database and to associate the first content information with the content entry corresponding to the previously stored metadata, in response to the first metadata matching the previously stored metadata. 3. The apparatus of claim 2, wherein the controller is further programmed to determine if first media characteristics of the first content information matches previously stored media characteristics of the previously stored content information in response to the first metadata failing to match the previously stored metadata. 4. The apparatus of claim 3, wherein the first media characteristics and the previously stored media characteristics include at least one of an estimated tempo, a spectral flatness, a bandwidth, a number of beats per minute and a runtime. 5. The apparatus of claim 1, wherein the controller is further programmed to determine if a first hash value of the first content information matches a previously stored hash value of the previously stored content information in response to the first media filename failing to match the previously stored filename. 6. The apparatus of claim 5, wherein the controller is further programmed to determine if the first metadata of the first content information matches the previously stored metadata in response to the first hash value failing to match the previously stored hash value. 7. The apparatus of claim 6, wherein the controller is further programmed to determine if a first normalized filename of the first content information matches a previously stored normalized filename of the previously stored content information in response to the first metadata failing to match the previously stored metadata. 8. A media apparatus for mapping a plurality of media files across multiple media sources, comprising:
a controller programmed to:
receive first content information representative of at least one first media file from at least one first media source, the first content information including a first media filename for the at least one first media file;
determine if the first media filename matches a previously stored filename;
derive first metadata from the first content information; and
determine if the first metadata matches previously stored metadata, in response to the first media filename failing to match the previously stored filename. 9. The apparatus of claim 8, wherein the controller is further programmed to store the first content information in a database and to associate the first media file with a previously stored media file corresponding to the previously stored metadata, in response to the first metadata matching the previously stored metadata. 10. The apparatus of claim 9, wherein the controller is further programmed to determine if first media characteristics of the first content information matches previously stored media characteristics in response to the first metadata failing to match the previously stored metadata. 11. The apparatus of claim 10, wherein the first media characteristics and the previously stored media characteristics include at least one of an estimated tempo, a spectral flatness, a bandwidth, a number of beats per minute and a runtime. 12. The apparatus of claim 8, wherein the controller is further programmed to determine if a first hash value of the first content information matches a previously stored hash value in response to the first media filename failing to match the previously stored filename. 13. The apparatus of claim 12, wherein the controller is further programmed to determine if the first metadata matches the previously stored metadata in response to the first hash value failing to match the previously stored hash value. 14. The apparatus of claim 13, wherein the controller is further programmed to determine if a first normalized filename of the first content information matches a previously stored normalized filename in response to the first metadata failing to match the previously stored metadata. 15. A non-transitory computer-readable medium tangibly embodying computer-executable instructions of a software program, the software program being executable by a processor of a computing device to provide operations comprising:
receiving first content information representative of at least one first media file from at least one media source, the first content information including a first media filename for the at least one first media file; determining if the first media filename matches a previously stored filename; deriving first metadata from the first content information; and determining if the first metadata matches previously stored metadata, in response to the first media filename failing to match the previously stored filename. 16. The medium of claim 15, further comprising storing the first content information in a database and associating the first content information with the previously stored filename in response to the first metadata matching the previously stored filename. 17. The medium of claim 16, further comprising determining whether first media characteristics of the first content information matches previously stored media characteristics in response to the first metadata failing to match the previously stored metadata. 18. The medium of claim 17, wherein the first media characteristics and the previously stored media characteristics include at least one of an estimated tempo, a spectral flatness, a bandwidth, a number of beats per minute and a runtime. 19. The medium of claim 15, further comprising determining whether a first hash value of the first content information matches a previously stored hash value in response to the first media filename failing to match the previously stored filename. 20. The medium of claim 19, further comprising determining whether the first metadata of the first metadata matches previously stored metadata in response to the first hash value failing to match the previously stored hash value. | 2,100 |
5,110 | 14,267,638 | 2,167 | A system and method for reporting invalid recordings of interactions. An interaction exchange list of interactions may be received that is transferred from an interaction exchange, e.g. to a contact center. A recorded interaction list may be generated listing recorded interactions stored in a memory. Records from the interaction exchange list may be matched with records from the recorded interaction list. For each record in the interaction exchange list, if a matching record from the recorded interaction list is found, it may be determined if the associated recorded interaction is operational. If no matching record is found or if the associated recorded interaction is determined to be non-operational, the associated recorded interaction may be reported as invalid. | 1. A method for reporting invalid recordings of interactions, the method comprising:
receiving an interaction exchange list of interactions transferred from an interaction exchange; generating a recorded interaction list of recorded interactions stored in a memory; matching records from the interaction exchange list with records from the recorded interaction list; for each record in the interaction exchange list:
if a matching record from the recorded interaction list is found, determining if the associated recorded interaction is operational; and
if no matching record is found or if the associated recorded interaction is determined to be non-operational, reporting that the associated recorded interaction is invalid. 2. The method of claim 1, wherein each record in the interaction exchange list is matched to a record in the recorded interaction list having the same one or more record parameters selected from a group consisting of: interaction identification, user device identification, number of segments in the interaction, interaction duration, interaction start time, interaction stop time, and interaction date. 3. The method of claim 1 comprising transforming an interaction identification of a record in the interaction exchange list to correlate with an interaction identification of a record in the recorded interaction list; and matching records having the same interaction identification. 4. The method of claim 1 comprising sorting the records in the interaction exchange list according to a start time and stop time of the interaction and matching records in the interaction exchange list with records in the recorded interaction list that have the same start time and stop time. 5. The method of claim 1 comprising matching two or more records in the interaction exchange list with a single record in the recorded interaction list that has the same interaction identification, start time and stop time. 6. The method of claim 1 comprising filtering the interaction exchange list based on predefined user devices and a predefined period of time to select a subset of records to be monitored. 7. The method of claim 1 comprising periodically reporting invalid recorded interactions according to a predefined reporting schedule. 8. The method of claim 1 comprising reporting a status of the invalid recorded interactions, wherein the status is selected from the group consisting of: not recorded, lost, damaged, incomplete, non-operational, and transferred. 9. The method of claim 1 comprising:
sending a request to initiate a new interaction with a user device interacting in the invalid recorded interaction;
recording the new interaction with the user device; and
verifying that the contact center stores a record and an operational recorded interaction for the new interaction. 10. A method for monitoring contact center recording, the method comprising:
at a contact center:
recording interactions transferred from an interaction exchange;
correlating interaction exchange records and contact center records of the interactions; and
if there is a discrepancy between the records such that there is an extra interaction exchange record that has no correlated contact center record, identifying that a contact center recording of the interaction associated with the extra interaction exchange record is missing. 11. The method of claim 10 comprising, for each interaction in which there is no discrepancy between the interaction exchange record and contact center record, determining if the interaction recording associated with the contact center record is operational. 12. The method of claim 11 comprising reporting that the interaction recording is non-operational. 13. The method of claim 11 comprising, if there are no discrepancy between the records and the interaction recordings are operational for all contact center records, reporting that all monitored interactions are recorded by the contact center. 14. The method of claim 11 comprising, before correlating the interaction exchange records:
retrieving a subset of interaction exchange records for interactions that occurred within a predetermined time period;
grouping interaction exchange records in the subset according to an interaction identification;
sorting the grouped interaction exchange records according to their interaction times; and
merging two or more of the sorted interaction exchange records that have the same interaction identification number and interaction times into a single interaction exchange record. 15. A system for reporting invalid recordings of interactions, the system comprising:
a recording device for recording interactions transferred from an interaction exchange; a memory for storing the recorded interactions; and a processor configured to generate records of the recorded interactions in a recorded interaction list, receive an interaction exchange list of interactions transferred from the interaction exchange, match records from the interaction exchange list with records from the recorded interaction list, wherein for each record in the interaction exchange list, if a matching record from the recorded interaction list is found, the processor is configured to determine if the associated recorded interaction is operational, and if no matching record is found or if the associated recorded interaction is determined to be non-operational, the processor is configured to report that the associated recorded interaction is invalid. 16. The system of claim 15 comprising a contact center recording compliance tool including the processor. 17. The system of claim 15, wherein the interaction exchange is a private branch exchange (PBX) for telephone interactions. 18. The system of claim 15, wherein the interaction exchange includes an Internet exchange (IX) including a computer telephony integration (CTI) server for voice over Internet Protocol (VoIP) communication. 19. The system of claim 15, wherein the processor is further configured to match each record in the interaction exchange list to a record in the recorded interaction list having the same one or more record parameters selected from a group consisting of: interaction identification, user device identification, number of segments in the interaction, interaction duration, interaction start time, interaction stop time, and interaction date. 20. The system of claim 15, wherein the processor is further configured to transform an interaction identification of a record in the interaction exchange list to correlate with an interaction identification of a record in the recorded interaction list; and match records having the same interaction identification. | A system and method for reporting invalid recordings of interactions. An interaction exchange list of interactions may be received that is transferred from an interaction exchange, e.g. to a contact center. A recorded interaction list may be generated listing recorded interactions stored in a memory. Records from the interaction exchange list may be matched with records from the recorded interaction list. For each record in the interaction exchange list, if a matching record from the recorded interaction list is found, it may be determined if the associated recorded interaction is operational. If no matching record is found or if the associated recorded interaction is determined to be non-operational, the associated recorded interaction may be reported as invalid.1. A method for reporting invalid recordings of interactions, the method comprising:
receiving an interaction exchange list of interactions transferred from an interaction exchange; generating a recorded interaction list of recorded interactions stored in a memory; matching records from the interaction exchange list with records from the recorded interaction list; for each record in the interaction exchange list:
if a matching record from the recorded interaction list is found, determining if the associated recorded interaction is operational; and
if no matching record is found or if the associated recorded interaction is determined to be non-operational, reporting that the associated recorded interaction is invalid. 2. The method of claim 1, wherein each record in the interaction exchange list is matched to a record in the recorded interaction list having the same one or more record parameters selected from a group consisting of: interaction identification, user device identification, number of segments in the interaction, interaction duration, interaction start time, interaction stop time, and interaction date. 3. The method of claim 1 comprising transforming an interaction identification of a record in the interaction exchange list to correlate with an interaction identification of a record in the recorded interaction list; and matching records having the same interaction identification. 4. The method of claim 1 comprising sorting the records in the interaction exchange list according to a start time and stop time of the interaction and matching records in the interaction exchange list with records in the recorded interaction list that have the same start time and stop time. 5. The method of claim 1 comprising matching two or more records in the interaction exchange list with a single record in the recorded interaction list that has the same interaction identification, start time and stop time. 6. The method of claim 1 comprising filtering the interaction exchange list based on predefined user devices and a predefined period of time to select a subset of records to be monitored. 7. The method of claim 1 comprising periodically reporting invalid recorded interactions according to a predefined reporting schedule. 8. The method of claim 1 comprising reporting a status of the invalid recorded interactions, wherein the status is selected from the group consisting of: not recorded, lost, damaged, incomplete, non-operational, and transferred. 9. The method of claim 1 comprising:
sending a request to initiate a new interaction with a user device interacting in the invalid recorded interaction;
recording the new interaction with the user device; and
verifying that the contact center stores a record and an operational recorded interaction for the new interaction. 10. A method for monitoring contact center recording, the method comprising:
at a contact center:
recording interactions transferred from an interaction exchange;
correlating interaction exchange records and contact center records of the interactions; and
if there is a discrepancy between the records such that there is an extra interaction exchange record that has no correlated contact center record, identifying that a contact center recording of the interaction associated with the extra interaction exchange record is missing. 11. The method of claim 10 comprising, for each interaction in which there is no discrepancy between the interaction exchange record and contact center record, determining if the interaction recording associated with the contact center record is operational. 12. The method of claim 11 comprising reporting that the interaction recording is non-operational. 13. The method of claim 11 comprising, if there are no discrepancy between the records and the interaction recordings are operational for all contact center records, reporting that all monitored interactions are recorded by the contact center. 14. The method of claim 11 comprising, before correlating the interaction exchange records:
retrieving a subset of interaction exchange records for interactions that occurred within a predetermined time period;
grouping interaction exchange records in the subset according to an interaction identification;
sorting the grouped interaction exchange records according to their interaction times; and
merging two or more of the sorted interaction exchange records that have the same interaction identification number and interaction times into a single interaction exchange record. 15. A system for reporting invalid recordings of interactions, the system comprising:
a recording device for recording interactions transferred from an interaction exchange; a memory for storing the recorded interactions; and a processor configured to generate records of the recorded interactions in a recorded interaction list, receive an interaction exchange list of interactions transferred from the interaction exchange, match records from the interaction exchange list with records from the recorded interaction list, wherein for each record in the interaction exchange list, if a matching record from the recorded interaction list is found, the processor is configured to determine if the associated recorded interaction is operational, and if no matching record is found or if the associated recorded interaction is determined to be non-operational, the processor is configured to report that the associated recorded interaction is invalid. 16. The system of claim 15 comprising a contact center recording compliance tool including the processor. 17. The system of claim 15, wherein the interaction exchange is a private branch exchange (PBX) for telephone interactions. 18. The system of claim 15, wherein the interaction exchange includes an Internet exchange (IX) including a computer telephony integration (CTI) server for voice over Internet Protocol (VoIP) communication. 19. The system of claim 15, wherein the processor is further configured to match each record in the interaction exchange list to a record in the recorded interaction list having the same one or more record parameters selected from a group consisting of: interaction identification, user device identification, number of segments in the interaction, interaction duration, interaction start time, interaction stop time, and interaction date. 20. The system of claim 15, wherein the processor is further configured to transform an interaction identification of a record in the interaction exchange list to correlate with an interaction identification of a record in the recorded interaction list; and match records having the same interaction identification. | 2,100 |
5,111 | 14,599,272 | 2,123 | A novel data-parallel algorithm is presented for topic modeling on a highly-parallel hardware architectures. The algorithm is a Markov-Chain Monte Carlo algorithm used to estimate the parameters of the LDA topic model. This algorithm is based on a highly parallel partially-collapsed Gibbs sampler, but replaces a stochastic step that draws from a distribution with an optimization step that computes the mean of the distribution directly and deterministically. This algorithm is correct, it is statistically performant, and it is faster than state-of-the art algorithms because it can exploit the massive amounts of parallelism by processing the algorithm on a highly-parallel architecture, such as a GPU. Furthermore, the partially-collapsed Gibbs sampler converges about as fast as the collapsed Gibbs sampler and identifies solutions that are as good, or even better, as the collapsed Gibbs sampler. | 1. A method for identifying sets of correlated words comprising:
receiving information for a set of documents; wherein the set of documents comprises a plurality of words; running a partially-collapsed Gibbs sampler over a Dirichlet distribution of the plurality of words in the set of documents to produce sampler result data, further comprising:
calculating a mean of the Dirichlet distribution;
determining, from the sampler result data, one or more sets of correlated words; wherein the method is performed by one or more computing devices. 2. The method of claim 1, wherein running the partially-collapsed Gibbs sampler over the Dirichlet distribution further comprises calculating the mean of the Dirichlet distribution as a substitute value for drawing a value from the Dirichlet distribution. 3. The method of claim 2, further comprising performing one or more calculations for running the partially-collapsed Gibbs sampler over the Dirichlet distribution using single-precision arithmetic. 4. The method of claim 1, wherein running the partially-collapsed Gibbs sampler over the Dirichlet distribution comprises computing a plurality of values, for the partially-collapsed Gibbs sampler, in parallel. 5. The method of claim 4, wherein the plurality of values that are computed in a plurality of parallel Single Program Multiple Data (SPMD) units on a graphics processing unit (GPU). 6. The method of claim 5, wherein, during a particular iteration of a plurality of iterations of the partially-collapsed Gibbs sampler, each SPMD unit of the plurality of SPMD units performs calculations for words in a particular document of the set of documents. 7. The method of claim 1, wherein the partially-collapsed Gibbs sampler is collapsed with respect to a θ variable. 8. One or more computer-readable media storing instructions which, when executed by one or more processors, cause performance of:
receiving information for a set of documents; wherein the set of documents comprises a plurality of words; running a partially-collapsed Gibbs sampler over a Dirichlet distribution of the plurality of words in the set of documents to produce sampler result data, further comprising:
calculating a mean of the Dirichlet distribution;
determining, from the sampler result data, one or more sets of correlated words. 9. The one or more computer-readable media of claim 8, wherein running the partially-collapsed Gibbs sampler over the Dirichlet distribution further comprises calculating the mean of the Dirichlet distribution as a substitute value for drawing a value from the Dirichlet distribution. 10. The one or more computer-readable media of claim 9, the instructions further comprising instructions for performing one or more calculations for running the partially-collapsed Gibbs sampler over the Dirichlet distribution using single-precision arithmetic. 11. The one or more computer-readable media of claim 8, wherein running the partially-collapsed Gibbs sampler over the Dirichlet distribution comprises computing a plurality of values, for the partially-collapsed Gibbs sampler, in parallel. 12. The one or more computer-readable media of claim 11, wherein the plurality of values are computed in parallel Single Program Multiple Data (SPMD) units on a graphics processing unit (GPU). 13. The one or more computer-readable media of claim 12, wherein, during a particular iteration of a plurality of iterations of the partially-collapsed Gibbs sampler, each SPMD unit of the plurality of SPMD units performs calculations for words in a particular document of the set of documents. 14. The one or more computer-readable media of claim 8, wherein the partially-collapsed Gibbs sampler is collapsed with respect to a θ variable. 15. A computer system comprising:
one or more processors; and one or more computer-readable media storing instructions which, when executed by the one or more processors, cause performance of:
receiving information for a set of documents;
wherein the set of documents comprises a plurality of words;
running a partially-collapsed Gibbs sampler over a Dirichlet distribution of the plurality of words in the set of documents to produce sampler result data, further comprising:
calculating a mean of the Dirichlet distribution;
determining, from the sampler result data, one or more sets of correlated words. 16. The computer system of claim 15, wherein running the partially-collapsed Gibbs sampler over the Dirichlet distribution further comprises calculating the mean of the Dirichlet distribution as a substitute value for drawing a value from the Dirichlet distribution. 17. The computer system of claim 16, wherein the instructions further comprise instructions for performing one or more calculations for running the partially-collapsed Gibbs sampler over the Dirichlet distribution using single-precision arithmetic. 18. The computer system of claim 15, wherein:
a particular processor of the one or more processors is a graphics processing unit (GPU) comprising a plurality of Single Program Multiple Data (SPMD) units; running the partially-collapsed Gibbs sampler over the Dirichlet distribution comprises computing a plurality of values, for the partially-collapsed Gibbs sampler, in parallel; and the plurality of values are computed on the plurality of SPMD units on the GPU. 19. The computer system of claim 18, wherein, during a particular iteration of a plurality of iterations of the partially-collapsed Gibbs sampler, each SPMD unit of the plurality of SPMD units performs calculations for words in a particular document of the set of documents. | A novel data-parallel algorithm is presented for topic modeling on a highly-parallel hardware architectures. The algorithm is a Markov-Chain Monte Carlo algorithm used to estimate the parameters of the LDA topic model. This algorithm is based on a highly parallel partially-collapsed Gibbs sampler, but replaces a stochastic step that draws from a distribution with an optimization step that computes the mean of the distribution directly and deterministically. This algorithm is correct, it is statistically performant, and it is faster than state-of-the art algorithms because it can exploit the massive amounts of parallelism by processing the algorithm on a highly-parallel architecture, such as a GPU. Furthermore, the partially-collapsed Gibbs sampler converges about as fast as the collapsed Gibbs sampler and identifies solutions that are as good, or even better, as the collapsed Gibbs sampler.1. A method for identifying sets of correlated words comprising:
receiving information for a set of documents; wherein the set of documents comprises a plurality of words; running a partially-collapsed Gibbs sampler over a Dirichlet distribution of the plurality of words in the set of documents to produce sampler result data, further comprising:
calculating a mean of the Dirichlet distribution;
determining, from the sampler result data, one or more sets of correlated words; wherein the method is performed by one or more computing devices. 2. The method of claim 1, wherein running the partially-collapsed Gibbs sampler over the Dirichlet distribution further comprises calculating the mean of the Dirichlet distribution as a substitute value for drawing a value from the Dirichlet distribution. 3. The method of claim 2, further comprising performing one or more calculations for running the partially-collapsed Gibbs sampler over the Dirichlet distribution using single-precision arithmetic. 4. The method of claim 1, wherein running the partially-collapsed Gibbs sampler over the Dirichlet distribution comprises computing a plurality of values, for the partially-collapsed Gibbs sampler, in parallel. 5. The method of claim 4, wherein the plurality of values that are computed in a plurality of parallel Single Program Multiple Data (SPMD) units on a graphics processing unit (GPU). 6. The method of claim 5, wherein, during a particular iteration of a plurality of iterations of the partially-collapsed Gibbs sampler, each SPMD unit of the plurality of SPMD units performs calculations for words in a particular document of the set of documents. 7. The method of claim 1, wherein the partially-collapsed Gibbs sampler is collapsed with respect to a θ variable. 8. One or more computer-readable media storing instructions which, when executed by one or more processors, cause performance of:
receiving information for a set of documents; wherein the set of documents comprises a plurality of words; running a partially-collapsed Gibbs sampler over a Dirichlet distribution of the plurality of words in the set of documents to produce sampler result data, further comprising:
calculating a mean of the Dirichlet distribution;
determining, from the sampler result data, one or more sets of correlated words. 9. The one or more computer-readable media of claim 8, wherein running the partially-collapsed Gibbs sampler over the Dirichlet distribution further comprises calculating the mean of the Dirichlet distribution as a substitute value for drawing a value from the Dirichlet distribution. 10. The one or more computer-readable media of claim 9, the instructions further comprising instructions for performing one or more calculations for running the partially-collapsed Gibbs sampler over the Dirichlet distribution using single-precision arithmetic. 11. The one or more computer-readable media of claim 8, wherein running the partially-collapsed Gibbs sampler over the Dirichlet distribution comprises computing a plurality of values, for the partially-collapsed Gibbs sampler, in parallel. 12. The one or more computer-readable media of claim 11, wherein the plurality of values are computed in parallel Single Program Multiple Data (SPMD) units on a graphics processing unit (GPU). 13. The one or more computer-readable media of claim 12, wherein, during a particular iteration of a plurality of iterations of the partially-collapsed Gibbs sampler, each SPMD unit of the plurality of SPMD units performs calculations for words in a particular document of the set of documents. 14. The one or more computer-readable media of claim 8, wherein the partially-collapsed Gibbs sampler is collapsed with respect to a θ variable. 15. A computer system comprising:
one or more processors; and one or more computer-readable media storing instructions which, when executed by the one or more processors, cause performance of:
receiving information for a set of documents;
wherein the set of documents comprises a plurality of words;
running a partially-collapsed Gibbs sampler over a Dirichlet distribution of the plurality of words in the set of documents to produce sampler result data, further comprising:
calculating a mean of the Dirichlet distribution;
determining, from the sampler result data, one or more sets of correlated words. 16. The computer system of claim 15, wherein running the partially-collapsed Gibbs sampler over the Dirichlet distribution further comprises calculating the mean of the Dirichlet distribution as a substitute value for drawing a value from the Dirichlet distribution. 17. The computer system of claim 16, wherein the instructions further comprise instructions for performing one or more calculations for running the partially-collapsed Gibbs sampler over the Dirichlet distribution using single-precision arithmetic. 18. The computer system of claim 15, wherein:
a particular processor of the one or more processors is a graphics processing unit (GPU) comprising a plurality of Single Program Multiple Data (SPMD) units; running the partially-collapsed Gibbs sampler over the Dirichlet distribution comprises computing a plurality of values, for the partially-collapsed Gibbs sampler, in parallel; and the plurality of values are computed on the plurality of SPMD units on the GPU. 19. The computer system of claim 18, wherein, during a particular iteration of a plurality of iterations of the partially-collapsed Gibbs sampler, each SPMD unit of the plurality of SPMD units performs calculations for words in a particular document of the set of documents. | 2,100 |
5,112 | 14,328,334 | 2,176 | Methods and systems for providing and managing content are disclosed. An example method can comprise receiving at least a portion of a content item and determining a timing attribute associated with at least a portion of the content item. An example method can also comprise determining a delivery information attribute based on the timing attribute. The delivery information attribute can comprise at least one of a time duration to process at least a portion of the content item and a time duration to receive or transmit at least a portion of the content item. An example method can also comprise receiving an update to the content item based on the delivery information attribute. | 1. A method, comprising:
receiving at least a portion of a content item; determining a timing attribute associated with the at least a portion of the content item; determining a delivery information attribute based on the timing attribute, wherein the delivery information attribute comprises at least one of a time duration to process the at least a portion of the content item and a time duration to receive the at least a portion of the content item; and receiving an update to the content item based on the delivery information attribute. 2. The method of claim 1, wherein the timing attribute comprises a time associated with an event that occurs at a device in at least one of receiving the at least a portion of the content item and processing the at least a portion of the content item. 3. The method of claim 1, wherein determining the timing attribute comprises determining a first timing attribute and a second timing attribute, and wherein determining delivery information attribute comprises determining a difference between the first timing attribute and the second timing attribute. 4. The method of claim 3, wherein the first timing attribute comprises a time associated with initiating a network connection with a device, and the second timing attribute comprises a time associated with completing the network connection with the device. 5. The method of claim 3, wherein the first timing attribute comprises a time associated with beginning to process a document object model based on the at least a portion of the content item, and the second timing attribute comprises a time associated with completing processing the document object model based on the at least a portion of the content item. 6. The method of claim 1, wherein determining the timing attribute comprises determining an attribute associated with the at least a portion of the content item, wherein the attribute associated with the content item is stored by a web interface on a device receiving the at least a portion of the content item. 7. The method of claim 1, wherein delivery information attribute further comprises at least one of a time duration to establish a network connection with a device receiving the at least a portion of the content item, and a power attribute indicating at least one of a power consumption mode, a power level, a time duration to use an amount of power, and a power capacity. 8. A method, comprising:
identifying timing information associated with first content; determining a delivery information attribute based on the timing information, wherein the delivery information attribute comprises at least one of a time duration to process the first content and a time duration to transmit the first content; and selecting second content based on the delivery information attribute. 9. The method of claim 8, wherein determining the timing information comprises determining a first timing attribute and a second timing attribute, and wherein determining the delivery information attribute comprises determining a difference between the first timing attribute and the second timing attribute. 10. The method of claim 9, wherein the first timing attribute comprises a time associated with a request and the second timing attribute comprises a time associated with a response. 11. The method of claim 9, wherein the first timing attribute comprises a time associated with initiating a network connection with a device and the second timing attribute comprises a time associated with completing the network connection with the device. 12. The method of claim 9, wherein the first timing attribute comprises a time associated with beginning to process a document object model based on the first content and the second timing attribute comprises a time associated with completing processing the document object model based on the first content. 13. A method, comprising:
receiving at least a portion of a content item; determining power information; and updating the content item based on the power information. 14. The method of claim 13, wherein receiving at least the portion of the content item comprises receiving at least a portion of a web page. 15. The method of claim 13, wherein determining power information comprises determining the power information in an attribute of a document object model associated with the content item. 16. The method of claim 13, wherein updating the content item based on the power information comprises at least one of enabling a portion of the content item and disabling a portion of the content item. 17. The method of claim 13, wherein updating the content item based on the power information comprises requesting additional content. 18. The method of claim 13, wherein updating the content item based on the power information comprises providing the power information to a device with a request for additional content. 19. The method of claim 18, wherein the power information is provided in a hypertext transfer protocol header field. 20. The method of claim 13, wherein the power information comprises a power usage mode. | Methods and systems for providing and managing content are disclosed. An example method can comprise receiving at least a portion of a content item and determining a timing attribute associated with at least a portion of the content item. An example method can also comprise determining a delivery information attribute based on the timing attribute. The delivery information attribute can comprise at least one of a time duration to process at least a portion of the content item and a time duration to receive or transmit at least a portion of the content item. An example method can also comprise receiving an update to the content item based on the delivery information attribute.1. A method, comprising:
receiving at least a portion of a content item; determining a timing attribute associated with the at least a portion of the content item; determining a delivery information attribute based on the timing attribute, wherein the delivery information attribute comprises at least one of a time duration to process the at least a portion of the content item and a time duration to receive the at least a portion of the content item; and receiving an update to the content item based on the delivery information attribute. 2. The method of claim 1, wherein the timing attribute comprises a time associated with an event that occurs at a device in at least one of receiving the at least a portion of the content item and processing the at least a portion of the content item. 3. The method of claim 1, wherein determining the timing attribute comprises determining a first timing attribute and a second timing attribute, and wherein determining delivery information attribute comprises determining a difference between the first timing attribute and the second timing attribute. 4. The method of claim 3, wherein the first timing attribute comprises a time associated with initiating a network connection with a device, and the second timing attribute comprises a time associated with completing the network connection with the device. 5. The method of claim 3, wherein the first timing attribute comprises a time associated with beginning to process a document object model based on the at least a portion of the content item, and the second timing attribute comprises a time associated with completing processing the document object model based on the at least a portion of the content item. 6. The method of claim 1, wherein determining the timing attribute comprises determining an attribute associated with the at least a portion of the content item, wherein the attribute associated with the content item is stored by a web interface on a device receiving the at least a portion of the content item. 7. The method of claim 1, wherein delivery information attribute further comprises at least one of a time duration to establish a network connection with a device receiving the at least a portion of the content item, and a power attribute indicating at least one of a power consumption mode, a power level, a time duration to use an amount of power, and a power capacity. 8. A method, comprising:
identifying timing information associated with first content; determining a delivery information attribute based on the timing information, wherein the delivery information attribute comprises at least one of a time duration to process the first content and a time duration to transmit the first content; and selecting second content based on the delivery information attribute. 9. The method of claim 8, wherein determining the timing information comprises determining a first timing attribute and a second timing attribute, and wherein determining the delivery information attribute comprises determining a difference between the first timing attribute and the second timing attribute. 10. The method of claim 9, wherein the first timing attribute comprises a time associated with a request and the second timing attribute comprises a time associated with a response. 11. The method of claim 9, wherein the first timing attribute comprises a time associated with initiating a network connection with a device and the second timing attribute comprises a time associated with completing the network connection with the device. 12. The method of claim 9, wherein the first timing attribute comprises a time associated with beginning to process a document object model based on the first content and the second timing attribute comprises a time associated with completing processing the document object model based on the first content. 13. A method, comprising:
receiving at least a portion of a content item; determining power information; and updating the content item based on the power information. 14. The method of claim 13, wherein receiving at least the portion of the content item comprises receiving at least a portion of a web page. 15. The method of claim 13, wherein determining power information comprises determining the power information in an attribute of a document object model associated with the content item. 16. The method of claim 13, wherein updating the content item based on the power information comprises at least one of enabling a portion of the content item and disabling a portion of the content item. 17. The method of claim 13, wherein updating the content item based on the power information comprises requesting additional content. 18. The method of claim 13, wherein updating the content item based on the power information comprises providing the power information to a device with a request for additional content. 19. The method of claim 18, wherein the power information is provided in a hypertext transfer protocol header field. 20. The method of claim 13, wherein the power information comprises a power usage mode. | 2,100 |
5,113 | 11,544,685 | 2,144 | Disclosed herein is a redaction system, method and computer program product. Embodiments of the invention implement an automated redaction system for redacting electronic documents. A redaction system of the invention has a source of electronic documents to be redacted; a source of redaction rules; and a redaction engine coupled to the source of electronic documents and the source of redaction rules. The redaction system is configured to perform operations of the method of the invention by accessing electronic documents to be redacted; accessing redaction rules to be applied when redacting the electronic documents; and redacting the electronic documents in accordance with the redaction rules. In other embodiments of the invention, the electronic documents to be redacted are converted to a common electronic format prior to redaction, and redacted when in the common electronic format. | 1. A redaction system comprising:
a source of redaction rules; and a redaction engine coupled to the source of redaction rules, the redaction engine configured to redact an electronic document in accordance with at least one of the redaction rules contained in the source of redaction rules to thereby generate a redacted version of the electronic document containing at least one redaction. 2. The system of claim 1 where the redaction engine is adapted to identify the electronic document by document type. 3. The system of claim 2 where the redaction engine is adapted to select redaction rules to be applied to the electronic document in dependence on the identified document type. 4. The system of claim 1 where the redaction rules specify categories of information to be redacted. 5. The system of claim 4 where the categories of information comprise text information. 6. The system of claim 4 where the categories of information comprise graphical information. 7. The system of claim 6 where the graphical information comprises an organization logo. 8. The system of claim 4 where the categories of information comprise visual information. 9. The system of claim 8 where the visual information comprises photographic information. 10. The system of claim 3 where the selected redaction rules specify document cells to be redacted. 11. The system of claim 3 where the selected redaction rules specify categories of text are to be redacted. 12. The system of claim 3 where the redaction engine is adapted to detect an identification code in the electronic document to determine document type. 13. The system of claim 3 where the redaction engine is adapted to receive inputs identifying the electronic document by document type. 14. The system of claim 3 the redaction engine is adapted to use pattern recognition to identify the electronic document by document type. 15. The system of claim 1 further comprising a memory adapted to store redacted electronic documents. 16. The system of claim 1 further comprising a scanning system configured to convert hard copies of documents to electronic documents. 17. The system of claim 1 where the redaction engine is adapted to provide the redaction with a redaction indicia. 18. The system of claim 1 where the redaction engine is adapted to provide the redaction indicia to identify what category of information has been redacted in the electronic documents. 19. The system of claim 1 where the redaction engine is adapted to provide the redaction without being identified by redaction indicia, the absence of redaction indicia masking a category of information that has been redacted in the electronic document. 20. The system of claim 1 further comprising a redaction rule entry system configured to receive the redaction rules to be used when performing redaction operations. 21. The system of claim 20 where the redaction rule entry system comprises a redaction rule editing system for editing pre-existing redaction rules. 22. The system of claim 20 where the redaction rule entry system is configured to receive commands associating redaction rules with specific electronic document types, wherein the redaction engine is configured such that a particular redaction rule associated with a particular electronic document type is used when redacting electronic documents corresponding to the particular electronic document type. 23. The system of claim 1 where the source of redaction rules comprises rules specifying cells in the electronic document to be reproduced without redaction. 24. The system of claim 1 further comprising:
a manual redaction entry system configured to allow a user to manually redact the electronic document; and where the source of redaction rules further comprises an automated system configured to monitor patterns of manual redactions entered by a user and to generate redaction rules in dependence on the monitoring activity. 25. The system of claim 1 where the source of redaction rules comprises rules specifying categories of information to be reproduced without redaction. 26. The system of claim 25 where at least one of the categories of information comprises text information. 27. The system of claim 25 where at least one of the categories of information comprises graphical information. 28. The system of claim 25 at least one of the categories of information comprises visual information. 29. The system of claim 28 where the visual information further comprises photographic images. 30. The system of claim 1 wherein the system is configured to redact electronic documents recorded in a plurality of different electronic formats. 31. The system of claim 1 further comprising an electronic document pre-processor configured to identify which electronic format a particular electronic document is recorded in and to convert the particular electronic document to a common electronic format. 32. The system of claim 31 wherein the redaction engine is adapted to performing the redaction operations on the electronic document when the electronic document is in the common format. 33. The system of claim 31 where the electronic document pre-processor is configured to impose a cell format on a particular electronic document in dependence on the redaction rules contained in the source of redaction rules. 34. The system of claim 33 where the redaction engine is adapted to impose a cell format on the electronic document. 35. The system of claim 31 further comprising an electronic document post-processor configured to convert the redacted version of the electronic document from the common electronic format in which it was redacted to another electronic format. 36. The system of claim 1 wherein the redaction engine is adapted to be connected to a network gateway for disseminating the redacted version of the electronic document to users. 37. A computer program product comprising a computer readable storage medium storing a computer program configured to perform redaction operations when executed by digital processing apparatus, the operations comprising:
accessing at least one redaction rule to be applied to the electronic document; redacting the electronic document in accordance with the at least one redaction rule. 38. The computer program product of claim 37 wherein the operations further comprise:
after accessing the electronic document to be redacted and prior to redacting the electronic document, converting the electronic document into a different electronic format, and wherein redacting the electronic document further comprises redacting the electronic document in the different electronic format. 39. The computer program product of claim 38 wherein the operations further comprise:
converting the redacted electronic document into a different electronic format. 40. A method comprising:
receiving redaction rules to be used in redacting electronic documents, where the redaction rules are specified in dependence on document type; storing the redaction rules to a computer memory, the computer memory comprising a source of redaction rules; accessing an electronic document to be redacted from a source of electronic documents; identifying the electronic document to be redacted by document type; accessing redaction rules from the source of redaction rules appropriate for use in redacting the type of document to which the electronic document corresponds; and redacting the electronic document in accordance with the redaction rules specified for the document type to which the electronic document corresponds, creating redactions in the electronic document. | Disclosed herein is a redaction system, method and computer program product. Embodiments of the invention implement an automated redaction system for redacting electronic documents. A redaction system of the invention has a source of electronic documents to be redacted; a source of redaction rules; and a redaction engine coupled to the source of electronic documents and the source of redaction rules. The redaction system is configured to perform operations of the method of the invention by accessing electronic documents to be redacted; accessing redaction rules to be applied when redacting the electronic documents; and redacting the electronic documents in accordance with the redaction rules. In other embodiments of the invention, the electronic documents to be redacted are converted to a common electronic format prior to redaction, and redacted when in the common electronic format.1. A redaction system comprising:
a source of redaction rules; and a redaction engine coupled to the source of redaction rules, the redaction engine configured to redact an electronic document in accordance with at least one of the redaction rules contained in the source of redaction rules to thereby generate a redacted version of the electronic document containing at least one redaction. 2. The system of claim 1 where the redaction engine is adapted to identify the electronic document by document type. 3. The system of claim 2 where the redaction engine is adapted to select redaction rules to be applied to the electronic document in dependence on the identified document type. 4. The system of claim 1 where the redaction rules specify categories of information to be redacted. 5. The system of claim 4 where the categories of information comprise text information. 6. The system of claim 4 where the categories of information comprise graphical information. 7. The system of claim 6 where the graphical information comprises an organization logo. 8. The system of claim 4 where the categories of information comprise visual information. 9. The system of claim 8 where the visual information comprises photographic information. 10. The system of claim 3 where the selected redaction rules specify document cells to be redacted. 11. The system of claim 3 where the selected redaction rules specify categories of text are to be redacted. 12. The system of claim 3 where the redaction engine is adapted to detect an identification code in the electronic document to determine document type. 13. The system of claim 3 where the redaction engine is adapted to receive inputs identifying the electronic document by document type. 14. The system of claim 3 the redaction engine is adapted to use pattern recognition to identify the electronic document by document type. 15. The system of claim 1 further comprising a memory adapted to store redacted electronic documents. 16. The system of claim 1 further comprising a scanning system configured to convert hard copies of documents to electronic documents. 17. The system of claim 1 where the redaction engine is adapted to provide the redaction with a redaction indicia. 18. The system of claim 1 where the redaction engine is adapted to provide the redaction indicia to identify what category of information has been redacted in the electronic documents. 19. The system of claim 1 where the redaction engine is adapted to provide the redaction without being identified by redaction indicia, the absence of redaction indicia masking a category of information that has been redacted in the electronic document. 20. The system of claim 1 further comprising a redaction rule entry system configured to receive the redaction rules to be used when performing redaction operations. 21. The system of claim 20 where the redaction rule entry system comprises a redaction rule editing system for editing pre-existing redaction rules. 22. The system of claim 20 where the redaction rule entry system is configured to receive commands associating redaction rules with specific electronic document types, wherein the redaction engine is configured such that a particular redaction rule associated with a particular electronic document type is used when redacting electronic documents corresponding to the particular electronic document type. 23. The system of claim 1 where the source of redaction rules comprises rules specifying cells in the electronic document to be reproduced without redaction. 24. The system of claim 1 further comprising:
a manual redaction entry system configured to allow a user to manually redact the electronic document; and where the source of redaction rules further comprises an automated system configured to monitor patterns of manual redactions entered by a user and to generate redaction rules in dependence on the monitoring activity. 25. The system of claim 1 where the source of redaction rules comprises rules specifying categories of information to be reproduced without redaction. 26. The system of claim 25 where at least one of the categories of information comprises text information. 27. The system of claim 25 where at least one of the categories of information comprises graphical information. 28. The system of claim 25 at least one of the categories of information comprises visual information. 29. The system of claim 28 where the visual information further comprises photographic images. 30. The system of claim 1 wherein the system is configured to redact electronic documents recorded in a plurality of different electronic formats. 31. The system of claim 1 further comprising an electronic document pre-processor configured to identify which electronic format a particular electronic document is recorded in and to convert the particular electronic document to a common electronic format. 32. The system of claim 31 wherein the redaction engine is adapted to performing the redaction operations on the electronic document when the electronic document is in the common format. 33. The system of claim 31 where the electronic document pre-processor is configured to impose a cell format on a particular electronic document in dependence on the redaction rules contained in the source of redaction rules. 34. The system of claim 33 where the redaction engine is adapted to impose a cell format on the electronic document. 35. The system of claim 31 further comprising an electronic document post-processor configured to convert the redacted version of the electronic document from the common electronic format in which it was redacted to another electronic format. 36. The system of claim 1 wherein the redaction engine is adapted to be connected to a network gateway for disseminating the redacted version of the electronic document to users. 37. A computer program product comprising a computer readable storage medium storing a computer program configured to perform redaction operations when executed by digital processing apparatus, the operations comprising:
accessing at least one redaction rule to be applied to the electronic document; redacting the electronic document in accordance with the at least one redaction rule. 38. The computer program product of claim 37 wherein the operations further comprise:
after accessing the electronic document to be redacted and prior to redacting the electronic document, converting the electronic document into a different electronic format, and wherein redacting the electronic document further comprises redacting the electronic document in the different electronic format. 39. The computer program product of claim 38 wherein the operations further comprise:
converting the redacted electronic document into a different electronic format. 40. A method comprising:
receiving redaction rules to be used in redacting electronic documents, where the redaction rules are specified in dependence on document type; storing the redaction rules to a computer memory, the computer memory comprising a source of redaction rules; accessing an electronic document to be redacted from a source of electronic documents; identifying the electronic document to be redacted by document type; accessing redaction rules from the source of redaction rules appropriate for use in redacting the type of document to which the electronic document corresponds; and redacting the electronic document in accordance with the redaction rules specified for the document type to which the electronic document corresponds, creating redactions in the electronic document. | 2,100 |
5,114 | 15,080,424 | 2,114 | A method, system and computer program product for identifying potential class loader problems prior to or during the deployment of the classes to the production environment. A set of class loaders is loaded into memory. The set of class loaders is arranged hierarchically into parent-child relationships. The class search path sequence for each class loader in the hierarchy is generated to detect and identify potential class loader problems. Those class loaders with a duplicate class in its class search path sequence are identified as those class loaders that may pose a potential problem. A message may then be displayed to the user identifying these class loaders as posing a potential problem. By identifying these class loaders prior to or during the deployment of the classes to the production environment, class loader problems may be prevented from occurring. | 1. A method for identifying potential class loader problems, the method comprising:
loading a set of class loaders into memory; arranging said set of class loaders hierarchically into parent-child relationships; generating, by a processor, a class search path sequence for each class loader; identifying one or more class loaders with a duplicate class in its class search path sequence; and displaying a message identifying said identified one or more class loaders as being potentially problematic. 2. The method as recited in claim 1 further comprising:
composing said class search path sequence for a class loader by prefixing a parent node's class search path to one or more classes of said class loader in response to said class loader having a delegation mode of parent-first. 3. The method as recited in claim 1 further comprising:
composing said class search path sequence for a class loader by postfixing a parent node's class search path to one or more classes of said class loader in response to a class loader having a delegation mode of parent-last. 4. The method as recited in claim 1, wherein said hierarchical arrangement is implemented by a stack. 5. The method as recited in claim 1, wherein said class search path sequence for each class loader is generated during one of the following: a compile time in a development environment and a build time in said development environment. 6. The method as recited in claim 5, wherein said development environment is a test system. | A method, system and computer program product for identifying potential class loader problems prior to or during the deployment of the classes to the production environment. A set of class loaders is loaded into memory. The set of class loaders is arranged hierarchically into parent-child relationships. The class search path sequence for each class loader in the hierarchy is generated to detect and identify potential class loader problems. Those class loaders with a duplicate class in its class search path sequence are identified as those class loaders that may pose a potential problem. A message may then be displayed to the user identifying these class loaders as posing a potential problem. By identifying these class loaders prior to or during the deployment of the classes to the production environment, class loader problems may be prevented from occurring.1. A method for identifying potential class loader problems, the method comprising:
loading a set of class loaders into memory; arranging said set of class loaders hierarchically into parent-child relationships; generating, by a processor, a class search path sequence for each class loader; identifying one or more class loaders with a duplicate class in its class search path sequence; and displaying a message identifying said identified one or more class loaders as being potentially problematic. 2. The method as recited in claim 1 further comprising:
composing said class search path sequence for a class loader by prefixing a parent node's class search path to one or more classes of said class loader in response to said class loader having a delegation mode of parent-first. 3. The method as recited in claim 1 further comprising:
composing said class search path sequence for a class loader by postfixing a parent node's class search path to one or more classes of said class loader in response to a class loader having a delegation mode of parent-last. 4. The method as recited in claim 1, wherein said hierarchical arrangement is implemented by a stack. 5. The method as recited in claim 1, wherein said class search path sequence for each class loader is generated during one of the following: a compile time in a development environment and a build time in said development environment. 6. The method as recited in claim 5, wherein said development environment is a test system. | 2,100 |
5,115 | 13,208,992 | 2,118 | The invention provides systems and methods for manufacture of a non-homogeneous article using a 3D voxel-based model of the article and a rapid prototyping device. Use of a voxel-based model provides processing advantages and offers improved realism of the manufactured object with regard to non-homogeneous (i) color, (ii) translucency, and/or (iii) hardness, for example. | 1. A method for manufacturing an aesthetically-acceptable non-homogeneous object, the method comprising the steps of:
(a) defining a 3D voxel representation for the non-homogeneous object to be manufactured, wherein each of a plurality of voxels is assigned one or more values representing one or more of the following prescribed physical properties M: color, translucency, and hardness; (b) using the 3D voxel representation to: (i) define a set of 3D dots to produce a shape of each of a plurality of successive Z-layers of the object to be manufactured and (ii) define the one or more prescribed physical properties at each dot making up each of the successive Z-layers of the object to be manufactured; (c) defining a transfer function T(M) that identifies a pigment, a resin, or both a pigment and a resin to produce a material having the one or more prescribed physical properties for each 3D dot to be printed; and (d) using a 3D printer to deposit the pigment and/or the resin identified by the transfer function at each dot of each of the plurality of successive Z-layers of the object, thereby producing the non-homogeneous object. 2. The method of claim 1, wherein step (b) comprises using multivariate interpolation to define the one or more prescribed physical properties at each 3D dot. 3. The method of claim 2, wherein the multivariate interpolation is trilinear interpolation. 4. The method of claim 1, wherein the transfer function T(M) identifies multiple pigments and/or multiple resins. 5. The method of claim 1, wherein the non-homogeneous object is one or more teeth. 6. The method of claim 1, wherein a value of the one or more prescribed physical properties varies within the object and/or within each of the Z-layers of the object. 7. The method of claim 1, wherein the 3D printer is a rapid prototyping device. 8. The method of claim 1, wherein the one or more prescribed physical properties comprises translucency, and wherein step (d) comprises depositing at least two different resins with embedded crystalline particles at a given dot, the combination of which resins produces the translucency prescribed for the given dot. 9. The method of claim 1, wherein the embedded crystalline particles have a known size distribution. 10. The method of claim 1, wherein one or more of the voxels has at least one associated real world dimension that is no greater than about 10 microns. 11. The method of claim 1, wherein the 3D voxel representation defined in step (a) is partitioned into a hierarchy of blocks, wherein each block: (i) has one or more spatial properties in common; and/or (ii) has one or more of the prescribed physical properties in common. 12. A system for fabricating a non-homogeneous article, the system comprising:
a user interface configured to receive input from a user; a design application in communication with the user interface, wherein the design application is configured to create a 3D voxel-based model of a non-homogeneous article, wherein each voxel is assigned one or more physical properties; and a rapid prototyping machine for fabrication of the non-homogeneous article, wherein said rapid prototyping machine is configured to fabricate the artificial tooth via additive manufacturing using the 3D voxel-based model, wherein properties of the voxels of the model correspond to properties of the voxels of the fabricated article. 13. The system of claim 12, wherein the physical properties comprise at least one of color, translucency, hardness, modulus, and dynamic modulus. 14. The system of claim 12, wherein the system is configured to perform additive manufacturing by providing successive layers or parcels of material. | The invention provides systems and methods for manufacture of a non-homogeneous article using a 3D voxel-based model of the article and a rapid prototyping device. Use of a voxel-based model provides processing advantages and offers improved realism of the manufactured object with regard to non-homogeneous (i) color, (ii) translucency, and/or (iii) hardness, for example.1. A method for manufacturing an aesthetically-acceptable non-homogeneous object, the method comprising the steps of:
(a) defining a 3D voxel representation for the non-homogeneous object to be manufactured, wherein each of a plurality of voxels is assigned one or more values representing one or more of the following prescribed physical properties M: color, translucency, and hardness; (b) using the 3D voxel representation to: (i) define a set of 3D dots to produce a shape of each of a plurality of successive Z-layers of the object to be manufactured and (ii) define the one or more prescribed physical properties at each dot making up each of the successive Z-layers of the object to be manufactured; (c) defining a transfer function T(M) that identifies a pigment, a resin, or both a pigment and a resin to produce a material having the one or more prescribed physical properties for each 3D dot to be printed; and (d) using a 3D printer to deposit the pigment and/or the resin identified by the transfer function at each dot of each of the plurality of successive Z-layers of the object, thereby producing the non-homogeneous object. 2. The method of claim 1, wherein step (b) comprises using multivariate interpolation to define the one or more prescribed physical properties at each 3D dot. 3. The method of claim 2, wherein the multivariate interpolation is trilinear interpolation. 4. The method of claim 1, wherein the transfer function T(M) identifies multiple pigments and/or multiple resins. 5. The method of claim 1, wherein the non-homogeneous object is one or more teeth. 6. The method of claim 1, wherein a value of the one or more prescribed physical properties varies within the object and/or within each of the Z-layers of the object. 7. The method of claim 1, wherein the 3D printer is a rapid prototyping device. 8. The method of claim 1, wherein the one or more prescribed physical properties comprises translucency, and wherein step (d) comprises depositing at least two different resins with embedded crystalline particles at a given dot, the combination of which resins produces the translucency prescribed for the given dot. 9. The method of claim 1, wherein the embedded crystalline particles have a known size distribution. 10. The method of claim 1, wherein one or more of the voxels has at least one associated real world dimension that is no greater than about 10 microns. 11. The method of claim 1, wherein the 3D voxel representation defined in step (a) is partitioned into a hierarchy of blocks, wherein each block: (i) has one or more spatial properties in common; and/or (ii) has one or more of the prescribed physical properties in common. 12. A system for fabricating a non-homogeneous article, the system comprising:
a user interface configured to receive input from a user; a design application in communication with the user interface, wherein the design application is configured to create a 3D voxel-based model of a non-homogeneous article, wherein each voxel is assigned one or more physical properties; and a rapid prototyping machine for fabrication of the non-homogeneous article, wherein said rapid prototyping machine is configured to fabricate the artificial tooth via additive manufacturing using the 3D voxel-based model, wherein properties of the voxels of the model correspond to properties of the voxels of the fabricated article. 13. The system of claim 12, wherein the physical properties comprise at least one of color, translucency, hardness, modulus, and dynamic modulus. 14. The system of claim 12, wherein the system is configured to perform additive manufacturing by providing successive layers or parcels of material. | 2,100 |
5,116 | 15,080,470 | 2,114 | A method, system and computer program product for identifying potential class loader problems prior to or during the deployment of the classes to the production environment. A set of class loaders is loaded into memory. The set of class loaders is arranged hierarchically into parent-child relationships. The class search path sequence for each class loader in the hierarchy is generated to detect and identify potential class loader problems. Those class loaders with a duplicate class in its class search path sequence are identified as those class loaders that may pose a potential problem. A message may then be displayed to the user identifying these class loaders as posing a potential problem. By identifying these class loaders prior to or during the deployment of the classes to the production environment, class loader problems may be prevented from occurring. | 1. A computer program product for identifying potential class loader problems, the computer program product comprising a computer readable storage medium having program code embodied therewith, the program code comprising the programming instructions for:
loading a set of class loaders into memory; arranging said set of class loaders hierarchically into parent-child relationships; generating a class search path sequence for each class loader; identifying one or more class loaders with a duplicate class in its class search path sequence; and displaying a message identifying said identified one or more class loaders as being potentially problematic. 2. The computer program product as recited in claim 1, wherein the program code further comprises the programming instructions for:
composing said class search path sequence for a class loader by prefixing a parent node's class search path to one or more classes of said class loader in response to said class loader having a delegation mode of parent-first. 3. The computer program product as recited in claim 1, wherein the program code further comprises the programming instructions for:
composing said class search path sequence for a class loader by postfixing a parent node's class search path to one or more classes of said class loader in response to a class loader having a delegation mode of parent-last. 4. The computer program product as recited in claim 1, wherein said hierarchical arrangement is implemented by a stack. 5. The computer program product as recited in claim 1, wherein said class search path sequence for each class loader is generated during one of the following: a compile time in a development environment and a build time in said development environment. 6. The computer program product as recited in claim 5, wherein said development environment is a test system. 7. A system, comprising:
a memory unit for storing a computer program for identifying potential class loader problems; and a processor coupled to the memory unit, wherein the processor is configured to execute the program instructions of the computer program comprising:
loading a set of class loaders into memory;
arranging said set of class loaders hierarchically into parent-child relationships;
generating a class search path sequence for each class loader;
identifying one or more class loaders with a duplicate class in its class search path sequence; and
displaying a message identifying said identified one or more class loaders as being potentially problematic. 8. The system as recited in claim 7, wherein the program instructions of the computer program further comprise:
composing said class search path sequence for a class loader by prefixing a parent node's class search path to one or more classes of said class loader in response to said class loader having a delegation mode of parent-first. 9. The system as recited in claim 7, wherein the program instructions of the computer program further comprise:
composing said class search path sequence for a class loader by postfixing a parent node's class search path to one or more classes of said class loader in response to a class loader having a delegation mode of parent-last. 10. The system as recited in claim 7, wherein said hierarchical arrangement is implemented by a stack. 11. The system as recited in claim 7, wherein said class search path sequence for each class loader is generated during one of the following: a compile time in a development environment and a build time in said development environment. 12. The system as recited in claim 11, wherein said development environment is a test system. | A method, system and computer program product for identifying potential class loader problems prior to or during the deployment of the classes to the production environment. A set of class loaders is loaded into memory. The set of class loaders is arranged hierarchically into parent-child relationships. The class search path sequence for each class loader in the hierarchy is generated to detect and identify potential class loader problems. Those class loaders with a duplicate class in its class search path sequence are identified as those class loaders that may pose a potential problem. A message may then be displayed to the user identifying these class loaders as posing a potential problem. By identifying these class loaders prior to or during the deployment of the classes to the production environment, class loader problems may be prevented from occurring.1. A computer program product for identifying potential class loader problems, the computer program product comprising a computer readable storage medium having program code embodied therewith, the program code comprising the programming instructions for:
loading a set of class loaders into memory; arranging said set of class loaders hierarchically into parent-child relationships; generating a class search path sequence for each class loader; identifying one or more class loaders with a duplicate class in its class search path sequence; and displaying a message identifying said identified one or more class loaders as being potentially problematic. 2. The computer program product as recited in claim 1, wherein the program code further comprises the programming instructions for:
composing said class search path sequence for a class loader by prefixing a parent node's class search path to one or more classes of said class loader in response to said class loader having a delegation mode of parent-first. 3. The computer program product as recited in claim 1, wherein the program code further comprises the programming instructions for:
composing said class search path sequence for a class loader by postfixing a parent node's class search path to one or more classes of said class loader in response to a class loader having a delegation mode of parent-last. 4. The computer program product as recited in claim 1, wherein said hierarchical arrangement is implemented by a stack. 5. The computer program product as recited in claim 1, wherein said class search path sequence for each class loader is generated during one of the following: a compile time in a development environment and a build time in said development environment. 6. The computer program product as recited in claim 5, wherein said development environment is a test system. 7. A system, comprising:
a memory unit for storing a computer program for identifying potential class loader problems; and a processor coupled to the memory unit, wherein the processor is configured to execute the program instructions of the computer program comprising:
loading a set of class loaders into memory;
arranging said set of class loaders hierarchically into parent-child relationships;
generating a class search path sequence for each class loader;
identifying one or more class loaders with a duplicate class in its class search path sequence; and
displaying a message identifying said identified one or more class loaders as being potentially problematic. 8. The system as recited in claim 7, wherein the program instructions of the computer program further comprise:
composing said class search path sequence for a class loader by prefixing a parent node's class search path to one or more classes of said class loader in response to said class loader having a delegation mode of parent-first. 9. The system as recited in claim 7, wherein the program instructions of the computer program further comprise:
composing said class search path sequence for a class loader by postfixing a parent node's class search path to one or more classes of said class loader in response to a class loader having a delegation mode of parent-last. 10. The system as recited in claim 7, wherein said hierarchical arrangement is implemented by a stack. 11. The system as recited in claim 7, wherein said class search path sequence for each class loader is generated during one of the following: a compile time in a development environment and a build time in said development environment. 12. The system as recited in claim 11, wherein said development environment is a test system. | 2,100 |
5,117 | 15,151,436 | 2,136 | Methods, storage arrays and computer readable media for path discovery to ports of a Fibre Channel storage system that includes a multi-array pool and is part of a group of arrays are provided. One example method includes executing a pull operation via a group leader array of the group of arrays. The pull operation is configured to gather port status of each one of the arrays in the group of arrays. The method further executes a push operation via the group leader array of the group of arrays. The push operation is configured to populate a local cache of each array in the group of arrays with the port status of each one of the arrays in the group of arrays. The method executes the pull operation and the push operation on a periodic schedule, such that changes that occur at particular ones of the arrays of the group of arrays are pushed to each one of the arrays in the group of arrays. Configurations for enabling volume moves, striping data across arrays and pools, pool creation, pool deletes, pool adds, group merge and other processes are also provided. | 1. A method for path discovery to ports of a Fibre Channel storage system that includes a multi-array pool that is part of a group of arrays, comprising,
executing a pull operation via a group leader array of the group of arrays, the pull operation is configured to gather port status of each one of the arrays in the group of arrays; executing a push operation via the group leader array of the group of arrays, the push operation is configured to populate a local cache of each array in the group of arrays with the port status of each one of the arrays in the group of arrays; and executing the pull operation and the push operation on a periodic schedule, such that changes occurring at particular ones of the arrays of the group of arrays is pushed to each one of the arrays in the group of arrays. 2. The method of claim 1, wherein the port status includes ALUA settings of each port of each array, such that a setting of active optimized (AO) and standby (SB) are determined for each port of the arrays in the group of arrays. 3. The method of claim 1, wherein the periodic schedule is programmable and defined by a time-out window that continually cycles. 4. The method of claim 1, wherein the local cache is a logical unit cache (LUC) that stores logical unit number (LUN) mappings and port data, and is local to each of an active controller and a standby controller of each array in the group of arrays. 5. A method of claim 1, further comprising,
striping a volume across at least two arrays of the multi-array pool; maintaining a bin map that identifies data of the volume stored in each of the at least two arrays; defining at least two paths to the volume using the port status that identifies ports in the AO ports and the bin map. 6. The method of claim 1, further comprising,
identifying a volume in the multi-array pool; executing a move operation of the volume to another multi-array pool of the group of arrays; transferring the local cache of one array of the multi-array pool to local cache of arrays of the anther multi-array pool, the multi-array pool being a source pool and the another multi-array pool being a destination pool; and executing a bin migration associated with a bin map that identifies what data of the volume is stored in each array in the group of arrays. 7. The method of claim 6, wherein the local cache is a logical unit cache (LUC) that stores logical unit number (LUN) mappings and port data, and is local to each of an active controller and a standby controller of each array in the group of arrays. 8. The method of claim 6, wherein after the move operation of the volume is complete, the bin map is updated consistent with a location of data in the array or arrays of the destination pool. 9. The method of claim 8, wherein after the move operation of the volume is complete, paths to the volume in the source pool are removed and paths to the volume in the destination pool are added, and further comprising,
setting data or triggering action from the arrays to cause one or more hosts connected to the group of arrays to rediscover paths to the volume. 10. The method of claim 1, further comprising,
adding an array to the group of arrays, the added array being associated to the multi-array pool or associated a new pool of the group of arrays, the added array providing for a scale-out of the group of arrays. 11. A method for processing a volume move from a source pool to a destination pool of a group of arrays in a Fibre Channel storage system, comprising,
identifying a volume to be moved; transferring a local cache of one array in the source pool to a local cache of an array of the destination pool, the local cache transferred to the array of the destination pool includes metadata that is descriptive of the volume to be moved; initiating a transfer of data for the volume from the array in the source pool to the array of the destination pool; executing a bin migration process to update a bin map while the transfer of data is in progress, such that when the transfer of data is complete the bin map identifies a location of the data in the destination pool; and updating one or more paths to the volume based on port status of ports of the arrays in the group of arrays. 12. The method of claim 11, wherein the port status is maintained current by managing a process that includes,
executing a pull operation via a group leader array of the group of arrays, the pull operation is configured to gather port status of each one of the arrays in the group of arrays; executing a push operation via the group leader array of the group of arrays, the push operation is configured to populate local cache of each array in the group of arrays with the port status of each one of the arrays in the group of arrays; and executing the pull operation and the push operation on a periodic schedule, such that changes occurring at particular ones of the arrays of the group of arrays is pushed to each one of the arrays in the group of arrays. 13. The method of claim 11, wherein the local cache is a logical unit cache (LUC) that stores the metadata, logical unit number (LUN) mappings and port data, and is local to each of an active controller and a standby controller of each array in the group of arrays. 14. The method of claim 12, wherein the port status includes ALUA settings of each port of each array, such that a setting of active optimized (AO) and standby (SB) are determined for each port of the arrays in the group of arrays. 15. The method of claim 12, wherein the periodic schedule is programmable and defined by a time-out window that continually cycles. 16. A method of claim 12, further comprising,
striping the volume across at least two arrays of a pool of the group of arrays; maintaining current the bin map of that identifies data of the volume stored in each of the at least two arrays; defining at least two paths to the volume using the port status that identifies ports in the AO ports and the bin map. 17. The method of claim 11, wherein updating the one or more paths to the volume includes setting data for hosts or triggering action from the arrays to cause one or more hosts connected to the group of arrays to rediscover paths to the volume. 18. A storage array arrangement defined from a group of arrays, comprising,
the arrays in the group of arrays each have an active controller and a standby controller, wherein a volume move process is executed by a group leader array of the group of arrays, the volume move process is configured to move the volume from a source pool to a destination pool of the group of arrays, the group leader array includes,
logic for transferring a local cache of one array in the source pool to a local cache of an array of the destination pool, the local cache transferred to the array of the destination pool includes metadata that is descriptive of the volume to be moved;
logic for initiating a transfer of data for the volume from the array in the source pool to the array of the destination pool;
logic for executing a bin migration process to update a bin map while the transfer of data is in progress, such that when the transfer of data is complete the bin map identifies a location of the data in the destination pool; and
logic for updating one or more paths to the volume based on port status of ports of the arrays in the group of arrays. 19. The storage array arrangement of claim 18, wherein the port status is maintained current by managing a process by the group leader array that includes,
logic to execute a pull operation via a group leader array of the group of arrays, the pull operation is configured to gather port status of each one of the arrays in the group of arrays; logic to execute a push operation via the group leader array of the group of arrays, the push operation is configured to populate local cache of each array in the group of arrays with the port status of each one of the arrays in the group of arrays; and logic to execute the pull operation and the push operation on a periodic schedule, such that changes occurring at particular ones of the arrays of the group of arrays is pushed to each one of the arrays in the group of arrays. 20. The storage array arrangement of claim 18, wherein the local cache is a logical unit cache (LUC) that stores the metadata, logical unit number (LUN) mappings and port data, and is local to each of an active controller and a standby controller of each array in the group of arrays. 21. The storage array arrangement of claim 18, wherein the port status includes ALUA settings of each port of each array, such that a setting of active optimized (AO) and standby (SB) are determined for each port of the arrays in the group of arrays. 22. The storage array arrangement of claim 19, wherein the periodic schedule is programmable and defined by a time-out window that continually cycles. 23. A storage array arrangement of claim 20, further comprising,
logic for striping the volume across at least two arrays of a pool of the group of arrays; logic for maintaining current the bin map of that identifies data of the volume stored in each of the at least two arrays; and logic for defining at least two paths to the volume using the port status that identifies ports in the AO ports and the bin map. 24. The storage array arrangement of claim 18, wherein the logic for updating the one or more paths to the volume includes logic for setting data for hosts or triggering action from the arrays to cause one or more hosts connected to the group of arrays to rediscover paths to the volume. 25. Computer readable media having programming instructions for processing a volume move from a source pool to a destination pool of a group of arrays in a Fibre Channel storage system, comprising,
program instructions for identifying a volume to be moved; program instructions for transferring a local cache of one array in the source pool to a local cache of an array of the destination pool, the local cache transferred to the array of the destination pool includes metadata that is descriptive of the volume to be moved; program instructions for initiating a transfer of data for the volume from the array in the source pool to the array of the destination pool; program instructions for executing a bin migration process to update a bin map while the transfer of data is in progress, such that when the transfer of data is complete the bin map identifies a location of the data in the destination pool; and program instructions for updating one or more paths to the volume based on port status of ports of the arrays in the group of arrays. 26. The computer readable media of claim of claim 25, wherein the port status is maintained current by managing a process that includes,
program instructions for executing a pull operation via a group leader array of the group of arrays, the pull operation is configured to gather port status of each one of the arrays in the group of arrays; program instructions for executing a push operation via the group leader array of the group of arrays, the push operation is configured to populate local cache of each array in the group of arrays with the port status of each one of the arrays in the group of arrays; and program instructions for executing the pull operation and the push operation on a periodic schedule, such that changes occurring at particular ones of the arrays of the group of arrays is pushed to each one of the arrays in the group of arrays. 27. The method of claim 25, wherein the program instructions for updating the one or more paths to the volume includes program instructions for setting data for hosts or triggering action from the arrays to cause one or more hosts connected to the group of arrays to rediscover paths to the volume. | Methods, storage arrays and computer readable media for path discovery to ports of a Fibre Channel storage system that includes a multi-array pool and is part of a group of arrays are provided. One example method includes executing a pull operation via a group leader array of the group of arrays. The pull operation is configured to gather port status of each one of the arrays in the group of arrays. The method further executes a push operation via the group leader array of the group of arrays. The push operation is configured to populate a local cache of each array in the group of arrays with the port status of each one of the arrays in the group of arrays. The method executes the pull operation and the push operation on a periodic schedule, such that changes that occur at particular ones of the arrays of the group of arrays are pushed to each one of the arrays in the group of arrays. Configurations for enabling volume moves, striping data across arrays and pools, pool creation, pool deletes, pool adds, group merge and other processes are also provided.1. A method for path discovery to ports of a Fibre Channel storage system that includes a multi-array pool that is part of a group of arrays, comprising,
executing a pull operation via a group leader array of the group of arrays, the pull operation is configured to gather port status of each one of the arrays in the group of arrays; executing a push operation via the group leader array of the group of arrays, the push operation is configured to populate a local cache of each array in the group of arrays with the port status of each one of the arrays in the group of arrays; and executing the pull operation and the push operation on a periodic schedule, such that changes occurring at particular ones of the arrays of the group of arrays is pushed to each one of the arrays in the group of arrays. 2. The method of claim 1, wherein the port status includes ALUA settings of each port of each array, such that a setting of active optimized (AO) and standby (SB) are determined for each port of the arrays in the group of arrays. 3. The method of claim 1, wherein the periodic schedule is programmable and defined by a time-out window that continually cycles. 4. The method of claim 1, wherein the local cache is a logical unit cache (LUC) that stores logical unit number (LUN) mappings and port data, and is local to each of an active controller and a standby controller of each array in the group of arrays. 5. A method of claim 1, further comprising,
striping a volume across at least two arrays of the multi-array pool; maintaining a bin map that identifies data of the volume stored in each of the at least two arrays; defining at least two paths to the volume using the port status that identifies ports in the AO ports and the bin map. 6. The method of claim 1, further comprising,
identifying a volume in the multi-array pool; executing a move operation of the volume to another multi-array pool of the group of arrays; transferring the local cache of one array of the multi-array pool to local cache of arrays of the anther multi-array pool, the multi-array pool being a source pool and the another multi-array pool being a destination pool; and executing a bin migration associated with a bin map that identifies what data of the volume is stored in each array in the group of arrays. 7. The method of claim 6, wherein the local cache is a logical unit cache (LUC) that stores logical unit number (LUN) mappings and port data, and is local to each of an active controller and a standby controller of each array in the group of arrays. 8. The method of claim 6, wherein after the move operation of the volume is complete, the bin map is updated consistent with a location of data in the array or arrays of the destination pool. 9. The method of claim 8, wherein after the move operation of the volume is complete, paths to the volume in the source pool are removed and paths to the volume in the destination pool are added, and further comprising,
setting data or triggering action from the arrays to cause one or more hosts connected to the group of arrays to rediscover paths to the volume. 10. The method of claim 1, further comprising,
adding an array to the group of arrays, the added array being associated to the multi-array pool or associated a new pool of the group of arrays, the added array providing for a scale-out of the group of arrays. 11. A method for processing a volume move from a source pool to a destination pool of a group of arrays in a Fibre Channel storage system, comprising,
identifying a volume to be moved; transferring a local cache of one array in the source pool to a local cache of an array of the destination pool, the local cache transferred to the array of the destination pool includes metadata that is descriptive of the volume to be moved; initiating a transfer of data for the volume from the array in the source pool to the array of the destination pool; executing a bin migration process to update a bin map while the transfer of data is in progress, such that when the transfer of data is complete the bin map identifies a location of the data in the destination pool; and updating one or more paths to the volume based on port status of ports of the arrays in the group of arrays. 12. The method of claim 11, wherein the port status is maintained current by managing a process that includes,
executing a pull operation via a group leader array of the group of arrays, the pull operation is configured to gather port status of each one of the arrays in the group of arrays; executing a push operation via the group leader array of the group of arrays, the push operation is configured to populate local cache of each array in the group of arrays with the port status of each one of the arrays in the group of arrays; and executing the pull operation and the push operation on a periodic schedule, such that changes occurring at particular ones of the arrays of the group of arrays is pushed to each one of the arrays in the group of arrays. 13. The method of claim 11, wherein the local cache is a logical unit cache (LUC) that stores the metadata, logical unit number (LUN) mappings and port data, and is local to each of an active controller and a standby controller of each array in the group of arrays. 14. The method of claim 12, wherein the port status includes ALUA settings of each port of each array, such that a setting of active optimized (AO) and standby (SB) are determined for each port of the arrays in the group of arrays. 15. The method of claim 12, wherein the periodic schedule is programmable and defined by a time-out window that continually cycles. 16. A method of claim 12, further comprising,
striping the volume across at least two arrays of a pool of the group of arrays; maintaining current the bin map of that identifies data of the volume stored in each of the at least two arrays; defining at least two paths to the volume using the port status that identifies ports in the AO ports and the bin map. 17. The method of claim 11, wherein updating the one or more paths to the volume includes setting data for hosts or triggering action from the arrays to cause one or more hosts connected to the group of arrays to rediscover paths to the volume. 18. A storage array arrangement defined from a group of arrays, comprising,
the arrays in the group of arrays each have an active controller and a standby controller, wherein a volume move process is executed by a group leader array of the group of arrays, the volume move process is configured to move the volume from a source pool to a destination pool of the group of arrays, the group leader array includes,
logic for transferring a local cache of one array in the source pool to a local cache of an array of the destination pool, the local cache transferred to the array of the destination pool includes metadata that is descriptive of the volume to be moved;
logic for initiating a transfer of data for the volume from the array in the source pool to the array of the destination pool;
logic for executing a bin migration process to update a bin map while the transfer of data is in progress, such that when the transfer of data is complete the bin map identifies a location of the data in the destination pool; and
logic for updating one or more paths to the volume based on port status of ports of the arrays in the group of arrays. 19. The storage array arrangement of claim 18, wherein the port status is maintained current by managing a process by the group leader array that includes,
logic to execute a pull operation via a group leader array of the group of arrays, the pull operation is configured to gather port status of each one of the arrays in the group of arrays; logic to execute a push operation via the group leader array of the group of arrays, the push operation is configured to populate local cache of each array in the group of arrays with the port status of each one of the arrays in the group of arrays; and logic to execute the pull operation and the push operation on a periodic schedule, such that changes occurring at particular ones of the arrays of the group of arrays is pushed to each one of the arrays in the group of arrays. 20. The storage array arrangement of claim 18, wherein the local cache is a logical unit cache (LUC) that stores the metadata, logical unit number (LUN) mappings and port data, and is local to each of an active controller and a standby controller of each array in the group of arrays. 21. The storage array arrangement of claim 18, wherein the port status includes ALUA settings of each port of each array, such that a setting of active optimized (AO) and standby (SB) are determined for each port of the arrays in the group of arrays. 22. The storage array arrangement of claim 19, wherein the periodic schedule is programmable and defined by a time-out window that continually cycles. 23. A storage array arrangement of claim 20, further comprising,
logic for striping the volume across at least two arrays of a pool of the group of arrays; logic for maintaining current the bin map of that identifies data of the volume stored in each of the at least two arrays; and logic for defining at least two paths to the volume using the port status that identifies ports in the AO ports and the bin map. 24. The storage array arrangement of claim 18, wherein the logic for updating the one or more paths to the volume includes logic for setting data for hosts or triggering action from the arrays to cause one or more hosts connected to the group of arrays to rediscover paths to the volume. 25. Computer readable media having programming instructions for processing a volume move from a source pool to a destination pool of a group of arrays in a Fibre Channel storage system, comprising,
program instructions for identifying a volume to be moved; program instructions for transferring a local cache of one array in the source pool to a local cache of an array of the destination pool, the local cache transferred to the array of the destination pool includes metadata that is descriptive of the volume to be moved; program instructions for initiating a transfer of data for the volume from the array in the source pool to the array of the destination pool; program instructions for executing a bin migration process to update a bin map while the transfer of data is in progress, such that when the transfer of data is complete the bin map identifies a location of the data in the destination pool; and program instructions for updating one or more paths to the volume based on port status of ports of the arrays in the group of arrays. 26. The computer readable media of claim of claim 25, wherein the port status is maintained current by managing a process that includes,
program instructions for executing a pull operation via a group leader array of the group of arrays, the pull operation is configured to gather port status of each one of the arrays in the group of arrays; program instructions for executing a push operation via the group leader array of the group of arrays, the push operation is configured to populate local cache of each array in the group of arrays with the port status of each one of the arrays in the group of arrays; and program instructions for executing the pull operation and the push operation on a periodic schedule, such that changes occurring at particular ones of the arrays of the group of arrays is pushed to each one of the arrays in the group of arrays. 27. The method of claim 25, wherein the program instructions for updating the one or more paths to the volume includes program instructions for setting data for hosts or triggering action from the arrays to cause one or more hosts connected to the group of arrays to rediscover paths to the volume. | 2,100 |
5,118 | 13,483,669 | 2,132 | The invention relates to methods of interleaving payload data and integrity control data in an external memory interfaced with a microcontroller to improve data integrity check, enhance data confidentiality and save internal memory. Data words and are received for storing in the external memory. Each data word is used to generate a respective integrity word, while an associated logic address is translated to two physical addresses in the external memory, one for the data word and the other for the integrity word. The two physical addresses for the data and integrity words are interleaved in the external memory, and sometimes, in a periodic scheme. In particular, each data word may be associated to an integrity sub-word included in an integrity word having the same length with that of a data word. The external memory may have dedicated regions for the data words and the integrity words, respectively. | 1. A method for securely storing data words and integrity words within an external memory of a microcontroller, the method comprising:
receiving a plurality of data words and a plurality of logic addresses; associating each data word, within the plurality of data words, with a corresponding logic address within the plurality of logic addresses; generating a plurality of integrity words from the plurality of data words based on an integrity check method, each integrity word being associated with at least one data word within the plurality of data words; translating the plurality of logic addresses to a plurality of first physical addresses within the external memory and a plurality of second physical addresses within the external memory based on a data map; encrypting the plurality of data words to a plurality of encrypted data words; storing the plurality of encrypted data words in the plurality of first physical addresses in the external memory; and storing the plurality of integrity words in the plurality of second physical addresses in the external memory. 2. The method of claim 1 wherein the external memory is one selected from a group consisting of read-only-memory (ROM), random-access-memory (RAM) and flash memory. 3. The method of claim 1 further comprises the step of storing at least one integrity word, within the plurality of integrity words, in an integrity cache in the microcontroller prior to the step of storing the plurality of integrity words in the plurality of second physical addresses in the external memory, wherein the integrity cache is different from a CPU cache. 4. The method of claim 1 wherein each integrity word, within the plurality of integrity words, has a first number of bits and each encrypted data word, within the plurality of encrypted data words, has a second number of bits, the first number of bits being equal to the second number of bits. 5. The method of claim 1 wherein each integrity word comprises a plurality of integrity sub-words, each integrity sub-word corresponding to a data word within the plurality of data words. 6. The method of claim 1 wherein the plurality of encrypted data words and the plurality of integrity words are interleaved in the external memory. 7. The method of claim 6 wherein a subset of the plurality of encrypted data words are associated with an integrity word having a plurality of integrity sub-words corresponding to the subset of the plurality of encrypted data words, the subset being stored with the integrity word in an interleaved scheme within the external memory. 8. The method of claim 7 wherein the subset of the plurality of encrypted data words has eight encrypted data words and the integrity word has eight integrity sub-words. 9. A method for securely storing data words and integrity words within an external memory of a microcontroller, the method comprising:
receiving a plurality of data words and a plurality of logic addresses; associating each data word, within the plurality of data words, with a corresponding logic address within the plurality of logic addresses; generating a plurality of integrity words from the plurality of data words based on an integrity check method, each integrity word being associated with at least one data word within the plurality of data words; translating the plurality of logic addresses to a plurality of first physical addresses within the external memory and a plurality of second physical addresses within the external memory based on a data map; storing the plurality of data words in the plurality of first physical addresses in the external memory; and storing the plurality of integrity words in the plurality of second physical addresses in the external memory. 10. The method of claim 9 further comprises the step of storing at least one integrity word, within the plurality of integrity words, in an integrity cache in the microcontroller prior to the step of storing the plurality of integrity words in the plurality of second physical addresses in the external memory, wherein the integrity cache is different from a CPU cache. 11. The method of claim 9 wherein each integrity word comprises a plurality of integrity sub-words, each integrity sub-word corresponding to a data word within the plurality of data words. 12. The method of claim 9 wherein the plurality of encrypted data words and the plurality of integrity words are interleaved in the external memory. 13. A secure microcontroller system comprising:
a central processing core that generates a plurality of data words and a plurality of logic addresses; an encryption and integrity block, coupled to the central processing core, the encryption and integrity block generates a plurality of integrity words from the plurality of data words, encrypts the plurality of data words, and maps the plurality of logic addresses to a plurality of first physical addresses and a plurality of second physical addresses within an external memory; and a memory controller, coupled to the encryption and integrity block, the memory controller stores the plurality of encrypted data words in the plurality of first physical addresses and the plurality of integrity words in the plurality of second physical addresses. 14. The secure microcontroller system in claim 13 wherein each integrity word comprises a plurality of integrity sub-words, each integrity sub-word corresponding to a data word within the plurality of data words. 15. The secure microcontroller system in claim 13 wherein the plurality of encrypted data words and the plurality of integrity words are interleaved in the external memory. 16. The secure microcontroller system in claim 13 wherein the encryption and integrity protection block further comprises:
an integrity control data generator that generates a plurality of integrity words from the plurality of data words based on an integrity check method;
an address translator that translates the plurality of logic addresses to the plurality of first physical addresses and the plurality of second physical addresses based on a data map; and
a data encryptor that encrypts the plurality of data words to the plurality of encrypted data words based on a data encryption method;
wherein both the plurality of first physical addresses the plurality of second physical addresses are associated with an external memory to the microcontroller;
wherein each of the plurality of integrity words is associated with at least one of the plurality of the data words. 17. The secure microcontroller system in claim 16 wherein the encryption and integrity protection block further comprises an integrity cache for storing at least one of the plurality of integrity words, wherein the integrity cache is different from a CPU cache. 18. A method for extracting encrypted data words and integrity words within an external memory of a microcontroller, the method comprising:
receiving a plurality of logic addresses; translating the plurality of logic addresses to a plurality of first physical addresses within the external memory and a plurality of second physical addresses within the external memory based on a data map; reading a plurality of encrypted data words from the plurality of first physical addresses in the external memory and a plurality of integrity words from the plurality of second physical addresses in the external memory; decrypting the plurality of encrypted data words to a plurality of data words; checking validity of the plurality of data words using the plurality of recovered integrity words based on an integrity check; and outputting the plurality of data words if the plurality of data words are valid. 19. The method in claim 18 wherein the step of checking validity of the plurality of data words further comprises the steps of:
regenerating a plurality of regenerated integrity words from the plurality of data words based on the integrity check;
comparing the plurality of regenerated integrity words with the plurality of integrity words; and
indicating the validity of the plurality of data words by comparison results that are associated with the consistency between the plurality of integrity words and the plurality of recovered integrity words. 20. The method of claim 18 wherein the validity of the plurality of data words is further applied to raise a CPU exception based on a security policy of the microcontroller. The CPU exception is exploited to implement at least one function selected from a group of functions including erasing the sensitive data, triggering a non-maskable interruption, writing a value in a flag register, resetting the microcontroller, and running a dedicated code. 21. The method of claim 18 wherein the external memory is one selected from a group consisting of read-only-memory (ROM), random-access-memory (RAM) and flash memory. 22. The method of claim 18 further comprises the step of storing at least one integrity word, within the plurality of integrity words, in an integrity cache in the microcontroller prior to the step of checking validity of the plurality of data words using the plurality of recovered integrity words based on an integrity check, wherein the integrity cache is different from a CPU cache. 23. The method of claim 18 wherein each integrity word, within the plurality of integrity words, has a first number of bits and each encrypted data word, within the plurality of encrypted data words, has a second number of bits, the first number of bits being equal to the second number of bits. 24. The method of claim 18 wherein each integrity word comprises a plurality of integrity sub-words, each integrity sub-word corresponding to an encrypted data word within the plurality of encrypted data words. 25. The method of claim 18 wherein the plurality of encrypted data words and the plurality of integrity words are interleaved in the external memory. 26. The method of claim 25 wherein a subset of the plurality of encrypted data words are associated with an integrity word having a plurality of integrity sub-words corresponding to the subset of the plurality of encrypted data words, the subset being stored with the integrity word in an interleaved scheme within the external memory. 27. The method of claim 26 wherein the subset of the plurality of encrypted data words has eight encrypted data words and the integrity word has eight integrity sub-words. | The invention relates to methods of interleaving payload data and integrity control data in an external memory interfaced with a microcontroller to improve data integrity check, enhance data confidentiality and save internal memory. Data words and are received for storing in the external memory. Each data word is used to generate a respective integrity word, while an associated logic address is translated to two physical addresses in the external memory, one for the data word and the other for the integrity word. The two physical addresses for the data and integrity words are interleaved in the external memory, and sometimes, in a periodic scheme. In particular, each data word may be associated to an integrity sub-word included in an integrity word having the same length with that of a data word. The external memory may have dedicated regions for the data words and the integrity words, respectively.1. A method for securely storing data words and integrity words within an external memory of a microcontroller, the method comprising:
receiving a plurality of data words and a plurality of logic addresses; associating each data word, within the plurality of data words, with a corresponding logic address within the plurality of logic addresses; generating a plurality of integrity words from the plurality of data words based on an integrity check method, each integrity word being associated with at least one data word within the plurality of data words; translating the plurality of logic addresses to a plurality of first physical addresses within the external memory and a plurality of second physical addresses within the external memory based on a data map; encrypting the plurality of data words to a plurality of encrypted data words; storing the plurality of encrypted data words in the plurality of first physical addresses in the external memory; and storing the plurality of integrity words in the plurality of second physical addresses in the external memory. 2. The method of claim 1 wherein the external memory is one selected from a group consisting of read-only-memory (ROM), random-access-memory (RAM) and flash memory. 3. The method of claim 1 further comprises the step of storing at least one integrity word, within the plurality of integrity words, in an integrity cache in the microcontroller prior to the step of storing the plurality of integrity words in the plurality of second physical addresses in the external memory, wherein the integrity cache is different from a CPU cache. 4. The method of claim 1 wherein each integrity word, within the plurality of integrity words, has a first number of bits and each encrypted data word, within the plurality of encrypted data words, has a second number of bits, the first number of bits being equal to the second number of bits. 5. The method of claim 1 wherein each integrity word comprises a plurality of integrity sub-words, each integrity sub-word corresponding to a data word within the plurality of data words. 6. The method of claim 1 wherein the plurality of encrypted data words and the plurality of integrity words are interleaved in the external memory. 7. The method of claim 6 wherein a subset of the plurality of encrypted data words are associated with an integrity word having a plurality of integrity sub-words corresponding to the subset of the plurality of encrypted data words, the subset being stored with the integrity word in an interleaved scheme within the external memory. 8. The method of claim 7 wherein the subset of the plurality of encrypted data words has eight encrypted data words and the integrity word has eight integrity sub-words. 9. A method for securely storing data words and integrity words within an external memory of a microcontroller, the method comprising:
receiving a plurality of data words and a plurality of logic addresses; associating each data word, within the plurality of data words, with a corresponding logic address within the plurality of logic addresses; generating a plurality of integrity words from the plurality of data words based on an integrity check method, each integrity word being associated with at least one data word within the plurality of data words; translating the plurality of logic addresses to a plurality of first physical addresses within the external memory and a plurality of second physical addresses within the external memory based on a data map; storing the plurality of data words in the plurality of first physical addresses in the external memory; and storing the plurality of integrity words in the plurality of second physical addresses in the external memory. 10. The method of claim 9 further comprises the step of storing at least one integrity word, within the plurality of integrity words, in an integrity cache in the microcontroller prior to the step of storing the plurality of integrity words in the plurality of second physical addresses in the external memory, wherein the integrity cache is different from a CPU cache. 11. The method of claim 9 wherein each integrity word comprises a plurality of integrity sub-words, each integrity sub-word corresponding to a data word within the plurality of data words. 12. The method of claim 9 wherein the plurality of encrypted data words and the plurality of integrity words are interleaved in the external memory. 13. A secure microcontroller system comprising:
a central processing core that generates a plurality of data words and a plurality of logic addresses; an encryption and integrity block, coupled to the central processing core, the encryption and integrity block generates a plurality of integrity words from the plurality of data words, encrypts the plurality of data words, and maps the plurality of logic addresses to a plurality of first physical addresses and a plurality of second physical addresses within an external memory; and a memory controller, coupled to the encryption and integrity block, the memory controller stores the plurality of encrypted data words in the plurality of first physical addresses and the plurality of integrity words in the plurality of second physical addresses. 14. The secure microcontroller system in claim 13 wherein each integrity word comprises a plurality of integrity sub-words, each integrity sub-word corresponding to a data word within the plurality of data words. 15. The secure microcontroller system in claim 13 wherein the plurality of encrypted data words and the plurality of integrity words are interleaved in the external memory. 16. The secure microcontroller system in claim 13 wherein the encryption and integrity protection block further comprises:
an integrity control data generator that generates a plurality of integrity words from the plurality of data words based on an integrity check method;
an address translator that translates the plurality of logic addresses to the plurality of first physical addresses and the plurality of second physical addresses based on a data map; and
a data encryptor that encrypts the plurality of data words to the plurality of encrypted data words based on a data encryption method;
wherein both the plurality of first physical addresses the plurality of second physical addresses are associated with an external memory to the microcontroller;
wherein each of the plurality of integrity words is associated with at least one of the plurality of the data words. 17. The secure microcontroller system in claim 16 wherein the encryption and integrity protection block further comprises an integrity cache for storing at least one of the plurality of integrity words, wherein the integrity cache is different from a CPU cache. 18. A method for extracting encrypted data words and integrity words within an external memory of a microcontroller, the method comprising:
receiving a plurality of logic addresses; translating the plurality of logic addresses to a plurality of first physical addresses within the external memory and a plurality of second physical addresses within the external memory based on a data map; reading a plurality of encrypted data words from the plurality of first physical addresses in the external memory and a plurality of integrity words from the plurality of second physical addresses in the external memory; decrypting the plurality of encrypted data words to a plurality of data words; checking validity of the plurality of data words using the plurality of recovered integrity words based on an integrity check; and outputting the plurality of data words if the plurality of data words are valid. 19. The method in claim 18 wherein the step of checking validity of the plurality of data words further comprises the steps of:
regenerating a plurality of regenerated integrity words from the plurality of data words based on the integrity check;
comparing the plurality of regenerated integrity words with the plurality of integrity words; and
indicating the validity of the plurality of data words by comparison results that are associated with the consistency between the plurality of integrity words and the plurality of recovered integrity words. 20. The method of claim 18 wherein the validity of the plurality of data words is further applied to raise a CPU exception based on a security policy of the microcontroller. The CPU exception is exploited to implement at least one function selected from a group of functions including erasing the sensitive data, triggering a non-maskable interruption, writing a value in a flag register, resetting the microcontroller, and running a dedicated code. 21. The method of claim 18 wherein the external memory is one selected from a group consisting of read-only-memory (ROM), random-access-memory (RAM) and flash memory. 22. The method of claim 18 further comprises the step of storing at least one integrity word, within the plurality of integrity words, in an integrity cache in the microcontroller prior to the step of checking validity of the plurality of data words using the plurality of recovered integrity words based on an integrity check, wherein the integrity cache is different from a CPU cache. 23. The method of claim 18 wherein each integrity word, within the plurality of integrity words, has a first number of bits and each encrypted data word, within the plurality of encrypted data words, has a second number of bits, the first number of bits being equal to the second number of bits. 24. The method of claim 18 wherein each integrity word comprises a plurality of integrity sub-words, each integrity sub-word corresponding to an encrypted data word within the plurality of encrypted data words. 25. The method of claim 18 wherein the plurality of encrypted data words and the plurality of integrity words are interleaved in the external memory. 26. The method of claim 25 wherein a subset of the plurality of encrypted data words are associated with an integrity word having a plurality of integrity sub-words corresponding to the subset of the plurality of encrypted data words, the subset being stored with the integrity word in an interleaved scheme within the external memory. 27. The method of claim 26 wherein the subset of the plurality of encrypted data words has eight encrypted data words and the integrity word has eight integrity sub-words. | 2,100 |
5,119 | 14,893,606 | 2,176 | Examples disclosed herein relate to web page output selection. A processor may determine the features of a section of a web page and assign a weight to each of the features respectively. The processor may determine a score for the section based on the weights of the features and determine to output the section based on the score. | 1. A computing system, comprising:
a storage to store information about previously output selections of web pages, wherein outputting selections comprises at least one of printing, digitally clipping, transmitting, and storing, and a processor to
weight the features of the output selections according to the frequency of the previously output selections sections including the feature;
assign a score to different sections of a web page tree where the score is based on feature values based on the features present in the sections and the weight of the present features;
determine sections to output based on the scores of he different sections; and
cause the determined sections to be output. 2. The computing system of claim 1, wherein the processor is further to group content with a determined section to output. 3. The computing system of claim 2, wherein the processor is further to group content to output based on the spatial alignment of sections. 4. The computing system of claim 3, wherein content with an overlapping area greater than a threshold with the selected section is determined to be spatially aligned and wherein spatially aligned content is selected for output with the selected section. 5. The computing system of claim 1, wherein the processor is further to determine multiple weights associated with a feature, wherein the weights are each associated with at least one of a different type of web page and a different type of user. 6. A method, comprising:
determining, by a processor, features of a section of a web page; assigning a weight to each of the features respectively, based on a machine learning method for determining the weights; determining a score for the section based on the weights of the features; and determining to output the section based on the score. 7. The method of claim 6, further comprising scoring different sections of the web page based on different groupings with additional content including the selected section. 8. The method of claim 6, further comprising determining the weight to assign to a feature based on at least one of the type of web page and the type of user. 9. The method of claim 6, wherein a section comprises a section of a tree structure representing the web page. 10. The method of claim 6, wherein the machine learning method comprises determining weights for different features based on outputting selections related to other web pages output by multiple users. 11. A machine-readable non-transitory storage medium comprising instructions executable by a processor to:
determine weights associated with different features of web page document object model nodes based on the features of document object model nodes associated with previously output portions of web pages; determine the features of nodes of a selected web page; score each of the nodes of the selected web page based on the weights associated with the determined features of each of the nodes; select a subset of the document object model nodes of the selected web page to output based on the scores of the nodes; and cause the sections of the web page associated with the subset of nodes to be output. 12. The machine-readable storage medium of claim 11, wherein the features comprise at least one of: position, area size, font color, font size, font type, text area, and number of links. 13. The machine-readable non-transitory storage medium of claim 11, further comprising instructions to traverse the document object model nodes in a depth first search from a selected node to determine nodes to group together for output based on spatial alignment between the nodes in the depth first search. 14. The machine-readable non-transitory storage medium of claim 13, further comprising instructions to select a group of nodes based on an aggregate score of the nodes in the group and the area of the web page represented by the nodes. 15. The machine-readable non-transitory storage medium of claim 11, wherein instructions to determine weights comprise instructions to apply a machine learning method to determine the statistical likelihood of features being included in document object model nodes selected for output. | Examples disclosed herein relate to web page output selection. A processor may determine the features of a section of a web page and assign a weight to each of the features respectively. The processor may determine a score for the section based on the weights of the features and determine to output the section based on the score.1. A computing system, comprising:
a storage to store information about previously output selections of web pages, wherein outputting selections comprises at least one of printing, digitally clipping, transmitting, and storing, and a processor to
weight the features of the output selections according to the frequency of the previously output selections sections including the feature;
assign a score to different sections of a web page tree where the score is based on feature values based on the features present in the sections and the weight of the present features;
determine sections to output based on the scores of he different sections; and
cause the determined sections to be output. 2. The computing system of claim 1, wherein the processor is further to group content with a determined section to output. 3. The computing system of claim 2, wherein the processor is further to group content to output based on the spatial alignment of sections. 4. The computing system of claim 3, wherein content with an overlapping area greater than a threshold with the selected section is determined to be spatially aligned and wherein spatially aligned content is selected for output with the selected section. 5. The computing system of claim 1, wherein the processor is further to determine multiple weights associated with a feature, wherein the weights are each associated with at least one of a different type of web page and a different type of user. 6. A method, comprising:
determining, by a processor, features of a section of a web page; assigning a weight to each of the features respectively, based on a machine learning method for determining the weights; determining a score for the section based on the weights of the features; and determining to output the section based on the score. 7. The method of claim 6, further comprising scoring different sections of the web page based on different groupings with additional content including the selected section. 8. The method of claim 6, further comprising determining the weight to assign to a feature based on at least one of the type of web page and the type of user. 9. The method of claim 6, wherein a section comprises a section of a tree structure representing the web page. 10. The method of claim 6, wherein the machine learning method comprises determining weights for different features based on outputting selections related to other web pages output by multiple users. 11. A machine-readable non-transitory storage medium comprising instructions executable by a processor to:
determine weights associated with different features of web page document object model nodes based on the features of document object model nodes associated with previously output portions of web pages; determine the features of nodes of a selected web page; score each of the nodes of the selected web page based on the weights associated with the determined features of each of the nodes; select a subset of the document object model nodes of the selected web page to output based on the scores of the nodes; and cause the sections of the web page associated with the subset of nodes to be output. 12. The machine-readable storage medium of claim 11, wherein the features comprise at least one of: position, area size, font color, font size, font type, text area, and number of links. 13. The machine-readable non-transitory storage medium of claim 11, further comprising instructions to traverse the document object model nodes in a depth first search from a selected node to determine nodes to group together for output based on spatial alignment between the nodes in the depth first search. 14. The machine-readable non-transitory storage medium of claim 13, further comprising instructions to select a group of nodes based on an aggregate score of the nodes in the group and the area of the web page represented by the nodes. 15. The machine-readable non-transitory storage medium of claim 11, wherein instructions to determine weights comprise instructions to apply a machine learning method to determine the statistical likelihood of features being included in document object model nodes selected for output. | 2,100 |
5,120 | 14,035,656 | 2,165 | Provided are methods comprising receiving a query for information from the database, determining particular data element types and data element values that are the subject of the query, instantiating a query data structure containing the data element types and the data element values that are the subject of the query, identifying records within the database that contain one or more data element types and/or data element values that are included in the query data structure, and instantiating a results data structure comprising information relating to the identified records. | 1. A method for analyzing information within a database that comprises one or more database structures which collectively contain a plurality of data records, with each record having at least two data element types, and with at least one of the data element types having a different data element value from the data element value for the corresponding data element type in at least one other record in the database; the method characterized by the steps of:
reading the plurality of records; instantiating an initial data structure for each unique data element type within the plurality of records; creating an entry in the initial data structure for each data element type for each unique data element value within that data element type; selecting one or more database structures within the database; instantiating a final data structure for the selected database structures in which the data element value for each data element type reflects the entry made in the initial data structures for that data element value; receiving a query for information from the database; determining particular data element types and data element values that are the subject of the query; instantiating a query data structure containing the data element types and the data element values that are the subject of the query; identifying records within the database that contain one or more data element types and/or data element values that are included in the query data structure; and instantiating a results data structure comprising information relating to the identified records. 2. The method of claim 1, further comprising assigning a unique code, to each unique data element value within each data element type, wherein the unique code is of a type that can be used to facilitate computer processing, and wherein entries in the initial data structures and the query data structure for the data element values are the corresponding assigned unique code instead of the actual data element values. 3. The method of claim 1, further comprising displaying one or more of the data element values in a manner that indicates whether or not the data element values were included in the query data structure. 4. The method of claim 1, further comprising associating a unique identifier to each of the initial data structures, final data structures, query data structures and results data structures, and storing in memory the initial data structures, final data structures, query data structures and results data structures along with their respective unique identifier. 5. The method of claim 4, further comprising sorting the displayed data element values included in the results data structure by the order of their frequency of occurrence. 6. The method of claim 4, further comprising utilizing the number of occurrences to provide suggestions for alternative queries of the database. 7. The method of claim 1, further comprising counting a frequency of occurrence of each of the data element values included in the results data structure, and using results of the counting to prioritize the data element values. 8. The method of claim 1, further comprising counting a number of unique data element values in the results data structure and utilizing the results of the counting to further analyze information contained the database. 9. The method of claim 1, further comprising counting a number of records containing one or more of the data element values included in the results data structure and utilizing the results of the counting to further analyze information contained the database. 10. The method of claim 1, further comprising counting the number of records that do not contain one or more of the data element values included in the results data structure and utilizing the results of the counting to further analyze information contained the database. 11. The method of claim 1, further comprising using values in the initial database structures to suggest values as query criteria during the entry of values for queries of the database, thereby enabling a user to accept the suggested values. 12. The method of claim 1, further comprising using values in the initial database structures to determine whether values entered for the query are data element types or data element values, thereby allowing searches of the database without specification of whether the entered values are data element types or data element values. 13. The method of claim 1, further comprising using values in the initial database structures to determine whether there are associations between the values of the query data structure, and thereby affording the ability to prioritize the values of the results data structure based upon the associations values of the query data structure. 14. A system for analyzing information within a database using a computer having one or more processors and memory storing programs to be executed by the one or more processors, and one or more of the programs being configured to analyze and locate information within the database, said database comprising one or more database structures for storing data records, with each of said records having at least two data element types, and with at least one of the data element types having a different data element value from the data element value for the corresponding data element type in at least one other record in the database, said system comprising:
means for reading and storing data records from a database; means for instantiating an initial data structure for each unique data element type within the stored records of the database; means for storing within the initial data structure for each data element type, an assigned value representing unique data element values for each data element type; means for selecting one or more database structures within the database and for instantiating a final data structure for the selected database structures, and for storing each of the records of the selected database structures within the final data structure using the assigned values for each data element value; means for receiving one or more queries for information from the database, for determining particular data element types and data element values that are applicable to the query, for instantiating a query data structure for each query, and for storing within the query data structure the determined data element types and data element values using the assigned values; and means for identifying the data records within the database that contain one or more of the data element types and data element values stored in the query data structure, for instantiating a results data structure, for storing within such results data structure information describing the identified data records, the information identifying the data element types and data element values contained within the identified records, and for indicating whether or not the data element types and data element values were stored within the query data structure. 15. The system of claim 14, in which the means for assigning the values representing the data element values comprises means for assigning a unique code to each unique data element value within each data element type, wherein the unique code is of a type that can be used to facilitate computer processing, and wherein the entries in the initial data structures and the query data structure for the data element values are the corresponding assigned unique code instead of the data element values. 16. The system of claim 14, further comprising means for displaying data element types and data element values stored within the results data structure. 17. The system of claim 14, further comprising means for counting a number of occurrences of the data element values within the results data structure and for using the results of the counting to suggest values for alternative queries to the database. 18. The system of claim 14, further comprising means for using the results data structure to provide suggestions for terms that can be used for alternative queries of the database. 19. The system of claim 18, wherein the means for using the results data structure to provide suggestions for terms that can be used for alternative queries of the database comprises a means for providing information indicating whether the suggestions are data element types or data element values. 20. The system of claim 18, wherein the means for using the results data structure to provide suggestions for terms that can be used for alternative queries of the database comprises a means for providing such suggestions during the process of a user of the system entering terms for a query, thereby enabling the user to accept the suggested terms. 21. The system of claim 14, further comprising means for assigning priority values to one or more of combinations of data element values and data element types that were determined as being applicable to the query and for using the assigned priority values to modify the information stored within the results data structure. 22. A method for analyzing information, comprising
identifying, in a database, unique data element types; generating a plurality of initial data structures corresponding to the unique data element types, wherein the plurality of initial data structures comprise unique data elements associated with the corresponding unique data element type; generating a final data structure based on the plurality of initial data structures, wherein the final data structure comprises a non-redundant selection of records from the database; and providing search results relevant to a search query based on the final data structure. 23. The method of claim 22, wherein generating the final data structure based on the plurality of initial data structures comprises generating binary codes for corresponding unique data elements. 24. The method of claim 24, wherein generating the final data structure comprises resolving at least one of data element dependency and data element redundancy between the plurality of initial data structures. 25. A method, comprising:
receiving a query for information from a database; identifying data element types relevant to the query and data element values relevant to the query; generating a query structure based on the identified data element types and data element values; identifying a data structure relevant to the query structure, wherein the data structure comprises non-redundant data element values from the database; identifying records in the data structure based on the query structure; and providing the records in response to the query for information. 26. The method of claim 25, wherein identifying the data structure relevant to the query structure comprises identifying a data structure comprising the greatest number of identified data element types relevant to the query. 27. The method of claim 25, wherein identifying records in the data structure based on the query structure comprises identifying records associated with at least one of the data element types relevant to the query and the data element values relevant to the query. 28. The method of claim 25, wherein providing the records in response to the query comprises displaying at least one of unique data element types, unique data element values, and a count of the number the unique data element values. 29. The method of claim 25, wherein providing the records in response to the query comprises displaying data elements of the records according to degrees of relevance, and wherein different degrees of relevance are represented by different color shades. 30. The method of claim 25, wherein receiving a query for information from the database comprises receiving the query as a free-form search, and wherein identifying records in the data structure comprises generating a status vector based on the free-form search. 31. The method of claim 25, wherein receiving a query for information from the database comprises receiving a weight value for at least one corresponding data element type, and wherein providing the records in response to the query is based on the weight value. | Provided are methods comprising receiving a query for information from the database, determining particular data element types and data element values that are the subject of the query, instantiating a query data structure containing the data element types and the data element values that are the subject of the query, identifying records within the database that contain one or more data element types and/or data element values that are included in the query data structure, and instantiating a results data structure comprising information relating to the identified records.1. A method for analyzing information within a database that comprises one or more database structures which collectively contain a plurality of data records, with each record having at least two data element types, and with at least one of the data element types having a different data element value from the data element value for the corresponding data element type in at least one other record in the database; the method characterized by the steps of:
reading the plurality of records; instantiating an initial data structure for each unique data element type within the plurality of records; creating an entry in the initial data structure for each data element type for each unique data element value within that data element type; selecting one or more database structures within the database; instantiating a final data structure for the selected database structures in which the data element value for each data element type reflects the entry made in the initial data structures for that data element value; receiving a query for information from the database; determining particular data element types and data element values that are the subject of the query; instantiating a query data structure containing the data element types and the data element values that are the subject of the query; identifying records within the database that contain one or more data element types and/or data element values that are included in the query data structure; and instantiating a results data structure comprising information relating to the identified records. 2. The method of claim 1, further comprising assigning a unique code, to each unique data element value within each data element type, wherein the unique code is of a type that can be used to facilitate computer processing, and wherein entries in the initial data structures and the query data structure for the data element values are the corresponding assigned unique code instead of the actual data element values. 3. The method of claim 1, further comprising displaying one or more of the data element values in a manner that indicates whether or not the data element values were included in the query data structure. 4. The method of claim 1, further comprising associating a unique identifier to each of the initial data structures, final data structures, query data structures and results data structures, and storing in memory the initial data structures, final data structures, query data structures and results data structures along with their respective unique identifier. 5. The method of claim 4, further comprising sorting the displayed data element values included in the results data structure by the order of their frequency of occurrence. 6. The method of claim 4, further comprising utilizing the number of occurrences to provide suggestions for alternative queries of the database. 7. The method of claim 1, further comprising counting a frequency of occurrence of each of the data element values included in the results data structure, and using results of the counting to prioritize the data element values. 8. The method of claim 1, further comprising counting a number of unique data element values in the results data structure and utilizing the results of the counting to further analyze information contained the database. 9. The method of claim 1, further comprising counting a number of records containing one or more of the data element values included in the results data structure and utilizing the results of the counting to further analyze information contained the database. 10. The method of claim 1, further comprising counting the number of records that do not contain one or more of the data element values included in the results data structure and utilizing the results of the counting to further analyze information contained the database. 11. The method of claim 1, further comprising using values in the initial database structures to suggest values as query criteria during the entry of values for queries of the database, thereby enabling a user to accept the suggested values. 12. The method of claim 1, further comprising using values in the initial database structures to determine whether values entered for the query are data element types or data element values, thereby allowing searches of the database without specification of whether the entered values are data element types or data element values. 13. The method of claim 1, further comprising using values in the initial database structures to determine whether there are associations between the values of the query data structure, and thereby affording the ability to prioritize the values of the results data structure based upon the associations values of the query data structure. 14. A system for analyzing information within a database using a computer having one or more processors and memory storing programs to be executed by the one or more processors, and one or more of the programs being configured to analyze and locate information within the database, said database comprising one or more database structures for storing data records, with each of said records having at least two data element types, and with at least one of the data element types having a different data element value from the data element value for the corresponding data element type in at least one other record in the database, said system comprising:
means for reading and storing data records from a database; means for instantiating an initial data structure for each unique data element type within the stored records of the database; means for storing within the initial data structure for each data element type, an assigned value representing unique data element values for each data element type; means for selecting one or more database structures within the database and for instantiating a final data structure for the selected database structures, and for storing each of the records of the selected database structures within the final data structure using the assigned values for each data element value; means for receiving one or more queries for information from the database, for determining particular data element types and data element values that are applicable to the query, for instantiating a query data structure for each query, and for storing within the query data structure the determined data element types and data element values using the assigned values; and means for identifying the data records within the database that contain one or more of the data element types and data element values stored in the query data structure, for instantiating a results data structure, for storing within such results data structure information describing the identified data records, the information identifying the data element types and data element values contained within the identified records, and for indicating whether or not the data element types and data element values were stored within the query data structure. 15. The system of claim 14, in which the means for assigning the values representing the data element values comprises means for assigning a unique code to each unique data element value within each data element type, wherein the unique code is of a type that can be used to facilitate computer processing, and wherein the entries in the initial data structures and the query data structure for the data element values are the corresponding assigned unique code instead of the data element values. 16. The system of claim 14, further comprising means for displaying data element types and data element values stored within the results data structure. 17. The system of claim 14, further comprising means for counting a number of occurrences of the data element values within the results data structure and for using the results of the counting to suggest values for alternative queries to the database. 18. The system of claim 14, further comprising means for using the results data structure to provide suggestions for terms that can be used for alternative queries of the database. 19. The system of claim 18, wherein the means for using the results data structure to provide suggestions for terms that can be used for alternative queries of the database comprises a means for providing information indicating whether the suggestions are data element types or data element values. 20. The system of claim 18, wherein the means for using the results data structure to provide suggestions for terms that can be used for alternative queries of the database comprises a means for providing such suggestions during the process of a user of the system entering terms for a query, thereby enabling the user to accept the suggested terms. 21. The system of claim 14, further comprising means for assigning priority values to one or more of combinations of data element values and data element types that were determined as being applicable to the query and for using the assigned priority values to modify the information stored within the results data structure. 22. A method for analyzing information, comprising
identifying, in a database, unique data element types; generating a plurality of initial data structures corresponding to the unique data element types, wherein the plurality of initial data structures comprise unique data elements associated with the corresponding unique data element type; generating a final data structure based on the plurality of initial data structures, wherein the final data structure comprises a non-redundant selection of records from the database; and providing search results relevant to a search query based on the final data structure. 23. The method of claim 22, wherein generating the final data structure based on the plurality of initial data structures comprises generating binary codes for corresponding unique data elements. 24. The method of claim 24, wherein generating the final data structure comprises resolving at least one of data element dependency and data element redundancy between the plurality of initial data structures. 25. A method, comprising:
receiving a query for information from a database; identifying data element types relevant to the query and data element values relevant to the query; generating a query structure based on the identified data element types and data element values; identifying a data structure relevant to the query structure, wherein the data structure comprises non-redundant data element values from the database; identifying records in the data structure based on the query structure; and providing the records in response to the query for information. 26. The method of claim 25, wherein identifying the data structure relevant to the query structure comprises identifying a data structure comprising the greatest number of identified data element types relevant to the query. 27. The method of claim 25, wherein identifying records in the data structure based on the query structure comprises identifying records associated with at least one of the data element types relevant to the query and the data element values relevant to the query. 28. The method of claim 25, wherein providing the records in response to the query comprises displaying at least one of unique data element types, unique data element values, and a count of the number the unique data element values. 29. The method of claim 25, wherein providing the records in response to the query comprises displaying data elements of the records according to degrees of relevance, and wherein different degrees of relevance are represented by different color shades. 30. The method of claim 25, wherein receiving a query for information from the database comprises receiving the query as a free-form search, and wherein identifying records in the data structure comprises generating a status vector based on the free-form search. 31. The method of claim 25, wherein receiving a query for information from the database comprises receiving a weight value for at least one corresponding data element type, and wherein providing the records in response to the query is based on the weight value. | 2,100 |
5,121 | 15,263,703 | 2,156 | A visualization of literary elements of a work of literature, such as a novel or short story, is generated from meta-data records representing a digital work of literature including literary elements (humor, drama, adventure, etc.), characters, and plot devices related to a position within the work of literature where each appears. A significance level is determined for each of the elements, characters and plot devices at each position within the work of literature, and these are plotted into a sequential graph having position (e.g. timeline) axis and a significance level axis. The sequential graph is then output for printing or display. Human-generated and machine-generated meta-data may be ingested equally well by the method. Colors, line thickness, and a broken line patterns may be employed for greater visual meaning. And, the sequential graph may be annotated according to segments (e.g. chapters, sections) and dominant genre within each segment. | 1. A method for visualizing literary elements as a graph comprising:
receiving, by a computer system, a set of meta-data records representing the contents of an existing digital work of literature, wherein each meta-data record comprises a significance value for a literary element and a relationship of the literary element to one or more items selected from the group consisting of a character, and a literary plot device, and a position where the literary element occurs within a literary plot of the work of literature; graphing, by a computer system, the literary elements, characters and plot devices in a sequential graph having a first axis corresponding to a progression of the literary plot within the work of literature, a second axis orthogonal to the first axis corresponds to significance level, and a plurality of points located within the sequential graph as a function of the occurrence position and significance level for each literary element; and rendering, by a computer system, the sequential graph to an output of the computer system. 2. The method as set forth in claim 1 wherein the literary element comprises one or more categories selected from the group consisting of humorous literature, suspenseful literature, mystery literature, dramatic literature, action literature, adventure literature, romantic literature, science fiction literature, science reference literature, and legal analysis literature. 3. The method as set forth in claim 1 wherein the rendering to an output comprises one or more steps selected from the group consisting of creating a digital image file, creating a digital movie file, printing to a printable material, and displaying on a digital display. 4. The method as set forth in claim 1 wherein the receiving of meta-data records comprises receiving converted data from human reviews, synopses, or both review and synopses of the work of literature. 5. The method as set forth in claim 1 wherein the receiving of meta-data records comprises receiving meta-data created by a computer using natural language processing and deep semantic analysis. 6. The method as set forth in claim 1 wherein the graphing comprises plotting a smooth curve for each literary element along a set of coordinates corresponding to each literary element. 7. The method as set forth in claim 6 further comprising encoding the smooth curve to correspond to the literary element using at least one indicia selected from the group consisting of line color, line thickness, and a broken line pattern. 8. The method as set forth in claim 1 further comprising:
breaking the meta-data records by a computer into segments of the work of literature; and
marking by a computer the sequential graph according to the segments. 9. The method as set forth in claim 8 wherein the breaking comprises one or more methods selected from the group consisting of breaking according to chapters, breaking according to sections, breaking according to number of pages, breaking according to number of paragraphs, and breaking according to shifts in subject matter. 10. The method as set forth in claim 8 further comprising:
determining by a computer system a dominant genre of each segment; and
annotating by a computer each segment on the sequential graph according to the dominant genre corresponding to each segment. 11. A computer program product for visualizing literary elements as a graph comprising:
a computer readable storage memory device storing program instructions for causing a processor to:
receive a set of meta-data records representing the contents of an existing digital work of literature, wherein each meta-data record comprises a significance value for a literary element and a relationship of the literary element to one or more items selected from the group consisting of a character, and a literary plot device, and a position where the literary element occurs within a literary plot of the work of literature;
graph the literary elements, characters and plot devices in a sequential graph having a first axis corresponding to a progression of the literary plot within the work of literature, a second axis orthogonal to the first axis corresponds to significance level, and a plurality of points located within the sequential graph as a function of the occurrence position and significance level for each literary element; and
render the sequential graph to an output of the computer system. 12. The computer program product as set forth in claim 11 wherein the literary element comprises one or more categories selected from the group consisting of humorous literature, suspenseful literature, mystery literature, dramatic literature, action literature, adventure literature, romantic literature, science fiction literature, science reference literature, and legal analysis literature. 13. The computer program product as set forth in claim 11 wherein the rendering to an output comprises at least one action selected from the group consisting of creating a digital image file, creating a digital movie file, printing to a printable material, and displaying on a digital display. 14. The computer program product as set forth in claim 11 wherein the receiving of meta-data records comprises at least one action selected from the group consisting of receiving converted data from human reviews, receiving converted data from synopses, and receiving meta-data created by a computer using natural language processing and deep semantic analysis. 15. The computer program product as set forth in claim 11 wherein the graphing comprises:
plotting a smooth curve for each literary element along a set of coordinates corresponding to each literary element;
encoding the smooth curve to correspond to the literary element using at least one indicia selected from the group consisting of line color, line thickness, and a broken line pattern;
breaking the meta-data records into segments of the work of literature; and
marking the sequential graph according to the segments. 16. The computer program product as set forth in claim 15 wherein the breaking comprises one or more actions selected from the group consisting of breaking according to chapters, breaking according to sections, breaking according to number of pages, breaking according to number of paragraphs, and breaking according to shifts in subject matter. 17. The computer program product as set forth in claim 15 further comprising program instructions stored by the computer readable storage memory device for causing a processor to:
determine a dominant genre of each segment; and
annotate on the sequential graph according to the dominant genre corresponding to each segment. 18. A computer system for visualizing literary elements as a graph comprising:
a processor; and a computer readable storage memory device storing program instructions for causing the processor to:
receive a set of meta-data records representing the contents of a digital work of literature, wherein each meta-data record comprises a significance value for a literary element and a relationship of the literary element to one or more items selected from the group consisting of a character, and a literary plot device, and a position where the literary element occurs within a literary plot of the work of literature;
graph the literary elements, characters and plot devices in a sequential graph having a first axis corresponding to a progression of the literary plot within the work of literature, a second axis orthogonal to the first axis corresponds to significance level, and a plurality of points located within the sequential graph as a function of the occurrence position and significance level for each literary element; and
render the sequential graph to an output of the computer system. 19. The computer system as set forth in claim 18 wherein the literary element comprises one or more categories selected from the group consisting of humorous literature, suspenseful literature, mystery literature, dramatic literature, action literature, adventure literature, romantic literature, science fiction literature, science reference literature, and legal analysis literature. 20. The computer system as set forth in claim 18 wherein the rendering to an output comprises one or more actions selected from the group consisting of creating a digital image file, creating a digital movie file, printing to a printable material, and displaying on a digital display. 21. The computer system as set forth in claim 18 wherein the receiving of meta-data records comprises one or more actions selected from the group consisting of receiving converted data from human reviews, receiving converted data from synopses, and receiving meta-data created by a computer using natural language processing and deep semantic analysis. 22. The computer system as set forth in claim 18 wherein the graphing comprises:
plotting a smooth curve for each literary element along a set of coordinates corresponding to each literary element;
encoding the smooth curve to correspond to the literary element using at least one indicia selected from the group consisting of line color, line thickness, and a broken line pattern;
breaking the meta-data records into segments of the work of literature; and
marking the sequential graph according to the segments. 23. The computer system as set forth in claim 22 wherein the breaking comprises one or more actions selected from the group consisting of breaking according to chapters, breaking according to sections, breaking according to number of pages, breaking according to number of paragraphs, and breaking according to shifts in subject matter. 24. The system as set forth in claim 23 further comprising program instructions stored by the computer readable storage memory device for causing the processor to:
determine a dominant genre of each segment; and
annotate each segment on the sequential graph according to the dominant genre corresponding to each segment. | A visualization of literary elements of a work of literature, such as a novel or short story, is generated from meta-data records representing a digital work of literature including literary elements (humor, drama, adventure, etc.), characters, and plot devices related to a position within the work of literature where each appears. A significance level is determined for each of the elements, characters and plot devices at each position within the work of literature, and these are plotted into a sequential graph having position (e.g. timeline) axis and a significance level axis. The sequential graph is then output for printing or display. Human-generated and machine-generated meta-data may be ingested equally well by the method. Colors, line thickness, and a broken line patterns may be employed for greater visual meaning. And, the sequential graph may be annotated according to segments (e.g. chapters, sections) and dominant genre within each segment.1. A method for visualizing literary elements as a graph comprising:
receiving, by a computer system, a set of meta-data records representing the contents of an existing digital work of literature, wherein each meta-data record comprises a significance value for a literary element and a relationship of the literary element to one or more items selected from the group consisting of a character, and a literary plot device, and a position where the literary element occurs within a literary plot of the work of literature; graphing, by a computer system, the literary elements, characters and plot devices in a sequential graph having a first axis corresponding to a progression of the literary plot within the work of literature, a second axis orthogonal to the first axis corresponds to significance level, and a plurality of points located within the sequential graph as a function of the occurrence position and significance level for each literary element; and rendering, by a computer system, the sequential graph to an output of the computer system. 2. The method as set forth in claim 1 wherein the literary element comprises one or more categories selected from the group consisting of humorous literature, suspenseful literature, mystery literature, dramatic literature, action literature, adventure literature, romantic literature, science fiction literature, science reference literature, and legal analysis literature. 3. The method as set forth in claim 1 wherein the rendering to an output comprises one or more steps selected from the group consisting of creating a digital image file, creating a digital movie file, printing to a printable material, and displaying on a digital display. 4. The method as set forth in claim 1 wherein the receiving of meta-data records comprises receiving converted data from human reviews, synopses, or both review and synopses of the work of literature. 5. The method as set forth in claim 1 wherein the receiving of meta-data records comprises receiving meta-data created by a computer using natural language processing and deep semantic analysis. 6. The method as set forth in claim 1 wherein the graphing comprises plotting a smooth curve for each literary element along a set of coordinates corresponding to each literary element. 7. The method as set forth in claim 6 further comprising encoding the smooth curve to correspond to the literary element using at least one indicia selected from the group consisting of line color, line thickness, and a broken line pattern. 8. The method as set forth in claim 1 further comprising:
breaking the meta-data records by a computer into segments of the work of literature; and
marking by a computer the sequential graph according to the segments. 9. The method as set forth in claim 8 wherein the breaking comprises one or more methods selected from the group consisting of breaking according to chapters, breaking according to sections, breaking according to number of pages, breaking according to number of paragraphs, and breaking according to shifts in subject matter. 10. The method as set forth in claim 8 further comprising:
determining by a computer system a dominant genre of each segment; and
annotating by a computer each segment on the sequential graph according to the dominant genre corresponding to each segment. 11. A computer program product for visualizing literary elements as a graph comprising:
a computer readable storage memory device storing program instructions for causing a processor to:
receive a set of meta-data records representing the contents of an existing digital work of literature, wherein each meta-data record comprises a significance value for a literary element and a relationship of the literary element to one or more items selected from the group consisting of a character, and a literary plot device, and a position where the literary element occurs within a literary plot of the work of literature;
graph the literary elements, characters and plot devices in a sequential graph having a first axis corresponding to a progression of the literary plot within the work of literature, a second axis orthogonal to the first axis corresponds to significance level, and a plurality of points located within the sequential graph as a function of the occurrence position and significance level for each literary element; and
render the sequential graph to an output of the computer system. 12. The computer program product as set forth in claim 11 wherein the literary element comprises one or more categories selected from the group consisting of humorous literature, suspenseful literature, mystery literature, dramatic literature, action literature, adventure literature, romantic literature, science fiction literature, science reference literature, and legal analysis literature. 13. The computer program product as set forth in claim 11 wherein the rendering to an output comprises at least one action selected from the group consisting of creating a digital image file, creating a digital movie file, printing to a printable material, and displaying on a digital display. 14. The computer program product as set forth in claim 11 wherein the receiving of meta-data records comprises at least one action selected from the group consisting of receiving converted data from human reviews, receiving converted data from synopses, and receiving meta-data created by a computer using natural language processing and deep semantic analysis. 15. The computer program product as set forth in claim 11 wherein the graphing comprises:
plotting a smooth curve for each literary element along a set of coordinates corresponding to each literary element;
encoding the smooth curve to correspond to the literary element using at least one indicia selected from the group consisting of line color, line thickness, and a broken line pattern;
breaking the meta-data records into segments of the work of literature; and
marking the sequential graph according to the segments. 16. The computer program product as set forth in claim 15 wherein the breaking comprises one or more actions selected from the group consisting of breaking according to chapters, breaking according to sections, breaking according to number of pages, breaking according to number of paragraphs, and breaking according to shifts in subject matter. 17. The computer program product as set forth in claim 15 further comprising program instructions stored by the computer readable storage memory device for causing a processor to:
determine a dominant genre of each segment; and
annotate on the sequential graph according to the dominant genre corresponding to each segment. 18. A computer system for visualizing literary elements as a graph comprising:
a processor; and a computer readable storage memory device storing program instructions for causing the processor to:
receive a set of meta-data records representing the contents of a digital work of literature, wherein each meta-data record comprises a significance value for a literary element and a relationship of the literary element to one or more items selected from the group consisting of a character, and a literary plot device, and a position where the literary element occurs within a literary plot of the work of literature;
graph the literary elements, characters and plot devices in a sequential graph having a first axis corresponding to a progression of the literary plot within the work of literature, a second axis orthogonal to the first axis corresponds to significance level, and a plurality of points located within the sequential graph as a function of the occurrence position and significance level for each literary element; and
render the sequential graph to an output of the computer system. 19. The computer system as set forth in claim 18 wherein the literary element comprises one or more categories selected from the group consisting of humorous literature, suspenseful literature, mystery literature, dramatic literature, action literature, adventure literature, romantic literature, science fiction literature, science reference literature, and legal analysis literature. 20. The computer system as set forth in claim 18 wherein the rendering to an output comprises one or more actions selected from the group consisting of creating a digital image file, creating a digital movie file, printing to a printable material, and displaying on a digital display. 21. The computer system as set forth in claim 18 wherein the receiving of meta-data records comprises one or more actions selected from the group consisting of receiving converted data from human reviews, receiving converted data from synopses, and receiving meta-data created by a computer using natural language processing and deep semantic analysis. 22. The computer system as set forth in claim 18 wherein the graphing comprises:
plotting a smooth curve for each literary element along a set of coordinates corresponding to each literary element;
encoding the smooth curve to correspond to the literary element using at least one indicia selected from the group consisting of line color, line thickness, and a broken line pattern;
breaking the meta-data records into segments of the work of literature; and
marking the sequential graph according to the segments. 23. The computer system as set forth in claim 22 wherein the breaking comprises one or more actions selected from the group consisting of breaking according to chapters, breaking according to sections, breaking according to number of pages, breaking according to number of paragraphs, and breaking according to shifts in subject matter. 24. The system as set forth in claim 23 further comprising program instructions stored by the computer readable storage memory device for causing the processor to:
determine a dominant genre of each segment; and
annotate each segment on the sequential graph according to the dominant genre corresponding to each segment. | 2,100 |
5,122 | 14,231,274 | 2,127 | A system simulates a process. Software instructions stored on a memory device and executable by a processor represent a process entity with a model. Instructions configure the model to function in a plurality of modes, the modes comprising a process mode, a fluid flow mode, and a dynamic mode. Additionally, instructions simulate the function of the process entity with the model in a first mode from the plurality of modes and then switch the model to a second mode from the plurality of modes. | 1. A system for simulating a process comprising:
a processor; a memory device coupled to the processor; software instructions stored on the memory device and executable by the processor, said instructions comprising:
instructions for representing a process entity with a model;
instructions for configuring the model to function in a plurality of modes, said modes comprising a process mode, a fluid flow mode, and a dynamics mode;
instructions for simulating the function of the process entity with the model in a first mode from the plurality of modes; and
instructions for switching the model to a second mode from the plurality of modes, wherein equations in the model do not change from the first mode to the second mode. 2. The system of claim 1, wherein the process mode and the fluid flow mode comprise steady state simulations. 3. The system of claim 1, wherein the dynamics mode comprises a simulation of system transients over time. 4. The system of claim 1, wherein configuring the model comprises, in the process mode, specifying one or more of pressure, temperature, and flow of a stream. 5. The system of claim 1, wherein configuring the model comprises, in the fluid flow mode, calculating flow of a stream. 6. The system of claim 1, wherein configuring the model comprises, in the dynamics mode, calculating flow of a stream. 7. One or more tangible, non-transitory computer-readable media having executable instructions stored thereon that, when executed, perform a method of simulating a process comprising:
representing a process entity with a model; configuring the model to function in a plurality of modes, said modes comprising a process mode, a fluid flow mode, and a dynamic mode; simulating the function of the process entity with the model in a first mode from the plurality of modes; and switching the model to a second mode from the plurality of modes. 8. The computer-readable media of claim 8, wherein the process mode and the fluid flow mode comprise steady state simulations. 9. The computer-readable media of claim 8, wherein the dynamics mode comprises a simulation of system transients over time. 10. The computer-readable media of claim 8, wherein configuring the model comprises, in the process mode, specifying one or more of pressure, temperature, and flow of a stream. 11. The computer-readable media of claim 8, wherein configuring the model comprises, in the fluid flow mode, calculating flow of a stream. 12. The computer-readable media of claim 8, wherein configuring the model comprises, in the dynamics mode, calculating flow of a stream. 13. A processor executable method of simulating a process comprising:
representing a process entity with a model; configuring the model to function in a plurality of modes, said modes comprising a process mode, a fluid flow mode, and a dynamic mode; simulating the function of the process entity with the model in a first mode from the plurality of modes; and switching the model to a second mode from the plurality of modes. 14. The method of claim 13, wherein the process mode and the fluid flow mode comprise steady state simulations. 15. The method of claim 13, wherein the dynamics mode comprises a simulation of system transients over time. 16. The method of claim 13, wherein configuring the model comprises, in the process mode, specifying one or more of pressure, temperature, and flow of a stream. 17. The method of claim 13, wherein configuring the model comprises, in the fluid flow mode, calculating flow of a stream. 18. The method of claim 13, wherein configuring the model comprises, in the dynamics mode, calculating flow of a stream. | A system simulates a process. Software instructions stored on a memory device and executable by a processor represent a process entity with a model. Instructions configure the model to function in a plurality of modes, the modes comprising a process mode, a fluid flow mode, and a dynamic mode. Additionally, instructions simulate the function of the process entity with the model in a first mode from the plurality of modes and then switch the model to a second mode from the plurality of modes.1. A system for simulating a process comprising:
a processor; a memory device coupled to the processor; software instructions stored on the memory device and executable by the processor, said instructions comprising:
instructions for representing a process entity with a model;
instructions for configuring the model to function in a plurality of modes, said modes comprising a process mode, a fluid flow mode, and a dynamics mode;
instructions for simulating the function of the process entity with the model in a first mode from the plurality of modes; and
instructions for switching the model to a second mode from the plurality of modes, wherein equations in the model do not change from the first mode to the second mode. 2. The system of claim 1, wherein the process mode and the fluid flow mode comprise steady state simulations. 3. The system of claim 1, wherein the dynamics mode comprises a simulation of system transients over time. 4. The system of claim 1, wherein configuring the model comprises, in the process mode, specifying one or more of pressure, temperature, and flow of a stream. 5. The system of claim 1, wherein configuring the model comprises, in the fluid flow mode, calculating flow of a stream. 6. The system of claim 1, wherein configuring the model comprises, in the dynamics mode, calculating flow of a stream. 7. One or more tangible, non-transitory computer-readable media having executable instructions stored thereon that, when executed, perform a method of simulating a process comprising:
representing a process entity with a model; configuring the model to function in a plurality of modes, said modes comprising a process mode, a fluid flow mode, and a dynamic mode; simulating the function of the process entity with the model in a first mode from the plurality of modes; and switching the model to a second mode from the plurality of modes. 8. The computer-readable media of claim 8, wherein the process mode and the fluid flow mode comprise steady state simulations. 9. The computer-readable media of claim 8, wherein the dynamics mode comprises a simulation of system transients over time. 10. The computer-readable media of claim 8, wherein configuring the model comprises, in the process mode, specifying one or more of pressure, temperature, and flow of a stream. 11. The computer-readable media of claim 8, wherein configuring the model comprises, in the fluid flow mode, calculating flow of a stream. 12. The computer-readable media of claim 8, wherein configuring the model comprises, in the dynamics mode, calculating flow of a stream. 13. A processor executable method of simulating a process comprising:
representing a process entity with a model; configuring the model to function in a plurality of modes, said modes comprising a process mode, a fluid flow mode, and a dynamic mode; simulating the function of the process entity with the model in a first mode from the plurality of modes; and switching the model to a second mode from the plurality of modes. 14. The method of claim 13, wherein the process mode and the fluid flow mode comprise steady state simulations. 15. The method of claim 13, wherein the dynamics mode comprises a simulation of system transients over time. 16. The method of claim 13, wherein configuring the model comprises, in the process mode, specifying one or more of pressure, temperature, and flow of a stream. 17. The method of claim 13, wherein configuring the model comprises, in the fluid flow mode, calculating flow of a stream. 18. The method of claim 13, wherein configuring the model comprises, in the dynamics mode, calculating flow of a stream. | 2,100 |
5,123 | 13,264,684 | 2,174 | A control system and methods for controlling a technical system includes one or more display units constituting a display working environment. The control system further includes an arrangement thumbnail, in turn including graphical representation of the display working environment, the arrangement thumbnail being provided on one of the display units. | 1-12. (canceled) 13. A supervisory control system controlling a power transmission and/or distribution system, said supervisory control system comprising
one or more display units constituting a display working environment and comprising means that visualize information objects related to the controlling of said power transmission and/or distribution system, an arrangement thumbnail comprising a graphical representation of said display working environment comprising thumbnail images of said one or more display units, said arrangement thumbnail being provided on one of said display units, and means for arranging said information objects by operations performed within said arrangement thumbnail.
wherein said means for arranging being configured to
receive a user input signal related to a desired location of said objects in a specific part of one of said display units, said user input signal comprising operations performed within said arrangement thumbnail through moving of said information objects over the thumbnail image of said one display unit within the arrangement thumbnail, and
arrange, in response to receiving said user input signal, said objects in the specific part of said one display unit dependent on whereto on the thumbnail image of said one display unit in the arrangement said information objects are moved. 14. The supervisory control system as claimed in claim 13, wherein said means for arranging is configured to provide a feedback signal visualizing where on said one display unit said objects will be placed, said feedback signal being based on said user input signal, and output said feedback signal on one of said display units. 15. The supervisory control system as claimed in claim 13, wherein the thumbnail arrangement is provided on the display unit from which said information objects are to be moved. 16. A method for arranging objects used in a supervisory control system that controls a power transmission and/or distribution system, said control system comprising one or more display units constituting a display working environment, the method wherein the steps of:
providing, on one of said display units, an arrangement thumbnail comprising a graphical representation of said display working environment, visualizing information objects related to the controlling of said power transmission and/or distribution system, receiving a user input signal related to a desired location of said objects in a specific part of one of said display units, said user input signal comprising operations performed within said arrangement thumbnail through moving of said information objects over the thumbnail image of said one display unit within the arrangement thumbnail, and arranging, in response to receiving said user input signal, said objects in the specific part of said one display unit dependent on whereto on the thumbnail image of said one display unit in the arrangement thumbnail said information objects are moved. 17. The method as claimed in claim 16, wherein said step of providing, on one of said display units, an arrangement thumbnail comprises showing said arrangement thumbnail upon receiving an information arranging signal. 18. The method as claimed in claim 17, wherein said information arranging signal is received when a user selects said object from a list, from a map, or when a user performs a drag operation of said object, whereby said objects are moved from one of said display units to said specific part of another display unit or from one location of said one display unit to another location thereon. 19. The method as claimed in claim 16, comprising the further step of:
providing a feedback signal visualizing where on said one display unit said objects will be placed, said feedback signal being based on said user input signal, and outputting said feedback signal on one of said display units. 20. The method as claimed in 16, wherein said objects comprise information objects such as text, pictures, and/or software applications. 21. The method as claimed in claim 16, wherein said step of arranging comprises updating means for handling said objects. 22. The method according to claim 16, wherein the thumbnail arrangement is provided on the display unit from which said information objects are to be moved. 23. A computer program product loadable into the internal memory of a computer of a supervisory control system, comprising software code portions for carrying out the method as claimed in claim 16 when said product is run on said computer. 24. A computer program product stored on a computer readable storage medium, comprising computer readable program code means for causing a computer of a supervisory control system, to carry out the method as claimed in claim 16. 25. The supervisory control system as claimed in claim 14, wherein the thumbnail arrangement is provided on the display unit from which said information objects are to be moved. 26. The method as claimed in claim 17, comprising the further step of:
providing a feedback signal visualizing where on said one display unit said objects will be placed, said feedback signal being based on said user input signal, and outputting said feedback signal on one of said display units. 27. The method as claimed in claim 18, comprising the further step of:
providing a feedback signal visualizing where on said one display unit said objects will be placed, said feedback signal being based on said user input signal, and outputting said feedback signal on one of said display units. 28. The method as claimed in claim 17, wherein said objects comprise information objects such as text, pictures, and/or software applications. 29. The method as claimed in claim 18, wherein said objects comprise information objects such as text, pictures, and/or software applications. 30. The method as claimed in claim 19, wherein said objects comprise information objects such as text, pictures, and/or software applications. 31. The method as claimed in claim 17, wherein said step of arranging comprises updating means for handling said objects. 32. The method as claimed in claim 18, wherein said step of arranging comprises updating means for handling said objects. | A control system and methods for controlling a technical system includes one or more display units constituting a display working environment. The control system further includes an arrangement thumbnail, in turn including graphical representation of the display working environment, the arrangement thumbnail being provided on one of the display units.1-12. (canceled) 13. A supervisory control system controlling a power transmission and/or distribution system, said supervisory control system comprising
one or more display units constituting a display working environment and comprising means that visualize information objects related to the controlling of said power transmission and/or distribution system, an arrangement thumbnail comprising a graphical representation of said display working environment comprising thumbnail images of said one or more display units, said arrangement thumbnail being provided on one of said display units, and means for arranging said information objects by operations performed within said arrangement thumbnail.
wherein said means for arranging being configured to
receive a user input signal related to a desired location of said objects in a specific part of one of said display units, said user input signal comprising operations performed within said arrangement thumbnail through moving of said information objects over the thumbnail image of said one display unit within the arrangement thumbnail, and
arrange, in response to receiving said user input signal, said objects in the specific part of said one display unit dependent on whereto on the thumbnail image of said one display unit in the arrangement said information objects are moved. 14. The supervisory control system as claimed in claim 13, wherein said means for arranging is configured to provide a feedback signal visualizing where on said one display unit said objects will be placed, said feedback signal being based on said user input signal, and output said feedback signal on one of said display units. 15. The supervisory control system as claimed in claim 13, wherein the thumbnail arrangement is provided on the display unit from which said information objects are to be moved. 16. A method for arranging objects used in a supervisory control system that controls a power transmission and/or distribution system, said control system comprising one or more display units constituting a display working environment, the method wherein the steps of:
providing, on one of said display units, an arrangement thumbnail comprising a graphical representation of said display working environment, visualizing information objects related to the controlling of said power transmission and/or distribution system, receiving a user input signal related to a desired location of said objects in a specific part of one of said display units, said user input signal comprising operations performed within said arrangement thumbnail through moving of said information objects over the thumbnail image of said one display unit within the arrangement thumbnail, and arranging, in response to receiving said user input signal, said objects in the specific part of said one display unit dependent on whereto on the thumbnail image of said one display unit in the arrangement thumbnail said information objects are moved. 17. The method as claimed in claim 16, wherein said step of providing, on one of said display units, an arrangement thumbnail comprises showing said arrangement thumbnail upon receiving an information arranging signal. 18. The method as claimed in claim 17, wherein said information arranging signal is received when a user selects said object from a list, from a map, or when a user performs a drag operation of said object, whereby said objects are moved from one of said display units to said specific part of another display unit or from one location of said one display unit to another location thereon. 19. The method as claimed in claim 16, comprising the further step of:
providing a feedback signal visualizing where on said one display unit said objects will be placed, said feedback signal being based on said user input signal, and outputting said feedback signal on one of said display units. 20. The method as claimed in 16, wherein said objects comprise information objects such as text, pictures, and/or software applications. 21. The method as claimed in claim 16, wherein said step of arranging comprises updating means for handling said objects. 22. The method according to claim 16, wherein the thumbnail arrangement is provided on the display unit from which said information objects are to be moved. 23. A computer program product loadable into the internal memory of a computer of a supervisory control system, comprising software code portions for carrying out the method as claimed in claim 16 when said product is run on said computer. 24. A computer program product stored on a computer readable storage medium, comprising computer readable program code means for causing a computer of a supervisory control system, to carry out the method as claimed in claim 16. 25. The supervisory control system as claimed in claim 14, wherein the thumbnail arrangement is provided on the display unit from which said information objects are to be moved. 26. The method as claimed in claim 17, comprising the further step of:
providing a feedback signal visualizing where on said one display unit said objects will be placed, said feedback signal being based on said user input signal, and outputting said feedback signal on one of said display units. 27. The method as claimed in claim 18, comprising the further step of:
providing a feedback signal visualizing where on said one display unit said objects will be placed, said feedback signal being based on said user input signal, and outputting said feedback signal on one of said display units. 28. The method as claimed in claim 17, wherein said objects comprise information objects such as text, pictures, and/or software applications. 29. The method as claimed in claim 18, wherein said objects comprise information objects such as text, pictures, and/or software applications. 30. The method as claimed in claim 19, wherein said objects comprise information objects such as text, pictures, and/or software applications. 31. The method as claimed in claim 17, wherein said step of arranging comprises updating means for handling said objects. 32. The method as claimed in claim 18, wherein said step of arranging comprises updating means for handling said objects. | 2,100 |
5,124 | 14,548,159 | 2,126 | A network analysis tool receives network flow information and uses deep learning—machine learning that models high-level abstractions in the network flow information—to identify dependencies between network assets. Based on the identified dependencies, the network analysis tool can discover functional relationships between network assets. For example, a network analysis tool receives network flow information, identifies dependencies between multiple network assets based on evaluation of the network flow information, and outputs results of the identification of the dependencies. When evaluating the network flow information, the network analysis tool can pre-process the network flow information to produce input vectors, use deep learning to extract patterns in the input vectors, and then determine dependencies based on the extracted patterns. The network analysis tool can repeat this process so as to update an assessment of the dependencies between network assets on a near real-time basis. | 1. One or more computer-readable media storing computer-executable instructions for causing a computing system, when programmed thereby, to perform:
receiving network flow information; identifying dependencies between multiple network assets based on evaluation of the network flow information, wherein the evaluation includes:
pre-processing the network flow information to produce input vectors;
using deep learning to extract patterns in the input vectors, wherein the deep learning is machine learning that models high-level abstractions in the input vectors; and
determining the dependencies based on the patterns; and
outputting results of the identifying the dependencies. 2. The one or more computer-readable media of claim 1, wherein the network flow information is packet flow information comprising an n-tuple per network flow, the network flow being an aggregation of packets that have common addressing attributes. 3. The one or more computer-readable media of claim 1, wherein the network flow information is received from multiple network probes situated in a network. 4. The one or more computer-readable media of claim 1, further storing computer-executable instructions for causing the computing system, when programmed thereby, to perform:
repeating the receiving, the identifying, and the outputting, so as to update an assessment of the dependencies between the multiple network assets on a near real-time basis. 5. The one or more computer-readable media of claim 1, wherein the dependencies are identified as recurrent temporal sequence-based patterns, and wherein each of the recurrent temporal sequence-based patterns is a randomly-initiated, repeating sequence of time-dependent elements. 6. The one or more computer-readable media of claim 1, wherein the pre-processing includes one or more of:
selectively converting unidirectional flow information to bidirectional flow information; windowing the network flow information using a time interval; categorizing network flows based on attributes of the network flow information; identifying instances of temporally proximate co-occurrences within the network flow information based on an ensemble approach; and checking that categorization of the network flow information is stable over a period of time. 7. The one or more computer-readable media of claim 6, wherein the categorizing assigns one of multiple categories as a function of attributes of a record of the network flow information, and wherein the attributes include one or more of source address, source port, destination address, destination port and protocol. 8. The one or more computer-readable media of claim 6, wherein the ensemble approach uses one or more of mutual information analysis, co-occurrence matrices followed by signal strength enhancement, clustering, auto-correlation/cross-correlation analysis, probability analysis, information-theoretic analysis, and cepstrum analysis. 9. The one or more computer-readable media of claim 6, wherein the instances are organized as a set of pairs of categorized records of the network flow information. 10. The one or more computer-readable media of claim 1, wherein the pre-processing includes:
combining instances of temporally proximate co-occurrences within the network flow information into higher-order combinations; encoding the higher-order combinations as the input vectors; and annotating the input vectors with details about the network flow information. 11. The one or more computer-readable media of claim 10, wherein the encoding indicates, for a given one of multiple possible higher-order combinations in a time interval, one of:
presence or absence of the given higher-order combination in the time interval; and count of the given higher-order combination in the time interval. 12. The one or more computer-readable media of claim 1, wherein the deep learning uses modeling architectures with non-linear transformations. 13. The one or more computer-readable media of claim 1, wherein the using deep learning includes:
applying a neural network to reveal similarities between the input vectors, wherein the applying the neural network produces output vectors; and summarizing the output vectors. 14. The one or more computer-readable media of claim 13, wherein the applying the neural network includes training a self-organizing map using the input vectors, and wherein the training the self-organizing map produces weight vectors for nodes of the self-organizing map, the weight vectors indicating the similarities between the input vectors. 15. The one or more computer-readable media of claim 13, wherein the summarizing includes:
performing hierarchical clustering on weight vectors produced by the neural network; and associating the clustered weight vectors with corresponding details about the network flow information. 16. The one or more computer-readable media of claim 13, wherein each of the input vectors includes, for a given time period, information indicating extent of co-occurrence of activity between network assets in various combinations, selected from among the multiple network assets, during the given time period, and wherein the summarizing makes the identification of the dependencies more robust over time. 17. In a computing system, a method comprising:
receiving, at the computing system, network flow information; with the computing system, identifying dependencies between multiple network assets based on evaluation of the network flow information, wherein the evaluation includes:
pre-processing the network flow information to produce input vectors;
using deep learning to extract patterns in the input vectors, wherein the deep learning is machine learning that models high-level abstractions in the input vectors; and
determining the dependencies based on the patterns; and
with the computing system, outputting results of the identifying the dependencies. 18. The method of claim 17, wherein the pre-processing includes one or more of:
selectively converting unidirectional flow information to bidirectional flow information; windowing the network flow information using a time interval; categorizing network flows based on attributes of the network flow information; identifying instances of temporally proximate co-occurrences within the network flow information based on an ensemble approach; and checking that categorization of the network flow information is stable over a period of time. 19. The method of claim 17, wherein the using deep learning includes:
applying a neural network to reveal similarities between the input vectors, wherein the applying the neural network produces output vectors; and summarizing the output vectors. 20. A computing system comprising a processor and memory, wherein the computing system implements a network analysis tool comprising:
an input module configured to receive network flow information; a pre-processor configured to pre-process the network flow information and produce input vectors; and a pattern extractor configured to:
use deep learning to extract patterns in the input vectors, wherein the deep learning is machine learning that models high-level abstractions in the input vectors; and
determine, based on the patterns, dependencies between multiple network assets. | A network analysis tool receives network flow information and uses deep learning—machine learning that models high-level abstractions in the network flow information—to identify dependencies between network assets. Based on the identified dependencies, the network analysis tool can discover functional relationships between network assets. For example, a network analysis tool receives network flow information, identifies dependencies between multiple network assets based on evaluation of the network flow information, and outputs results of the identification of the dependencies. When evaluating the network flow information, the network analysis tool can pre-process the network flow information to produce input vectors, use deep learning to extract patterns in the input vectors, and then determine dependencies based on the extracted patterns. The network analysis tool can repeat this process so as to update an assessment of the dependencies between network assets on a near real-time basis.1. One or more computer-readable media storing computer-executable instructions for causing a computing system, when programmed thereby, to perform:
receiving network flow information; identifying dependencies between multiple network assets based on evaluation of the network flow information, wherein the evaluation includes:
pre-processing the network flow information to produce input vectors;
using deep learning to extract patterns in the input vectors, wherein the deep learning is machine learning that models high-level abstractions in the input vectors; and
determining the dependencies based on the patterns; and
outputting results of the identifying the dependencies. 2. The one or more computer-readable media of claim 1, wherein the network flow information is packet flow information comprising an n-tuple per network flow, the network flow being an aggregation of packets that have common addressing attributes. 3. The one or more computer-readable media of claim 1, wherein the network flow information is received from multiple network probes situated in a network. 4. The one or more computer-readable media of claim 1, further storing computer-executable instructions for causing the computing system, when programmed thereby, to perform:
repeating the receiving, the identifying, and the outputting, so as to update an assessment of the dependencies between the multiple network assets on a near real-time basis. 5. The one or more computer-readable media of claim 1, wherein the dependencies are identified as recurrent temporal sequence-based patterns, and wherein each of the recurrent temporal sequence-based patterns is a randomly-initiated, repeating sequence of time-dependent elements. 6. The one or more computer-readable media of claim 1, wherein the pre-processing includes one or more of:
selectively converting unidirectional flow information to bidirectional flow information; windowing the network flow information using a time interval; categorizing network flows based on attributes of the network flow information; identifying instances of temporally proximate co-occurrences within the network flow information based on an ensemble approach; and checking that categorization of the network flow information is stable over a period of time. 7. The one or more computer-readable media of claim 6, wherein the categorizing assigns one of multiple categories as a function of attributes of a record of the network flow information, and wherein the attributes include one or more of source address, source port, destination address, destination port and protocol. 8. The one or more computer-readable media of claim 6, wherein the ensemble approach uses one or more of mutual information analysis, co-occurrence matrices followed by signal strength enhancement, clustering, auto-correlation/cross-correlation analysis, probability analysis, information-theoretic analysis, and cepstrum analysis. 9. The one or more computer-readable media of claim 6, wherein the instances are organized as a set of pairs of categorized records of the network flow information. 10. The one or more computer-readable media of claim 1, wherein the pre-processing includes:
combining instances of temporally proximate co-occurrences within the network flow information into higher-order combinations; encoding the higher-order combinations as the input vectors; and annotating the input vectors with details about the network flow information. 11. The one or more computer-readable media of claim 10, wherein the encoding indicates, for a given one of multiple possible higher-order combinations in a time interval, one of:
presence or absence of the given higher-order combination in the time interval; and count of the given higher-order combination in the time interval. 12. The one or more computer-readable media of claim 1, wherein the deep learning uses modeling architectures with non-linear transformations. 13. The one or more computer-readable media of claim 1, wherein the using deep learning includes:
applying a neural network to reveal similarities between the input vectors, wherein the applying the neural network produces output vectors; and summarizing the output vectors. 14. The one or more computer-readable media of claim 13, wherein the applying the neural network includes training a self-organizing map using the input vectors, and wherein the training the self-organizing map produces weight vectors for nodes of the self-organizing map, the weight vectors indicating the similarities between the input vectors. 15. The one or more computer-readable media of claim 13, wherein the summarizing includes:
performing hierarchical clustering on weight vectors produced by the neural network; and associating the clustered weight vectors with corresponding details about the network flow information. 16. The one or more computer-readable media of claim 13, wherein each of the input vectors includes, for a given time period, information indicating extent of co-occurrence of activity between network assets in various combinations, selected from among the multiple network assets, during the given time period, and wherein the summarizing makes the identification of the dependencies more robust over time. 17. In a computing system, a method comprising:
receiving, at the computing system, network flow information; with the computing system, identifying dependencies between multiple network assets based on evaluation of the network flow information, wherein the evaluation includes:
pre-processing the network flow information to produce input vectors;
using deep learning to extract patterns in the input vectors, wherein the deep learning is machine learning that models high-level abstractions in the input vectors; and
determining the dependencies based on the patterns; and
with the computing system, outputting results of the identifying the dependencies. 18. The method of claim 17, wherein the pre-processing includes one or more of:
selectively converting unidirectional flow information to bidirectional flow information; windowing the network flow information using a time interval; categorizing network flows based on attributes of the network flow information; identifying instances of temporally proximate co-occurrences within the network flow information based on an ensemble approach; and checking that categorization of the network flow information is stable over a period of time. 19. The method of claim 17, wherein the using deep learning includes:
applying a neural network to reveal similarities between the input vectors, wherein the applying the neural network produces output vectors; and summarizing the output vectors. 20. A computing system comprising a processor and memory, wherein the computing system implements a network analysis tool comprising:
an input module configured to receive network flow information; a pre-processor configured to pre-process the network flow information and produce input vectors; and a pattern extractor configured to:
use deep learning to extract patterns in the input vectors, wherein the deep learning is machine learning that models high-level abstractions in the input vectors; and
determine, based on the patterns, dependencies between multiple network assets. | 2,100 |
5,125 | 13,723,385 | 2,142 | Methods and apparatus for providing a trending tool for presenting trending information measured or collected with regard to a content page within the context of a display of the content page. In some cases, a trending tool may be used to present trending information based on analytics data for a given selectable item of the content page, such as a clickable link or image, where the trending information may be displayed proximate to the given selectable item within the user interface. The trending information may be determined from the analytics data over a given period or periods of time. Further, the visual presentation of the trending information within, for example, an overlay may be modified based on the trending information, or based on other selected elements of the analytics data or based on other calculations of the analytics data. | 1. A method, comprising:
performing, by one or more computing devices:
displaying, within a user interface, a content page comprising a plurality of selectable items, wherein each of the plurality of selectable items corresponds to measured analytics data;
retrieving trending information corresponding to the plurality of selectable items, wherein the trending information is based on the measured analytics data over one or more periods of time; and
displaying, within the user interface and within context of the content page, for each selectable item of the plurality of selectable items, a presentation of the trending information based on one or more portions of the trending information corresponding to the selectable item. 2. The method of claim 1, wherein said displaying comprises displaying the presentation of trending information within an overlay proximate to the corresponding selectable item. 3. The method of claim 1, wherein said displaying comprises displaying, for each of the plurality of selectable items, the presentation of trending information within a previously displayed overlay. 4. The method of claim 1, further comprising:
receiving input indicating a point in time along a trending graph, wherein the trending graph corresponds to the trending information for a selectable item; and updating, for the selectable item, displayed trending information to correspond to the point in time along the trending graph. 5. The method of claim 1, further comprising:
displaying, within context of the content, a respective overlay for each of the plurality of selectable items; and modifying, a visual characteristic of each respective overlay based on a positive or negative trend value of respective trending information for the selectable item of the plurality of selectable items. 6. The method of claim 1, wherein said displaying the trending information for the selectable item is displayed in a panel of the user interface and displayed proximate to a display of the content page without overlapping the display of the content page. 7. The method of claim 1, wherein said retrieving comprises communicating with an analytics data server to query the analytics data server for a subset of analytics data corresponding to parameters describing the plurality of selectable items and the one or more periods of time. 8. A system, comprising:
a data retrieval module implemented on one or more computing devices, wherein the data retrieval module is configured to:
retrieve trending information corresponding to a plurality of selectable items within a content page, wherein the trending information is based on the measured analytics data over one or more periods of time; and
a user interface module implemented on one or more computing devices, wherein the user interface module is configured to:
display the content page comprising the plurality of selectable items, wherein each of the plurality of selectable items corresponds to measured analytics data, and
display, within context of the content page, for each selectable item of the plurality of selectable items, a presentation of the trending information based on one or more portions of the trending information corresponding to the selectable item. 9. The system of claim 8, wherein to display the presentation of the trending information comprises displaying the presentation of trending information within an overlay proximate to the corresponding selectable item. 10. The system of claim 8, wherein to display the presentation of the trending information comprises displaying, for each of the plurality of selectable items, the presentation of trending information within a previously displayed overlay. 11. The system of claim 8, wherein the user interface module is further configured to:
receive input indicating a point in time along a trending graph, wherein the trending graph corresponds to the trending information for the item; and update, for the item, displayed trending information to correspond to the point in time along the trending graph. 12. The system of claim 8, wherein the user interface module is further configured to:
display, within context of the content, a respective overlay for each of the plurality of items; and modify, a visual characteristic of each respective overlay based on a positive or negative trend value of respective trending information for a respective item of the plurality of items. 13. The system of claim 8, wherein to display the presentation of the trending information comprises displaying the presentation of trending information within an overlay proximate to the corresponding selectable item. 14. The system of claim 8, wherein to display the presentation of the trending information comprises displaying, for each of the plurality of selectable items, the presentation of trending information within a previously displayed overlay. 15. A non-transitory computer-readable storage medium storing program instructions that when executed by a computing device cause the computing device to perform:
displaying, within a user interface, a content page comprising a plurality of selectable items, wherein each of the plurality of selectable items corresponds to measured analytics data; retrieving trending information corresponding to the plurality of selectable items, wherein the trending information is based on the measured analytics data over one or more periods of time; and displaying, within the user interface and within context of the content page, for each selectable item of the plurality of selectable items, a presentation of the trending information based on one or more portions of the trending information corresponding to the selectable item. 16. The non-transitory computer-readable storage medium of claim 15, wherein said displaying comprises displaying the presentation of trending information within an overlay proximate to the corresponding selectable item. 17. The non-transitory computer-readable storage medium of claim 15, wherein said displaying comprises displaying, for each of the plurality of selectable items, the presentation of trending information within a previously displayed overlay. 18. The non-transitory computer-readable storage medium of claim 15, wherein the non-transitory computer-readable storage medium further stores additional program instructions that when executed by the computing device cause the computing device to perform:
receiving input indicating a point in time along a trending graph, wherein the trending graph corresponds to the trending information for a selectable item; and updating, for the selectable item, displayed trending information to correspond to the point in time along the trending graph. 19. The non-transitory computer-readable storage medium of claim 15, wherein the non-transitory computer-readable storage medium further stores additional program instructions that when executed by the computing device cause the computing device to perform:
displaying, within context of the content, a respective overlay for each of the plurality of selectable items; and modifying, a visual characteristic of each respective overlay based on a positive or negative trend value of respective trending information for the selectable item of the plurality of selectable items. 20. The non-transitory computer-readable storage medium of claim 15, wherein said displaying the trending information for the selectable item is displayed in a panel of the user interface and displayed proximate to a display of the content page without overlapping the display of the content page. | Methods and apparatus for providing a trending tool for presenting trending information measured or collected with regard to a content page within the context of a display of the content page. In some cases, a trending tool may be used to present trending information based on analytics data for a given selectable item of the content page, such as a clickable link or image, where the trending information may be displayed proximate to the given selectable item within the user interface. The trending information may be determined from the analytics data over a given period or periods of time. Further, the visual presentation of the trending information within, for example, an overlay may be modified based on the trending information, or based on other selected elements of the analytics data or based on other calculations of the analytics data.1. A method, comprising:
performing, by one or more computing devices:
displaying, within a user interface, a content page comprising a plurality of selectable items, wherein each of the plurality of selectable items corresponds to measured analytics data;
retrieving trending information corresponding to the plurality of selectable items, wherein the trending information is based on the measured analytics data over one or more periods of time; and
displaying, within the user interface and within context of the content page, for each selectable item of the plurality of selectable items, a presentation of the trending information based on one or more portions of the trending information corresponding to the selectable item. 2. The method of claim 1, wherein said displaying comprises displaying the presentation of trending information within an overlay proximate to the corresponding selectable item. 3. The method of claim 1, wherein said displaying comprises displaying, for each of the plurality of selectable items, the presentation of trending information within a previously displayed overlay. 4. The method of claim 1, further comprising:
receiving input indicating a point in time along a trending graph, wherein the trending graph corresponds to the trending information for a selectable item; and updating, for the selectable item, displayed trending information to correspond to the point in time along the trending graph. 5. The method of claim 1, further comprising:
displaying, within context of the content, a respective overlay for each of the plurality of selectable items; and modifying, a visual characteristic of each respective overlay based on a positive or negative trend value of respective trending information for the selectable item of the plurality of selectable items. 6. The method of claim 1, wherein said displaying the trending information for the selectable item is displayed in a panel of the user interface and displayed proximate to a display of the content page without overlapping the display of the content page. 7. The method of claim 1, wherein said retrieving comprises communicating with an analytics data server to query the analytics data server for a subset of analytics data corresponding to parameters describing the plurality of selectable items and the one or more periods of time. 8. A system, comprising:
a data retrieval module implemented on one or more computing devices, wherein the data retrieval module is configured to:
retrieve trending information corresponding to a plurality of selectable items within a content page, wherein the trending information is based on the measured analytics data over one or more periods of time; and
a user interface module implemented on one or more computing devices, wherein the user interface module is configured to:
display the content page comprising the plurality of selectable items, wherein each of the plurality of selectable items corresponds to measured analytics data, and
display, within context of the content page, for each selectable item of the plurality of selectable items, a presentation of the trending information based on one or more portions of the trending information corresponding to the selectable item. 9. The system of claim 8, wherein to display the presentation of the trending information comprises displaying the presentation of trending information within an overlay proximate to the corresponding selectable item. 10. The system of claim 8, wherein to display the presentation of the trending information comprises displaying, for each of the plurality of selectable items, the presentation of trending information within a previously displayed overlay. 11. The system of claim 8, wherein the user interface module is further configured to:
receive input indicating a point in time along a trending graph, wherein the trending graph corresponds to the trending information for the item; and update, for the item, displayed trending information to correspond to the point in time along the trending graph. 12. The system of claim 8, wherein the user interface module is further configured to:
display, within context of the content, a respective overlay for each of the plurality of items; and modify, a visual characteristic of each respective overlay based on a positive or negative trend value of respective trending information for a respective item of the plurality of items. 13. The system of claim 8, wherein to display the presentation of the trending information comprises displaying the presentation of trending information within an overlay proximate to the corresponding selectable item. 14. The system of claim 8, wherein to display the presentation of the trending information comprises displaying, for each of the plurality of selectable items, the presentation of trending information within a previously displayed overlay. 15. A non-transitory computer-readable storage medium storing program instructions that when executed by a computing device cause the computing device to perform:
displaying, within a user interface, a content page comprising a plurality of selectable items, wherein each of the plurality of selectable items corresponds to measured analytics data; retrieving trending information corresponding to the plurality of selectable items, wherein the trending information is based on the measured analytics data over one or more periods of time; and displaying, within the user interface and within context of the content page, for each selectable item of the plurality of selectable items, a presentation of the trending information based on one or more portions of the trending information corresponding to the selectable item. 16. The non-transitory computer-readable storage medium of claim 15, wherein said displaying comprises displaying the presentation of trending information within an overlay proximate to the corresponding selectable item. 17. The non-transitory computer-readable storage medium of claim 15, wherein said displaying comprises displaying, for each of the plurality of selectable items, the presentation of trending information within a previously displayed overlay. 18. The non-transitory computer-readable storage medium of claim 15, wherein the non-transitory computer-readable storage medium further stores additional program instructions that when executed by the computing device cause the computing device to perform:
receiving input indicating a point in time along a trending graph, wherein the trending graph corresponds to the trending information for a selectable item; and updating, for the selectable item, displayed trending information to correspond to the point in time along the trending graph. 19. The non-transitory computer-readable storage medium of claim 15, wherein the non-transitory computer-readable storage medium further stores additional program instructions that when executed by the computing device cause the computing device to perform:
displaying, within context of the content, a respective overlay for each of the plurality of selectable items; and modifying, a visual characteristic of each respective overlay based on a positive or negative trend value of respective trending information for the selectable item of the plurality of selectable items. 20. The non-transitory computer-readable storage medium of claim 15, wherein said displaying the trending information for the selectable item is displayed in a panel of the user interface and displayed proximate to a display of the content page without overlapping the display of the content page. | 2,100 |
5,126 | 14,990,237 | 2,185 | A Universal Serial Bus (USB) cable assembly is configured to interconnect a USB device, such as a smartphone or digital music player, disposed within a motor vehicle with a USB hub disposed within the motor vehicle, such as in the vehicle's infotainment system. The USB cable assembly includes a first connector configured to interface with the USB hub, a second connector configured to interface with the USB device, and a plurality of wire cables interconnecting the first connector and the second connector. The USB cable assembly further includes a signal conditioning circuit in communication with the first connector, the second connector and the plurality of wire cables. The signal conditioning circuit is disposed intermediate the first connector and the second connector. | 1. A Universal Serial Bus (USB) cable assembly configured to interconnect a USB device disposed within a motor vehicle to a USB hub disposed within the same motor vehicle, said USB cable assembly comprising:
a first connector configured to interface with the USB hub; a second connector configured to interface with the USB device; an active signal conditioning circuit connected to the second connector and integral to the second connector; and a plurality of wire cables interconnecting the active signal conditioning circuit to the first connector, wherein the signal conditioning circuit is provided electrical power from the USB hub via two of the plurality of wire cables and wherein the USB cable assembly includes no circuitry other than the plurality of wire cables intermediate the active signal conditioning circuit and the first connector. 2. The USB cable assembly according to claim 1, wherein the USB cable assembly is between 0.5 and 5 meters long. 3.-4. (canceled) 5. The USB cable assembly according to claim 1, further comprising a housing encapsulating the second connector and the active signal conditioning circuit. 6. The USB cable assembly according to claim 1, wherein the USB cable assembly is disposed within the motor vehicle. 7. The USB cable assembly according to claim 6, wherein the USB cable assembly is interconnected with an infotainment system. 8. The USB cable assembly according to claim 1, wherein the USB cable assembly conforms to the USB 2.0 standard. 9. The USB cable assembly according to claim 8, wherein the USB cable assembly further conforms to the USB 3.1 standard. 10. The USB cable assembly according to claim 1, wherein the active signal conditioning circuit is configured to amplify only the high frequency content of the signal of a USB signal transmitted between the USB hub and the USB device. 11. (canceled) 12. The USB cable assembly according to claim 10, wherein the active signal conditioning circuit is configured to equalize the high frequency content of the signal of a USB signal transmitted between the USB hub and the USB device. | A Universal Serial Bus (USB) cable assembly is configured to interconnect a USB device, such as a smartphone or digital music player, disposed within a motor vehicle with a USB hub disposed within the motor vehicle, such as in the vehicle's infotainment system. The USB cable assembly includes a first connector configured to interface with the USB hub, a second connector configured to interface with the USB device, and a plurality of wire cables interconnecting the first connector and the second connector. The USB cable assembly further includes a signal conditioning circuit in communication with the first connector, the second connector and the plurality of wire cables. The signal conditioning circuit is disposed intermediate the first connector and the second connector.1. A Universal Serial Bus (USB) cable assembly configured to interconnect a USB device disposed within a motor vehicle to a USB hub disposed within the same motor vehicle, said USB cable assembly comprising:
a first connector configured to interface with the USB hub; a second connector configured to interface with the USB device; an active signal conditioning circuit connected to the second connector and integral to the second connector; and a plurality of wire cables interconnecting the active signal conditioning circuit to the first connector, wherein the signal conditioning circuit is provided electrical power from the USB hub via two of the plurality of wire cables and wherein the USB cable assembly includes no circuitry other than the plurality of wire cables intermediate the active signal conditioning circuit and the first connector. 2. The USB cable assembly according to claim 1, wherein the USB cable assembly is between 0.5 and 5 meters long. 3.-4. (canceled) 5. The USB cable assembly according to claim 1, further comprising a housing encapsulating the second connector and the active signal conditioning circuit. 6. The USB cable assembly according to claim 1, wherein the USB cable assembly is disposed within the motor vehicle. 7. The USB cable assembly according to claim 6, wherein the USB cable assembly is interconnected with an infotainment system. 8. The USB cable assembly according to claim 1, wherein the USB cable assembly conforms to the USB 2.0 standard. 9. The USB cable assembly according to claim 8, wherein the USB cable assembly further conforms to the USB 3.1 standard. 10. The USB cable assembly according to claim 1, wherein the active signal conditioning circuit is configured to amplify only the high frequency content of the signal of a USB signal transmitted between the USB hub and the USB device. 11. (canceled) 12. The USB cable assembly according to claim 10, wherein the active signal conditioning circuit is configured to equalize the high frequency content of the signal of a USB signal transmitted between the USB hub and the USB device. | 2,100 |
5,127 | 14,317,413 | 2,182 | Methods and apparatuses for generating a condition code for a floating point number operation prior to normalization. A processor receives an intermediate result for an operation, wherein the intermediate result comprises an intermediate significand and an intermediate exponent. A processor determines a mask based on the value of the intermediate exponent. A processor generates a masked significand by applying the mask to the intermediate significand. A processor generates a condition code based on the masked significand having a predetermined value. | 1-7. (canceled) 8. A computer program product for generating a condition code for a floating point number operation prior to normalization, the computer program product comprising:
a computer readable storage medium and program instructions stored on the computer readable storage medium, the program instructions comprising:
program instructions to receive an intermediate result for an operation, wherein the intermediate result comprises an intermediate significand and an intermediate exponent;
program instructions to determine a mask based, at least in part, on the value of the intermediate exponent;
program instructions to generate a masked significand by applying the mask to the intermediate significand; and
program instructions to generate a condition code based, at least in part, on the masked significand having a predetermined value. 9. The computer program product of claim 8, wherein the operation is one of (i) a addition of two operands or (ii) a subtraction of two operands. 10. The computer program product of claim 9, wherein the program instruction to generate the masked significand further comprises:
program instruction to maintain a value of a predetermined number of most significant bits of the intermediate significand, based, at least in part, on the determined mask; and program instructions to overwrite a value of a predetermined number of least significant bits of the intermediate significand, based, at least in part, on the determined mask. 11. The computer program product of claim 10, wherein the condition code indicates an underflow condition based, at least in part, on the predetermined number of most significant bits each having a zero value. 12. The computer program product of claim 8, wherein the operation is a conversion of an operand with a larger precision to a resultant with a smaller precision. 13. The computer program product of claim 12, wherein the program instruction to generate the masked significand further comprises:
program instruction to maintain a value of a predetermined number of least significant bits of the intermediate significand, based, at least in part, on the determined mask; and program instructions to overwrite a value of a predetermined number of most significant bits of the intermediate significand, based, at least in part, on the determined mask. 14. The computer program product of claim 13, wherein the condition code indicates an underflow condition based, at least in part, on the predetermined number of least significant bits each having a maximum value. 15. An apparatus for generating a condition code for operations performed in a floating point processor, wherein the condition code is based on an intermediate result of an operation prior to normalization of the intermediate result, comprising:
a first circuit logic to determine a mask based, at least in part, on an exponent of the intermediate result; and a second circuit logic to determine a condition code based, at least in part, on a value of the determined mask of the mask generation logic and a value of a significand of the intermediate result. 16. The apparatus of claim 15, wherein the operation is one of (i) a addition of two operands or (ii) a subtraction of two operands. 17. The apparatus of claim 16, wherein the first circuit logic further comprises:
a third circuit logic to maintain a value of a predetermined number of most significant bits of the intermediate significand, based, at least in part, on the determined mask; and a fourth circuit logic to overwrite a value of a predetermined number of least significant bits of the intermediate significand, based, at least in part, on the determined mask. 18. The apparatus of claim 17, wherein the condition code indicates an underflow condition based, at least in part, on the predetermined number of most significant bits each having a zero value. 19. The apparatus of claim 15, wherein the operation is a conversion of an operand with a larger precision to a resultant with a smaller precision. 20. The apparatus of claim 19, wherein the first circuit logic further comprises:
a fifth circuit logic to maintain a value of a predetermined number of least significant bits of the intermediate significand, based, at least in part, on the determined mask; and a sixth circuit logic to overwrite a value of a predetermined number of most significant bits of the intermediate significand, based, at least in part, on the determined mask. | Methods and apparatuses for generating a condition code for a floating point number operation prior to normalization. A processor receives an intermediate result for an operation, wherein the intermediate result comprises an intermediate significand and an intermediate exponent. A processor determines a mask based on the value of the intermediate exponent. A processor generates a masked significand by applying the mask to the intermediate significand. A processor generates a condition code based on the masked significand having a predetermined value.1-7. (canceled) 8. A computer program product for generating a condition code for a floating point number operation prior to normalization, the computer program product comprising:
a computer readable storage medium and program instructions stored on the computer readable storage medium, the program instructions comprising:
program instructions to receive an intermediate result for an operation, wherein the intermediate result comprises an intermediate significand and an intermediate exponent;
program instructions to determine a mask based, at least in part, on the value of the intermediate exponent;
program instructions to generate a masked significand by applying the mask to the intermediate significand; and
program instructions to generate a condition code based, at least in part, on the masked significand having a predetermined value. 9. The computer program product of claim 8, wherein the operation is one of (i) a addition of two operands or (ii) a subtraction of two operands. 10. The computer program product of claim 9, wherein the program instruction to generate the masked significand further comprises:
program instruction to maintain a value of a predetermined number of most significant bits of the intermediate significand, based, at least in part, on the determined mask; and program instructions to overwrite a value of a predetermined number of least significant bits of the intermediate significand, based, at least in part, on the determined mask. 11. The computer program product of claim 10, wherein the condition code indicates an underflow condition based, at least in part, on the predetermined number of most significant bits each having a zero value. 12. The computer program product of claim 8, wherein the operation is a conversion of an operand with a larger precision to a resultant with a smaller precision. 13. The computer program product of claim 12, wherein the program instruction to generate the masked significand further comprises:
program instruction to maintain a value of a predetermined number of least significant bits of the intermediate significand, based, at least in part, on the determined mask; and program instructions to overwrite a value of a predetermined number of most significant bits of the intermediate significand, based, at least in part, on the determined mask. 14. The computer program product of claim 13, wherein the condition code indicates an underflow condition based, at least in part, on the predetermined number of least significant bits each having a maximum value. 15. An apparatus for generating a condition code for operations performed in a floating point processor, wherein the condition code is based on an intermediate result of an operation prior to normalization of the intermediate result, comprising:
a first circuit logic to determine a mask based, at least in part, on an exponent of the intermediate result; and a second circuit logic to determine a condition code based, at least in part, on a value of the determined mask of the mask generation logic and a value of a significand of the intermediate result. 16. The apparatus of claim 15, wherein the operation is one of (i) a addition of two operands or (ii) a subtraction of two operands. 17. The apparatus of claim 16, wherein the first circuit logic further comprises:
a third circuit logic to maintain a value of a predetermined number of most significant bits of the intermediate significand, based, at least in part, on the determined mask; and a fourth circuit logic to overwrite a value of a predetermined number of least significant bits of the intermediate significand, based, at least in part, on the determined mask. 18. The apparatus of claim 17, wherein the condition code indicates an underflow condition based, at least in part, on the predetermined number of most significant bits each having a zero value. 19. The apparatus of claim 15, wherein the operation is a conversion of an operand with a larger precision to a resultant with a smaller precision. 20. The apparatus of claim 19, wherein the first circuit logic further comprises:
a fifth circuit logic to maintain a value of a predetermined number of least significant bits of the intermediate significand, based, at least in part, on the determined mask; and a sixth circuit logic to overwrite a value of a predetermined number of most significant bits of the intermediate significand, based, at least in part, on the determined mask. | 2,100 |
5,128 | 14,573,273 | 2,182 | Methods and apparatuses for generating a condition code for a floating point number operation prior to normalization. A processor receives an intermediate result for an operation, wherein the intermediate result comprises an intermediate significand and an intermediate exponent. A processor determines a mask based on the value of the intermediate exponent. A processor generates a masked significand by applying the mask to the intermediate significand. A processor generates a condition code based on the masked significand having a predetermined value. | 1. A method of generating a condition code for a floating point number operation prior to normalization, the method comprising:
receiving, by one or more processors, an intermediate result for an operation, wherein the intermediate result comprises an intermediate significand and an intermediate exponent; determining, by the one or more processors, a mask based, at least in part, on the value of the intermediate exponent; generating, by the one or more processors, a masked significand by applying the mask to the intermediate significand; and generating, by the one or more processors, a condition code based, at least in part, on the masked significand having a predetermined value. 2. The method of claim 1, wherein the operation is one of (i) an addition of two operands or (ii) a subtraction of two operands. 3. The method of claim 2, wherein generating the masked significand further comprises:
maintaining, by the one or more processors, a value of a predetermined number of most significant bits of the intermediate significand, based, at least in part, on the determined mask; and overwriting, by the one or more processors, a value of a predetermined number of least significant bits of the intermediate significand, based, at least in part, on the determined mask. 4. The method of claim 3, wherein the condition code indicates an underflow condition based, at least in part, on the predetermined number of most significant bits each having a zero value. 5. The method of claim 1, wherein the operation is a conversion of an operand with a larger precision to a resultant with a smaller precision. 6. The method of claim 5, wherein generating the masked significand further comprises:
maintaining, by the one or more processors, a value of a predetermined number of least significant bits of the intermediate significand, based, at least in part, on the determined mask; and overwriting, by the one or more processors, a value of a predetermined number of most significant bits of the intermediate significand, based, at least in part, on the determined mask. 7. The method of claim 6, wherein the condition code indicates an underflow condition based on the predetermined number of least significant bits each having a maximum value. | Methods and apparatuses for generating a condition code for a floating point number operation prior to normalization. A processor receives an intermediate result for an operation, wherein the intermediate result comprises an intermediate significand and an intermediate exponent. A processor determines a mask based on the value of the intermediate exponent. A processor generates a masked significand by applying the mask to the intermediate significand. A processor generates a condition code based on the masked significand having a predetermined value.1. A method of generating a condition code for a floating point number operation prior to normalization, the method comprising:
receiving, by one or more processors, an intermediate result for an operation, wherein the intermediate result comprises an intermediate significand and an intermediate exponent; determining, by the one or more processors, a mask based, at least in part, on the value of the intermediate exponent; generating, by the one or more processors, a masked significand by applying the mask to the intermediate significand; and generating, by the one or more processors, a condition code based, at least in part, on the masked significand having a predetermined value. 2. The method of claim 1, wherein the operation is one of (i) an addition of two operands or (ii) a subtraction of two operands. 3. The method of claim 2, wherein generating the masked significand further comprises:
maintaining, by the one or more processors, a value of a predetermined number of most significant bits of the intermediate significand, based, at least in part, on the determined mask; and overwriting, by the one or more processors, a value of a predetermined number of least significant bits of the intermediate significand, based, at least in part, on the determined mask. 4. The method of claim 3, wherein the condition code indicates an underflow condition based, at least in part, on the predetermined number of most significant bits each having a zero value. 5. The method of claim 1, wherein the operation is a conversion of an operand with a larger precision to a resultant with a smaller precision. 6. The method of claim 5, wherein generating the masked significand further comprises:
maintaining, by the one or more processors, a value of a predetermined number of least significant bits of the intermediate significand, based, at least in part, on the determined mask; and overwriting, by the one or more processors, a value of a predetermined number of most significant bits of the intermediate significand, based, at least in part, on the determined mask. 7. The method of claim 6, wherein the condition code indicates an underflow condition based on the predetermined number of least significant bits each having a maximum value. | 2,100 |
5,129 | 14,716,001 | 2,133 | Aspects disclosed herein include memory controllers employing memory capacity compression, and related processor-based systems and methods. In certain aspects, compressed memory controllers are employed that can provide memory capacity compression. In some aspects, a line-based memory capacity compression scheme can be employed where additional translation of a physical address (PA) to a physical buffer address is performed to allow compressed data in a system memory at the physical buffer address for efficient compressed data storage. A translation lookaside buffer (TLB) may also be employed to store TLB entries comprising PA tags corresponding to a physical buffer address in the system memory to more efficiently perform the translation of the PA to the physical buffer address in the system memory. In certain aspects, a line-based memory capacity compression scheme, a page-based memory capacity compression scheme, or a hybrid line-page-based memory capacity compression scheme can be employed. | 1. A compressed memory controller, comprising:
a memory interface configured to access a system memory; and a compressed controller configured to:
receive a memory access request comprising a physical address (PA) to be accessed in the system memory over a system bus;
translate the received PA in the received memory access request into a physical buffer address based on a mapping of the PA to the physical buffer address in an entry in a master directory comprising a plurality of physical buffer addresses each corresponding to a PA in the system memory; and
access the system memory based on the physical buffer address to perform the received memory access request. 2. The compressed memory controller of claim 1, wherein the compressed controller is configured to access the system memory based on an offset to the physical buffer address and a length associated with the entry in the master directory to perform the received memory access request. 3. The compressed memory controller of claim 1, wherein the compressed controller is configured to receive the memory access request comprising write data and a memory write operation comprising the PA to be written in the system memory;
the compressed controller further configured to:
compress the write data received in the memory write operation into compressed write data;
determine an available physical buffer address in the system memory for the memory write operation based on the compressed write data; and
the compressed memory controller configured to access the system memory based on the determined available physical buffer address to store the compressed write data for the memory write operation. 4. The compressed memory controller of claim 3, wherein the compressed controller is further configured to update the master directory to store the physical buffer address for the memory write operation in the entry of the master directory corresponding to the PA. 5. The compressed memory controller of claim 3, wherein the compressed memory controller is configured to update the master directory by being further configured to store an offset to the physical buffer address and a length associated with the entry in the master directory. 6. The compressed memory controller of claim 3, wherein the compressed controller is further configured to determine if the write data for the memory write operation is a fixed pattern;
if the write data for the memory write operation is the fixed pattern, the compressed controller is configured to:
update the entry in the master directory corresponding to the PA to indicate the fixed pattern for the memory write operation; and
not write the compressed write data for the memory write operation at the physical buffer address in the system memory. 7. The compressed memory controller of claim 3, wherein the entry in the master directory further comprises a pool indicator indicating a physical buffer pool in the system memory, based on the mapping of the PA to the physical buffer address;
wherein the compressed controller is configured to:
determine the available physical buffer address in the physical buffer pool corresponding to the pool indicator in the physical buffer address for the memory write operation; and
access the physical buffer pool corresponding to the pool indicator in the physical buffer address in the system memory to store the compressed write data for the memory write operation in the system memory based on the physical buffer address. 8. The compressed memory controller of claim 7, wherein the compressed controller is configured to access the physical buffer pool corresponding to the pool indicator in the physical buffer address in the system memory to store the compressed write data for the memory write operation in the system memory based on an offset from the physical buffer address. 9. The compressed memory controller of claim 7, wherein the compressed controller is configured to determine the available physical buffer address in the physical buffer pool for the memory write operation from a free nodes list corresponding to the physical buffer pool indicating at least one free physical buffer address in the system memory. 10. The compressed memory controller of claim 9, wherein, if the compressed controller is further configured to inform an operating system (OS) when a number of available physical buffer addresses in the free nodes list falls below a defined threshold. 11. The compressed memory controller of claim 9, wherein in response to determining the available physical buffer address in the physical buffer pool, the compressed controller is configured to pull at least one free physical buffer from the free nodes list into a local pull buffer for the available physical buffer address. 12. The compressed memory controller of claim 9, wherein the free nodes list is stored in the system memory. 13. The compressed memory controller of claim 1, wherein the compressed controller is configured to:
receive the memory access request comprising a memory read operation comprising the PA to be read in the system memory; access the system memory based on the physical buffer address to read compressed read data; decompress the compressed read data into uncompressed read data; and provide the uncompressed read data on the system bus for the memory read operation. 14. The compressed memory controller of claim 13, wherein the compressed controller is further configured to determine if read data for the memory read operation contains a predefined fixed pattern;
if the compressed read data for the memory read operation contains the predefined fixed pattern, the compressed controller is further configured to not access the system memory based on the physical buffer address to read the compressed read data. 15. The compressed memory controller of claim 1, wherein the compressed controller is configured to:
translate the received PA in the received memory access request into the physical buffer address in the master directory comprising a data line address in the system memory comprised of a plurality of data lines; and access the data line address in the system memory to perform the received memory access request. 16. The compressed memory controller of claim 15, wherein the entry in the master directory further comprises a pool indicator indicating a physical buffer pool among a plurality of different sized physical buffer pools in the system memory, based on the mapping of the PA to the physical buffer address. 17. The compressed memory controller of claim 16, wherein memory access request is comprised of a memory write operation, and
the compressed controller is configured to select the physical buffer pool among the plurality of different sized physical buffer pools based on a compression line size of a memory write operation for an available physical buffer address. 18. The compressed memory controller of claim 17, wherein if the selected physical buffer pool does not contain any available physical buffer addresses, the compressed controller is configured to select the physical buffer pool assigned to allocate the physical buffer address from another physical buffer pool assigned to a larger physical buffer. 19. The compressed memory controller of claim 18, wherein the compressed controller is further configured to, if the physical buffer address is not available in the physical buffer pool assigned to the larger physical buffers:
return the physical buffer address to a free nodes list corresponding to the physical buffer pool for the physical buffer address assigned to the larger physical buffers. 20. The compressed memory controller of claim 1, wherein the compressed controller is configured to:
translate the received PA in the received memory access request into the physical buffer address in the master directory based on a starting position and a length from a data page address in the system memory; and access compressed data of the length at the starting position from the data page address in the system memory to perform the received memory access request. 21. The compressed memory controller of claim 20, wherein the data page address comprises a data page in the system memory among a plurality of data pages each assigned to a data page size. 22. The compressed memory controller of claim 20, wherein the compressed controller is configured to translate the received PA by being further configured to select the starting position and the length from a plurality of starting positions and lengths associated with the data page address in the master directory based on at least a portion of the received PA. 23. The compressed memory controller of claim 1, wherein the compressed controller is configured to:
translate the received PA in the received memory access request into the physical buffer comprising a block address based on a data page corresponding to the received PA, a starting data block in the data page, and a data block length from the starting data block; and access compressed data of the data block length at the starting data block from the block address in the page buffer in the system memory to perform the received memory access request. 24. The compressed memory controller of claim 23, wherein the compressed controller is configured to translate the received PA in the received memory access request into the physical buffer comprising the block address based on the data page among a plurality of equally sized data pages, the data page corresponding to the received PA, a starting data block in the data page, and a data block length from the starting data block. 25. The compressed memory controller of claim 1, further comprising:
a translation lookaside buffer (TLB) comprised of a plurality of TLB entries in a tag array and a data array; and
each TLB entry among the plurality of TLB entries configured to store an entry from the master directory comprising a tag in the tag array corresponding to the PA and at least one physical buffer address into the system memory to compress data corresponding to the PA; and
the compressed controller configured to:
determine if the PA for the received memory access request is contained in a TLB entry in the TLB;
if the PA is contained in the TLB entry in the TLB, translate the received PA in the received memory access request as the physical buffer address in the TLB entry containing the PA; and
if the PA is not contained in the TLB entry in the TLB, translate the received PA in the received memory access request as the physical buffer address at the entry corresponding to the PA in the master directory. 26. The compressed memory controller of claim 25, wherein if the PA is not contained in the TLB entry in the TLB, the compressed controller is further configured to:
evict the TLB entry in the TLB; and store the entry in the master directory corresponding to the PA for the received memory access request. 27. The compressed memory controller of claim 1 integrated into an integrated circuit (IC). 28. The compressed memory controller of claim 1 integrated into a device selected from the group consisting of: a set top box; an entertainment unit; a navigation device; a communications device; a fixed location data unit; a mobile location data unit; a mobile phone; a cellular phone; a computer; a portable computer; a desktop computer; a personal digital assistant (PDA); a monitor; a computer monitor; a television; a tuner; a radio; a satellite radio; a music player; a digital music player; a portable music player; a digital video player; a video player; a digital video disc (DVD) player; and a portable digital video player. 29. A method of compressing data for a memory access request to a system memory in a central processing unit (CPU)-based system, comprising:
receiving a memory access request comprising a physical address (PA) to be accessed in a system memory over a system bus; translating the received PA in the received memory access request into a physical buffer address based on a mapping of the PA to the physical buffer address in an entry in a master directory comprising a plurality of physical buffer addresses each corresponding to the PA in the system memory; and accessing the system memory based on the physical buffer address to perform the received memory access request. 30. A central processing unit (CPU) system, comprising:
a system bus; at least one CPU core communicatively coupled to the system bus; a compressed memory controller communicatively coupled to the system bus; a system memory communicatively coupled to the system bus, the system memory configured to store memory data; a translation lookaside buffer (TLB) comprised of a plurality of TLB entries in a tag array and a data array;
each TLB entry among the plurality of TLB entries configured to store an entry from a master directory comprising a tag in the tag array corresponding to a physical address (PA) and at least one physical buffer address into the system memory to compress data corresponding to the PA;
a cache communicatively coupled to the system bus, the cache comprising a plurality of cache entries each configured to store uncompressed memory data corresponding to the PA; the cache configured to:
receive a memory access request from the at least one CPU core and the compressed memory controller over the system bus; and
provide the memory data corresponding to the PA of the received memory access request if the PA is contained in a cache entry in the cache; and
the compressed memory controller configured to receive the memory access request comprising the PA to be accessed in the system memory over the system bus; and
if the PA of the memory access request is not contained in the cache entry in the cache, the compressed memory controller is further configured to:
determine if the PA for the received memory access request is contained in a TLB entry in the TLB;
if the PA is contained in the TLB entry in the TLB, translate the received PA in the received memory access request as the physical buffer address in the TLB entry containing the PA;
if the PA is not contained in the TLB entry in the TLB, translate the received PA in the received memory access request as the physical buffer address at the entry corresponding to the PA in the master directory; and
access the system memory based on the physical buffer address to perform the received memory access request. | Aspects disclosed herein include memory controllers employing memory capacity compression, and related processor-based systems and methods. In certain aspects, compressed memory controllers are employed that can provide memory capacity compression. In some aspects, a line-based memory capacity compression scheme can be employed where additional translation of a physical address (PA) to a physical buffer address is performed to allow compressed data in a system memory at the physical buffer address for efficient compressed data storage. A translation lookaside buffer (TLB) may also be employed to store TLB entries comprising PA tags corresponding to a physical buffer address in the system memory to more efficiently perform the translation of the PA to the physical buffer address in the system memory. In certain aspects, a line-based memory capacity compression scheme, a page-based memory capacity compression scheme, or a hybrid line-page-based memory capacity compression scheme can be employed.1. A compressed memory controller, comprising:
a memory interface configured to access a system memory; and a compressed controller configured to:
receive a memory access request comprising a physical address (PA) to be accessed in the system memory over a system bus;
translate the received PA in the received memory access request into a physical buffer address based on a mapping of the PA to the physical buffer address in an entry in a master directory comprising a plurality of physical buffer addresses each corresponding to a PA in the system memory; and
access the system memory based on the physical buffer address to perform the received memory access request. 2. The compressed memory controller of claim 1, wherein the compressed controller is configured to access the system memory based on an offset to the physical buffer address and a length associated with the entry in the master directory to perform the received memory access request. 3. The compressed memory controller of claim 1, wherein the compressed controller is configured to receive the memory access request comprising write data and a memory write operation comprising the PA to be written in the system memory;
the compressed controller further configured to:
compress the write data received in the memory write operation into compressed write data;
determine an available physical buffer address in the system memory for the memory write operation based on the compressed write data; and
the compressed memory controller configured to access the system memory based on the determined available physical buffer address to store the compressed write data for the memory write operation. 4. The compressed memory controller of claim 3, wherein the compressed controller is further configured to update the master directory to store the physical buffer address for the memory write operation in the entry of the master directory corresponding to the PA. 5. The compressed memory controller of claim 3, wherein the compressed memory controller is configured to update the master directory by being further configured to store an offset to the physical buffer address and a length associated with the entry in the master directory. 6. The compressed memory controller of claim 3, wherein the compressed controller is further configured to determine if the write data for the memory write operation is a fixed pattern;
if the write data for the memory write operation is the fixed pattern, the compressed controller is configured to:
update the entry in the master directory corresponding to the PA to indicate the fixed pattern for the memory write operation; and
not write the compressed write data for the memory write operation at the physical buffer address in the system memory. 7. The compressed memory controller of claim 3, wherein the entry in the master directory further comprises a pool indicator indicating a physical buffer pool in the system memory, based on the mapping of the PA to the physical buffer address;
wherein the compressed controller is configured to:
determine the available physical buffer address in the physical buffer pool corresponding to the pool indicator in the physical buffer address for the memory write operation; and
access the physical buffer pool corresponding to the pool indicator in the physical buffer address in the system memory to store the compressed write data for the memory write operation in the system memory based on the physical buffer address. 8. The compressed memory controller of claim 7, wherein the compressed controller is configured to access the physical buffer pool corresponding to the pool indicator in the physical buffer address in the system memory to store the compressed write data for the memory write operation in the system memory based on an offset from the physical buffer address. 9. The compressed memory controller of claim 7, wherein the compressed controller is configured to determine the available physical buffer address in the physical buffer pool for the memory write operation from a free nodes list corresponding to the physical buffer pool indicating at least one free physical buffer address in the system memory. 10. The compressed memory controller of claim 9, wherein, if the compressed controller is further configured to inform an operating system (OS) when a number of available physical buffer addresses in the free nodes list falls below a defined threshold. 11. The compressed memory controller of claim 9, wherein in response to determining the available physical buffer address in the physical buffer pool, the compressed controller is configured to pull at least one free physical buffer from the free nodes list into a local pull buffer for the available physical buffer address. 12. The compressed memory controller of claim 9, wherein the free nodes list is stored in the system memory. 13. The compressed memory controller of claim 1, wherein the compressed controller is configured to:
receive the memory access request comprising a memory read operation comprising the PA to be read in the system memory; access the system memory based on the physical buffer address to read compressed read data; decompress the compressed read data into uncompressed read data; and provide the uncompressed read data on the system bus for the memory read operation. 14. The compressed memory controller of claim 13, wherein the compressed controller is further configured to determine if read data for the memory read operation contains a predefined fixed pattern;
if the compressed read data for the memory read operation contains the predefined fixed pattern, the compressed controller is further configured to not access the system memory based on the physical buffer address to read the compressed read data. 15. The compressed memory controller of claim 1, wherein the compressed controller is configured to:
translate the received PA in the received memory access request into the physical buffer address in the master directory comprising a data line address in the system memory comprised of a plurality of data lines; and access the data line address in the system memory to perform the received memory access request. 16. The compressed memory controller of claim 15, wherein the entry in the master directory further comprises a pool indicator indicating a physical buffer pool among a plurality of different sized physical buffer pools in the system memory, based on the mapping of the PA to the physical buffer address. 17. The compressed memory controller of claim 16, wherein memory access request is comprised of a memory write operation, and
the compressed controller is configured to select the physical buffer pool among the plurality of different sized physical buffer pools based on a compression line size of a memory write operation for an available physical buffer address. 18. The compressed memory controller of claim 17, wherein if the selected physical buffer pool does not contain any available physical buffer addresses, the compressed controller is configured to select the physical buffer pool assigned to allocate the physical buffer address from another physical buffer pool assigned to a larger physical buffer. 19. The compressed memory controller of claim 18, wherein the compressed controller is further configured to, if the physical buffer address is not available in the physical buffer pool assigned to the larger physical buffers:
return the physical buffer address to a free nodes list corresponding to the physical buffer pool for the physical buffer address assigned to the larger physical buffers. 20. The compressed memory controller of claim 1, wherein the compressed controller is configured to:
translate the received PA in the received memory access request into the physical buffer address in the master directory based on a starting position and a length from a data page address in the system memory; and access compressed data of the length at the starting position from the data page address in the system memory to perform the received memory access request. 21. The compressed memory controller of claim 20, wherein the data page address comprises a data page in the system memory among a plurality of data pages each assigned to a data page size. 22. The compressed memory controller of claim 20, wherein the compressed controller is configured to translate the received PA by being further configured to select the starting position and the length from a plurality of starting positions and lengths associated with the data page address in the master directory based on at least a portion of the received PA. 23. The compressed memory controller of claim 1, wherein the compressed controller is configured to:
translate the received PA in the received memory access request into the physical buffer comprising a block address based on a data page corresponding to the received PA, a starting data block in the data page, and a data block length from the starting data block; and access compressed data of the data block length at the starting data block from the block address in the page buffer in the system memory to perform the received memory access request. 24. The compressed memory controller of claim 23, wherein the compressed controller is configured to translate the received PA in the received memory access request into the physical buffer comprising the block address based on the data page among a plurality of equally sized data pages, the data page corresponding to the received PA, a starting data block in the data page, and a data block length from the starting data block. 25. The compressed memory controller of claim 1, further comprising:
a translation lookaside buffer (TLB) comprised of a plurality of TLB entries in a tag array and a data array; and
each TLB entry among the plurality of TLB entries configured to store an entry from the master directory comprising a tag in the tag array corresponding to the PA and at least one physical buffer address into the system memory to compress data corresponding to the PA; and
the compressed controller configured to:
determine if the PA for the received memory access request is contained in a TLB entry in the TLB;
if the PA is contained in the TLB entry in the TLB, translate the received PA in the received memory access request as the physical buffer address in the TLB entry containing the PA; and
if the PA is not contained in the TLB entry in the TLB, translate the received PA in the received memory access request as the physical buffer address at the entry corresponding to the PA in the master directory. 26. The compressed memory controller of claim 25, wherein if the PA is not contained in the TLB entry in the TLB, the compressed controller is further configured to:
evict the TLB entry in the TLB; and store the entry in the master directory corresponding to the PA for the received memory access request. 27. The compressed memory controller of claim 1 integrated into an integrated circuit (IC). 28. The compressed memory controller of claim 1 integrated into a device selected from the group consisting of: a set top box; an entertainment unit; a navigation device; a communications device; a fixed location data unit; a mobile location data unit; a mobile phone; a cellular phone; a computer; a portable computer; a desktop computer; a personal digital assistant (PDA); a monitor; a computer monitor; a television; a tuner; a radio; a satellite radio; a music player; a digital music player; a portable music player; a digital video player; a video player; a digital video disc (DVD) player; and a portable digital video player. 29. A method of compressing data for a memory access request to a system memory in a central processing unit (CPU)-based system, comprising:
receiving a memory access request comprising a physical address (PA) to be accessed in a system memory over a system bus; translating the received PA in the received memory access request into a physical buffer address based on a mapping of the PA to the physical buffer address in an entry in a master directory comprising a plurality of physical buffer addresses each corresponding to the PA in the system memory; and accessing the system memory based on the physical buffer address to perform the received memory access request. 30. A central processing unit (CPU) system, comprising:
a system bus; at least one CPU core communicatively coupled to the system bus; a compressed memory controller communicatively coupled to the system bus; a system memory communicatively coupled to the system bus, the system memory configured to store memory data; a translation lookaside buffer (TLB) comprised of a plurality of TLB entries in a tag array and a data array;
each TLB entry among the plurality of TLB entries configured to store an entry from a master directory comprising a tag in the tag array corresponding to a physical address (PA) and at least one physical buffer address into the system memory to compress data corresponding to the PA;
a cache communicatively coupled to the system bus, the cache comprising a plurality of cache entries each configured to store uncompressed memory data corresponding to the PA; the cache configured to:
receive a memory access request from the at least one CPU core and the compressed memory controller over the system bus; and
provide the memory data corresponding to the PA of the received memory access request if the PA is contained in a cache entry in the cache; and
the compressed memory controller configured to receive the memory access request comprising the PA to be accessed in the system memory over the system bus; and
if the PA of the memory access request is not contained in the cache entry in the cache, the compressed memory controller is further configured to:
determine if the PA for the received memory access request is contained in a TLB entry in the TLB;
if the PA is contained in the TLB entry in the TLB, translate the received PA in the received memory access request as the physical buffer address in the TLB entry containing the PA;
if the PA is not contained in the TLB entry in the TLB, translate the received PA in the received memory access request as the physical buffer address at the entry corresponding to the PA in the master directory; and
access the system memory based on the physical buffer address to perform the received memory access request. | 2,100 |
5,130 | 14,804,654 | 2,113 | Associating error events with inputs to applications can refer to associating each of a plurality of different error event types encountered in response to an input to an element of an application displayed in a graphical user interface (GUI) of a user device with a unique identifier of the input and representing an error event type of the different error event types associated with the unique input identifier in a GUI of a support device | 1. A system, comprising:
an associate engine to associate each of a plurality of different error event types encountered in response to an input to an element of an application displayed in a graphical user interface (GUI) of a user device with a unique identifier of the input; and a represent engine to represent an error event type of the different error event types associated with the unique input identifier in a GUI of a support device. 2. The system of claim 1, where the representation of the error event type of the different error event types includes an error event notification message originally displayed by the GUI of the user device. 3. The system of claim 1, where the application is a mobile application and where the user device is a mobile user device. 4. The system of claim 3, including a record engine to record the plurality of different error event types during all sessions of all users using the mobile application on a plurality of mobile user devices. 5. The system of claim 1, where the plurality of different error event types include a first error event type that is a Hypertext Transfer Protocol error event, a crash error event, or a handled exception error event. 6. The system of claim 5, including a second error event type that is an error event notification message displayed in the GUI of the user device in response to occurrence of the first error event type. 7. The system of claim 1, where the user device and the support device are separate and distinct. 8. A non-transitory machine-readable medium including instructions executable by a machine to cause the machine to
record different error event message types displayed in graphical user interfaces (GUI)s of mobile user devices in response to an input to an element of a mobile application displayed in the GUIs, where the inputs are identified by a unique input identifier; associate each of the different error event message types with the unique input identifier of the input; and represent each of the different error event message types associated with the unique input identifier in a GUI of a support device. 9. The medium of claim 8, including instructions to represent each of the different error event message types in response to a selection provided via the GUI of the support device to drill down on a representation of the input. 10. The medium of claim 8, including instructions to display a percentage of a total number of inputs to the element displayed in the GUIs of the mobile user devices that resulted in error events. 11. The medium of claim 8, including instructions to associate each of the different error event message types with a single unique input identifier of the input. 12. A method, comprising:
recording different error event message types displayed in a plurality of graphical user interface (GUI)s of a plurality of user devices in response to a input to an element of a mobile application displayed in the GUIs during sessions of the mobile application; associating each of the recorded different error event message types with an unique identifier of the input; and representing each of the different error event message types associated with the unique input identifier in a GUI of a support device. 13. The method of claim 12, including representing each of the different error event types at the same time in the GUI of the support device. 14. The method of claim 12, including associating respective thread identifiers of each of the recorded different error event message types with a unique identifier of the input. 15. The method of claim 12, including displaying content of at least one of the different error event message types in the GUI of the support device as it appeared to a user of the user device. | Associating error events with inputs to applications can refer to associating each of a plurality of different error event types encountered in response to an input to an element of an application displayed in a graphical user interface (GUI) of a user device with a unique identifier of the input and representing an error event type of the different error event types associated with the unique input identifier in a GUI of a support device1. A system, comprising:
an associate engine to associate each of a plurality of different error event types encountered in response to an input to an element of an application displayed in a graphical user interface (GUI) of a user device with a unique identifier of the input; and a represent engine to represent an error event type of the different error event types associated with the unique input identifier in a GUI of a support device. 2. The system of claim 1, where the representation of the error event type of the different error event types includes an error event notification message originally displayed by the GUI of the user device. 3. The system of claim 1, where the application is a mobile application and where the user device is a mobile user device. 4. The system of claim 3, including a record engine to record the plurality of different error event types during all sessions of all users using the mobile application on a plurality of mobile user devices. 5. The system of claim 1, where the plurality of different error event types include a first error event type that is a Hypertext Transfer Protocol error event, a crash error event, or a handled exception error event. 6. The system of claim 5, including a second error event type that is an error event notification message displayed in the GUI of the user device in response to occurrence of the first error event type. 7. The system of claim 1, where the user device and the support device are separate and distinct. 8. A non-transitory machine-readable medium including instructions executable by a machine to cause the machine to
record different error event message types displayed in graphical user interfaces (GUI)s of mobile user devices in response to an input to an element of a mobile application displayed in the GUIs, where the inputs are identified by a unique input identifier; associate each of the different error event message types with the unique input identifier of the input; and represent each of the different error event message types associated with the unique input identifier in a GUI of a support device. 9. The medium of claim 8, including instructions to represent each of the different error event message types in response to a selection provided via the GUI of the support device to drill down on a representation of the input. 10. The medium of claim 8, including instructions to display a percentage of a total number of inputs to the element displayed in the GUIs of the mobile user devices that resulted in error events. 11. The medium of claim 8, including instructions to associate each of the different error event message types with a single unique input identifier of the input. 12. A method, comprising:
recording different error event message types displayed in a plurality of graphical user interface (GUI)s of a plurality of user devices in response to a input to an element of a mobile application displayed in the GUIs during sessions of the mobile application; associating each of the recorded different error event message types with an unique identifier of the input; and representing each of the different error event message types associated with the unique input identifier in a GUI of a support device. 13. The method of claim 12, including representing each of the different error event types at the same time in the GUI of the support device. 14. The method of claim 12, including associating respective thread identifiers of each of the recorded different error event message types with a unique identifier of the input. 15. The method of claim 12, including displaying content of at least one of the different error event message types in the GUI of the support device as it appeared to a user of the user device. | 2,100 |
5,131 | 14,516,293 | 2,119 | The invention relates to a method for controlling thermal properties of a node. The method steps include calculating, using a temperature reading, a transmission duty cycle of the node, calculating a data amount capable of being transmitted with the transmission duty cycle, and transmitting, from a network interface of the node, a plurality of available data at a rate less than the data amount based on a priority of the plurality of available data. | 1. A method for controlling thermal properties of a node, comprising:
calculating, using a temperature reading, a transmission duty cycle of the node; calculating a data amount capable of being transmitted with the transmission duty cycle; and transmitting, from a network interface of the node, a plurality of available data at a rate less than the data amount based on a priority of the plurality of available data. 2. The method of claim 1, further comprising:
receiving the plurality of available data; determining the priority of the plurality of available data; and associating the priority with the plurality of available data. 3. The method of claim 1, further comprising:
cooling the node for a predetermined period of time. 4. The method of claim 3, further comprising:
increasing the predetermined period of time for cooling the node. 5. The method of claim 3, further comprising:
powering down the network interface of the node. 6. The method of claim 3, further comprising:
idling the network interface of the node. 7. The method of claim 1 wherein transmitting the plurality of available data further comprises:
transmitting available data above a minimum priority. 8. The method of claim 1, wherein transmitting the plurality of available data further comprises:
transmitting available data in a decreasing order of priority. 9. The method of claim 1, wherein the network interface is a cellular modem. 10. The method of claim 1, wherein the network interface is operatively connected to a mesh network. 11. A system for controlling thermal properties of a node, comprising:
a transmission network; and a server and the node operatively connected to the server via the transmission network, wherein the node comprises a first processor configured to:
calculate, using a temperature reading, a transmission duty cycle of the node;
calculate a data amount capable of being transmitted with the transmission duty cycle; and
transmit, from a network interface of the node, a plurality of available data at a rate less than the data amount based on a priority of the plurality of the available data. 12. The system of claim 11, wherein the first processor is further configured to:
receive the plurality of the available data; determine the priority of the plurality of the available data; and associate the priority with the plurality of the available data. 13. The system of claim 11, the first processor is further configured to:
cool the node for a predetermined period of time. 14. The system of claim 11, further comprising:
a second processor configured to:
calculate, using the temperature reading, the transmission duty cycle of the node;
calculate the data amount capable of being transmitted with the transmission duty cycle; and
transmit, from the network interface of the node, the plurality of available data at a rate less than the data amount based on the priority of the plurality of the available data. 15. The system of claim 11, wherein the second processor is further configured to:
cool the node for a predetermined period of time. 16. The system of claim 11, wherein the node and the server are connected via a cellular data network. 17. The system of claim 11, further comprising:
a second node connected to the node. 18. The system of claim 17, wherein the second node is connected to the node via a mesh network. 19. A non-transitory computer readable medium comprising instructions which, when executed by one or more hardware processors, causes operations to:
calculate, using a temperature reading, a transmission duty cycle of the node; calculate a data amount capable of being transmitted with the transmission duty cycle; and transmit, from a network interface of the node, a plurality of available data at a rate less than the data amount based on the priority of the plurality of the available data. 20. The non-transitory computer readable medium of claim 19 further comprising executable instructions to:
receive the plurality of the available data;
determine the priority of the plurality of the available data; and
associate the priority with the plurality of the available data. | The invention relates to a method for controlling thermal properties of a node. The method steps include calculating, using a temperature reading, a transmission duty cycle of the node, calculating a data amount capable of being transmitted with the transmission duty cycle, and transmitting, from a network interface of the node, a plurality of available data at a rate less than the data amount based on a priority of the plurality of available data.1. A method for controlling thermal properties of a node, comprising:
calculating, using a temperature reading, a transmission duty cycle of the node; calculating a data amount capable of being transmitted with the transmission duty cycle; and transmitting, from a network interface of the node, a plurality of available data at a rate less than the data amount based on a priority of the plurality of available data. 2. The method of claim 1, further comprising:
receiving the plurality of available data; determining the priority of the plurality of available data; and associating the priority with the plurality of available data. 3. The method of claim 1, further comprising:
cooling the node for a predetermined period of time. 4. The method of claim 3, further comprising:
increasing the predetermined period of time for cooling the node. 5. The method of claim 3, further comprising:
powering down the network interface of the node. 6. The method of claim 3, further comprising:
idling the network interface of the node. 7. The method of claim 1 wherein transmitting the plurality of available data further comprises:
transmitting available data above a minimum priority. 8. The method of claim 1, wherein transmitting the plurality of available data further comprises:
transmitting available data in a decreasing order of priority. 9. The method of claim 1, wherein the network interface is a cellular modem. 10. The method of claim 1, wherein the network interface is operatively connected to a mesh network. 11. A system for controlling thermal properties of a node, comprising:
a transmission network; and a server and the node operatively connected to the server via the transmission network, wherein the node comprises a first processor configured to:
calculate, using a temperature reading, a transmission duty cycle of the node;
calculate a data amount capable of being transmitted with the transmission duty cycle; and
transmit, from a network interface of the node, a plurality of available data at a rate less than the data amount based on a priority of the plurality of the available data. 12. The system of claim 11, wherein the first processor is further configured to:
receive the plurality of the available data; determine the priority of the plurality of the available data; and associate the priority with the plurality of the available data. 13. The system of claim 11, the first processor is further configured to:
cool the node for a predetermined period of time. 14. The system of claim 11, further comprising:
a second processor configured to:
calculate, using the temperature reading, the transmission duty cycle of the node;
calculate the data amount capable of being transmitted with the transmission duty cycle; and
transmit, from the network interface of the node, the plurality of available data at a rate less than the data amount based on the priority of the plurality of the available data. 15. The system of claim 11, wherein the second processor is further configured to:
cool the node for a predetermined period of time. 16. The system of claim 11, wherein the node and the server are connected via a cellular data network. 17. The system of claim 11, further comprising:
a second node connected to the node. 18. The system of claim 17, wherein the second node is connected to the node via a mesh network. 19. A non-transitory computer readable medium comprising instructions which, when executed by one or more hardware processors, causes operations to:
calculate, using a temperature reading, a transmission duty cycle of the node; calculate a data amount capable of being transmitted with the transmission duty cycle; and transmit, from a network interface of the node, a plurality of available data at a rate less than the data amount based on the priority of the plurality of the available data. 20. The non-transitory computer readable medium of claim 19 further comprising executable instructions to:
receive the plurality of the available data;
determine the priority of the plurality of the available data; and
associate the priority with the plurality of the available data. | 2,100 |
5,132 | 12,881,277 | 2,143 | A method of providing an interface in a terminal equipped with a touch screen, including displaying a first screen when receiving an unlock input for displaying the preset first screen. A screen change input for changing a part or an entire of the first screen into a preset second screen is received through the touch screen displaying the first screen; and changing a part of screen displayed on the touch screen from the first screen into the second screen according to a progress of the screen change input. | 1. A method of providing an interface in a terminal equipped with a touch screen, comprising:
displaying a first screen when receiving an unlock input touch command for displaying a preset first screen; receiving a screen change input touch command for changing a part or an entirety of the first screen into a preset second screen through the touch screen displaying the first screen; and changing a part of a screen displayed on the touch screen from the first screen into the second screen according to a progress of the screen change input command. 2. The method of claim 1, wherein the received screen change touch input command is a predetermined movement along a specific part of the touch screen that changes screen allocation so that a size of the part of the screen displayed as the first screen is reduced as a part of the touch screen displayed as the second screen is increased in correspondence with a distance of a predetermined movement along the specific part of the touch screen. 3. The method of claim 1, wherein the preset first screen comprises a screen displaying a zipper, and the screen change input comprises a touch input in which a predetermined movement drags a handle of the zipper displayed on the first screen to open,
wherein changing a part of the screen displayed on the touch screen from the first screen displayed into the second screen displayed comprises changing a screen display of a part where the zipper is opened from the first screen into the second screen as the handle of zipper is dragged. 4. The method of claim 1, wherein the preset first screen comprises a screen displaying a plurality of buttons, and wherein the screen change input comprises a touch input which touches the plurality of buttons displayed on the first screen to open, wherein changing a part of the screen comprises changing a screen of a part where the button is opened from the first screen into the second screen as the plurality of buttons are opened. 5. The method of claim 1, wherein the preset first screen comprises a screen displaying a knot, wherein the screen change input comprises a touch input which drags a part of the knot displayed on the first screen to release, wherein changing a part of screen comprises changing a part of screen displayed on the touch screen from the first screen into the second screen according to a ratio in which the knot is released. 6. The method of claim 1, wherein the preset first screen comprises a screen displaying a door, wherein the screen change input comprises a touch input which drags a handle of the door displayed on the first screen to open, wherein changing a part of screen comprises changing a display of less than an entirety a screen of a part where the door is opened from the first screen into the second screen as the handle of the door is dragged. 7. A terminal for providing an interface, comprising:
a touch screen comprising a touch sensor which is configured to receive an unlock input touch command for displaying a preset first screen and a screen change input for changing a part or an entirety of the first screen into a preset second screen, and a display unit which is configured to display a screen under the control of the controller; and a controller controlling the display unit to display the first screen when the touch sensor senses the unlock input touch command, controlling the display unit to change a part of screen displayed on the display unit from the first screen into the second screen according to a progress of the screen change input touch command sensed by the touch sensor. 8. The terminal of claim 7, wherein the preset first screen comprises a screen displaying a zipper, and wherein the screen change input comprises a touch input command which drags a handle of the zipper displayed on the first screen to open, and the controller controls the display unit to change a screen of a part where the zipper is opened from the first screen into the second screen as the handle of zipper is dragged. 9. The terminal of claim 7, wherein the preset first screen is a screen displaying a plurality of buttons, the screen change input is a touch input which touches the plurality of buttons displayed on the first screen to open, and the controller controls the display unit to change a screen of a part where the button is opened from the first screen into the second screen as the plurality of buttons are opened. 10. The terminal of claim 7, wherein the preset first screen is a screen displaying a knot, the screen change input touch command is a touch input which drags a part of the knot displayed on the first screen to release, and the controller controls the display unit to change a part of screen displayed on the touch screen from the first screen into the second screen according to a ratio in which the knot is released. 11. The terminal of claim 7, wherein the preset first screen comprises a screen displaying a door, the screen change input touch command is a touch input which drags a handle of the door displayed on the first screen to open the door, and the controller controls the display unit to change a part of the screen where the door is opened from the first screen into the second screen as the handle of the door is dragged. 12. The terminal of claim 7, wherein the received screen change touch input command is a predetermined movement along a specific part of the touch screen that changes screen allocation so that a size of the part of the screen displayed as the first screen is reduced as a part of the touch screen displayed as the second screen is increased in correspondence with a distance of a predetermined movement along the specific part of the touch screen | A method of providing an interface in a terminal equipped with a touch screen, including displaying a first screen when receiving an unlock input for displaying the preset first screen. A screen change input for changing a part or an entire of the first screen into a preset second screen is received through the touch screen displaying the first screen; and changing a part of screen displayed on the touch screen from the first screen into the second screen according to a progress of the screen change input.1. A method of providing an interface in a terminal equipped with a touch screen, comprising:
displaying a first screen when receiving an unlock input touch command for displaying a preset first screen; receiving a screen change input touch command for changing a part or an entirety of the first screen into a preset second screen through the touch screen displaying the first screen; and changing a part of a screen displayed on the touch screen from the first screen into the second screen according to a progress of the screen change input command. 2. The method of claim 1, wherein the received screen change touch input command is a predetermined movement along a specific part of the touch screen that changes screen allocation so that a size of the part of the screen displayed as the first screen is reduced as a part of the touch screen displayed as the second screen is increased in correspondence with a distance of a predetermined movement along the specific part of the touch screen. 3. The method of claim 1, wherein the preset first screen comprises a screen displaying a zipper, and the screen change input comprises a touch input in which a predetermined movement drags a handle of the zipper displayed on the first screen to open,
wherein changing a part of the screen displayed on the touch screen from the first screen displayed into the second screen displayed comprises changing a screen display of a part where the zipper is opened from the first screen into the second screen as the handle of zipper is dragged. 4. The method of claim 1, wherein the preset first screen comprises a screen displaying a plurality of buttons, and wherein the screen change input comprises a touch input which touches the plurality of buttons displayed on the first screen to open, wherein changing a part of the screen comprises changing a screen of a part where the button is opened from the first screen into the second screen as the plurality of buttons are opened. 5. The method of claim 1, wherein the preset first screen comprises a screen displaying a knot, wherein the screen change input comprises a touch input which drags a part of the knot displayed on the first screen to release, wherein changing a part of screen comprises changing a part of screen displayed on the touch screen from the first screen into the second screen according to a ratio in which the knot is released. 6. The method of claim 1, wherein the preset first screen comprises a screen displaying a door, wherein the screen change input comprises a touch input which drags a handle of the door displayed on the first screen to open, wherein changing a part of screen comprises changing a display of less than an entirety a screen of a part where the door is opened from the first screen into the second screen as the handle of the door is dragged. 7. A terminal for providing an interface, comprising:
a touch screen comprising a touch sensor which is configured to receive an unlock input touch command for displaying a preset first screen and a screen change input for changing a part or an entirety of the first screen into a preset second screen, and a display unit which is configured to display a screen under the control of the controller; and a controller controlling the display unit to display the first screen when the touch sensor senses the unlock input touch command, controlling the display unit to change a part of screen displayed on the display unit from the first screen into the second screen according to a progress of the screen change input touch command sensed by the touch sensor. 8. The terminal of claim 7, wherein the preset first screen comprises a screen displaying a zipper, and wherein the screen change input comprises a touch input command which drags a handle of the zipper displayed on the first screen to open, and the controller controls the display unit to change a screen of a part where the zipper is opened from the first screen into the second screen as the handle of zipper is dragged. 9. The terminal of claim 7, wherein the preset first screen is a screen displaying a plurality of buttons, the screen change input is a touch input which touches the plurality of buttons displayed on the first screen to open, and the controller controls the display unit to change a screen of a part where the button is opened from the first screen into the second screen as the plurality of buttons are opened. 10. The terminal of claim 7, wherein the preset first screen is a screen displaying a knot, the screen change input touch command is a touch input which drags a part of the knot displayed on the first screen to release, and the controller controls the display unit to change a part of screen displayed on the touch screen from the first screen into the second screen according to a ratio in which the knot is released. 11. The terminal of claim 7, wherein the preset first screen comprises a screen displaying a door, the screen change input touch command is a touch input which drags a handle of the door displayed on the first screen to open the door, and the controller controls the display unit to change a part of the screen where the door is opened from the first screen into the second screen as the handle of the door is dragged. 12. The terminal of claim 7, wherein the received screen change touch input command is a predetermined movement along a specific part of the touch screen that changes screen allocation so that a size of the part of the screen displayed as the first screen is reduced as a part of the touch screen displayed as the second screen is increased in correspondence with a distance of a predetermined movement along the specific part of the touch screen | 2,100 |
5,133 | 14,606,101 | 2,176 | A portal page may be displayed in the active area of a portable computing device display. The portable computing device may receive display data that includes original page display instructions specifying how to display a plurality of portlets within a common page. The personal computing device may identify an initial portlet of the plurality of portlets and remove portlets, other than the initial portlet, from the original page display instructions to produce modified page display instructions having at least one transition instruction. The personal computing device may scale, based upon the modified page display instructions, the initial portlet to render within the active display area; and render, based upon the scaled initial portlet, a web page within the active display area. | 1. A method of displaying a portal page within an active display area, the method comprising:
receiving display data that includes original page display instructions specifying how to display a plurality of portlets within a common page; identifying an initial portlet of the plurality of portlets; producing modified page display instructions having at least one transition instruction by removing portlets, other than the initial portlet, from the original page display instructions; scaling, based upon the modified page display instructions, the initial portlet to render within the active display area; and rendering, based upon the scaled initial portlet, a web page within the active display area. 2. The method of claim 1, wherein
rendering the web page within the active display area to produce the web page in a full-screen zoom mode. 3. The method of claim 1, further comprising
activating the at least one transition instruction with a zoom mode transition action; and rendering the original page display instructions to produce a second web page containing the plurality of portlets. 4. The method of claim 3, wherein the zoom mode transition action is at least one action from the group consisting of a screen touch action, a screen swipe gesture, a verbal command, and selection of a hyperlink. 5. The method of claim 1, further comprising
identifying a second portlet of the plurality of portlets; producing second modified page display instructions having at least one transition instruction by removing portlets, other than the second portlet, from the original page display instructions; scaling, based upon the second modified page display instructions, the second portlet to render with the active display area; activating the at least one transition instruction upon performance of a portlet transition action; and rendering, based upon the scaled second portlet, a second web page within the active display area. 6. The method of claim 5, wherein the portlet transition action is at least one action from the group consisting of a second screen touch action, a second screen swipe gesture, a second verbal command, and selection of a second hyperlink. 7. The method of claim 5, wherein the second web page is rendered in a full-screen zoom mode. 8. The method of claim 1, wherein
rendering the modified page display instructions results in the web page being in a headless browser mode; and further comprising activating the at least one transition instruction with a browser mode transition action; and rendering the original page display instructions subsequent to the at least one transition instruction to produce a second web page containing the plurality of portlets. 9. The method of claim 8, wherein the browser mode transition action is at least one action from the group consisting of a second screen touch action, a second screen swipe gesture, a second verbal command, and a second selection of a hyperlink. | A portal page may be displayed in the active area of a portable computing device display. The portable computing device may receive display data that includes original page display instructions specifying how to display a plurality of portlets within a common page. The personal computing device may identify an initial portlet of the plurality of portlets and remove portlets, other than the initial portlet, from the original page display instructions to produce modified page display instructions having at least one transition instruction. The personal computing device may scale, based upon the modified page display instructions, the initial portlet to render within the active display area; and render, based upon the scaled initial portlet, a web page within the active display area.1. A method of displaying a portal page within an active display area, the method comprising:
receiving display data that includes original page display instructions specifying how to display a plurality of portlets within a common page; identifying an initial portlet of the plurality of portlets; producing modified page display instructions having at least one transition instruction by removing portlets, other than the initial portlet, from the original page display instructions; scaling, based upon the modified page display instructions, the initial portlet to render within the active display area; and rendering, based upon the scaled initial portlet, a web page within the active display area. 2. The method of claim 1, wherein
rendering the web page within the active display area to produce the web page in a full-screen zoom mode. 3. The method of claim 1, further comprising
activating the at least one transition instruction with a zoom mode transition action; and rendering the original page display instructions to produce a second web page containing the plurality of portlets. 4. The method of claim 3, wherein the zoom mode transition action is at least one action from the group consisting of a screen touch action, a screen swipe gesture, a verbal command, and selection of a hyperlink. 5. The method of claim 1, further comprising
identifying a second portlet of the plurality of portlets; producing second modified page display instructions having at least one transition instruction by removing portlets, other than the second portlet, from the original page display instructions; scaling, based upon the second modified page display instructions, the second portlet to render with the active display area; activating the at least one transition instruction upon performance of a portlet transition action; and rendering, based upon the scaled second portlet, a second web page within the active display area. 6. The method of claim 5, wherein the portlet transition action is at least one action from the group consisting of a second screen touch action, a second screen swipe gesture, a second verbal command, and selection of a second hyperlink. 7. The method of claim 5, wherein the second web page is rendered in a full-screen zoom mode. 8. The method of claim 1, wherein
rendering the modified page display instructions results in the web page being in a headless browser mode; and further comprising activating the at least one transition instruction with a browser mode transition action; and rendering the original page display instructions subsequent to the at least one transition instruction to produce a second web page containing the plurality of portlets. 9. The method of claim 8, wherein the browser mode transition action is at least one action from the group consisting of a second screen touch action, a second screen swipe gesture, a second verbal command, and a second selection of a hyperlink. | 2,100 |
5,134 | 13,536,333 | 2,178 | Techniques for generating and providing a checklist, and for providing updates to a checklist based on event data. In some aspects, a checklist is provided to a terminal device by receiving a notification of a trigger event, which is used, at least in part, to obtain a checklist template and to generate a checklist from the checklist template, which is then provided to the terminal device. In some aspects, a server device provides a checklist to a terminal device, the checklist comprising a sequence of prompts, each prompt indicating one or more actions, and the server device provides an update to the checklist based on received event data. | 1. A processor-driven method of providing a medical checklist to a terminal device, the method comprising operating one or more processors to execute stored program instructions causing the one or more processors to:
receive a notification that a trigger event has occurred, the notification comprising an event identifier, a case identifier and one or more event data items; obtain a checklist template from a checklist template repository based on at least one of: the event identifier, the case identifier and at least one of the one or more event data items; create a medical checklist comprising case information based on the case identifier, the checklist template and at least one of the one or more event data items; and display the medical checklist on a terminal device. 2. The method of claim 1, wherein obtaining the checklist template is based on the results of a lookup performed using the case identifier. 3. The method of claim 2, wherein the results of the lookup comprise historical data. 4. The method of claim 1, wherein the trigger event is a patient entering an operating room. 5. The method of claim 1, wherein the notification that the trigger event has occurred is generated by one or more sensors. 6. The method of claim 5, wherein at least one sensor of the one or more sensors is a physiological monitor. 7. The method of claim 5, wherein at least one sensor of the one or more sensors is a real-time location system. 8. The method of claim 1, wherein the medical checklist comprises a sequence of prompts, each prompt indicating one or more actions. 9. The method of claim 8, wherein the sequence of prompts describe a sign-in, time-out or debrief procedure for surgery. 10. The method of claim 1, wherein creating the medical checklist is additionally based on one or more settings associated with an individual. 11. The method of claim 10, wherein the individual is a surgeon. 12. The method of claim 10, wherein the individual is a patient. 13. A system for providing a medical checklist to a terminal device, the system comprising:
a server device configured to:
receive a notification that a trigger event has occurred, the notification comprising an event identifier, a case identifier and one or more event data items;
obtain a checklist template from a checklist template repository based on the event identifier and the one or more event data items;
create a medical checklist comprising case information based on the case identifier, the checklist template and the one or more event data items; and
provide the medical checklist to a terminal device. 14. The system of claim 13, wherein obtaining the checklist template is based on the results of a lookup performed using the case identifier. 15. The system of claim 14, wherein the results of the lookup comprise historical data. 16. The system of claim 13, wherein the trigger event is a patient entering an operating room. 17. The system of claim 13, wherein the notification that the trigger event has occurred is generated by one or more sensors. 18. The system of claim 17, wherein at least one sensor of the one or more sensors is a physiological monitor. 19. The system of claim 17, wherein at least one sensor of the one or more sensors is a real-time location system. 20. The system of claim 13, wherein the medical checklist comprises a sequence of prompts, each prompt indicating one or more actions. 21. The system of claim 20, wherein the sequence of prompts describe a sign-in, time-out or debrief procedure for surgery. 22. The system of claim 13, wherein creating the medical checklist is additionally based on one or more settings associated with an individual. 23. The system of claim 22, wherein the individual is a surgeon. 24. The system of claim 22, wherein the individual is a patient. 25. A system for providing and administering medical checklists, the system comprising:
a plurality of terminal devices, each terminal device configured to:
display a medical checklist comprising a sequence of prompts, each prompt indicating one or more actions; and
receive input from a user in response to a prompt of the sequence of prompts, the input signifying that an action of the one or more actions indicated by the prompt is being performed; and
a server device configured to:
provide medical checklists to the plurality of terminal devices;
receive event data indicating one or more medical activities; and
update one or more of the medical checklists on a terminal device based on the received event data. 26. The system of claim 25, wherein updating one or more of the medical checklists comprises modifying one or more of the sequence of prompts. 27. The system of claim 25, wherein the event data is received from one of the plurality of terminal devices. 28. The system of claim 25, wherein the event data is received from a sensor device. 29. The system of claim 25, wherein the server is further configured to identify unexpected circumstances in response to receiving the event data. 30. The system of claim 25, wherein at least one terminal device of the plurality of terminal devices is configured to receive input from the user in response to a prompt of the sequence of prompts via one or more controllers. 31. The system of claim 30, wherein at least one controller of the one or more controllers is a motion controller. 32. The system of claim 30, wherein at least one controller of the one or more controllers is a remote input device. 33. The system of claim 30, wherein at least one controller of the one or more controllers is a voice controller. 34. The system of claim 25, wherein the at least one terminal device is further configured to signal unexpected circumstances based on comparing input received from the user with the update received from the server device. 35. A processor-driven method of providing and administering medical checklists, the method comprising:
at a server device, providing a medical checklist to a terminal device, the medical checklist comprising a sequence of prompts, each prompt indicating one or more actions; at the terminal device, displaying the medical checklist; and at the server device, receiving event data indicating one or more medical activities and providing an update of one or more of the medical checklists to the terminal device based on the received event data. 36. The method of claim 35, wherein updating one or more of the medical checklists comprises modifying one or more of the sequence of prompts. 37. The method of claim 35, wherein the event data is received from one of the plurality of terminal devices. 38. The method of claim 35, wherein the event data is received from a sensor device. 39. The method of claim 35, wherein the server is further configured to identify unexpected circumstances in response to receiving the event data. 40. The method of claim 35, wherein at least one terminal device of the plurality of terminal devices is configured to receive input from the user in response to a prompt of the sequence of prompts via one or more controllers. 41. The method of claim 40, wherein at least one controller of the one or more controllers is a motion controller. 42. The method of claim 40, wherein at least one controller of the one or more controllers is a remote input device. 43. The method of claim 40, wherein at least one controller of the one or more controllers is a voice controller. 44. The method of claim 35, wherein the at least one terminal device is further configured to signal unexpected circumstances based on comparing input received from the user with the update received from the server device. 45. An operating room including a computer-driven medical checklist presentation and administration system comprising:
one or more sensors configured to provide a notification of a trigger event to a server; and one or more terminal devices, each terminal device configured to:
receive a medical checklist from the server comprising a sequence of prompts, each prompt indicating one or more actions;
display the medical checklist; and
receive input from a user in response to a prompt of the sequence of prompts, the input signifying that an action of the one or more actions indicated by the prompt has been performed. 46. The system of claim 45, wherein at least one sensor of the one or more sensors is a physiological monitor. 47. The system of claim 45, wherein at least one sensor of the one or more sensors is a real-time location system. 48. The system of claim 45, wherein at least one terminal device of the one or more terminal devices is configured to receive input from the user in response to a prompt of the sequence of prompts via one or more controllers. 49. The system of claim 48, wherein at least one controller of the one or more controllers is a motion controller. 50. The system of claim 48, wherein at least one controller of the one or more controllers is a remote input device. 51. The system of claim 45, wherein the sequence of prompts describe a sign-in, time-out or debrief procedure for surgery. | Techniques for generating and providing a checklist, and for providing updates to a checklist based on event data. In some aspects, a checklist is provided to a terminal device by receiving a notification of a trigger event, which is used, at least in part, to obtain a checklist template and to generate a checklist from the checklist template, which is then provided to the terminal device. In some aspects, a server device provides a checklist to a terminal device, the checklist comprising a sequence of prompts, each prompt indicating one or more actions, and the server device provides an update to the checklist based on received event data.1. A processor-driven method of providing a medical checklist to a terminal device, the method comprising operating one or more processors to execute stored program instructions causing the one or more processors to:
receive a notification that a trigger event has occurred, the notification comprising an event identifier, a case identifier and one or more event data items; obtain a checklist template from a checklist template repository based on at least one of: the event identifier, the case identifier and at least one of the one or more event data items; create a medical checklist comprising case information based on the case identifier, the checklist template and at least one of the one or more event data items; and display the medical checklist on a terminal device. 2. The method of claim 1, wherein obtaining the checklist template is based on the results of a lookup performed using the case identifier. 3. The method of claim 2, wherein the results of the lookup comprise historical data. 4. The method of claim 1, wherein the trigger event is a patient entering an operating room. 5. The method of claim 1, wherein the notification that the trigger event has occurred is generated by one or more sensors. 6. The method of claim 5, wherein at least one sensor of the one or more sensors is a physiological monitor. 7. The method of claim 5, wherein at least one sensor of the one or more sensors is a real-time location system. 8. The method of claim 1, wherein the medical checklist comprises a sequence of prompts, each prompt indicating one or more actions. 9. The method of claim 8, wherein the sequence of prompts describe a sign-in, time-out or debrief procedure for surgery. 10. The method of claim 1, wherein creating the medical checklist is additionally based on one or more settings associated with an individual. 11. The method of claim 10, wherein the individual is a surgeon. 12. The method of claim 10, wherein the individual is a patient. 13. A system for providing a medical checklist to a terminal device, the system comprising:
a server device configured to:
receive a notification that a trigger event has occurred, the notification comprising an event identifier, a case identifier and one or more event data items;
obtain a checklist template from a checklist template repository based on the event identifier and the one or more event data items;
create a medical checklist comprising case information based on the case identifier, the checklist template and the one or more event data items; and
provide the medical checklist to a terminal device. 14. The system of claim 13, wherein obtaining the checklist template is based on the results of a lookup performed using the case identifier. 15. The system of claim 14, wherein the results of the lookup comprise historical data. 16. The system of claim 13, wherein the trigger event is a patient entering an operating room. 17. The system of claim 13, wherein the notification that the trigger event has occurred is generated by one or more sensors. 18. The system of claim 17, wherein at least one sensor of the one or more sensors is a physiological monitor. 19. The system of claim 17, wherein at least one sensor of the one or more sensors is a real-time location system. 20. The system of claim 13, wherein the medical checklist comprises a sequence of prompts, each prompt indicating one or more actions. 21. The system of claim 20, wherein the sequence of prompts describe a sign-in, time-out or debrief procedure for surgery. 22. The system of claim 13, wherein creating the medical checklist is additionally based on one or more settings associated with an individual. 23. The system of claim 22, wherein the individual is a surgeon. 24. The system of claim 22, wherein the individual is a patient. 25. A system for providing and administering medical checklists, the system comprising:
a plurality of terminal devices, each terminal device configured to:
display a medical checklist comprising a sequence of prompts, each prompt indicating one or more actions; and
receive input from a user in response to a prompt of the sequence of prompts, the input signifying that an action of the one or more actions indicated by the prompt is being performed; and
a server device configured to:
provide medical checklists to the plurality of terminal devices;
receive event data indicating one or more medical activities; and
update one or more of the medical checklists on a terminal device based on the received event data. 26. The system of claim 25, wherein updating one or more of the medical checklists comprises modifying one or more of the sequence of prompts. 27. The system of claim 25, wherein the event data is received from one of the plurality of terminal devices. 28. The system of claim 25, wherein the event data is received from a sensor device. 29. The system of claim 25, wherein the server is further configured to identify unexpected circumstances in response to receiving the event data. 30. The system of claim 25, wherein at least one terminal device of the plurality of terminal devices is configured to receive input from the user in response to a prompt of the sequence of prompts via one or more controllers. 31. The system of claim 30, wherein at least one controller of the one or more controllers is a motion controller. 32. The system of claim 30, wherein at least one controller of the one or more controllers is a remote input device. 33. The system of claim 30, wherein at least one controller of the one or more controllers is a voice controller. 34. The system of claim 25, wherein the at least one terminal device is further configured to signal unexpected circumstances based on comparing input received from the user with the update received from the server device. 35. A processor-driven method of providing and administering medical checklists, the method comprising:
at a server device, providing a medical checklist to a terminal device, the medical checklist comprising a sequence of prompts, each prompt indicating one or more actions; at the terminal device, displaying the medical checklist; and at the server device, receiving event data indicating one or more medical activities and providing an update of one or more of the medical checklists to the terminal device based on the received event data. 36. The method of claim 35, wherein updating one or more of the medical checklists comprises modifying one or more of the sequence of prompts. 37. The method of claim 35, wherein the event data is received from one of the plurality of terminal devices. 38. The method of claim 35, wherein the event data is received from a sensor device. 39. The method of claim 35, wherein the server is further configured to identify unexpected circumstances in response to receiving the event data. 40. The method of claim 35, wherein at least one terminal device of the plurality of terminal devices is configured to receive input from the user in response to a prompt of the sequence of prompts via one or more controllers. 41. The method of claim 40, wherein at least one controller of the one or more controllers is a motion controller. 42. The method of claim 40, wherein at least one controller of the one or more controllers is a remote input device. 43. The method of claim 40, wherein at least one controller of the one or more controllers is a voice controller. 44. The method of claim 35, wherein the at least one terminal device is further configured to signal unexpected circumstances based on comparing input received from the user with the update received from the server device. 45. An operating room including a computer-driven medical checklist presentation and administration system comprising:
one or more sensors configured to provide a notification of a trigger event to a server; and one or more terminal devices, each terminal device configured to:
receive a medical checklist from the server comprising a sequence of prompts, each prompt indicating one or more actions;
display the medical checklist; and
receive input from a user in response to a prompt of the sequence of prompts, the input signifying that an action of the one or more actions indicated by the prompt has been performed. 46. The system of claim 45, wherein at least one sensor of the one or more sensors is a physiological monitor. 47. The system of claim 45, wherein at least one sensor of the one or more sensors is a real-time location system. 48. The system of claim 45, wherein at least one terminal device of the one or more terminal devices is configured to receive input from the user in response to a prompt of the sequence of prompts via one or more controllers. 49. The system of claim 48, wherein at least one controller of the one or more controllers is a motion controller. 50. The system of claim 48, wherein at least one controller of the one or more controllers is a remote input device. 51. The system of claim 45, wherein the sequence of prompts describe a sign-in, time-out or debrief procedure for surgery. | 2,100 |
5,135 | 14,484,871 | 2,199 | A maintenance mode mechanism (MMM) expedites host maintenance in a cloud computing environment by intelligently suspending essentially inactive virtual machines. The user is given the option to enter maintenance mode using the MMM. The MMM determines essentially inactive VMs that can be suspended to reduce the number of VMs that need to be migrated prior to entering a maintenance mode. Metrics of the VMs associated with the host are analyzed to determine which VMs can be suspended. Parameters can also be set by the user to instruct the MMM to verify the selection of a specific VM with the user. | 1. An apparatus comprising:
at least one processor; a memory coupled to the at least one processor; a cloud computing system with a host computer having a plurality of active virtual machines; a maintenance mode mechanism (MMM) residing in the memory and executed by the at least one processor, wherein the MMM determines at least one virtual machine of the plurality of active virtual machines on the host computer is an essentially inactive virtual machine and then suspends the essentially inactive virtual machine prior to placing the host computer in maintenance mode. 2. The apparatus of claim 1 wherein the MMM determines the at least one virtual machine of the plurality of active virtual machines is an essentially inactive virtual machine using a metric of the host computer with a threshold for the metric. 3. The apparatus of claim 2 wherein the metric of the host computer is a metric of the physical properties of the physical machine hosting the host computer. 4. The apparatus of claim 3 wherein the physical properties of the physical machine hosting the host computer include central processing unit (CPU) utilization, disk utilization and network utilization. 5. The apparatus of claim 2 wherein a user it allowed to set the threshold. 6. The apparatus of claim 1 wherein the maintenance mode mechanism further includes a hold active bit for each virtual machine in the host, where the hold active bit is set to indicate that a corresponding virtual machine should not be suspended. 7. The apparatus of claim 6 wherein the hold active bit for each virtual machine in the host is stored by the maintenance mode mechanism in a table with virtual machine identifiers and corresponding hold active bits. 8. The apparatus of claim 7 wherein the MMM allows the user to set a hold active bit in the table. 9. The apparatus of claim 1 wherein the MMM provides an option to a user to expedite the maintenance mode by suspending essentially inactive virtual machines. 10-20. (canceled) | A maintenance mode mechanism (MMM) expedites host maintenance in a cloud computing environment by intelligently suspending essentially inactive virtual machines. The user is given the option to enter maintenance mode using the MMM. The MMM determines essentially inactive VMs that can be suspended to reduce the number of VMs that need to be migrated prior to entering a maintenance mode. Metrics of the VMs associated with the host are analyzed to determine which VMs can be suspended. Parameters can also be set by the user to instruct the MMM to verify the selection of a specific VM with the user.1. An apparatus comprising:
at least one processor; a memory coupled to the at least one processor; a cloud computing system with a host computer having a plurality of active virtual machines; a maintenance mode mechanism (MMM) residing in the memory and executed by the at least one processor, wherein the MMM determines at least one virtual machine of the plurality of active virtual machines on the host computer is an essentially inactive virtual machine and then suspends the essentially inactive virtual machine prior to placing the host computer in maintenance mode. 2. The apparatus of claim 1 wherein the MMM determines the at least one virtual machine of the plurality of active virtual machines is an essentially inactive virtual machine using a metric of the host computer with a threshold for the metric. 3. The apparatus of claim 2 wherein the metric of the host computer is a metric of the physical properties of the physical machine hosting the host computer. 4. The apparatus of claim 3 wherein the physical properties of the physical machine hosting the host computer include central processing unit (CPU) utilization, disk utilization and network utilization. 5. The apparatus of claim 2 wherein a user it allowed to set the threshold. 6. The apparatus of claim 1 wherein the maintenance mode mechanism further includes a hold active bit for each virtual machine in the host, where the hold active bit is set to indicate that a corresponding virtual machine should not be suspended. 7. The apparatus of claim 6 wherein the hold active bit for each virtual machine in the host is stored by the maintenance mode mechanism in a table with virtual machine identifiers and corresponding hold active bits. 8. The apparatus of claim 7 wherein the MMM allows the user to set a hold active bit in the table. 9. The apparatus of claim 1 wherein the MMM provides an option to a user to expedite the maintenance mode by suspending essentially inactive virtual machines. 10-20. (canceled) | 2,100 |
5,136 | 15,063,044 | 2,141 | A mobile device may advertise an application human-machine interface (HMI) service responsive to connection to a computing platform of a vehicle as the primary mobile device. One or more secondary mobile devices may connect to the application HMI service of the primary mobile device. The primary mobile device may provide a user interface of a connected application executed by the primary mobile device to the computing platform and to the at least one secondary mobile device, each secondary device executing the connected application. | 1. A system comprising:
a primary mobile device programmed to:
advertise an application human-machine interface (HMI) service responsive to connection to a computing platform of a vehicle as the primary mobile device,
connect to at least one secondary mobile device, and
provide a user interface of a connected application executed by the primary mobile device to the computing platform and to the at least one secondary mobile device, each secondary mobile device executing the connected application. 2. The system of claim 1, wherein the primary mobile device is further programmed to provide messaging flows, formatted in a device link interface protocol configured to integrate functionality of the connected applications to the computing platform, to the computing platform and to the at least one secondary mobile device to cause the computing platform and the at least one secondary mobile device to each render the user interface. 3. The system of claim 2, wherein the messaging flows include remote procedure call messages responsive to command messages, and HMI messages to render the user interfaces. 4. The system of claim 2, wherein the device link interface protocol is SmartDeviceLink (SDL). 5. The system of claim 1, wherein the primary mobile device is further programmed to:
receive a command message from the computing platform; and update the user interface of the computing platform and the at least one secondary mobile device responsive to the command message. 6. The system of claim 1, wherein the primary mobile device is further programmed to:
receive a command message from one of the at least one secondary mobile device; and update the user interface of the computing platform and the at least one secondary mobile device responsive to the command message. 7. The system of claim 1, wherein the primary mobile device is a driver device. 8. A system comprising:
a plurality of mobile devices, each executing a connected application, one of the mobile devices connected to a vehicle computing platform as a primary device, each other mobile device connected to an application human-machine interface (HMI) service executed by the primary device, the primary device programmed to send message flows to the computing platform to provide a primary user interface and to each other mobile device to provide secondary user interfaces. 9. The system of claim 8, wherein the primary mobile device is further programmed to provide the messaging flows, formatted in a device link interface protocol configured to integrate functionality of the connected applications to the computing platform, to the computing platform and to the at least one secondary mobile device to cause the computing platform and the at least one secondary mobile device to each render the user interface. 10. The system of claim 8, wherein the messaging flows include remote procedure call messages responsive to command messages, and HMI messages to render the user interfaces. 11. The system of claim 8, wherein the messaging flows are formatted in SmartDeviceLink (SDL) protocol. 12. The system of claim 8, wherein the primary device is further programmed to:
receive a command message from the computing platform; and update the primary user interface of the computing platform and the secondary user interfaces of the at least one secondary mobile device responsive to the command message. 13. The system of claim 8, wherein the primary device is further programmed to:
receive a command message from one of the plurality of mobile devices; and update the primary user interface of the computing platform and the secondary user interfaces of the each other mobile device responsive to the command message. 14. The system of claim 8, wherein the primary device is a driver device. 15. A non-transitory computer-readable medium, comprising instructions that, when executed by a processor of a mobile device, cause the mobile device to:
advertise an application human-machine interface (HMI) service responsive to connection to a computing platform of a vehicle as the primary mobile device; connect to at least one secondary mobile device; and provide message flows via the HMI service of a connected application executed by the primary mobile device to the computing platform and to the at least one secondary mobile device, to cause the computing platform and the at least one secondary mobile device to render a user interface of the connected application. 16. The medium of claim 15, further comprising instructions that, when executed by the processor of the mobile device, causing the mobile device to provide the messaging flows formatted in SmartDeviceLink (SDL) protocol to the computing platform and to the at least one secondary mobile device. 17. The medium of claim 15, wherein the messaging flows include remote procedure call messages responsive to command messages, and HMI messages to render the user interfaces. 18. The medium of claim 15, further comprising instructions that, when executed by the processor of the mobile device, cause the mobile device to:
receive a command message from the computing platform; and update the user interface of the computing platform and the at least one secondary mobile device responsive to the command message. 19. The medium of claim 15, further comprising instructions that, when executed by the processor of the mobile device, cause the mobile device to:
receive a command message from one of the at least one secondary mobile device; and update the user interface of the computing platform and the at least one secondary mobile device responsive to the command message. 20. The medium of claim 15, wherein the primary mobile device is a driver device. | A mobile device may advertise an application human-machine interface (HMI) service responsive to connection to a computing platform of a vehicle as the primary mobile device. One or more secondary mobile devices may connect to the application HMI service of the primary mobile device. The primary mobile device may provide a user interface of a connected application executed by the primary mobile device to the computing platform and to the at least one secondary mobile device, each secondary device executing the connected application.1. A system comprising:
a primary mobile device programmed to:
advertise an application human-machine interface (HMI) service responsive to connection to a computing platform of a vehicle as the primary mobile device,
connect to at least one secondary mobile device, and
provide a user interface of a connected application executed by the primary mobile device to the computing platform and to the at least one secondary mobile device, each secondary mobile device executing the connected application. 2. The system of claim 1, wherein the primary mobile device is further programmed to provide messaging flows, formatted in a device link interface protocol configured to integrate functionality of the connected applications to the computing platform, to the computing platform and to the at least one secondary mobile device to cause the computing platform and the at least one secondary mobile device to each render the user interface. 3. The system of claim 2, wherein the messaging flows include remote procedure call messages responsive to command messages, and HMI messages to render the user interfaces. 4. The system of claim 2, wherein the device link interface protocol is SmartDeviceLink (SDL). 5. The system of claim 1, wherein the primary mobile device is further programmed to:
receive a command message from the computing platform; and update the user interface of the computing platform and the at least one secondary mobile device responsive to the command message. 6. The system of claim 1, wherein the primary mobile device is further programmed to:
receive a command message from one of the at least one secondary mobile device; and update the user interface of the computing platform and the at least one secondary mobile device responsive to the command message. 7. The system of claim 1, wherein the primary mobile device is a driver device. 8. A system comprising:
a plurality of mobile devices, each executing a connected application, one of the mobile devices connected to a vehicle computing platform as a primary device, each other mobile device connected to an application human-machine interface (HMI) service executed by the primary device, the primary device programmed to send message flows to the computing platform to provide a primary user interface and to each other mobile device to provide secondary user interfaces. 9. The system of claim 8, wherein the primary mobile device is further programmed to provide the messaging flows, formatted in a device link interface protocol configured to integrate functionality of the connected applications to the computing platform, to the computing platform and to the at least one secondary mobile device to cause the computing platform and the at least one secondary mobile device to each render the user interface. 10. The system of claim 8, wherein the messaging flows include remote procedure call messages responsive to command messages, and HMI messages to render the user interfaces. 11. The system of claim 8, wherein the messaging flows are formatted in SmartDeviceLink (SDL) protocol. 12. The system of claim 8, wherein the primary device is further programmed to:
receive a command message from the computing platform; and update the primary user interface of the computing platform and the secondary user interfaces of the at least one secondary mobile device responsive to the command message. 13. The system of claim 8, wherein the primary device is further programmed to:
receive a command message from one of the plurality of mobile devices; and update the primary user interface of the computing platform and the secondary user interfaces of the each other mobile device responsive to the command message. 14. The system of claim 8, wherein the primary device is a driver device. 15. A non-transitory computer-readable medium, comprising instructions that, when executed by a processor of a mobile device, cause the mobile device to:
advertise an application human-machine interface (HMI) service responsive to connection to a computing platform of a vehicle as the primary mobile device; connect to at least one secondary mobile device; and provide message flows via the HMI service of a connected application executed by the primary mobile device to the computing platform and to the at least one secondary mobile device, to cause the computing platform and the at least one secondary mobile device to render a user interface of the connected application. 16. The medium of claim 15, further comprising instructions that, when executed by the processor of the mobile device, causing the mobile device to provide the messaging flows formatted in SmartDeviceLink (SDL) protocol to the computing platform and to the at least one secondary mobile device. 17. The medium of claim 15, wherein the messaging flows include remote procedure call messages responsive to command messages, and HMI messages to render the user interfaces. 18. The medium of claim 15, further comprising instructions that, when executed by the processor of the mobile device, cause the mobile device to:
receive a command message from the computing platform; and update the user interface of the computing platform and the at least one secondary mobile device responsive to the command message. 19. The medium of claim 15, further comprising instructions that, when executed by the processor of the mobile device, cause the mobile device to:
receive a command message from one of the at least one secondary mobile device; and update the user interface of the computing platform and the at least one secondary mobile device responsive to the command message. 20. The medium of claim 15, wherein the primary mobile device is a driver device. | 2,100 |
5,137 | 14,220,329 | 2,176 | A portal page may be displayed in the active area of a portable computing device display. The portable computing device may receive display data that includes original page display instructions specifying how to display a plurality of portlets within a common page. The personal computing device may identify an initial portlet of the plurality of portlets and remove portlets, other than the initial portlet, from the original page display instructions to produce modified page display instructions having at least one transition instruction. The personal computing device may scale, based upon the modified page display instructions, the initial portlet to render within the active display area; and render, based upon the scaled initial portlet, a web page within the active display area. | 1-9. (canceled) 10. A computing system, comprising:
a display with an active display area; a computer memory configured to receive display data that includes page display instructions that specify how a plurality of portlets are to be displayed within a common page; at least one processor circuit communicatively connected to the display and the computer memory and configured to
identify an initial portlet out of the plurality of portlets;
produce modified page display instructions having at least one transition instruction by removing portlets, other than the initial portlet, from the original page display instructions;
scale, based on the modified page display instructions, the initial portlet to render within the active display area; and
render, based on the scaled initial portlet, a web page within the active display area. 11. The system of claim 10, wherein the computing device is a digital telephone, a tablet computing device, a handheld computing device, or a laptop computer. 12. The system of claim 11, wherein the at least one processor is configured to
render the web page in a full-screen zoom mode; activate the at least one transition instruction in response to a zoom mode transition action; and render the second modified page display instructions to produce a second web page according to the at least one transition instruction. 13. The system of claim 12, wherein the zoom mode transition action is selected from the group consisting of a screen touch action, a screen swipe gesture, a verbal command, and selection of a hyperlink. 14. The system of claim 11, wherein the at least one processor is further configured to
identify a second portlet of the plurality of portlets; remove portlets, other than the second portlet, from the page display instructions to produce second modified page display instructions having at least one transition instruction; scale, based upon the second modified page display instructions, the second portlet to render with the active display; and render, based upon the scaled second portlet, a third web page within the active display area upon performance of a portlet transition action. 15. The system of claim 14, wherein the portlet transition action is at least one action from the group consisting of a second screen touch action, a second screen swipe gesture, a second verbal command, and selection of a second hyperlink. 16. The system of claim 11, wherein the at least one processor is further configured to
render the modified page display instructions to produce the web page being in a headless browser mode and the page display instructions include a browser mode transition action. 17. A computer program product for rendering portal pages within an active display area, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions being readable and executable by a computing device to cause the computing device to perform a method comprising:
receiving display data that includes page display instructions that specify how a plurality of portlets are to be displayed within a common page; identifying an initial portlet of the plurality of portlets; producing modified page display instructions by removing portlets, other than the initial portlet, from the original page display instructions; scaling, based upon the modified page display instructions, the initial portlet to render within the active display area; and rendering, based upon the scaled initial portlet, a web page within the active display area. | A portal page may be displayed in the active area of a portable computing device display. The portable computing device may receive display data that includes original page display instructions specifying how to display a plurality of portlets within a common page. The personal computing device may identify an initial portlet of the plurality of portlets and remove portlets, other than the initial portlet, from the original page display instructions to produce modified page display instructions having at least one transition instruction. The personal computing device may scale, based upon the modified page display instructions, the initial portlet to render within the active display area; and render, based upon the scaled initial portlet, a web page within the active display area.1-9. (canceled) 10. A computing system, comprising:
a display with an active display area; a computer memory configured to receive display data that includes page display instructions that specify how a plurality of portlets are to be displayed within a common page; at least one processor circuit communicatively connected to the display and the computer memory and configured to
identify an initial portlet out of the plurality of portlets;
produce modified page display instructions having at least one transition instruction by removing portlets, other than the initial portlet, from the original page display instructions;
scale, based on the modified page display instructions, the initial portlet to render within the active display area; and
render, based on the scaled initial portlet, a web page within the active display area. 11. The system of claim 10, wherein the computing device is a digital telephone, a tablet computing device, a handheld computing device, or a laptop computer. 12. The system of claim 11, wherein the at least one processor is configured to
render the web page in a full-screen zoom mode; activate the at least one transition instruction in response to a zoom mode transition action; and render the second modified page display instructions to produce a second web page according to the at least one transition instruction. 13. The system of claim 12, wherein the zoom mode transition action is selected from the group consisting of a screen touch action, a screen swipe gesture, a verbal command, and selection of a hyperlink. 14. The system of claim 11, wherein the at least one processor is further configured to
identify a second portlet of the plurality of portlets; remove portlets, other than the second portlet, from the page display instructions to produce second modified page display instructions having at least one transition instruction; scale, based upon the second modified page display instructions, the second portlet to render with the active display; and render, based upon the scaled second portlet, a third web page within the active display area upon performance of a portlet transition action. 15. The system of claim 14, wherein the portlet transition action is at least one action from the group consisting of a second screen touch action, a second screen swipe gesture, a second verbal command, and selection of a second hyperlink. 16. The system of claim 11, wherein the at least one processor is further configured to
render the modified page display instructions to produce the web page being in a headless browser mode and the page display instructions include a browser mode transition action. 17. A computer program product for rendering portal pages within an active display area, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions being readable and executable by a computing device to cause the computing device to perform a method comprising:
receiving display data that includes page display instructions that specify how a plurality of portlets are to be displayed within a common page; identifying an initial portlet of the plurality of portlets; producing modified page display instructions by removing portlets, other than the initial portlet, from the original page display instructions; scaling, based upon the modified page display instructions, the initial portlet to render within the active display area; and rendering, based upon the scaled initial portlet, a web page within the active display area. | 2,100 |
5,138 | 11,966,540 | 2,158 | A virtual database administrator (VDBA) is implemented in a database server network to monitor back-up write events from the database servers on the network to a network back-up server and correct failed back-up attempts. The VDBA regularly polls the database servers for copies of event logs that include information about back-up attempts. The VDBA parses each of the event logs, searching for the back-up log entries indicating successful or failed back-up writes for particular databases. For failed back-up writes, the VDBA instructs the specific database server to retry the back-up write for the particular database. The back-up retry instructions are specific to the database server and cause a back-up retry limited to the particular database on the server that experienced the failure. | 1. A network database administration system comprising
a backup polling module that requests and receives event log information from each of one or more database servers within a network; a parsing module that searches the event log information and identifies one or more of an event entry indicating a successful database back-up write and an event entry indicating a failed database back-up write; and a backup trigger module that is initiated when the parsing module identifies the failed database back-up write and creates a configuration file adapted to cause a specific database server experiencing the failed database back-up write to attempt a new database back-up write to correct the failed database back-up write. 2. The system of claim 1, wherein
the specific database server hosts a plurality of databases; the failed database back-up write occurred with respect to a single one of the plurality of databases; and the configuration file is further adapted to cause the specific database server to attempt a new database back-up write limited to the single one of the plurality of databases. 3. The system of claim 1, wherein the parsing module initiates an alert to a live administrator when the failed database back-up write for the specific database server meets a threshold condition. 4. The system of claim 3, wherein the threshold condition is a certain number of occurrences of the failed database back-up write for the specific server. 5. The system of claim 1 further comprising a data store and wherein the parsing module further records data from the event entries related to occurrences of the successful database back-up write and the failed database back-up write in the data store. 6. The system of claim 1 further comprising a data polling module that requests and receives configuration information from each of the plurality of database servers. 7. The system of claim 6 further comprising a dynamic configuration module that creates a dynamic configuration file adapted to cause a particular one of the database servers to update a configuration setting. 8. The system of claim 6 further comprising a server information module that generates a report incorporating information from one or more of the event entries, the configuration information, or both. 9. A method on a computer of administering a plurality of databases connected within a network comprising
requesting event log information from each of the plurality of database servers within the network; receiving the requested event log information; parsing the event log information to identify one or more of an event entry indicating a successful database back-up write and an event entry indicating a failed database back-up write; creating, upon identification of the failed database back-up write, a configuration file adapted to cause a specific database server experiencing the failed database back-up write to attempt a, new database back-up write to correct the failed database back-up write; and transmitting the configuration file to the specific database server. 10. The method of claim 9, wherein
the specific database server hosts a plurality of databases; and the failed database back-up write occurred with respect to a single one of the plurality of databases; the method further comprising adapting the configuration file to cause the specific database server to attempt a new database back-up write limited to the single one of the plurality of databases. 11. The method of claim 9 further comprising initiating an alert to a live administrator when the failed database back-up write for the specific database server meets a threshold condition. 12. The method of claim 11 wherein the threshold condition is a certain number of occurrences of the failed database back-up write. 13. The method of claim 9 further comprising recording data from the event entries related to occurrences of the successful database back-up write and the failed database back-up write in a data store. 14. The method of claim 9 further comprising
requesting configuration information from a particular one of the database servers; receiving configuration information from the particular one of the database servers; and creating a dynamic configuration file adapted to cause the particular one of the database servers to update a configuration setting. 15. The method of claim 9 further comprising
requesting configuration information from one or more of the plurality of database servers; receiving configuration information from the one or more of the plurality of database servers; and generating a report incorporating information from one or more of the event entries, the configuration information, or both:. 16. A computer readable medium comprising computer executable instructions for causing a computer to perform operations comprising
requesting event log information from each of the plurality of database servers within the network; receiving the requested event log information; parsing the event log information to identify one or more of an event entry indicating a successful database back-up write and an event entry indicating a failed database back-up write; creating, upon identification of the failed database back-up write, a configuration file adapted to cause a specific database server experiencing the failed database back-up write to attempt a new database back-up write to correct the failed database back-up write; and transmitting the configuration file to the specific database server. 17. The computer readable medium of claim 16, wherein when
the specific database server hosts a plurality of databases; and the failed database back-up write occurred with respect to a single one of the plurality of databases; the instructions further comprise the following operation: adapting the configuration file to cause the specific database server to attempt a new database back-up write limited to the single one of the plurality of databases. 18. The computer readable medium of claim 16, wherein the instructions further comprise the following operation:
initiating an alert to a live administrator when the failed database back-up write for the specific database server meets a threshold condition. 19. The computer readable medium of claim 18, wherein the threshold condition is a certain number of occurrences of the failed database back-up write. 20. The computer readable medium of claim 16, wherein the instructions further comprise the following operation:
recording data from the event entries related to occurrences of the successful database back-up write and the failed database back-up write in a data store. 21. The computer readable medium of claim 16, wherein the instructions further comprise the following operations:
requesting configuration information from a particular one of the database servers; receiving configuration information from the particular one of the database servers; and creating a dynamic configuration file adapted to cause the particular one of the database servers to update a configuration setting. 22. The computer readable medium of claim 16, wherein the instructions further comprise the following operations:
requesting configuration information from one or more of the plurality of database servers; receiving configuration information from the one or more of the plurality of database servers; and generating a report incorporating information from one or more of the event entries, the configuration information, or both. | A virtual database administrator (VDBA) is implemented in a database server network to monitor back-up write events from the database servers on the network to a network back-up server and correct failed back-up attempts. The VDBA regularly polls the database servers for copies of event logs that include information about back-up attempts. The VDBA parses each of the event logs, searching for the back-up log entries indicating successful or failed back-up writes for particular databases. For failed back-up writes, the VDBA instructs the specific database server to retry the back-up write for the particular database. The back-up retry instructions are specific to the database server and cause a back-up retry limited to the particular database on the server that experienced the failure.1. A network database administration system comprising
a backup polling module that requests and receives event log information from each of one or more database servers within a network; a parsing module that searches the event log information and identifies one or more of an event entry indicating a successful database back-up write and an event entry indicating a failed database back-up write; and a backup trigger module that is initiated when the parsing module identifies the failed database back-up write and creates a configuration file adapted to cause a specific database server experiencing the failed database back-up write to attempt a new database back-up write to correct the failed database back-up write. 2. The system of claim 1, wherein
the specific database server hosts a plurality of databases; the failed database back-up write occurred with respect to a single one of the plurality of databases; and the configuration file is further adapted to cause the specific database server to attempt a new database back-up write limited to the single one of the plurality of databases. 3. The system of claim 1, wherein the parsing module initiates an alert to a live administrator when the failed database back-up write for the specific database server meets a threshold condition. 4. The system of claim 3, wherein the threshold condition is a certain number of occurrences of the failed database back-up write for the specific server. 5. The system of claim 1 further comprising a data store and wherein the parsing module further records data from the event entries related to occurrences of the successful database back-up write and the failed database back-up write in the data store. 6. The system of claim 1 further comprising a data polling module that requests and receives configuration information from each of the plurality of database servers. 7. The system of claim 6 further comprising a dynamic configuration module that creates a dynamic configuration file adapted to cause a particular one of the database servers to update a configuration setting. 8. The system of claim 6 further comprising a server information module that generates a report incorporating information from one or more of the event entries, the configuration information, or both. 9. A method on a computer of administering a plurality of databases connected within a network comprising
requesting event log information from each of the plurality of database servers within the network; receiving the requested event log information; parsing the event log information to identify one or more of an event entry indicating a successful database back-up write and an event entry indicating a failed database back-up write; creating, upon identification of the failed database back-up write, a configuration file adapted to cause a specific database server experiencing the failed database back-up write to attempt a, new database back-up write to correct the failed database back-up write; and transmitting the configuration file to the specific database server. 10. The method of claim 9, wherein
the specific database server hosts a plurality of databases; and the failed database back-up write occurred with respect to a single one of the plurality of databases; the method further comprising adapting the configuration file to cause the specific database server to attempt a new database back-up write limited to the single one of the plurality of databases. 11. The method of claim 9 further comprising initiating an alert to a live administrator when the failed database back-up write for the specific database server meets a threshold condition. 12. The method of claim 11 wherein the threshold condition is a certain number of occurrences of the failed database back-up write. 13. The method of claim 9 further comprising recording data from the event entries related to occurrences of the successful database back-up write and the failed database back-up write in a data store. 14. The method of claim 9 further comprising
requesting configuration information from a particular one of the database servers; receiving configuration information from the particular one of the database servers; and creating a dynamic configuration file adapted to cause the particular one of the database servers to update a configuration setting. 15. The method of claim 9 further comprising
requesting configuration information from one or more of the plurality of database servers; receiving configuration information from the one or more of the plurality of database servers; and generating a report incorporating information from one or more of the event entries, the configuration information, or both:. 16. A computer readable medium comprising computer executable instructions for causing a computer to perform operations comprising
requesting event log information from each of the plurality of database servers within the network; receiving the requested event log information; parsing the event log information to identify one or more of an event entry indicating a successful database back-up write and an event entry indicating a failed database back-up write; creating, upon identification of the failed database back-up write, a configuration file adapted to cause a specific database server experiencing the failed database back-up write to attempt a new database back-up write to correct the failed database back-up write; and transmitting the configuration file to the specific database server. 17. The computer readable medium of claim 16, wherein when
the specific database server hosts a plurality of databases; and the failed database back-up write occurred with respect to a single one of the plurality of databases; the instructions further comprise the following operation: adapting the configuration file to cause the specific database server to attempt a new database back-up write limited to the single one of the plurality of databases. 18. The computer readable medium of claim 16, wherein the instructions further comprise the following operation:
initiating an alert to a live administrator when the failed database back-up write for the specific database server meets a threshold condition. 19. The computer readable medium of claim 18, wherein the threshold condition is a certain number of occurrences of the failed database back-up write. 20. The computer readable medium of claim 16, wherein the instructions further comprise the following operation:
recording data from the event entries related to occurrences of the successful database back-up write and the failed database back-up write in a data store. 21. The computer readable medium of claim 16, wherein the instructions further comprise the following operations:
requesting configuration information from a particular one of the database servers; receiving configuration information from the particular one of the database servers; and creating a dynamic configuration file adapted to cause the particular one of the database servers to update a configuration setting. 22. The computer readable medium of claim 16, wherein the instructions further comprise the following operations:
requesting configuration information from one or more of the plurality of database servers; receiving configuration information from the one or more of the plurality of database servers; and generating a report incorporating information from one or more of the event entries, the configuration information, or both. | 2,100 |
5,139 | 13,290,848 | 2,133 | A memory allocator assigns temporary memory limits to each of a plurality of processes requiring memory. Thereafter, at least one assigned temporary memory limit is changed during execution of a corresponding process. Related apparatus, systems, techniques and articles are also described. | 1. A computer program product comprising a non-transitory machine-readable medium storing instructions that, when executed by at least one programmable processor, cause the at least one programmable processor to perform operations comprising:
assigning, by a memory allocator, temporary memory limits to each of a plurality of processes requiring memory; and changing at least one assigned temporary memory limit during execution of a corresponding process. 2. A computer program product as in claim 1, wherein a global memory limit is defined that specifies an aggregate amount of memory to be consumed by all of the plurality of processes, the memory allocator assigning the temporary memory limits to the plurality of processes such that the global memory limit is not exceeded. 3. A computer program product as in claim 2, wherein the global memory limit dynamically changes which results in the memory allocator changing at least one temporary memory limit. 4. A computer program product as in claim 1, wherein the memory allocator uses a vector in shared memory to store memory limits, current memory consumption and control data. 5. A computer program product as in claim 1, wherein each process has an associated slot in the vector. 6. A computer program product as in claim 5, wherein each slot specifies a number of bytes allocated by the memory allocator to the process. 7. A computer program product as in claim 5, wherein the temporary memory limit for each process is stored in the corresponding slot. 8. A computer program product as in claim 5, wherein each slot specifies an absolute process limit specific to the process which the temporary memory limit cannot exceed. 9. A computer program product as in claim 1, wherein the operations further comprise: signaling processes having temporary memory limits which have been reduced in response to the increasing memory limit of another process to free at least a portion of their cached data. 10. A computer program product as in claim 9, wherein all signaled processes free a proportional amount of their cached data. 11. A computer program product as in claim 9, wherein the freed cached data is returned to an operating system executing the memory allocator. 12. A computer program product as in claim 11, wherein the memory allocator subsequently allocates at least a portion of the memory returned to the operating system. 13. A method comprising:
assigning, by a memory allocator, temporary memory limits to each of a plurality of processes requiring memory; and changing at least one assigned temporary memory limit during execution of a corresponding process. 14. A method as in claim 13, wherein a global memory limit is defined that specifies an aggregate amount of memory to be consumed by all of the plurality of processes, the memory allocator assigning the temporary memory limits to the plurality of processes such that the global memory limit is not exceeded. 15. A method as in claim 14, wherein the global memory limit dynamically changes which results in the memory allocator changing at least one temporary memory limit. 16. A method as in claim 13, wherein the memory allocator uses a vector in shared memory to store memory limits, current memory consumption and control data. 17. A method as in claim 13, wherein each process has an associated slot in the vector, each slot specifying a number of bytes allocated by the memory allocator to the process, the temporary memory limit for each process being stored in the corresponding slot, each slot specifying an absolute process limit specific to the process which the temporary memory limit cannot exceed. 18. A method as in claim 13, further comprising: signaling processes having temporary memory limits which have been reduced in response to the increasing memory limit of another process to free at least a portion of their cached data. 19. A method as in claim 18, wherein all signaled processes free a proportional amount of their cached data. 20. A system comprising:
at least one data processor; memory coupled to the at least one data processor, the memory storing instructions, which when executed, cause the at least one data processor to perform operations comprising:
assigning, by a memory allocator, temporary memory limits to each of a plurality of processes requiring memory; and
changing at least one assigned temporary memory limit during execution of a corresponding process. | A memory allocator assigns temporary memory limits to each of a plurality of processes requiring memory. Thereafter, at least one assigned temporary memory limit is changed during execution of a corresponding process. Related apparatus, systems, techniques and articles are also described.1. A computer program product comprising a non-transitory machine-readable medium storing instructions that, when executed by at least one programmable processor, cause the at least one programmable processor to perform operations comprising:
assigning, by a memory allocator, temporary memory limits to each of a plurality of processes requiring memory; and changing at least one assigned temporary memory limit during execution of a corresponding process. 2. A computer program product as in claim 1, wherein a global memory limit is defined that specifies an aggregate amount of memory to be consumed by all of the plurality of processes, the memory allocator assigning the temporary memory limits to the plurality of processes such that the global memory limit is not exceeded. 3. A computer program product as in claim 2, wherein the global memory limit dynamically changes which results in the memory allocator changing at least one temporary memory limit. 4. A computer program product as in claim 1, wherein the memory allocator uses a vector in shared memory to store memory limits, current memory consumption and control data. 5. A computer program product as in claim 1, wherein each process has an associated slot in the vector. 6. A computer program product as in claim 5, wherein each slot specifies a number of bytes allocated by the memory allocator to the process. 7. A computer program product as in claim 5, wherein the temporary memory limit for each process is stored in the corresponding slot. 8. A computer program product as in claim 5, wherein each slot specifies an absolute process limit specific to the process which the temporary memory limit cannot exceed. 9. A computer program product as in claim 1, wherein the operations further comprise: signaling processes having temporary memory limits which have been reduced in response to the increasing memory limit of another process to free at least a portion of their cached data. 10. A computer program product as in claim 9, wherein all signaled processes free a proportional amount of their cached data. 11. A computer program product as in claim 9, wherein the freed cached data is returned to an operating system executing the memory allocator. 12. A computer program product as in claim 11, wherein the memory allocator subsequently allocates at least a portion of the memory returned to the operating system. 13. A method comprising:
assigning, by a memory allocator, temporary memory limits to each of a plurality of processes requiring memory; and changing at least one assigned temporary memory limit during execution of a corresponding process. 14. A method as in claim 13, wherein a global memory limit is defined that specifies an aggregate amount of memory to be consumed by all of the plurality of processes, the memory allocator assigning the temporary memory limits to the plurality of processes such that the global memory limit is not exceeded. 15. A method as in claim 14, wherein the global memory limit dynamically changes which results in the memory allocator changing at least one temporary memory limit. 16. A method as in claim 13, wherein the memory allocator uses a vector in shared memory to store memory limits, current memory consumption and control data. 17. A method as in claim 13, wherein each process has an associated slot in the vector, each slot specifying a number of bytes allocated by the memory allocator to the process, the temporary memory limit for each process being stored in the corresponding slot, each slot specifying an absolute process limit specific to the process which the temporary memory limit cannot exceed. 18. A method as in claim 13, further comprising: signaling processes having temporary memory limits which have been reduced in response to the increasing memory limit of another process to free at least a portion of their cached data. 19. A method as in claim 18, wherein all signaled processes free a proportional amount of their cached data. 20. A system comprising:
at least one data processor; memory coupled to the at least one data processor, the memory storing instructions, which when executed, cause the at least one data processor to perform operations comprising:
assigning, by a memory allocator, temporary memory limits to each of a plurality of processes requiring memory; and
changing at least one assigned temporary memory limit during execution of a corresponding process. | 2,100 |
5,140 | 13,427,830 | 2,142 | A reaction indicator in the form of a graphical user interface is disclosed. The reaction indicator combines sentiment and intensity data relating to an asset for use in real-time evaluation of publicly traded assets, in particular equities and commodities. The reaction indicator includes graphic objects displayed upon a monitor that depict social media market sentiment, a timeline slider object, and a vertical bar chart object. The sentiment is derived based upon pairs of lexical items in local syntactic context found in a volume of social media messages. | 1. A reaction indicator in the form of a graphical user interface, the reaction indicator combining sentiment and intensity data relating to a publicly traded asset for use in real-time evaluation of the publicly traded asset, comprising:
graphic objects displayed upon a monitor that depict social media market sentiment derived based upon pairs of lexical items in local syntactic context found in a volume of social media messages; and a timeline slider object. 2. The reaction indicator according to claim 1, wherein the graphic object is a sphere. 3. The reaction indicator according to claim 1, wherein the graphic object depicts sentiments and intensity. 4. The reaction indicator according to claim 3, wherein the graphic object changes color based upon sentiment. 5. The reaction indicator according to claim 3, wherein the graphic object changes size based upon intensity. 6. The reaction indicator according to claim 1, further including a central graphic object visualizing a weighted average of all graphic objects based on weights assigned to the graphic objects. 7. The reaction indicator according to claim 1, wherein sentiment is based upon polarity and strength. 8. The reaction indicator according to claim 1, wherein intensity is based upon a frequency of messages about the asset. 9. The reaction indicator according to claim 1, further including a vertical bar chart object. 10. The reaction indicator according to claim 1, wherein the asset is selected from the group of equities and commodities. 11. A reaction indicator in the form of a graphical user interface, the reaction indicator combining sentiment and intensity data relating to a publicly traded asset for use in real-time evaluation of the publicly traded asset, comprising:
graphic objects displayed upon a monitor that depict sentiment and intensity based upon processing of social media messages. 12. The reaction indicator according to claim 11, further including a timeline slider object. 13. The reaction indicator according to claim 11, further including a vertical bar chart object. 14. The reaction indicator according to claim 11, wherein the graphic object is a sphere. 15. The reaction indicator according to claim 11, wherein the graphic object changes color based upon sentiment. 16. The reaction indicator according to claim 11, wherein the graphic object changes size based upon intensity. 17. The reaction indicator according to claim 11, further including a central graphic object visualizing a weighted average of all graphic objects based on weights assigned to the graphic objects. 18. The reaction indicator according to claim 11, wherein sentiment is based upon polarity and strength derived based upon pairs of lexical items in local syntactic context found in the social media messages. 19. The reaction indicator according to claim 11, where intensity is based upon a frequency of messages about the asset. 20. The reaction indicator according to claim 11, wherein the asset is selected from the group of equities and commodities. | A reaction indicator in the form of a graphical user interface is disclosed. The reaction indicator combines sentiment and intensity data relating to an asset for use in real-time evaluation of publicly traded assets, in particular equities and commodities. The reaction indicator includes graphic objects displayed upon a monitor that depict social media market sentiment, a timeline slider object, and a vertical bar chart object. The sentiment is derived based upon pairs of lexical items in local syntactic context found in a volume of social media messages.1. A reaction indicator in the form of a graphical user interface, the reaction indicator combining sentiment and intensity data relating to a publicly traded asset for use in real-time evaluation of the publicly traded asset, comprising:
graphic objects displayed upon a monitor that depict social media market sentiment derived based upon pairs of lexical items in local syntactic context found in a volume of social media messages; and a timeline slider object. 2. The reaction indicator according to claim 1, wherein the graphic object is a sphere. 3. The reaction indicator according to claim 1, wherein the graphic object depicts sentiments and intensity. 4. The reaction indicator according to claim 3, wherein the graphic object changes color based upon sentiment. 5. The reaction indicator according to claim 3, wherein the graphic object changes size based upon intensity. 6. The reaction indicator according to claim 1, further including a central graphic object visualizing a weighted average of all graphic objects based on weights assigned to the graphic objects. 7. The reaction indicator according to claim 1, wherein sentiment is based upon polarity and strength. 8. The reaction indicator according to claim 1, wherein intensity is based upon a frequency of messages about the asset. 9. The reaction indicator according to claim 1, further including a vertical bar chart object. 10. The reaction indicator according to claim 1, wherein the asset is selected from the group of equities and commodities. 11. A reaction indicator in the form of a graphical user interface, the reaction indicator combining sentiment and intensity data relating to a publicly traded asset for use in real-time evaluation of the publicly traded asset, comprising:
graphic objects displayed upon a monitor that depict sentiment and intensity based upon processing of social media messages. 12. The reaction indicator according to claim 11, further including a timeline slider object. 13. The reaction indicator according to claim 11, further including a vertical bar chart object. 14. The reaction indicator according to claim 11, wherein the graphic object is a sphere. 15. The reaction indicator according to claim 11, wherein the graphic object changes color based upon sentiment. 16. The reaction indicator according to claim 11, wherein the graphic object changes size based upon intensity. 17. The reaction indicator according to claim 11, further including a central graphic object visualizing a weighted average of all graphic objects based on weights assigned to the graphic objects. 18. The reaction indicator according to claim 11, wherein sentiment is based upon polarity and strength derived based upon pairs of lexical items in local syntactic context found in the social media messages. 19. The reaction indicator according to claim 11, where intensity is based upon a frequency of messages about the asset. 20. The reaction indicator according to claim 11, wherein the asset is selected from the group of equities and commodities. | 2,100 |
5,141 | 13,633,337 | 2,176 | A panoptic visualization system includes an enforcer and a layout engine coupled thereto. The enforcer is configured to identify a restricted document component of a panoptic visualization document collection having a plurality of document components each of which includes respective media content and has associated metadata providing information about the respective document component. The associated metadata for the document components may further include information identifying links between the respective document components. The layout engine is configured to generate a layout of panoptically-arranged visual representations of the document components according to the document components and associated metadata. For the restricted document component, the layout engine is configured to generate the layout according to the associated metadata for the restricted document component, but the generated layout includes a visual representation of the restriction in place of the restricted document component. And the layout engine is configured to communicate the layout. | 1. A panoptic visualization system comprising:
an enforcer configured to identify a restricted document component of a panoptic visualization document collection having a plurality of document components each of which includes respective media content and has associated metadata providing information about the respective document component, the associated metadata for the document components further including information identifying links between the respective document components; and a layout engine coupled to the enforcer and configured to generate a layout of panoptically-arranged visual representations of the document components according to the document components and associated metadata, wherein for the restricted document component, the layout engine is configured to generate the layout according to the associated metadata for the restricted document component, but the generated layout includes a visual representation of the restriction in place of the restricted document component, and wherein the layout engine is configured to communicate the layout. 2. The panoptic visualization system of claim 1, wherein the layout engine is further configured to retrieve the document components including the restricted document component before generation of the layout, and
wherein the layout engine being configured to generate the layout includes being configured to generate the layout including the restricted document component, and including the visual representation of the restriction overlaying the restricted document component. 3. The panoptic visualization system of claim 2 further comprising:
an administrator configured to grant access to the restricted document component, and in response thereto, automatically remove the visual representation of the restriction from the layout. 4. The panoptic visualization system of claim 1, wherein the layout engine being configured to generate the layout includes being configured to generate the layout replacing the restricted document component in the layout with the visual representation of the restriction. 5. The panoptic visualization system of claim 4 further comprising:
an administrator configured to grant access to the restricted document component, and in response thereto, automatically replace the visual representation of the restriction in the layout with the restricted document component. 6. The panoptic visualization system of claim 1, wherein the layout engine is further configured to select a layout model from a plurality of layout models for panoptically-arranged visual representations of the document components, the layout model being selected according to the associated metadata for at least one of the document components, and
wherein the layout engine being configured to generate the layout includes being configured to generate the layout further based on the selected layout model. 7. The panoptic visualization system of claim 1, wherein the associated metadata for each of the document components provides information specifying one or more of a size, location or depth of the visual representation of the respective document component in the layout, and
wherein for the document components and visual representation of the restricted document component, the layout engine is configured to generate the layout according to the one or more of the size, location or depth specified by the information provided in the associated metadata. 8. The panoptic visualization system of claim 7, wherein the layout engine is further configured to retrieve the document components before generation of the layout,
wherein for each of one or more of the document components, the document component is in a state including visual representations at respective resolutions of the document component, and the associated metadata provides information specifying at least the size of the visual representation of the respective document component in the layout, and wherein for each of one or more of the document components, the layout engine is configured to retrieve the document component for the visual representation at a resolution that matches the size specified by the information provided in the associated metadata. 9. A method comprising:
identifying a restricted document component of a panoptic visualization document collection having a plurality of document components each of which includes respective media content and has associated metadata providing information about the respective document component, the associated metadata for the document components further including information identifying links between the respective document components; generating a layout of panoptically-arranged visual representations of the document components according to the document components and associated metadata, wherein for the restricted document component, the layout is generated according to the associated metadata for the restricted document component, but the generated layout includes a visual representation of the restriction in place of the restricted document component; and communicating the layout. 10. The method of claim 9 further comprising retrieving the document components including the restricted document component before generation of the layout,
wherein generating the layout includes generating the layout including the restricted document component, and including the visual representation of the restriction overlaying the restricted document component. 11. The method of claim 10 further comprising:
granting access to the restricted document component, and in response thereto, automatically removing the visual representation of the restriction from the layout. 12. The method of claim 9, wherein generating the layout includes generating the layout replacing the restricted document component in the layout with the visual representation of the restriction. 13. The method of claim 12 further comprising:
granting access to the restricted document component in the layout, and in response thereto, automatically replacing the visual representation of the restriction in the layout with the restricted document component. 14. The method of claim 9 further comprising selecting a layout model from a plurality of layout models for panoptically-arranged visual representations of the document components, the layout model being selected according to the associated metadata for at least one of the document components,
wherein generating the layout includes generating the layout further based on the selected layout model. 15. The method of claim 9, wherein the associated metadata for each of the document components provides information specifying one or more of a size, location or depth of the visual representation of the respective document component in the layout, and
wherein for the document components and visual representation of the restricted document component, the layout is generated according to the one or more of the size, location or depth specified by the information provided in the associated metadata. 16. The method of claim 15 further comprising retrieving the document components before generation of the layout,
wherein for each of one or more of the document components, the document component is in a state including visual representations at respective resolutions of the document component, and the associated metadata provides information specifying at least the size of the visual representation of the respective document component in the layout, and
wherein for each of one or more of the document components, the document component is retrieved for the visual representation at a resolution that matches the size specified by the information provided in the associated metadata. 17. A computer-readable storage medium having computer-readable program code portions stored therein that, in response to execution by a processor, cause an apparatus to at least:
identify a restricted document component of a panoptic visualization document collection having a plurality of document components each of which includes respective media content and has associated metadata providing information about the respective document component, the associated metadata for the document components further including information identifying links between the respective document components; generate a layout of panoptically-arranged visual representations of the document components according to the document components and associated metadata, wherein for the restricted document component, the apparatus is caused to generate the layout according to the associated metadata for the restricted document component, but the generated layout includes a visual representation of the restriction in place of the restricted document component; and communicate the layout. 18. The computer-readable storage medium of claim 17, wherein the computer-readable storage medium has further computer-readable program code portions stored therein that, in response to execution by the processor, cause the apparatus to further:
retrieve the document components including the restricted document component before generation of the layout, wherein the apparatus being caused to generate the layout includes being caused to generate the layout including the restricted document component, and including the visual representation of the restriction overlaying the restricted document component. 19. The computer-readable storage medium of claim 18, wherein the computer-readable storage medium has further computer-readable program code portions stored therein that, in response to execution by the processor, cause the apparatus to further:
grant access to the restricted document component, and in response thereto, automatically remove the visual representation of the restriction from the layout. 20. The computer-readable storage medium of claim 17, wherein the apparatus being caused to generate the layout includes being caused to generate the layout replacing the restricted document component in the layout with the visual representation of the restriction. 21. The computer-readable storage medium of claim 20, wherein the computer-readable storage medium has further computer-readable program code portions stored therein that, in response to execution by the processor, cause the apparatus to further:
grant access to the restricted document component, and in response thereto, automatically replace the visual representation of the restriction in the layout with the restricted document component. 22. The computer-readable storage medium of claim 17, wherein the computer-readable storage medium has further computer-readable program code portions stored therein that, in response to execution by the processor, cause the apparatus to further:
select a layout model from a plurality of layout models for panoptically-arranged visual representations of the document components, the layout model being selected according to the associated metadata for at least one of the document components, and wherein the apparatus being caused to generate the layout includes being caused to generate the layout further based on the selected layout model. 23. The computer-readable storage medium of claim 17, wherein the associated metadata for each of the document components provides information specifying one or more of a size, location or depth of the visual representation of the respective document component in the layout, and
wherein for the document components and visual representation of the restricted document component, the apparatus is configured to generate the layout according to the one or more of the size, location or depth specified by the information provided in the associated metadata. 24. The computer-readable storage medium of claim 23, wherein the computer-readable storage medium has further computer-readable program code portions stored therein that, in response to execution by the processor, cause the apparatus to further:
retrieve the document components before generation of the layout, wherein for each of one or more of the document components, the document component is in a state including visual representations at respective resolutions of the document component, and the associated metadata provides information specifying at least the size of the visual representation of the respective document component in the layout, and wherein for each of one or more of the document components, the apparatus is caused to retrieve the document component for the visual representation at a resolution that matches the size specified by the information provided in the associated metadata. | A panoptic visualization system includes an enforcer and a layout engine coupled thereto. The enforcer is configured to identify a restricted document component of a panoptic visualization document collection having a plurality of document components each of which includes respective media content and has associated metadata providing information about the respective document component. The associated metadata for the document components may further include information identifying links between the respective document components. The layout engine is configured to generate a layout of panoptically-arranged visual representations of the document components according to the document components and associated metadata. For the restricted document component, the layout engine is configured to generate the layout according to the associated metadata for the restricted document component, but the generated layout includes a visual representation of the restriction in place of the restricted document component. And the layout engine is configured to communicate the layout.1. A panoptic visualization system comprising:
an enforcer configured to identify a restricted document component of a panoptic visualization document collection having a plurality of document components each of which includes respective media content and has associated metadata providing information about the respective document component, the associated metadata for the document components further including information identifying links between the respective document components; and a layout engine coupled to the enforcer and configured to generate a layout of panoptically-arranged visual representations of the document components according to the document components and associated metadata, wherein for the restricted document component, the layout engine is configured to generate the layout according to the associated metadata for the restricted document component, but the generated layout includes a visual representation of the restriction in place of the restricted document component, and wherein the layout engine is configured to communicate the layout. 2. The panoptic visualization system of claim 1, wherein the layout engine is further configured to retrieve the document components including the restricted document component before generation of the layout, and
wherein the layout engine being configured to generate the layout includes being configured to generate the layout including the restricted document component, and including the visual representation of the restriction overlaying the restricted document component. 3. The panoptic visualization system of claim 2 further comprising:
an administrator configured to grant access to the restricted document component, and in response thereto, automatically remove the visual representation of the restriction from the layout. 4. The panoptic visualization system of claim 1, wherein the layout engine being configured to generate the layout includes being configured to generate the layout replacing the restricted document component in the layout with the visual representation of the restriction. 5. The panoptic visualization system of claim 4 further comprising:
an administrator configured to grant access to the restricted document component, and in response thereto, automatically replace the visual representation of the restriction in the layout with the restricted document component. 6. The panoptic visualization system of claim 1, wherein the layout engine is further configured to select a layout model from a plurality of layout models for panoptically-arranged visual representations of the document components, the layout model being selected according to the associated metadata for at least one of the document components, and
wherein the layout engine being configured to generate the layout includes being configured to generate the layout further based on the selected layout model. 7. The panoptic visualization system of claim 1, wherein the associated metadata for each of the document components provides information specifying one or more of a size, location or depth of the visual representation of the respective document component in the layout, and
wherein for the document components and visual representation of the restricted document component, the layout engine is configured to generate the layout according to the one or more of the size, location or depth specified by the information provided in the associated metadata. 8. The panoptic visualization system of claim 7, wherein the layout engine is further configured to retrieve the document components before generation of the layout,
wherein for each of one or more of the document components, the document component is in a state including visual representations at respective resolutions of the document component, and the associated metadata provides information specifying at least the size of the visual representation of the respective document component in the layout, and wherein for each of one or more of the document components, the layout engine is configured to retrieve the document component for the visual representation at a resolution that matches the size specified by the information provided in the associated metadata. 9. A method comprising:
identifying a restricted document component of a panoptic visualization document collection having a plurality of document components each of which includes respective media content and has associated metadata providing information about the respective document component, the associated metadata for the document components further including information identifying links between the respective document components; generating a layout of panoptically-arranged visual representations of the document components according to the document components and associated metadata, wherein for the restricted document component, the layout is generated according to the associated metadata for the restricted document component, but the generated layout includes a visual representation of the restriction in place of the restricted document component; and communicating the layout. 10. The method of claim 9 further comprising retrieving the document components including the restricted document component before generation of the layout,
wherein generating the layout includes generating the layout including the restricted document component, and including the visual representation of the restriction overlaying the restricted document component. 11. The method of claim 10 further comprising:
granting access to the restricted document component, and in response thereto, automatically removing the visual representation of the restriction from the layout. 12. The method of claim 9, wherein generating the layout includes generating the layout replacing the restricted document component in the layout with the visual representation of the restriction. 13. The method of claim 12 further comprising:
granting access to the restricted document component in the layout, and in response thereto, automatically replacing the visual representation of the restriction in the layout with the restricted document component. 14. The method of claim 9 further comprising selecting a layout model from a plurality of layout models for panoptically-arranged visual representations of the document components, the layout model being selected according to the associated metadata for at least one of the document components,
wherein generating the layout includes generating the layout further based on the selected layout model. 15. The method of claim 9, wherein the associated metadata for each of the document components provides information specifying one or more of a size, location or depth of the visual representation of the respective document component in the layout, and
wherein for the document components and visual representation of the restricted document component, the layout is generated according to the one or more of the size, location or depth specified by the information provided in the associated metadata. 16. The method of claim 15 further comprising retrieving the document components before generation of the layout,
wherein for each of one or more of the document components, the document component is in a state including visual representations at respective resolutions of the document component, and the associated metadata provides information specifying at least the size of the visual representation of the respective document component in the layout, and
wherein for each of one or more of the document components, the document component is retrieved for the visual representation at a resolution that matches the size specified by the information provided in the associated metadata. 17. A computer-readable storage medium having computer-readable program code portions stored therein that, in response to execution by a processor, cause an apparatus to at least:
identify a restricted document component of a panoptic visualization document collection having a plurality of document components each of which includes respective media content and has associated metadata providing information about the respective document component, the associated metadata for the document components further including information identifying links between the respective document components; generate a layout of panoptically-arranged visual representations of the document components according to the document components and associated metadata, wherein for the restricted document component, the apparatus is caused to generate the layout according to the associated metadata for the restricted document component, but the generated layout includes a visual representation of the restriction in place of the restricted document component; and communicate the layout. 18. The computer-readable storage medium of claim 17, wherein the computer-readable storage medium has further computer-readable program code portions stored therein that, in response to execution by the processor, cause the apparatus to further:
retrieve the document components including the restricted document component before generation of the layout, wherein the apparatus being caused to generate the layout includes being caused to generate the layout including the restricted document component, and including the visual representation of the restriction overlaying the restricted document component. 19. The computer-readable storage medium of claim 18, wherein the computer-readable storage medium has further computer-readable program code portions stored therein that, in response to execution by the processor, cause the apparatus to further:
grant access to the restricted document component, and in response thereto, automatically remove the visual representation of the restriction from the layout. 20. The computer-readable storage medium of claim 17, wherein the apparatus being caused to generate the layout includes being caused to generate the layout replacing the restricted document component in the layout with the visual representation of the restriction. 21. The computer-readable storage medium of claim 20, wherein the computer-readable storage medium has further computer-readable program code portions stored therein that, in response to execution by the processor, cause the apparatus to further:
grant access to the restricted document component, and in response thereto, automatically replace the visual representation of the restriction in the layout with the restricted document component. 22. The computer-readable storage medium of claim 17, wherein the computer-readable storage medium has further computer-readable program code portions stored therein that, in response to execution by the processor, cause the apparatus to further:
select a layout model from a plurality of layout models for panoptically-arranged visual representations of the document components, the layout model being selected according to the associated metadata for at least one of the document components, and wherein the apparatus being caused to generate the layout includes being caused to generate the layout further based on the selected layout model. 23. The computer-readable storage medium of claim 17, wherein the associated metadata for each of the document components provides information specifying one or more of a size, location or depth of the visual representation of the respective document component in the layout, and
wherein for the document components and visual representation of the restricted document component, the apparatus is configured to generate the layout according to the one or more of the size, location or depth specified by the information provided in the associated metadata. 24. The computer-readable storage medium of claim 23, wherein the computer-readable storage medium has further computer-readable program code portions stored therein that, in response to execution by the processor, cause the apparatus to further:
retrieve the document components before generation of the layout, wherein for each of one or more of the document components, the document component is in a state including visual representations at respective resolutions of the document component, and the associated metadata provides information specifying at least the size of the visual representation of the respective document component in the layout, and wherein for each of one or more of the document components, the apparatus is caused to retrieve the document component for the visual representation at a resolution that matches the size specified by the information provided in the associated metadata. | 2,100 |
5,142 | 14,765,323 | 2,145 | An electronic device includes a touch-sensitive display screen to display a graphical representation of a mathematical relationship and to enable a user to enter a one-dimensional touch gesture thereon for performing a one-dimensional adjustment function for the displayed graphical representation. A display adjustment module interprets the one-dimensional touch gesture and performs the one-dimensional adjustment function. The display adjustment module performs a one-dimensional zoom adjustment function in response to one of a one-dimensional pinch touch gesture and a one-dimensional spread touch gesture. The one-dimensional zoom adjustment function increases or reduces a displayed range of values in a first dimension while maintaining unchanged a displayed range of values in a second dimension of the displayed graphical representation. | 1. An electronic device, comprising:
a touch-sensitive display screen to display a graphical representation of a mathematical relationship and to enable a user to enter a one-dimensional touch gesture thereon for performing a one-dimensional adjustment function for the displayed graphical representation; and a display adjustment module to interpret the one-dimensional touch gesture and perform the one-dimensional adjustment function, wherein the display adjustment module performs a one-dimensional zoom adjustment function in response to one of a one-dimensional pinch touch gesture and a one-dimensional spread touch gesture, wherein the one-dimensional zoom adjustment function increases or reduces a displayed range of values in a first dimension while maintaining unchanged a displayed range of values in a second dimension of the displayed graphical representation. 2. The electronic device of claim 1, wherein the display adjustment module performs a vertical zoom-out adjustment function in response to a vertical pinch touch gesture, wherein the vertical zoom-out adjustment function increases the displayed range of values in a vertical dimension while the displayed range of values in a horizontal dimension remains unchanged. 3. The electronic device of claim 1, wherein the display adjustment module performs a vertical zoom-in adjustment function in response to a vertical spread touch gesture, wherein the vertical zoom-in adjustment function decreases the displayed range of values in a vertical dimension while the displayed range of values in a horizontal dimension remains unchanged. 4. The electronic device of claim 1, wherein the display adjustment module performs a horizontal zoom-out adjustment function in response to a horizontal pinch touch gesture, wherein the horizontal zoom-out adjustment function increases the displayed range of values in a horizontal dimension while the displayed range of values in a vertical dimension remains unchanged. 5. The electronic device of claim 1, wherein the display adjustment module performs a horizontal zoom-in adjustment function in response to a horizontal spread touch gesture, wherein the horizontal zoom-in adjustment function decreases the displayed range of values in a horizontal dimension while the displayed range of values in a vertical dimension remains unchanged. 6. The electronic device of claim 1, wherein the display adjustment module continually and dynamically adjusts the graphical representation while the touch gesture is being performed. 7. The electronic device of claim 6, wherein the display adjustment module causes the adjustment of the graphical representation to momentarily pause at a set of predetermined zoom factors. 8. The electronic device of claim 1, wherein the one-dimensional zoom adjustment function varies depending upon whether the touch gesture involves two moving digits of the user, or one moving digit and one fixed digit. 9. The electronic device of claim 8, wherein the display adjustment module performs a one-dimensional zoom about an axis of the graphical representation when the touch gesture involves two moving digits of the user, and performs a one-dimensional zoom about a point under the fixed digit when the touch gesture involves one moving digit and one fixed digit. 10. The electronic device of claim 1, wherein rotation of digits of the user performing the one-dimensional touch gesture locks a current zoom factor, and further rotation provides a fine adjustment to the zoom factor. 11. An electronic device, comprising:
a touch-sensitive display screen to display a table of values of a mathematical function and to enable a user to enter a touch gesture thereon for performing an adjustment function for the displayed table of values; and a display adjustment module to interpret the touch gesture and perform the adjustment function, wherein the display adjustment module performs a zoom adjustment function in response to one of a pinch touch gesture and a spread touch gesture, wherein the zoom adjustment function modifies a delta value between consecutive values in a column of the table. 12. The electronic device of claim 11, wherein the table of values includes a plurality of columns, including a first column containing values for an independent variable of the mathematical function and a second column containing values for an expression defined in terms of the independent variable, wherein the values in the first column have a constant delta value, and wherein the zoom adjustment function involves multiplying the constant delta value by a scale factor. 13. The electronic device of claim 12, wherein the zoom adjustment function is performed with respect to a selected value in the first column of the table, and wherein the selected value is held fixed during the zoom adjustment function. 14. The electronic device of claim 11, wherein the touch gesture is one of a vertical pinch touch gesture and a vertical spread touch gesture, and wherein the adjustment function increases the delta value between consecutive values in a column of the table for the vertical pinch touch gesture and decreases the delta value between consecutive values in a column of the table for the vertical spread touch gesture. 15. An electronic device, comprising:
a touch-sensitive display screen to enable a user to enter a touch gesture thereon for performing an adjustment function for displayed information; and a display adjustment module to interpret the touch gesture and perform the adjustment function, wherein the display adjustment module performs at least one of a numerical result adjustment and a symbolic expression adjustment, wherein the numerical result adjustment involves decreasing a number of digits displayed for a selected numerical result in response to a pinch touch gesture to round the selected numerical result to fewer place values, and increasing the number of digits displayed for the selected numerical result in response to a spread touch gesture, and wherein the symbolic expression adjustment involves factoring and simplifying a selected symbolic expression in response to a pinch touch gesture and expanding the selected symbolic expression in response to a spread touch gesture. | An electronic device includes a touch-sensitive display screen to display a graphical representation of a mathematical relationship and to enable a user to enter a one-dimensional touch gesture thereon for performing a one-dimensional adjustment function for the displayed graphical representation. A display adjustment module interprets the one-dimensional touch gesture and performs the one-dimensional adjustment function. The display adjustment module performs a one-dimensional zoom adjustment function in response to one of a one-dimensional pinch touch gesture and a one-dimensional spread touch gesture. The one-dimensional zoom adjustment function increases or reduces a displayed range of values in a first dimension while maintaining unchanged a displayed range of values in a second dimension of the displayed graphical representation.1. An electronic device, comprising:
a touch-sensitive display screen to display a graphical representation of a mathematical relationship and to enable a user to enter a one-dimensional touch gesture thereon for performing a one-dimensional adjustment function for the displayed graphical representation; and a display adjustment module to interpret the one-dimensional touch gesture and perform the one-dimensional adjustment function, wherein the display adjustment module performs a one-dimensional zoom adjustment function in response to one of a one-dimensional pinch touch gesture and a one-dimensional spread touch gesture, wherein the one-dimensional zoom adjustment function increases or reduces a displayed range of values in a first dimension while maintaining unchanged a displayed range of values in a second dimension of the displayed graphical representation. 2. The electronic device of claim 1, wherein the display adjustment module performs a vertical zoom-out adjustment function in response to a vertical pinch touch gesture, wherein the vertical zoom-out adjustment function increases the displayed range of values in a vertical dimension while the displayed range of values in a horizontal dimension remains unchanged. 3. The electronic device of claim 1, wherein the display adjustment module performs a vertical zoom-in adjustment function in response to a vertical spread touch gesture, wherein the vertical zoom-in adjustment function decreases the displayed range of values in a vertical dimension while the displayed range of values in a horizontal dimension remains unchanged. 4. The electronic device of claim 1, wherein the display adjustment module performs a horizontal zoom-out adjustment function in response to a horizontal pinch touch gesture, wherein the horizontal zoom-out adjustment function increases the displayed range of values in a horizontal dimension while the displayed range of values in a vertical dimension remains unchanged. 5. The electronic device of claim 1, wherein the display adjustment module performs a horizontal zoom-in adjustment function in response to a horizontal spread touch gesture, wherein the horizontal zoom-in adjustment function decreases the displayed range of values in a horizontal dimension while the displayed range of values in a vertical dimension remains unchanged. 6. The electronic device of claim 1, wherein the display adjustment module continually and dynamically adjusts the graphical representation while the touch gesture is being performed. 7. The electronic device of claim 6, wherein the display adjustment module causes the adjustment of the graphical representation to momentarily pause at a set of predetermined zoom factors. 8. The electronic device of claim 1, wherein the one-dimensional zoom adjustment function varies depending upon whether the touch gesture involves two moving digits of the user, or one moving digit and one fixed digit. 9. The electronic device of claim 8, wherein the display adjustment module performs a one-dimensional zoom about an axis of the graphical representation when the touch gesture involves two moving digits of the user, and performs a one-dimensional zoom about a point under the fixed digit when the touch gesture involves one moving digit and one fixed digit. 10. The electronic device of claim 1, wherein rotation of digits of the user performing the one-dimensional touch gesture locks a current zoom factor, and further rotation provides a fine adjustment to the zoom factor. 11. An electronic device, comprising:
a touch-sensitive display screen to display a table of values of a mathematical function and to enable a user to enter a touch gesture thereon for performing an adjustment function for the displayed table of values; and a display adjustment module to interpret the touch gesture and perform the adjustment function, wherein the display adjustment module performs a zoom adjustment function in response to one of a pinch touch gesture and a spread touch gesture, wherein the zoom adjustment function modifies a delta value between consecutive values in a column of the table. 12. The electronic device of claim 11, wherein the table of values includes a plurality of columns, including a first column containing values for an independent variable of the mathematical function and a second column containing values for an expression defined in terms of the independent variable, wherein the values in the first column have a constant delta value, and wherein the zoom adjustment function involves multiplying the constant delta value by a scale factor. 13. The electronic device of claim 12, wherein the zoom adjustment function is performed with respect to a selected value in the first column of the table, and wherein the selected value is held fixed during the zoom adjustment function. 14. The electronic device of claim 11, wherein the touch gesture is one of a vertical pinch touch gesture and a vertical spread touch gesture, and wherein the adjustment function increases the delta value between consecutive values in a column of the table for the vertical pinch touch gesture and decreases the delta value between consecutive values in a column of the table for the vertical spread touch gesture. 15. An electronic device, comprising:
a touch-sensitive display screen to enable a user to enter a touch gesture thereon for performing an adjustment function for displayed information; and a display adjustment module to interpret the touch gesture and perform the adjustment function, wherein the display adjustment module performs at least one of a numerical result adjustment and a symbolic expression adjustment, wherein the numerical result adjustment involves decreasing a number of digits displayed for a selected numerical result in response to a pinch touch gesture to round the selected numerical result to fewer place values, and increasing the number of digits displayed for the selected numerical result in response to a spread touch gesture, and wherein the symbolic expression adjustment involves factoring and simplifying a selected symbolic expression in response to a pinch touch gesture and expanding the selected symbolic expression in response to a spread touch gesture. | 2,100 |
5,143 | 12,942,721 | 2,169 | A method begins by a processing module receiving a data storage request and accessing a file directory to identify dispersed storage network (DSN) systems. The method continues with the processing module identifying dispersed storage (DS) units to produce identified DS units for each of the DSN systems and selecting one of the DSN systems to produce a selected DSN system. The method continues with the processing module selecting a set of DS units from the identified DS units of the selected DSN system to produce selected DS units, wherein the selected DS units store a set of encoded data slices. The method continues with the processing module updating the file directory to include an identity of the selected DS units and an identity of the set of encoded data slices. | 1. A method comprises:
receiving a data storage request; accessing a file directory to identify dispersed storage network (DSN) systems; for each of the DSN systems, identifying dispersed storage (DS) units based on a desired dispersed error coding performance level to produce identified DS units; selecting one of the DSN systems based on a collective dispersed error coding performance level of the identified DS units of the one of the DSN systems to produce a selected DSN system; selecting a set of DS units from the identified DS units of the selected DSN system based on the desired dispersed error coding performance level to produce selected DS units, wherein the selected DS units store a set of encoded data slices; and updating the file directory to include an identity of the selected DS units and an identity of the set of encoded data slices. 2. The method of claim 1, wherein the file directory comprises:
a listing of DSN systems; a root file directory identifier; one or more intermediate file directory identifiers; a file name or data block identifier; a DSN system identifier; DS unit identifiers; and slice names. 3. The method of claim 1, wherein the updating the file directory comprises:
creating a file name associated with the set of encoded data slices; linking the file name to one or more intermediate file directory folders; linking the one or more intermediate file directories folders to a root directory folder; linking the file name to a DSN identifier of the selected DSN system; linking the file name to slice names of the set of encoded data slices; and linking the slice names to DS unit identifiers of the selected DS units. 4. The method of claim 3 further comprises:
creating at least one of the one or more intermediate file directory folders. 5. The method of claim 1, wherein the desired dispersed error coding performance level comprises at least one of:
an indication of dispersed error coding storage requirements; an indication of historical dispersed error coding storage performance; an indication of available storage; an indication of processing capabilities; an indication of latency performance; and an indication of bandwidth performance. 6. A method comprises:
receiving a data storage request for a particular type of data storage; identifying a dispersed storage network (DSN) system from a plurality of DSN systems based on the particular type of data storage to produce an identified DSN system; identifying dispersed storage (DS) units within the identified DSN system based on the particular type of data storage to produce identified DS units; selecting a set of DS units from the identified DS units of the identified DSN system based on the particular type of data storage to produce selected DS units, wherein the selected DS units store a set of encoded data slices; and updating the file directory to include an identity of the selected DS units and an identity of the set of encoded data slices. 7. The method of claim 6, wherein the particular type of data storage comprises at least one of:
a data type indication; a weighted storage requirement; a data retrieval latency indication; a data bandwidth indication; dispersed error coding storage function parameters; and a date usage indication. 8. The method of claim 6, wherein the updating the file directory comprises:
creating a file name associated with the set of encoded data slices; linking the file name to one or more intermediate file directory folders; linking the one or more intermediate file directories folders to a root directory folder; linking the file name to a DSN identifier of the identified DSN system; linking the file name to slice names of the set of encoded data slices; and linking the slice names to DS unit identifiers of the selected DS units. 9. The method of claim 8 further comprises:
creating at least one of the one or more intermediate file directory folders. 10. A computer comprises:
an interface; and a processing module operable to:
receive, via the interface, a data storage request;
access a file directory to identify dispersed storage network (DSN) systems;
identify dispersed storage (DS) units based on a desired dispersed error coding performance level to produce identified DS units for each of the DSN systems;
select one of the DSN systems based on a collective dispersed error coding performance level of the identified DS units of the one of the DSN systems to produce a selected DSN system;
select a set of DS units from the identified DS units of the selected DSN system based on the desired dispersed error coding performance level to produce selected DS units, wherein the selected DS units store a set of encoded data slices; and
update the file directory to include an identity of the selected DS units and an identity of the set of encoded data slices. 11. The computer of claim 10, wherein the file directory comprises:
a listing of DSN systems; a root file directory identifier; one or more intermediate file directory identifiers; a file name or data block identifier; a DSN system identifier; DS unit identifiers; and slice names. 12. The computer of claim 10, wherein the processing module further functions to update the file directory by:
creating a file name associated with the set of encoded data slices; linking the file name to one or more intermediate file directory folders; linking the one or more intermediate file directories folders to a root directory folder; linking the file name to a DSN identifier of the selected DSN system; linking the file name to slice names of the set of encoded data slices; and linking the slice names to DS unit identifiers of the selected DS units. 13. The computer of claim 12, wherein the processing module further functions to:
create at least one of the one or more intermediate file directory folders. 14. The computer of claim 10, wherein the desired dispersed error coding performance level comprises at least one of:
an indication of dispersed error coding storage requirements; an indication of historical dispersed error coding storage performance; an indication of available storage; an indication of processing capabilities; an indication of latency performance; and an indication of bandwidth performance. 15. A computer comprises:
an interface; and a processing module operable to:
receive, via the interface, a data storage request for a particular type of data storage;
identify a dispersed storage network (DSN) system from a plurality of DSN systems based on the particular type of data storage to produce an identified DSN system;
identify dispersed storage (DS) units within the identified DSN system based on the particular type of data storage to produce identified DS units;
select a set of DS units from the identified DS units of the identified DSN system based on the particular type of data storage to produce selected DS units, wherein the selected DS units store a set of encoded data slices; and
update the file directory to include an identity of the selected DS units and an identity of the set of encoded data slices. 16. The computer of claim 15, wherein the particular type of data storage comprises at least one of:
a data type indication; a weighted storage requirement; a data retrieval latency indication; a data bandwidth indication; dispersed error coding storage function parameters; and a date usage indication. 17. The computer of claim 15, wherein the processing module further functions to update the file directory by:
creating a file name associated with the set of encoded data slices; linking the file name to one or more intermediate file directory folders; linking the one or more intermediate file directories folders to a root directory folder; linking the file name to a DSN identifier of the identified DSN system; linking the file name to slice names of the set of encoded data slices; and linking the slice names to DS unit identifiers of the selected DS units. 18. The computer of claim 17, wherein the processing module further functions to:
create at least one of the one or more intermediate file directory folders. | A method begins by a processing module receiving a data storage request and accessing a file directory to identify dispersed storage network (DSN) systems. The method continues with the processing module identifying dispersed storage (DS) units to produce identified DS units for each of the DSN systems and selecting one of the DSN systems to produce a selected DSN system. The method continues with the processing module selecting a set of DS units from the identified DS units of the selected DSN system to produce selected DS units, wherein the selected DS units store a set of encoded data slices. The method continues with the processing module updating the file directory to include an identity of the selected DS units and an identity of the set of encoded data slices.1. A method comprises:
receiving a data storage request; accessing a file directory to identify dispersed storage network (DSN) systems; for each of the DSN systems, identifying dispersed storage (DS) units based on a desired dispersed error coding performance level to produce identified DS units; selecting one of the DSN systems based on a collective dispersed error coding performance level of the identified DS units of the one of the DSN systems to produce a selected DSN system; selecting a set of DS units from the identified DS units of the selected DSN system based on the desired dispersed error coding performance level to produce selected DS units, wherein the selected DS units store a set of encoded data slices; and updating the file directory to include an identity of the selected DS units and an identity of the set of encoded data slices. 2. The method of claim 1, wherein the file directory comprises:
a listing of DSN systems; a root file directory identifier; one or more intermediate file directory identifiers; a file name or data block identifier; a DSN system identifier; DS unit identifiers; and slice names. 3. The method of claim 1, wherein the updating the file directory comprises:
creating a file name associated with the set of encoded data slices; linking the file name to one or more intermediate file directory folders; linking the one or more intermediate file directories folders to a root directory folder; linking the file name to a DSN identifier of the selected DSN system; linking the file name to slice names of the set of encoded data slices; and linking the slice names to DS unit identifiers of the selected DS units. 4. The method of claim 3 further comprises:
creating at least one of the one or more intermediate file directory folders. 5. The method of claim 1, wherein the desired dispersed error coding performance level comprises at least one of:
an indication of dispersed error coding storage requirements; an indication of historical dispersed error coding storage performance; an indication of available storage; an indication of processing capabilities; an indication of latency performance; and an indication of bandwidth performance. 6. A method comprises:
receiving a data storage request for a particular type of data storage; identifying a dispersed storage network (DSN) system from a plurality of DSN systems based on the particular type of data storage to produce an identified DSN system; identifying dispersed storage (DS) units within the identified DSN system based on the particular type of data storage to produce identified DS units; selecting a set of DS units from the identified DS units of the identified DSN system based on the particular type of data storage to produce selected DS units, wherein the selected DS units store a set of encoded data slices; and updating the file directory to include an identity of the selected DS units and an identity of the set of encoded data slices. 7. The method of claim 6, wherein the particular type of data storage comprises at least one of:
a data type indication; a weighted storage requirement; a data retrieval latency indication; a data bandwidth indication; dispersed error coding storage function parameters; and a date usage indication. 8. The method of claim 6, wherein the updating the file directory comprises:
creating a file name associated with the set of encoded data slices; linking the file name to one or more intermediate file directory folders; linking the one or more intermediate file directories folders to a root directory folder; linking the file name to a DSN identifier of the identified DSN system; linking the file name to slice names of the set of encoded data slices; and linking the slice names to DS unit identifiers of the selected DS units. 9. The method of claim 8 further comprises:
creating at least one of the one or more intermediate file directory folders. 10. A computer comprises:
an interface; and a processing module operable to:
receive, via the interface, a data storage request;
access a file directory to identify dispersed storage network (DSN) systems;
identify dispersed storage (DS) units based on a desired dispersed error coding performance level to produce identified DS units for each of the DSN systems;
select one of the DSN systems based on a collective dispersed error coding performance level of the identified DS units of the one of the DSN systems to produce a selected DSN system;
select a set of DS units from the identified DS units of the selected DSN system based on the desired dispersed error coding performance level to produce selected DS units, wherein the selected DS units store a set of encoded data slices; and
update the file directory to include an identity of the selected DS units and an identity of the set of encoded data slices. 11. The computer of claim 10, wherein the file directory comprises:
a listing of DSN systems; a root file directory identifier; one or more intermediate file directory identifiers; a file name or data block identifier; a DSN system identifier; DS unit identifiers; and slice names. 12. The computer of claim 10, wherein the processing module further functions to update the file directory by:
creating a file name associated with the set of encoded data slices; linking the file name to one or more intermediate file directory folders; linking the one or more intermediate file directories folders to a root directory folder; linking the file name to a DSN identifier of the selected DSN system; linking the file name to slice names of the set of encoded data slices; and linking the slice names to DS unit identifiers of the selected DS units. 13. The computer of claim 12, wherein the processing module further functions to:
create at least one of the one or more intermediate file directory folders. 14. The computer of claim 10, wherein the desired dispersed error coding performance level comprises at least one of:
an indication of dispersed error coding storage requirements; an indication of historical dispersed error coding storage performance; an indication of available storage; an indication of processing capabilities; an indication of latency performance; and an indication of bandwidth performance. 15. A computer comprises:
an interface; and a processing module operable to:
receive, via the interface, a data storage request for a particular type of data storage;
identify a dispersed storage network (DSN) system from a plurality of DSN systems based on the particular type of data storage to produce an identified DSN system;
identify dispersed storage (DS) units within the identified DSN system based on the particular type of data storage to produce identified DS units;
select a set of DS units from the identified DS units of the identified DSN system based on the particular type of data storage to produce selected DS units, wherein the selected DS units store a set of encoded data slices; and
update the file directory to include an identity of the selected DS units and an identity of the set of encoded data slices. 16. The computer of claim 15, wherein the particular type of data storage comprises at least one of:
a data type indication; a weighted storage requirement; a data retrieval latency indication; a data bandwidth indication; dispersed error coding storage function parameters; and a date usage indication. 17. The computer of claim 15, wherein the processing module further functions to update the file directory by:
creating a file name associated with the set of encoded data slices; linking the file name to one or more intermediate file directory folders; linking the one or more intermediate file directories folders to a root directory folder; linking the file name to a DSN identifier of the identified DSN system; linking the file name to slice names of the set of encoded data slices; and linking the slice names to DS unit identifiers of the selected DS units. 18. The computer of claim 17, wherein the processing module further functions to:
create at least one of the one or more intermediate file directory folders. | 2,100 |
5,144 | 13,761,256 | 2,163 | This invention relates to a method, system and computer program product for processing instruction code to solve a problem. A method according to an embodiment includes: identifying a first relational data table operating on a second relational data table in the instruction code; selecting one or more sets of decision variables from identified tables and operation; constructing one or more equivalent sets of serialized instructions comprising the equivalent serial logical operations operating on one or more of the identified sets of decision variables; and performing the equivalent sets of serialized instructions to determine a solution to the problem. | 1. A method of processing instruction code to solve a problem, comprising:
identifying a first relational data table operating on a second relational data table in the instruction code; selecting one or more sets of decision variables from identified tables and operation; constructing one or more equivalent sets of serialized instructions comprising equivalent serial logical operations operating on one or more of the identified sets of decision variables; and performing the equivalent sets of serialized instructions to determine a solution to the problem. 2. The method according to claim 1, further comprising:
identifying one or more key types associated with a relational operation for selecting decision variables based on the identified operation key types. 3. The method according to claim 2, further comprising:
grouping the selected decision variables into sets using one or more of the identified key types associated with the relational operation. 4. The method according to claim 2, further comprising:
identifying key types associated with the relational tables and identifying which rows or columns of decision variables are to be used in the operation. 5. The method according to claim 1, further comprising:
performing each portion of instruction code in real time. 6. The method according to claim 1, further comprising:
repeating the identifying and the constructing for all code portions in the instruction code. 7. The method according to claim 1, wherein the decision variables are integer decision variables or real decision variables. 8. The method according to claim 1, wherein the logical operations comprise at least one of summation, subtraction, or finding a product of two tables. 9. The method according to claim 1, wherein the problem is a linear algebra problem. 10. The method according to claim 1, wherein the problem is a quadratic algebra problem. 11. A system for processing instruction code to solve a problem, the system performing a method comprising:
identifying a first relational data table operating on a second relational data table in the instruction code; selecting one or more sets of decision variables from identified tables and operation; constructing one or more equivalent sets of serialized instructions comprising equivalent serial logical operations operating on one or more of the identified sets of variables; and performing the equivalent sets of serialized instructions to determine a solution to the problem. 12. The system according to claim 11, the method further comprising:
identifying one or more key types associated with a relational operation for selecting decision variables based on the identified operation key types. 13. The system according to claim 12, the method further comprising:
grouping the selected decision variables into sets using one or more of the identified key types associated with the relational operation. 14. The system according to claim 12, the method further comprising:
identifying key types associated with the relational tables and identifying which rows or columns of decision variables are to be used in the operation. 15. The system according to claim 11, the method further comprising:
performing each portion of instruction code in real time. 16. The system according to claim 11, the method further comprising:
repeating the identifying and the constructing for all code portions in the instruction code. 17. The system according to claim 11, wherein the decision variables are integer decision variables or real decision variables. 18. The system according to claim 11, wherein the logical operations comprise at least one of summation, subtraction, or finding a product of two tables. 19. A computer program stored on a computer readable storage medium and loadable into the internal memory of a digital computer, comprising software code portions, when the program is run on a computer, for performing the method claim 1. | This invention relates to a method, system and computer program product for processing instruction code to solve a problem. A method according to an embodiment includes: identifying a first relational data table operating on a second relational data table in the instruction code; selecting one or more sets of decision variables from identified tables and operation; constructing one or more equivalent sets of serialized instructions comprising the equivalent serial logical operations operating on one or more of the identified sets of decision variables; and performing the equivalent sets of serialized instructions to determine a solution to the problem.1. A method of processing instruction code to solve a problem, comprising:
identifying a first relational data table operating on a second relational data table in the instruction code; selecting one or more sets of decision variables from identified tables and operation; constructing one or more equivalent sets of serialized instructions comprising equivalent serial logical operations operating on one or more of the identified sets of decision variables; and performing the equivalent sets of serialized instructions to determine a solution to the problem. 2. The method according to claim 1, further comprising:
identifying one or more key types associated with a relational operation for selecting decision variables based on the identified operation key types. 3. The method according to claim 2, further comprising:
grouping the selected decision variables into sets using one or more of the identified key types associated with the relational operation. 4. The method according to claim 2, further comprising:
identifying key types associated with the relational tables and identifying which rows or columns of decision variables are to be used in the operation. 5. The method according to claim 1, further comprising:
performing each portion of instruction code in real time. 6. The method according to claim 1, further comprising:
repeating the identifying and the constructing for all code portions in the instruction code. 7. The method according to claim 1, wherein the decision variables are integer decision variables or real decision variables. 8. The method according to claim 1, wherein the logical operations comprise at least one of summation, subtraction, or finding a product of two tables. 9. The method according to claim 1, wherein the problem is a linear algebra problem. 10. The method according to claim 1, wherein the problem is a quadratic algebra problem. 11. A system for processing instruction code to solve a problem, the system performing a method comprising:
identifying a first relational data table operating on a second relational data table in the instruction code; selecting one or more sets of decision variables from identified tables and operation; constructing one or more equivalent sets of serialized instructions comprising equivalent serial logical operations operating on one or more of the identified sets of variables; and performing the equivalent sets of serialized instructions to determine a solution to the problem. 12. The system according to claim 11, the method further comprising:
identifying one or more key types associated with a relational operation for selecting decision variables based on the identified operation key types. 13. The system according to claim 12, the method further comprising:
grouping the selected decision variables into sets using one or more of the identified key types associated with the relational operation. 14. The system according to claim 12, the method further comprising:
identifying key types associated with the relational tables and identifying which rows or columns of decision variables are to be used in the operation. 15. The system according to claim 11, the method further comprising:
performing each portion of instruction code in real time. 16. The system according to claim 11, the method further comprising:
repeating the identifying and the constructing for all code portions in the instruction code. 17. The system according to claim 11, wherein the decision variables are integer decision variables or real decision variables. 18. The system according to claim 11, wherein the logical operations comprise at least one of summation, subtraction, or finding a product of two tables. 19. A computer program stored on a computer readable storage medium and loadable into the internal memory of a digital computer, comprising software code portions, when the program is run on a computer, for performing the method claim 1. | 2,100 |
5,145 | 12,747,615 | 2,159 | The invention relates to search for cases in a database. According to the proposed method and apparatus, similarity matching is performed between an input case and a set of cases in an initial search to receive similar cases by—using a given matching criterion. Then statistics on image and non-image-based features associated with the similar cases are calculated and presented to the user with the similar cases. In a search refinement the similar cases are refined by additional features that are determined by the user based on the statistics. The search refinement can be iterative depending on the user's need. | 1. A method of searching cases in a database, said method comprising:
a first step of performing similarity matching between an input case and cases in the database by using a first matching criterion, to identify a set of cases similar to said input case; calculating statistics on features associated with the set of similar cases; presenting the set of similar cases and the statistics to a user; receiving a user input including a second matching criterion based on said statistics; and a second step of performing similarity matching between the input case and the set of similar cases by using said second matching criterion. 2. A method as claimed in claim 1, wherein the cases in the database include a plurality of images classified according to different imaging modalities, said first step of performing similarity matching comprising:
performing similarity matching between an input case and cases in the database for each imaging modality to identify a plurality of respective sets of similar cases by using said first matching criterion; and selecting cases that appear in at least two sets of said sets of similar cases, and to be used by said step of calculating statistics;
wherein said second step of performing similarity matching is performed between the input case and the selected similar cases. 3. A method as claimed in claim 1, wherein the features associated with the set of similar cases are image-based and/or non-image based features. 4. A method as claimed in claim 3, wherein the first matching criterion includes at least one image-based feature and the second matching criterion includes at least one non-image-based feature. 5. A method as claimed in claim 3, wherein the first matching criterion includes at least one non-image-based feature and the second matching criterion includes at least one image-based feature. 6. A method as claimed in claim 3 wherein the steps of performing similarity matching include calculating a similarity value for each case to be compared, for indicating the degree of similarity between the input case and the case to be compared. 7. A method as claimed in claim 6, wherein the similarity value is Euclidean distance, Mahalanobis distance or weighted combination of these two distances. 8. A method as claimed in claim 3 further comprising an iterative step of performing similarity matching between the input case and an updated set of similar cases by using an updated similarity matching criterion based on a further user input to retrieve cases similar to the user. 9. A method as claimed in claim 3, wherein the user input further comprises a numerical value given to each feature in the criterion, and the second step of performing similarity matching includes calculating a similarity metric by using the numerical values. 10. A method as claimed in 3, wherein the user input further comprises any one of image-based features and non-image-based features presented in the similar cases that are the most similar cases to the input case. 11. An apparatus (300) of searching cases in a database (303), said apparatus (300) comprising:
a first matching unit (310) for performing similarity matching between an input case and cases in the database by using a first matching criterion, to identify a set of cases similar to said input case; a calculating unit (320) for calculating statistics on features associated with the set of similar cases; a presenting unit (330) for presenting the set of similar cases and the statistics to a user; a receiving unit (340) for receiving a user input including a second matching criterion based on said statistics; and a second matching unit (350) for performing similarity matching between the input case and the set of similar cases by using said second matching criterion. 12. An apparatus as claimed in claim 11, wherein the cases in the database include a plurality of images classified according to different modalities, wherein the first matching unit (310) is further arranged for performing similarity matching between an input case and cases in the database for each imaging modality to identify a plurality of respective sets of similar cases by using said first matching criterion and selecting cases that appear in at least two sets of said sets of similar cases, and to be used by said step of calculating statistics; and the second matching unit (350) is further arranged for performing similarity matching between the input case and the selected similar cases. 13. An apparatus as claimed in claim 11, wherein the features associated with the set of similar cases are image-based and/or non-image based features. 14. An apparatus as claimed in claim 13, wherein any one of the first and second matching units is further arranged for calculating a similarity value for each case to be compared, for indicating the degree of similarity between the input case and the case to be compared. 15. An apparatus as claimed in claim 11 further comprising a controller (360) for controlling an iterative step of performing similarity matching between the input case and an updated set of similar cases by using an updated similarity matching criterion based on a further user input to retrieve cases similar to the user. | The invention relates to search for cases in a database. According to the proposed method and apparatus, similarity matching is performed between an input case and a set of cases in an initial search to receive similar cases by—using a given matching criterion. Then statistics on image and non-image-based features associated with the similar cases are calculated and presented to the user with the similar cases. In a search refinement the similar cases are refined by additional features that are determined by the user based on the statistics. The search refinement can be iterative depending on the user's need.1. A method of searching cases in a database, said method comprising:
a first step of performing similarity matching between an input case and cases in the database by using a first matching criterion, to identify a set of cases similar to said input case; calculating statistics on features associated with the set of similar cases; presenting the set of similar cases and the statistics to a user; receiving a user input including a second matching criterion based on said statistics; and a second step of performing similarity matching between the input case and the set of similar cases by using said second matching criterion. 2. A method as claimed in claim 1, wherein the cases in the database include a plurality of images classified according to different imaging modalities, said first step of performing similarity matching comprising:
performing similarity matching between an input case and cases in the database for each imaging modality to identify a plurality of respective sets of similar cases by using said first matching criterion; and selecting cases that appear in at least two sets of said sets of similar cases, and to be used by said step of calculating statistics;
wherein said second step of performing similarity matching is performed between the input case and the selected similar cases. 3. A method as claimed in claim 1, wherein the features associated with the set of similar cases are image-based and/or non-image based features. 4. A method as claimed in claim 3, wherein the first matching criterion includes at least one image-based feature and the second matching criterion includes at least one non-image-based feature. 5. A method as claimed in claim 3, wherein the first matching criterion includes at least one non-image-based feature and the second matching criterion includes at least one image-based feature. 6. A method as claimed in claim 3 wherein the steps of performing similarity matching include calculating a similarity value for each case to be compared, for indicating the degree of similarity between the input case and the case to be compared. 7. A method as claimed in claim 6, wherein the similarity value is Euclidean distance, Mahalanobis distance or weighted combination of these two distances. 8. A method as claimed in claim 3 further comprising an iterative step of performing similarity matching between the input case and an updated set of similar cases by using an updated similarity matching criterion based on a further user input to retrieve cases similar to the user. 9. A method as claimed in claim 3, wherein the user input further comprises a numerical value given to each feature in the criterion, and the second step of performing similarity matching includes calculating a similarity metric by using the numerical values. 10. A method as claimed in 3, wherein the user input further comprises any one of image-based features and non-image-based features presented in the similar cases that are the most similar cases to the input case. 11. An apparatus (300) of searching cases in a database (303), said apparatus (300) comprising:
a first matching unit (310) for performing similarity matching between an input case and cases in the database by using a first matching criterion, to identify a set of cases similar to said input case; a calculating unit (320) for calculating statistics on features associated with the set of similar cases; a presenting unit (330) for presenting the set of similar cases and the statistics to a user; a receiving unit (340) for receiving a user input including a second matching criterion based on said statistics; and a second matching unit (350) for performing similarity matching between the input case and the set of similar cases by using said second matching criterion. 12. An apparatus as claimed in claim 11, wherein the cases in the database include a plurality of images classified according to different modalities, wherein the first matching unit (310) is further arranged for performing similarity matching between an input case and cases in the database for each imaging modality to identify a plurality of respective sets of similar cases by using said first matching criterion and selecting cases that appear in at least two sets of said sets of similar cases, and to be used by said step of calculating statistics; and the second matching unit (350) is further arranged for performing similarity matching between the input case and the selected similar cases. 13. An apparatus as claimed in claim 11, wherein the features associated with the set of similar cases are image-based and/or non-image based features. 14. An apparatus as claimed in claim 13, wherein any one of the first and second matching units is further arranged for calculating a similarity value for each case to be compared, for indicating the degree of similarity between the input case and the case to be compared. 15. An apparatus as claimed in claim 11 further comprising a controller (360) for controlling an iterative step of performing similarity matching between the input case and an updated set of similar cases by using an updated similarity matching criterion based on a further user input to retrieve cases similar to the user. | 2,100 |
5,146 | 12,057,000 | 2,166 | A computing environment typically comprises a large set of diverse objects, such as files, user profiles, executable binaries, configuration information, and data caches, wherein such objects are typically stored and managed by an aggregation of systems, such as a file system, a system registry, and an assembly cache. An alternative representation of the computer system may comprise an object hierarchy configured to store all of the objects of the computing environment according to a simple organizational grammar. Various services (e.g., a synchronization service, a backup service, and a sharing service) may be provided to manage the diverse objects in a similar manner. The representation may also be provided to a variety of devices, which may render the computing environment in a consistent manner but adjusted to reflect the capabilities of the device and the user. The computing environment is thereby represented in a deployable, consistent, and extensible manner. | 1. A method of representing a computing environment, the method comprising:
representing objects of the computing environment in an object hierarchy, respective objects represented according to a recursable base representation format. 2. The method of claim 1, the recursable base representation format comprising a recursable sequence of records of atoms. 3. The method of claim 1, the object hierarchy represented as XML. 4. The method of claim 1, at least one object represented as an unexpanded node. 5. The method of claim 4, the method comprising:
upon receiving a request to expand an unexpanded node, providing the object of the unexpanded node. 6. The method of claim 1:
the unexpanded node referencing an object store containing the object of the unexpanded node, and the method comprising: upon receiving a request to expand an unexpanded node referencing an object store:
requesting the object from the object store, and
upon receiving the object from the data store, providing the object in response to the request. 7. The method of claim 1:
the computing environment represented to a device, and the representation adjusted according to capabilities of the device. 8. The method of claim 7:
the capabilities of the device including a device storage capacity, and the adjusting comprising: representing the computing environment with at least one unexpanded node to limit the size of the represented computing environment to not exceed the device storage capacity. 9. The method of claim 1:
the computing environment represented for a user, and the representation adjusted according to the user. 10. The method of claim 9:
the computing environment specifying a user account for the user, the computing environment specifying the access privileges for the user account to the objects of the computing environment, and the adjusting comprising: representing the computing environment with at least one unexpanded node representing a portion of the object hierarchy restricted from the user according to the access privileges of the user account. 11. The method of claim 1, comprising:
transforming the computing environment from the recursable base representation format to a data interchange format. 12. The method of claim 1, comprising:
marshaling the objects of the computing environment as instances of at least one class of a platform representation format. 13. A system for representing a computing environment, the system comprising:
a computing environment object store configured to store objects comprising the computing environment; a computing environment representing component configured to represent the objects of the computing environment in an object hierarchy, respective objects represented according to a recursable base representation format; and a computing environment services set comprising at least one computing environment service configured to operate on the objects of the computing environment. 14. The system of claim 13:
at least one object of the object hierarchy represented as an unexpanded node, and the system comprising: a computing environment node expansion component configured, upon receiving a request to expand an unexpanded node, to provide the object of the unexpanded node. 15. The system of claim 14:
at least one unexpanded node referencing an object store containing the object of the unexpanded node, and the system comprising: a computing environment object store accessing component configured, upon receiving a request to expand the unexpanded node referencing the object store, to:
request the object from the object store, and
upon receiving the object from the data store, provide the object in response to the request. 16. The system of claim 13:
the computing environment representing component configured to:
receive a request for the computing environment specifying a data interchange format, and
transforming the computing environment from the recursable base representation format to the data interchange format. 17. The system of claim 13, comprising:
a computing environment altering component configured to:
receive at least one computing environment alteration, and
altering the object hierarchy according to the computing environment alteration. 18. The system of claim 17:
the computing environment alteration including at least one class instance of the computing environment according to a representation format, and the computing environment altering component configured to transform the class instance into an object representation according to the recursable base representation format. 19. The system of claim 13, the computing environment services set comprising at least one of an object backup service, an object query service, an object synchronization service, and an object event reporting service. 20. A system for representing a computing environment, the system comprising:
a computing environment object store configured to store an object hierarchy of objects comprising the computing environment, respective objects represented according to a recursable base representation format comprising a recursable sequence of records of atoms; a computing environment representing component configured to:
receive a request for the computing environment specifying a data interchange format,
transform the object hierarchy from the recursable base representation format into the data interchange format, and
provide the transformed object hierarchy in response to the request;
a computing environment node expansion component configured, upon receiving a request to expand an unexpanded node representing an object of the object hierarchy, to provide the object; a computing environment external object store accessing component configured, upon receiving a request to expand an unexpanded node representing an object of the object hierarchy and referencing an external object store, to:
request the object from the external object store, and
upon receiving the object from the external object store, provide the object in response to the request;
a computing environment altering component configured to:
receive at least one computing environment alteration,
transform objects represented in the computing environment alteration into an object representation according to the recursable base representation format, and
alter the object hierarchy according to the computing environment alteration; and
a computing environment services set comprising at least one computing environment service configured to operate on the objects of the computing environment. | A computing environment typically comprises a large set of diverse objects, such as files, user profiles, executable binaries, configuration information, and data caches, wherein such objects are typically stored and managed by an aggregation of systems, such as a file system, a system registry, and an assembly cache. An alternative representation of the computer system may comprise an object hierarchy configured to store all of the objects of the computing environment according to a simple organizational grammar. Various services (e.g., a synchronization service, a backup service, and a sharing service) may be provided to manage the diverse objects in a similar manner. The representation may also be provided to a variety of devices, which may render the computing environment in a consistent manner but adjusted to reflect the capabilities of the device and the user. The computing environment is thereby represented in a deployable, consistent, and extensible manner.1. A method of representing a computing environment, the method comprising:
representing objects of the computing environment in an object hierarchy, respective objects represented according to a recursable base representation format. 2. The method of claim 1, the recursable base representation format comprising a recursable sequence of records of atoms. 3. The method of claim 1, the object hierarchy represented as XML. 4. The method of claim 1, at least one object represented as an unexpanded node. 5. The method of claim 4, the method comprising:
upon receiving a request to expand an unexpanded node, providing the object of the unexpanded node. 6. The method of claim 1:
the unexpanded node referencing an object store containing the object of the unexpanded node, and the method comprising: upon receiving a request to expand an unexpanded node referencing an object store:
requesting the object from the object store, and
upon receiving the object from the data store, providing the object in response to the request. 7. The method of claim 1:
the computing environment represented to a device, and the representation adjusted according to capabilities of the device. 8. The method of claim 7:
the capabilities of the device including a device storage capacity, and the adjusting comprising: representing the computing environment with at least one unexpanded node to limit the size of the represented computing environment to not exceed the device storage capacity. 9. The method of claim 1:
the computing environment represented for a user, and the representation adjusted according to the user. 10. The method of claim 9:
the computing environment specifying a user account for the user, the computing environment specifying the access privileges for the user account to the objects of the computing environment, and the adjusting comprising: representing the computing environment with at least one unexpanded node representing a portion of the object hierarchy restricted from the user according to the access privileges of the user account. 11. The method of claim 1, comprising:
transforming the computing environment from the recursable base representation format to a data interchange format. 12. The method of claim 1, comprising:
marshaling the objects of the computing environment as instances of at least one class of a platform representation format. 13. A system for representing a computing environment, the system comprising:
a computing environment object store configured to store objects comprising the computing environment; a computing environment representing component configured to represent the objects of the computing environment in an object hierarchy, respective objects represented according to a recursable base representation format; and a computing environment services set comprising at least one computing environment service configured to operate on the objects of the computing environment. 14. The system of claim 13:
at least one object of the object hierarchy represented as an unexpanded node, and the system comprising: a computing environment node expansion component configured, upon receiving a request to expand an unexpanded node, to provide the object of the unexpanded node. 15. The system of claim 14:
at least one unexpanded node referencing an object store containing the object of the unexpanded node, and the system comprising: a computing environment object store accessing component configured, upon receiving a request to expand the unexpanded node referencing the object store, to:
request the object from the object store, and
upon receiving the object from the data store, provide the object in response to the request. 16. The system of claim 13:
the computing environment representing component configured to:
receive a request for the computing environment specifying a data interchange format, and
transforming the computing environment from the recursable base representation format to the data interchange format. 17. The system of claim 13, comprising:
a computing environment altering component configured to:
receive at least one computing environment alteration, and
altering the object hierarchy according to the computing environment alteration. 18. The system of claim 17:
the computing environment alteration including at least one class instance of the computing environment according to a representation format, and the computing environment altering component configured to transform the class instance into an object representation according to the recursable base representation format. 19. The system of claim 13, the computing environment services set comprising at least one of an object backup service, an object query service, an object synchronization service, and an object event reporting service. 20. A system for representing a computing environment, the system comprising:
a computing environment object store configured to store an object hierarchy of objects comprising the computing environment, respective objects represented according to a recursable base representation format comprising a recursable sequence of records of atoms; a computing environment representing component configured to:
receive a request for the computing environment specifying a data interchange format,
transform the object hierarchy from the recursable base representation format into the data interchange format, and
provide the transformed object hierarchy in response to the request;
a computing environment node expansion component configured, upon receiving a request to expand an unexpanded node representing an object of the object hierarchy, to provide the object; a computing environment external object store accessing component configured, upon receiving a request to expand an unexpanded node representing an object of the object hierarchy and referencing an external object store, to:
request the object from the external object store, and
upon receiving the object from the external object store, provide the object in response to the request;
a computing environment altering component configured to:
receive at least one computing environment alteration,
transform objects represented in the computing environment alteration into an object representation according to the recursable base representation format, and
alter the object hierarchy according to the computing environment alteration; and
a computing environment services set comprising at least one computing environment service configured to operate on the objects of the computing environment. | 2,100 |
5,147 | 14,954,491 | 2,165 | The method comprises processing plural product information records from the product information sources into one or more groups based on which product information records are likely to correspond to the same product, correlating a unique product ID corresponding to the product associated with each of said groups to identify the product, comparing each identified product to categories of a taxonomy to determine a category for the identified products in the taxonomy, and determining attributes for each categorized product based on the product information records corresponding to each group, creating product specifications based on the determined attributes and storing the product specification in the corresponding determined categories of the taxonomy. | 1. A method of aggregating product information for use in a product database including various products arranged in product categories, the product information being collected from a plurality of sources in a networked computer environment regarding products of a product category comprising the steps of:
retrieving, by a server coupled to the networked computer environment, product phrase information from each of the plurality of sources, said product phrase information including at least one phrase and at least one characteristic; and determining, using computational linguistics, whether at least one said at least phrase of said product phrase information is a product characteristic associated with a product category. 2. The method of claim 1, wherein said at least one characteristic of said phrase includes at least one of frequency, location, font size, font style, font case, font effects, font color, collocation and co-occurrence of said phrase in each of said plurality of sources. 3. The method of claim 2, wherein the plurality of sources include at least one of a manufacturer's product specifications source, a product literature source, and a merchant's information source. 4. The method of claim 3, said determining step further including the step of cross-referencing said product phrase information to a category database to determine a product category of at least one of a manufacturer's product specifications source, a product literature source, and a merchant's information source. 5. The method of claim 4, further including the step of applying statistical analysis to said product phrase information to rank each phrase based on said at least one characteristic of said phrase thereby providing a ranking of phrases. 6. The method of claim 5, further including the step of storing at least one of said product phrase information and said ranking of phrases in a product phrase database. 7. The method of claim 3, wherein said retrieving includes retrieving pricing information and at least one of product phrase information, product model information, manufacturer's identity information, and merchant identity information from said merchant's information source. 8. The method of claim 7, wherein retrieved information is stored in a product offerings database. 9. The method of claim 3, wherein said a manufacturer's product specifications source is a manufacturer's product specifications Web page, said product literature source is a product literature Web page, and said merchant's information source is a merchant's Web page. 10. The method of claim 1, further including the step of storing each phrase determined to be a product property in a product property database. 11. The method of claim 10, further including the step of ranking phrases determined to be a product property. 12. The method of claim 11, wherein said retrieving includes retrieving pricing information and at least one of product phrase information, product model information, manufacturer's identity information, and merchant identity information from said merchant's information source. 13. The method of claim 12, wherein retrieved information is stored in a product offerings database. 14. The method of claim 1, further comprising:
applying statistical analysis to said product phrase information to rank each phrase based on said at least one characteristic of said phrase thereby providing a ranking of phrases; determining whether each phrase of each of said product phrase information is a product property indicative of a characteristic of at least one of a product and a product category; and determining whether each phrase determined to be a product property is evaluative. 15. A system for aggregating product information for use in a product database including various products arranged in product categories, the product information being collected from a plurality of sources in a networked computer environment regarding products of a product category, the system comprising:
at least one processor; and at least one memory operatively coupled to said at least one processor and having computer executable instructions stored thereon which, when executed by one or more of the at least one processors, causes the one or more of the at least one processors to:
retrieve product phrase information from each of the plurality of sources, said product phrase information including at least one phrase and at least one characteristic; and
determine, using computational linguistics, whether at least one said at least phrase of said product phrase information is a product characteristic associated with a product category. 16. The system of claim 15, wherein said at least one characteristic of said phrase includes at least one of frequency, location, font size, font style, font case, font effects, font color, collocation and co-occurrence of said phrase in each of said plurality of sources. 17. The system of claim 16, wherein the plurality of sources include at least one of a manufacturer's product specifications source, a product literature source, and a merchant's information source. 18. The system of claim 17, wherein said instructions further cause one or more of said at least one processors to cross-reference said product phrase information to a category database to determine a product category of at least one of a manufacturer's product specifications source, a product literature source, and a merchant's information source. 19. The system of claim 18, wherein said instructions further cause one or more of said at least one processors to apply statistical analysis to said product phrase information to rank each phrase based on said at least one characteristic of said phrase thereby providing a ranking of phrases. 20. The system of claim 19, wherein said instructions further cause one or more of said at least one processors to cause at least one of said product phrase information and said ranking of phrases to be stored in a product phrase database. 21. The system of claim 17, wherein said retrieving includes retrieving pricing information and at least one of product phrase information, product model information, manufacturer's identity information, and merchant identity information from said merchant's information source. 22. The system of claim 21, wherein retrieved information is stored in a product offerings database. 23. The system of claim 17, wherein said a manufacturer's product specifications source is a manufacturer's product specifications Web page, said product literature source is a product literature Web page, and said merchant's information source is a merchant's Web page. 24. The system of claim 15, wherein said instructions further cause one or more of said at least one processors to cause each phrase determined to be a product property to be stored in a product property database. 25. The system of claim 24, wherein said instructions further cause one or more of said at least one processors to rank phrases determined to be a product property. 26. The system of claim 25, wherein said retrieving includes retrieving pricing information and at least one of product phrase information, product model information, manufacturer's identity information, and merchant identity information from said merchant's information source. 27. The system of claim 26, wherein retrieved information is stored in a product offerings database. 28. The system of claim 15, wherein said instructions further cause one or more of said at least one processors to apply statistical analysis to said product phrase information to rank each phrase based on said at least one characteristic of said phrase thereby providing a ranking of phrases, determine whether each phrase of each of said product phrase information is a product property indicative of a characteristic of at least one of a product and a product category, and determine whether each phrase determined to be a product property is evaluative. | The method comprises processing plural product information records from the product information sources into one or more groups based on which product information records are likely to correspond to the same product, correlating a unique product ID corresponding to the product associated with each of said groups to identify the product, comparing each identified product to categories of a taxonomy to determine a category for the identified products in the taxonomy, and determining attributes for each categorized product based on the product information records corresponding to each group, creating product specifications based on the determined attributes and storing the product specification in the corresponding determined categories of the taxonomy.1. A method of aggregating product information for use in a product database including various products arranged in product categories, the product information being collected from a plurality of sources in a networked computer environment regarding products of a product category comprising the steps of:
retrieving, by a server coupled to the networked computer environment, product phrase information from each of the plurality of sources, said product phrase information including at least one phrase and at least one characteristic; and determining, using computational linguistics, whether at least one said at least phrase of said product phrase information is a product characteristic associated with a product category. 2. The method of claim 1, wherein said at least one characteristic of said phrase includes at least one of frequency, location, font size, font style, font case, font effects, font color, collocation and co-occurrence of said phrase in each of said plurality of sources. 3. The method of claim 2, wherein the plurality of sources include at least one of a manufacturer's product specifications source, a product literature source, and a merchant's information source. 4. The method of claim 3, said determining step further including the step of cross-referencing said product phrase information to a category database to determine a product category of at least one of a manufacturer's product specifications source, a product literature source, and a merchant's information source. 5. The method of claim 4, further including the step of applying statistical analysis to said product phrase information to rank each phrase based on said at least one characteristic of said phrase thereby providing a ranking of phrases. 6. The method of claim 5, further including the step of storing at least one of said product phrase information and said ranking of phrases in a product phrase database. 7. The method of claim 3, wherein said retrieving includes retrieving pricing information and at least one of product phrase information, product model information, manufacturer's identity information, and merchant identity information from said merchant's information source. 8. The method of claim 7, wherein retrieved information is stored in a product offerings database. 9. The method of claim 3, wherein said a manufacturer's product specifications source is a manufacturer's product specifications Web page, said product literature source is a product literature Web page, and said merchant's information source is a merchant's Web page. 10. The method of claim 1, further including the step of storing each phrase determined to be a product property in a product property database. 11. The method of claim 10, further including the step of ranking phrases determined to be a product property. 12. The method of claim 11, wherein said retrieving includes retrieving pricing information and at least one of product phrase information, product model information, manufacturer's identity information, and merchant identity information from said merchant's information source. 13. The method of claim 12, wherein retrieved information is stored in a product offerings database. 14. The method of claim 1, further comprising:
applying statistical analysis to said product phrase information to rank each phrase based on said at least one characteristic of said phrase thereby providing a ranking of phrases; determining whether each phrase of each of said product phrase information is a product property indicative of a characteristic of at least one of a product and a product category; and determining whether each phrase determined to be a product property is evaluative. 15. A system for aggregating product information for use in a product database including various products arranged in product categories, the product information being collected from a plurality of sources in a networked computer environment regarding products of a product category, the system comprising:
at least one processor; and at least one memory operatively coupled to said at least one processor and having computer executable instructions stored thereon which, when executed by one or more of the at least one processors, causes the one or more of the at least one processors to:
retrieve product phrase information from each of the plurality of sources, said product phrase information including at least one phrase and at least one characteristic; and
determine, using computational linguistics, whether at least one said at least phrase of said product phrase information is a product characteristic associated with a product category. 16. The system of claim 15, wherein said at least one characteristic of said phrase includes at least one of frequency, location, font size, font style, font case, font effects, font color, collocation and co-occurrence of said phrase in each of said plurality of sources. 17. The system of claim 16, wherein the plurality of sources include at least one of a manufacturer's product specifications source, a product literature source, and a merchant's information source. 18. The system of claim 17, wherein said instructions further cause one or more of said at least one processors to cross-reference said product phrase information to a category database to determine a product category of at least one of a manufacturer's product specifications source, a product literature source, and a merchant's information source. 19. The system of claim 18, wherein said instructions further cause one or more of said at least one processors to apply statistical analysis to said product phrase information to rank each phrase based on said at least one characteristic of said phrase thereby providing a ranking of phrases. 20. The system of claim 19, wherein said instructions further cause one or more of said at least one processors to cause at least one of said product phrase information and said ranking of phrases to be stored in a product phrase database. 21. The system of claim 17, wherein said retrieving includes retrieving pricing information and at least one of product phrase information, product model information, manufacturer's identity information, and merchant identity information from said merchant's information source. 22. The system of claim 21, wherein retrieved information is stored in a product offerings database. 23. The system of claim 17, wherein said a manufacturer's product specifications source is a manufacturer's product specifications Web page, said product literature source is a product literature Web page, and said merchant's information source is a merchant's Web page. 24. The system of claim 15, wherein said instructions further cause one or more of said at least one processors to cause each phrase determined to be a product property to be stored in a product property database. 25. The system of claim 24, wherein said instructions further cause one or more of said at least one processors to rank phrases determined to be a product property. 26. The system of claim 25, wherein said retrieving includes retrieving pricing information and at least one of product phrase information, product model information, manufacturer's identity information, and merchant identity information from said merchant's information source. 27. The system of claim 26, wherein retrieved information is stored in a product offerings database. 28. The system of claim 15, wherein said instructions further cause one or more of said at least one processors to apply statistical analysis to said product phrase information to rank each phrase based on said at least one characteristic of said phrase thereby providing a ranking of phrases, determine whether each phrase of each of said product phrase information is a product property indicative of a characteristic of at least one of a product and a product category, and determine whether each phrase determined to be a product property is evaluative. | 2,100 |
5,148 | 14,274,151 | 2,144 | A method of an evolutionary nature to automate the process of optimizing website elements, such as web page designs and/or colors and/or content and/or functionality, in order to optimize desired effectiveness and performance by dynamically monitoring performance and adjusting web page and/or website elements accordingly or randomly or as a combination of the two, while optionally dynamically changing test parameters. The process can result in either static or dynamic web design, and can be either stopped or started or become static at any time so that a continual and dynamic process is achieved. | 1. A method comprising:
monitoring various parameters on a website or part of a website on which an activity, an activity level, or a plurality of activities is carried out; changing an element or a plurality of elements on the website or on part of the website according to changes in monitored parameters; and optimizing automatically an effectiveness of the website or part of the website to achieve a desired activity, a desired activity level or a desired plurality of activities as a result of a changed element or a plurality of changed elements. 2. The method according to claim 1, wherein the element or the plurality of elements includes one or more of a design; a content; an image; a video; a hyperlink; an audio; a media file; any element that influences accessibility and/or performance of the website such as, but not limited to, speed, resolution, and color depth; an element that can be perceived by a user consciously or subconsciously; any offering on the website such as, but not limited to, a price, a shipping option, a sale, a deal, a product packaging, a name, a monetary incentive, and a referral incentive; and any functionality of the website. 3. The method according to claim 1, further comprising:
dynamically measuring the effectiveness of the website or the part of the website to achieve the desired activity, the desired activity level, or the desired plurality of activities. 4. The method according to claim 1, wherein an original version of the website or the element is kept and exposed to a portion of users to provide a reference benchmark for improvement. 5. The method according to claim 3, wherein a dynamically measured feature of the activity or the plurality of activities relates to one of a date, a time of day, a geographical location of a user, a best approximation of the user's geographical location, a season of year either at the user's geographical location or at another location, a language setting of a machine accessing the website, any information that is known about the machine and/or a user accessing the website, any information that is assumed about the user accessing the website, any information that was pre-evaluated about the user accessing the website, any information that was pre-acquired about the user accessing the website, and any information either dynamic or predefined. 6. The method according to claim 1, further comprising:
receiving performance data from a website that is being optimized, an external source, or from both the website that is being optimized and the external source. 7. The method according to claim 1, further comprising:
analyzing and/or changing multiple websites. 8. The method according to claim 1, further comprising:
running on the website a process or a plurality of processes that run for a period of time then stop, continuously run, or continuously run and after some time start to dynamically change the website. 9. A method comprising:
logging all occurrences, changes, and add-to-cart clicks on a website with date/time stamps; influencing a color range and color starting points as a factor of the date/time stamps; monitoring the add-to-cart clicks; querying whether there are more or less add-to-cart clicks per web page occurrence; if an answer is that there are more add-to-cart clicks per web page occurrence, then changing a color more in a same direction; if the answer is that there are less add-to-cart clicks per web page occurrence, then changing the color towards a previous color tone; if the answer is that there is no change in add-to-cart clicks per web page occurrence, then not changing the color; and displaying a web element with a selected color. 10. A method comprising:
receiving a web page request; querying whether a background color selection should be either statistically based or randomly based; if statistically based, selecting a background color within a range defined by a statistical analysis; if randomly based, selecting the background color randomly from a set range of colors; displaying the web page with a selected background color; logging all occurrences and checkout clicks with background colors used and date/time of each of the checkout clicks; calculating the statistical analysis of checkout performance per background color and the date/time of each of the checkout clicks; and feeding the statistical analysis back to the step of selecting the background color within the range defined by the statistical analysis. 11. A method comprising:
receiving a web page request; comparing an average time a user now spends on a website with the average time the user spent on the website before a last font size change; if the average time the user now spends is longer, making a font size change more as the last font size change; if the average time the user now spends is shorter, making the font size change opposite to the last font size change; if the average time the user now spends is not changed, then, after every X number of times, where X is a number selected by an operator, increasing or decreasing the font size randomly within a set range to re-check if the font size change is beneficial; displaying the web page with a selected font size change; obtaining analytics information from an external source; analyzing the analytics information for the average time the user spends on the website; and feeding the average time the user spends on the website back to the comparing step. 12. A method comprising:
receiving a web page request; selecting a background color and an image randomly for the web page within a selection range defined by a statistical analysis; displaying the web page with a selected background color and image; logging occurrences and contact-us clicks with the selected background color and image and a date/time for each of the contact-us clicks; calculating the statistical analysis of the contact-us clicks per the selected background color, the image, and the date/time; defining the selection range based on logged data for the selected background color and image; and feeding the selection range to the selecting step. 13. A method comprising:
receiving a web page request; selecting a background color based on a user's season, time of day, a user's geographical location, and a statistical analysis; displaying the web page with a selected background color; logging occurrences with the selected background color, the user's geographical location, a link to store page, and a date/time; calculating the statistical analysis of links to store page per the selected background color, the user's geographical location, and the date/time; defining the background color based on logged data and successive approximation; and feeding the statistical analysis back to the selecting step. | A method of an evolutionary nature to automate the process of optimizing website elements, such as web page designs and/or colors and/or content and/or functionality, in order to optimize desired effectiveness and performance by dynamically monitoring performance and adjusting web page and/or website elements accordingly or randomly or as a combination of the two, while optionally dynamically changing test parameters. The process can result in either static or dynamic web design, and can be either stopped or started or become static at any time so that a continual and dynamic process is achieved.1. A method comprising:
monitoring various parameters on a website or part of a website on which an activity, an activity level, or a plurality of activities is carried out; changing an element or a plurality of elements on the website or on part of the website according to changes in monitored parameters; and optimizing automatically an effectiveness of the website or part of the website to achieve a desired activity, a desired activity level or a desired plurality of activities as a result of a changed element or a plurality of changed elements. 2. The method according to claim 1, wherein the element or the plurality of elements includes one or more of a design; a content; an image; a video; a hyperlink; an audio; a media file; any element that influences accessibility and/or performance of the website such as, but not limited to, speed, resolution, and color depth; an element that can be perceived by a user consciously or subconsciously; any offering on the website such as, but not limited to, a price, a shipping option, a sale, a deal, a product packaging, a name, a monetary incentive, and a referral incentive; and any functionality of the website. 3. The method according to claim 1, further comprising:
dynamically measuring the effectiveness of the website or the part of the website to achieve the desired activity, the desired activity level, or the desired plurality of activities. 4. The method according to claim 1, wherein an original version of the website or the element is kept and exposed to a portion of users to provide a reference benchmark for improvement. 5. The method according to claim 3, wherein a dynamically measured feature of the activity or the plurality of activities relates to one of a date, a time of day, a geographical location of a user, a best approximation of the user's geographical location, a season of year either at the user's geographical location or at another location, a language setting of a machine accessing the website, any information that is known about the machine and/or a user accessing the website, any information that is assumed about the user accessing the website, any information that was pre-evaluated about the user accessing the website, any information that was pre-acquired about the user accessing the website, and any information either dynamic or predefined. 6. The method according to claim 1, further comprising:
receiving performance data from a website that is being optimized, an external source, or from both the website that is being optimized and the external source. 7. The method according to claim 1, further comprising:
analyzing and/or changing multiple websites. 8. The method according to claim 1, further comprising:
running on the website a process or a plurality of processes that run for a period of time then stop, continuously run, or continuously run and after some time start to dynamically change the website. 9. A method comprising:
logging all occurrences, changes, and add-to-cart clicks on a website with date/time stamps; influencing a color range and color starting points as a factor of the date/time stamps; monitoring the add-to-cart clicks; querying whether there are more or less add-to-cart clicks per web page occurrence; if an answer is that there are more add-to-cart clicks per web page occurrence, then changing a color more in a same direction; if the answer is that there are less add-to-cart clicks per web page occurrence, then changing the color towards a previous color tone; if the answer is that there is no change in add-to-cart clicks per web page occurrence, then not changing the color; and displaying a web element with a selected color. 10. A method comprising:
receiving a web page request; querying whether a background color selection should be either statistically based or randomly based; if statistically based, selecting a background color within a range defined by a statistical analysis; if randomly based, selecting the background color randomly from a set range of colors; displaying the web page with a selected background color; logging all occurrences and checkout clicks with background colors used and date/time of each of the checkout clicks; calculating the statistical analysis of checkout performance per background color and the date/time of each of the checkout clicks; and feeding the statistical analysis back to the step of selecting the background color within the range defined by the statistical analysis. 11. A method comprising:
receiving a web page request; comparing an average time a user now spends on a website with the average time the user spent on the website before a last font size change; if the average time the user now spends is longer, making a font size change more as the last font size change; if the average time the user now spends is shorter, making the font size change opposite to the last font size change; if the average time the user now spends is not changed, then, after every X number of times, where X is a number selected by an operator, increasing or decreasing the font size randomly within a set range to re-check if the font size change is beneficial; displaying the web page with a selected font size change; obtaining analytics information from an external source; analyzing the analytics information for the average time the user spends on the website; and feeding the average time the user spends on the website back to the comparing step. 12. A method comprising:
receiving a web page request; selecting a background color and an image randomly for the web page within a selection range defined by a statistical analysis; displaying the web page with a selected background color and image; logging occurrences and contact-us clicks with the selected background color and image and a date/time for each of the contact-us clicks; calculating the statistical analysis of the contact-us clicks per the selected background color, the image, and the date/time; defining the selection range based on logged data for the selected background color and image; and feeding the selection range to the selecting step. 13. A method comprising:
receiving a web page request; selecting a background color based on a user's season, time of day, a user's geographical location, and a statistical analysis; displaying the web page with a selected background color; logging occurrences with the selected background color, the user's geographical location, a link to store page, and a date/time; calculating the statistical analysis of links to store page per the selected background color, the user's geographical location, and the date/time; defining the background color based on logged data and successive approximation; and feeding the statistical analysis back to the selecting step. | 2,100 |
5,149 | 14,554,329 | 2,177 | Embodiments of the invention provide a method, system and computer program product for upgrade feasibility and reporting. In an embodiment of the invention, a method for application upgrade feasibility and reporting includes generating in memory of a computing system a deployment characterization of a customized instance of a computer program designated to receive an upgrade. The method also includes comparing the deployment characterization to a selection of known characterizations of deployment of different customized instances of the computer program, each of the characterization having an association with an upgrade feasibility predictor for the upgrade. The method yet further includes identifying a matching one of the known characterizations for the generated deployment characterization. Finally, the method includes displaying a report on a display of the computing system including an upgrade feasibility predictor corresponding to the matching one of the known characterization. | 1. A method for application upgrade feasibility and reporting, the method comprising:
generating in memory of a computing system a deployment characterization of a customized instance of a computer program designated to receive an upgrade; comparing the deployment characterization to a selection of known characterizations of deployment of different customized instances of the computer program, each of the characterization having an association with an upgrade feasibility predictor for the upgrade; identifying a matching one of the known characterizations for the generated deployment characterization; and, displaying a report on a display of the computing system including an upgrade feasibility predictor corresponding to the matching one of the known characterization. 2. The method of claim 1, wherein the deployment characterization comprises an inventory of components included as part of the customized instance of the computer program. 3. The method of claim 1, wherein the deployment characterization comprises an inventory of components upon which the instance of the computer program is dependent. 4. The method of claim 1, wherein the deployment characterization comprises an inventory of ones of the components that have been modified from a default form of the components. 5. The method of claim 1, wherein the upgrade feasibility predictor comprises an indicator selected from the group consisting of recommended, not recommended, and recommended with caution. 6. The method of claim 1, wherein a hyperlinked reference to crowd-sourced documentation pertaining to particular upgrade issues for the deployment characterization arising from attempting the upgrade is included in the report. 7. An application deployment data processing system configured for application upgrade feasibility and reporting, the system comprising:
a host computing system comprising at least one computer with memory and at least one processor; a data store coupled to the host computing system; a customized instance of a computer program comprising a plurality of components stored in the data store; and, an upgrade feasibility module executing in the memory of the host computing system, the module comprising program code enabled upon execution by the at least one processor to generate in the memory a deployment characterization of the customized instance of the computer program designated to receive an upgrade, to compare the deployment characterization to a selection of known characterizations of deployment of different customized instances of the computer program stored in the data store, each of the characterization having an association with an upgrade feasibility predictor for the upgrade, to identify a matching one of the known characterizations for the generated deployment characterization and to display a report on a display of the host computing system including an upgrade feasibility predictor corresponding to the matching one of the known characterization. 8. The system of claim 7, wherein the deployment characterization comprises an inventory of the components included as part of the customized instance of the computer program. 9. The system of claim 7, wherein the deployment characterization comprises an inventory of other components upon which the instance of the computer program is dependent. 10. The system of claim 7, wherein the deployment characterization comprises an inventory of ones of the components that have been modified from a default form of the components. 11. The system of claim 7, wherein the upgrade feasibility predictor comprises an indicator selected from the group consisting of recommended, not recommended, and recommended with caution. 12. The system of claim 7, wherein a hyperlinked reference to crowd-sourced documentation pertaining to particular upgrade issues for the deployment characterization arising from attempting the upgrade is included in the report. 13. A computer program product for application upgrade feasibility and reporting, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions executable by a device to cause the device to perform a method comprising:
generating by a device in memory of a computing system a deployment characterization of a customized instance of a computer program designated to receive an upgrade; comparing by the device the deployment characterization to a selection of known characterizations of deployment of different customized instances of the computer program, each of the characterization having an association with an upgrade feasibility predictor for the upgrade; identifying by the device a matching one of the known characterizations for the generated deployment characterization; and, displaying by the device a report on a display of the computing system including an upgrade feasibility predictor corresponding to the matching one of the known characterization. 14. The computer program product of claim 13, wherein the deployment characterization comprises an inventory of components included as part of the customized instance of the computer program. 15. The computer program product of claim 13, wherein the deployment characterization comprises an inventory of components upon which the instance of the computer program is dependent. 16. The computer program product of claim 13, wherein the deployment characterization comprises an inventory of ones of the components that have been modified from a default form of the components. 17. The computer program product of claim 13, wherein the upgrade feasibility predictor comprises an indicator selected from the group consisting of recommended, not recommended, and recommended with caution. 18. The computer program product of claim 13, wherein a hyperlinked reference to crowd-sourced documentation pertaining to particular upgrade issues for the deployment characterization arising from attempting the upgrade is included in the report. | Embodiments of the invention provide a method, system and computer program product for upgrade feasibility and reporting. In an embodiment of the invention, a method for application upgrade feasibility and reporting includes generating in memory of a computing system a deployment characterization of a customized instance of a computer program designated to receive an upgrade. The method also includes comparing the deployment characterization to a selection of known characterizations of deployment of different customized instances of the computer program, each of the characterization having an association with an upgrade feasibility predictor for the upgrade. The method yet further includes identifying a matching one of the known characterizations for the generated deployment characterization. Finally, the method includes displaying a report on a display of the computing system including an upgrade feasibility predictor corresponding to the matching one of the known characterization.1. A method for application upgrade feasibility and reporting, the method comprising:
generating in memory of a computing system a deployment characterization of a customized instance of a computer program designated to receive an upgrade; comparing the deployment characterization to a selection of known characterizations of deployment of different customized instances of the computer program, each of the characterization having an association with an upgrade feasibility predictor for the upgrade; identifying a matching one of the known characterizations for the generated deployment characterization; and, displaying a report on a display of the computing system including an upgrade feasibility predictor corresponding to the matching one of the known characterization. 2. The method of claim 1, wherein the deployment characterization comprises an inventory of components included as part of the customized instance of the computer program. 3. The method of claim 1, wherein the deployment characterization comprises an inventory of components upon which the instance of the computer program is dependent. 4. The method of claim 1, wherein the deployment characterization comprises an inventory of ones of the components that have been modified from a default form of the components. 5. The method of claim 1, wherein the upgrade feasibility predictor comprises an indicator selected from the group consisting of recommended, not recommended, and recommended with caution. 6. The method of claim 1, wherein a hyperlinked reference to crowd-sourced documentation pertaining to particular upgrade issues for the deployment characterization arising from attempting the upgrade is included in the report. 7. An application deployment data processing system configured for application upgrade feasibility and reporting, the system comprising:
a host computing system comprising at least one computer with memory and at least one processor; a data store coupled to the host computing system; a customized instance of a computer program comprising a plurality of components stored in the data store; and, an upgrade feasibility module executing in the memory of the host computing system, the module comprising program code enabled upon execution by the at least one processor to generate in the memory a deployment characterization of the customized instance of the computer program designated to receive an upgrade, to compare the deployment characterization to a selection of known characterizations of deployment of different customized instances of the computer program stored in the data store, each of the characterization having an association with an upgrade feasibility predictor for the upgrade, to identify a matching one of the known characterizations for the generated deployment characterization and to display a report on a display of the host computing system including an upgrade feasibility predictor corresponding to the matching one of the known characterization. 8. The system of claim 7, wherein the deployment characterization comprises an inventory of the components included as part of the customized instance of the computer program. 9. The system of claim 7, wherein the deployment characterization comprises an inventory of other components upon which the instance of the computer program is dependent. 10. The system of claim 7, wherein the deployment characterization comprises an inventory of ones of the components that have been modified from a default form of the components. 11. The system of claim 7, wherein the upgrade feasibility predictor comprises an indicator selected from the group consisting of recommended, not recommended, and recommended with caution. 12. The system of claim 7, wherein a hyperlinked reference to crowd-sourced documentation pertaining to particular upgrade issues for the deployment characterization arising from attempting the upgrade is included in the report. 13. A computer program product for application upgrade feasibility and reporting, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions executable by a device to cause the device to perform a method comprising:
generating by a device in memory of a computing system a deployment characterization of a customized instance of a computer program designated to receive an upgrade; comparing by the device the deployment characterization to a selection of known characterizations of deployment of different customized instances of the computer program, each of the characterization having an association with an upgrade feasibility predictor for the upgrade; identifying by the device a matching one of the known characterizations for the generated deployment characterization; and, displaying by the device a report on a display of the computing system including an upgrade feasibility predictor corresponding to the matching one of the known characterization. 14. The computer program product of claim 13, wherein the deployment characterization comprises an inventory of components included as part of the customized instance of the computer program. 15. The computer program product of claim 13, wherein the deployment characterization comprises an inventory of components upon which the instance of the computer program is dependent. 16. The computer program product of claim 13, wherein the deployment characterization comprises an inventory of ones of the components that have been modified from a default form of the components. 17. The computer program product of claim 13, wherein the upgrade feasibility predictor comprises an indicator selected from the group consisting of recommended, not recommended, and recommended with caution. 18. The computer program product of claim 13, wherein a hyperlinked reference to crowd-sourced documentation pertaining to particular upgrade issues for the deployment characterization arising from attempting the upgrade is included in the report. | 2,100 |
5,150 | 14,572,884 | 2,141 | An input apparatus includes a detection section, a change section, and a transmission section. The detection section detects a movement amount of a user operation in an arbitrary direction. The change section changes a ratio of a first movement amount as a movement amount in a first operation direction corresponding to a first direction on a screen to a second movement amount as a movement amount in a second operation direction corresponding to a second direction on the screen different from the first direction, the first movement amount and the second movement amount corresponding to a detection value detected by the detection section. The transmission section transmits the first movement amount and the second movement amount whose ratio has been changed as scroll information of an image displayed on the screen. | 1. An information processing apparatus comprising:
an input unit configured to receive a mode selection input from a user; a switching unit configured to switch between a pointing mode and a scroll mode based on the mode selection input; and a scroll control unit configured to scroll in a scroll direction in the scroll mode. 2. The information processing apparatus of claim 1, wherein the scroll control unit is configured to restrict the scroll direction to a horizontal direction based on movement of the user in three-dimensional space. 3. The information processing apparatus of claim 1, wherein the scroll control unit is configured to restrict the scroll direction to a vertical direction based on movement of the user in three-dimensional space. 4. The information processing apparatus of claim 1, further comprising a direction weighting unit configured to determine a first direction weighting factor that restricts the scroll direction in a first scroll direction based on movement of the user in three-dimensional space. 5. The information processing apparatus of claim 4, wherein the direction weighting unit is configured to determine a second direction weighting factor that restricts the scroll direction in a second scroll direction, different from the first scroll direction, based on movement of the user in three-dimensional space. 6. The information processing apparatus of claim 1, wherein the input unit is further configured to receive a movement input based on movement of the user in three-dimensional space. 7. The information processing apparatus of claim 6, wherein the scroll control unit is further configured to restrict the scroll direction based on the movement input received by the input unit. 8. An information processing method comprising:
receiving, by an input unit, a mode selection input from a user; switching, by a switching unit, between a pointing mode and a scroll mode based on the mode selection input; and scrolling, by a scroll control unit, in a scroll direction in the scroll mode. 9. The information processing method of claim 8, wherein scrolling includes restricting the scroll direction to a horizontal direction based on movement of the user in three-dimensional space. 10. The information processing method of claim 8, wherein scrolling includes restricting the scroll direction to a vertical direction based on movement of the user in three-dimensional space. 11. The information processing method of claim 8, further comprising determining a first direction weighting factor that restricts the scroll direction in a first scroll direction based on movement of the user in three-dimensional space. 12. The information processing method of claim 11, further comprising determining a second direction weighting factor that restricts the scroll direction in a second scroll direction, different from the first scroll direction, based on movement of the user in three-dimensional space. 13. The information processing method of claim 8, further comprising receiving, by the input unit, a movement input based on movement of the user in three-dimensional space. 14. The information processing method of claim 13, wherein scrolling includes restricting the scroll direction based on the movement input received by the input unit. 15. An information processing apparatus comprising:
an input unit configured to receive from a user a mode selection input indicative of a pointing mode or a scroll mode and to receive a movement input based on movement of the user in three-dimensional space; a switching unit configured to operate in the pointing mode or the scroll mode based on the mode selection input; and a scroll control unit configured to scroll in a scroll direction in the scroll mode based on the movement input received by the input unit. 16. The information processing apparatus of claim 15, wherein the scroll control unit is configured to restrict the scroll direction to a horizontal direction based on the movement input received by the input unit. 17. The information processing apparatus of claim 15, wherein the scroll control unit is configured to restrict the scroll direction to a vertical direction based on the movement input received by the input unit. 18. The information processing apparatus of claim 15, further comprising a direction weighting unit configured to determine a first direction weighting factor that restricts the scroll direction in a first scroll direction based on the movement input received by the input unit. 19. The information processing apparatus of claim 18, wherein the direction weighting unit is configured to determine a second direction weighting factor that restricts the scroll direction in a second scroll direction, different from the first scroll direction, based on the movement input received by the input unit. 20. The information processing apparatus of claim 15, wherein the scroll control unit is further configured to restrict the scroll direction based on the movement input received by the input unit. 21. An information processing apparatus comprising processing circuitry configured to:
receive from a user a mode selection input indicative of a pointing mode or a scroll mode and to receive a movement input based on movement of the user in three-dimensional space; operate in the pointing mode or the scroll mode based on the mode selection input; and scroll in a scroll direction in the scroll mode based on the movement input. 22. A computer-readable storage device encoded with computer-executable instructions that, when executed by a processing apparatus, perform a method comprising:
receiving from a user a mode selection input indicative of a pointing mode or a scroll mode and receiving a movement input based on movement of the user in three-dimensional space; operating in the pointing mode or the scroll mode based on the mode selection input; and scrolling in a scroll direction in the scroll mode based on the movement input. | An input apparatus includes a detection section, a change section, and a transmission section. The detection section detects a movement amount of a user operation in an arbitrary direction. The change section changes a ratio of a first movement amount as a movement amount in a first operation direction corresponding to a first direction on a screen to a second movement amount as a movement amount in a second operation direction corresponding to a second direction on the screen different from the first direction, the first movement amount and the second movement amount corresponding to a detection value detected by the detection section. The transmission section transmits the first movement amount and the second movement amount whose ratio has been changed as scroll information of an image displayed on the screen.1. An information processing apparatus comprising:
an input unit configured to receive a mode selection input from a user; a switching unit configured to switch between a pointing mode and a scroll mode based on the mode selection input; and a scroll control unit configured to scroll in a scroll direction in the scroll mode. 2. The information processing apparatus of claim 1, wherein the scroll control unit is configured to restrict the scroll direction to a horizontal direction based on movement of the user in three-dimensional space. 3. The information processing apparatus of claim 1, wherein the scroll control unit is configured to restrict the scroll direction to a vertical direction based on movement of the user in three-dimensional space. 4. The information processing apparatus of claim 1, further comprising a direction weighting unit configured to determine a first direction weighting factor that restricts the scroll direction in a first scroll direction based on movement of the user in three-dimensional space. 5. The information processing apparatus of claim 4, wherein the direction weighting unit is configured to determine a second direction weighting factor that restricts the scroll direction in a second scroll direction, different from the first scroll direction, based on movement of the user in three-dimensional space. 6. The information processing apparatus of claim 1, wherein the input unit is further configured to receive a movement input based on movement of the user in three-dimensional space. 7. The information processing apparatus of claim 6, wherein the scroll control unit is further configured to restrict the scroll direction based on the movement input received by the input unit. 8. An information processing method comprising:
receiving, by an input unit, a mode selection input from a user; switching, by a switching unit, between a pointing mode and a scroll mode based on the mode selection input; and scrolling, by a scroll control unit, in a scroll direction in the scroll mode. 9. The information processing method of claim 8, wherein scrolling includes restricting the scroll direction to a horizontal direction based on movement of the user in three-dimensional space. 10. The information processing method of claim 8, wherein scrolling includes restricting the scroll direction to a vertical direction based on movement of the user in three-dimensional space. 11. The information processing method of claim 8, further comprising determining a first direction weighting factor that restricts the scroll direction in a first scroll direction based on movement of the user in three-dimensional space. 12. The information processing method of claim 11, further comprising determining a second direction weighting factor that restricts the scroll direction in a second scroll direction, different from the first scroll direction, based on movement of the user in three-dimensional space. 13. The information processing method of claim 8, further comprising receiving, by the input unit, a movement input based on movement of the user in three-dimensional space. 14. The information processing method of claim 13, wherein scrolling includes restricting the scroll direction based on the movement input received by the input unit. 15. An information processing apparatus comprising:
an input unit configured to receive from a user a mode selection input indicative of a pointing mode or a scroll mode and to receive a movement input based on movement of the user in three-dimensional space; a switching unit configured to operate in the pointing mode or the scroll mode based on the mode selection input; and a scroll control unit configured to scroll in a scroll direction in the scroll mode based on the movement input received by the input unit. 16. The information processing apparatus of claim 15, wherein the scroll control unit is configured to restrict the scroll direction to a horizontal direction based on the movement input received by the input unit. 17. The information processing apparatus of claim 15, wherein the scroll control unit is configured to restrict the scroll direction to a vertical direction based on the movement input received by the input unit. 18. The information processing apparatus of claim 15, further comprising a direction weighting unit configured to determine a first direction weighting factor that restricts the scroll direction in a first scroll direction based on the movement input received by the input unit. 19. The information processing apparatus of claim 18, wherein the direction weighting unit is configured to determine a second direction weighting factor that restricts the scroll direction in a second scroll direction, different from the first scroll direction, based on the movement input received by the input unit. 20. The information processing apparatus of claim 15, wherein the scroll control unit is further configured to restrict the scroll direction based on the movement input received by the input unit. 21. An information processing apparatus comprising processing circuitry configured to:
receive from a user a mode selection input indicative of a pointing mode or a scroll mode and to receive a movement input based on movement of the user in three-dimensional space; operate in the pointing mode or the scroll mode based on the mode selection input; and scroll in a scroll direction in the scroll mode based on the movement input. 22. A computer-readable storage device encoded with computer-executable instructions that, when executed by a processing apparatus, perform a method comprising:
receiving from a user a mode selection input indicative of a pointing mode or a scroll mode and receiving a movement input based on movement of the user in three-dimensional space; operating in the pointing mode or the scroll mode based on the mode selection input; and scrolling in a scroll direction in the scroll mode based on the movement input. | 2,100 |
5,151 | 13,474,619 | 2,142 | Customizing menus for a consumer electronics device, including: generating a predefined menu identifier; preparing menu definitions for the menus to be customized on the consumer electronics device; generating menu configuration information using the prepared menu definitions; transmitting the generated menu configuration information to the consumer electronics device; and identifying a specific menu and menu items using the predefined menu identifier. Keywords include customization of menus and consumer electronics device. | 1. A method of customizing menus for a consumer electronics device, the method comprising:
generating a predefined menu identifier; preparing menu definitions for the menus to be customized on the consumer electronics device; generating menu configuration information using the prepared menu definitions; transmitting the generated menu configuration information to the consumer electronics device; and identifying a specific menu and menu items using the predefined menu identifier. 2. The method of claim 1, further comprising
receiving a menu customization request from the consumer electronics device, wherein the menu customization request includes device specific information to identify the consumer electronics device. 3. The method of claim 1, wherein the menu definitions specify a default value for a parameter that is set through the menus. 4. The method of claim 1, wherein the menu definitions comprises
parameter settings that are applied immediately by the consumer electronics upon receiving menu customizations. 5. The method of claim 1, wherein the menu definitions of a menu item comprise application specific data that is given to an application launched by the menu item when it is launched. 6. The method of claim 1, wherein the menu item specifies a network location from which the consumer electronics device downloads and executes code. 7. The method of claim 1, wherein the menu item specifies an URL to a web application to run when the menu item is selected. 8. The method of claim 1, wherein a set of menu definitions specifies and uses menus that are modified dynamically at run time. 9. The method of claim 1, wherein a set of menu definitions controls ordering of the menus and menu items including existing menus defined by the consumer electronics device and dynamic menus and menu items that are added later at run time. 10. The method of claim 1, wherein the specific menu is configured as a standard device menu populated with standard menu items. 11. The method of claim 1, further comprising
using naming schemes to prevent a first menu identifier generated dynamically by the consumer electronics device from interfering with a second menu identifier generated by an application creating the menu definitions. 12. The method of claim 1, wherein a menu definition indicates that a menu is a standard pre-defined menu of the consumer electronics device. 13. The method of claim 1, wherein the menu definitions add to the menus without having to define the menus. 14. The method of claim 1, wherein the menu definitions remove from the menus without having to define the menus. 15. The method of claim 1, further comprising
placing a menu with a predefined menu identifier to act as a place holder, wherein when a client code adds to the menu, it shows up in a proper location with a proper title and icon. 16. The method of claim 1, further comprising
generating and using predefined menu identifiers to identify locations within a menu structure where unknown dynamic items are placed. 17. The method of claim 1, further comprising
a dynamic system menu that launches an Internet content service or native application. 18. The method of claim 17, wherein the dynamic system menu comprises
menu items including a string of configuration data that is used by the application. 19. The method of claim 17, wherein the Internet content service comprises
at least one of general application, website, widget, or other program that requires communicating back to a server. 20. The method of claim 17, wherein the native application comprises a service, general application, maps, URL/URI, widget, and/or other program that is native or local to a device that does not require communication back to the server. 21. A non-transitory storage medium storing a computer program to customize menus for a consumer electronics device, the computer program comprising executable instructions that cause a computer to:
receive a menu customization request from the consumer electronics device, wherein the menu customization request includes device specific information to identify the consumer electronics device; prepare menu definitions for the menus to be customized on the consumer electronics device; generate menu configuration information using the prepared menu definitions; transmit the generated menu configuration information to the consumer electronics device; and generate and use a predefined menu identifier to identify a specific menu and menu items. 22. The non-transitory storage medium of claim 21, wherein the menu definitions specify that a menu item contains application specific data that is given to an application launched by the menu item when it is launched. 23. The non-transitory storage medium of claim 22, wherein the menu item specifies a network location from which the consumer electronics device downloads and executes code. | Customizing menus for a consumer electronics device, including: generating a predefined menu identifier; preparing menu definitions for the menus to be customized on the consumer electronics device; generating menu configuration information using the prepared menu definitions; transmitting the generated menu configuration information to the consumer electronics device; and identifying a specific menu and menu items using the predefined menu identifier. Keywords include customization of menus and consumer electronics device.1. A method of customizing menus for a consumer electronics device, the method comprising:
generating a predefined menu identifier; preparing menu definitions for the menus to be customized on the consumer electronics device; generating menu configuration information using the prepared menu definitions; transmitting the generated menu configuration information to the consumer electronics device; and identifying a specific menu and menu items using the predefined menu identifier. 2. The method of claim 1, further comprising
receiving a menu customization request from the consumer electronics device, wherein the menu customization request includes device specific information to identify the consumer electronics device. 3. The method of claim 1, wherein the menu definitions specify a default value for a parameter that is set through the menus. 4. The method of claim 1, wherein the menu definitions comprises
parameter settings that are applied immediately by the consumer electronics upon receiving menu customizations. 5. The method of claim 1, wherein the menu definitions of a menu item comprise application specific data that is given to an application launched by the menu item when it is launched. 6. The method of claim 1, wherein the menu item specifies a network location from which the consumer electronics device downloads and executes code. 7. The method of claim 1, wherein the menu item specifies an URL to a web application to run when the menu item is selected. 8. The method of claim 1, wherein a set of menu definitions specifies and uses menus that are modified dynamically at run time. 9. The method of claim 1, wherein a set of menu definitions controls ordering of the menus and menu items including existing menus defined by the consumer electronics device and dynamic menus and menu items that are added later at run time. 10. The method of claim 1, wherein the specific menu is configured as a standard device menu populated with standard menu items. 11. The method of claim 1, further comprising
using naming schemes to prevent a first menu identifier generated dynamically by the consumer electronics device from interfering with a second menu identifier generated by an application creating the menu definitions. 12. The method of claim 1, wherein a menu definition indicates that a menu is a standard pre-defined menu of the consumer electronics device. 13. The method of claim 1, wherein the menu definitions add to the menus without having to define the menus. 14. The method of claim 1, wherein the menu definitions remove from the menus without having to define the menus. 15. The method of claim 1, further comprising
placing a menu with a predefined menu identifier to act as a place holder, wherein when a client code adds to the menu, it shows up in a proper location with a proper title and icon. 16. The method of claim 1, further comprising
generating and using predefined menu identifiers to identify locations within a menu structure where unknown dynamic items are placed. 17. The method of claim 1, further comprising
a dynamic system menu that launches an Internet content service or native application. 18. The method of claim 17, wherein the dynamic system menu comprises
menu items including a string of configuration data that is used by the application. 19. The method of claim 17, wherein the Internet content service comprises
at least one of general application, website, widget, or other program that requires communicating back to a server. 20. The method of claim 17, wherein the native application comprises a service, general application, maps, URL/URI, widget, and/or other program that is native or local to a device that does not require communication back to the server. 21. A non-transitory storage medium storing a computer program to customize menus for a consumer electronics device, the computer program comprising executable instructions that cause a computer to:
receive a menu customization request from the consumer electronics device, wherein the menu customization request includes device specific information to identify the consumer electronics device; prepare menu definitions for the menus to be customized on the consumer electronics device; generate menu configuration information using the prepared menu definitions; transmit the generated menu configuration information to the consumer electronics device; and generate and use a predefined menu identifier to identify a specific menu and menu items. 22. The non-transitory storage medium of claim 21, wherein the menu definitions specify that a menu item contains application specific data that is given to an application launched by the menu item when it is launched. 23. The non-transitory storage medium of claim 22, wherein the menu item specifies a network location from which the consumer electronics device downloads and executes code. | 2,100 |
5,152 | 13,567,554 | 2,177 | A method comprises causing a character string to be displayed on a display, receiving a signal indicative of user input for selecting the displayed character string, and responding to the signal by using a language engine to predict a location within the selected character string for modification of the selected character string. | 1. A method comprising:
causing a character string to be displayed on a display; receiving a signal indicative of user input for selecting the displayed character string; and responding to the signal by using a language engine to predict a location within the selected character string for modification of the selected character string. 2. The method of claim 1, comprising using the language engine to predict the location for modification of the selected character string based on the selected character string and a location of the user input within the selected character string. 3. The method of claim 1, further comprising receiving a signal indicative of user input in respect of a selection of a text editing option. 4. The method of claim 3, wherein the user input for selecting the displayed character string comprises a dynamic touch input which identifies both a location of an object representing the selected text editing option and the selected character string. 5. The method of claim 3, wherein using the language engine to predict the location comprises identifying a replacement character string based on the selected character string and the selected text editing option, wherein the replacement character string is a version of the selected character string that is modified at the predicted location based on the selected text editing option. 6. The method of claim 5, comprising subsequently causing the selected character string to be replaced on the display by the replacement character string. 7. The method of claim 5, wherein predicting the location for modification comprises identifying plural different replacement character strings based on the selected character string and the selected text editing option, each of the different replacement strings being a version of the selected character string that is modified at a different location based on the selected text editing option. 8. The method of claim 7, comprising activating a mechanism for allowing the user to select one of the plural replacement character strings; and
responding to selection of one of the replacement character strings by causing the selected displayed character string to be replaced on the display by the selected replacement character string. 9. The method of claim 4, wherein the selected text editing option is a text character. 10. The method of claim 9, wherein each replacement character string is modified by inserting the selected text character into the selected displayed character string at a predicted location. 11. The method of claim 10, wherein each replacement character string is modified also by removing a character from the string. 12. The method of claim 4, wherein the text editing option is a character removal option. 13. The method of claim 12, wherein each identified replacement character string is modified by removing a text character from the predicted location in the selected displayed character string. 14. The method of claim 1 comprising, subsequent to predicting the location for modification, positioning a cursor within the selected character string based on the predicted location. 15. The method of claim 1, wherein the displayed character string is a correctly spelled word. 16. Apparatus comprising at least one processor and at least one memory including computer program code, the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus:
to cause a character string to be displayed on a display; to receive a signal indicative of user input for selecting the displayed character string; and to respond to the signal by using a language engine to predict a location within the selected character string for modification of the selected character string. 17. The apparatus of claim 16, wherein the at least one memory and the computer program code are configured, with the at least one processor, to cause the apparatus:
to use the language engine to predict the location for modification of the selected character string based on the selected character string and a location of the user input within the selected character string. 18. The apparatus of claim 16, wherein the at least one memory and the computer program code are configured, with the at least one processor, to cause the apparatus:
receive a signal indicative of user input in respect of a selection of a text editing option. 19. The apparatus of claim 18, wherein the user input for selecting the displayed character string comprises a dynamic touch input which identifies a location of an object representing the selected text editing option and the selected character string. 20. The apparatus of claim 18, wherein the at least one memory and the computer program code are configured, with the at least one processor, to cause the apparatus:
to use the language engine to predict the location by identifying a replacement character string based on the selected character string and the selected text editing option, wherein the replacement character string is a version of the selected character string that is modified at the predicted location based on the selected text editing option. 21. The apparatus of claim 20, wherein the at least one memory and the computer program code are configured, with the at least one processor, to cause the apparatus:
subsequently to cause the selected character string to be replaced on the display by the replacement character string. 22. The apparatus of claim 20, wherein the at least one memory and the computer program code are configured, with the at least one processor, to cause the apparatus:
to predict the location for modification by identifying plural different replacement character strings based on the selected character string and the selected text editing option, each of the different replacement strings being a version of the selected character string that is modified at a different location based on the selected text editing option. 23. The apparatus of claim 22, wherein the at least one memory and the computer program code are configured, with the at least one processor, to cause the apparatus:
to activate a mechanism for allowing the user to select one of the plural replacement character strings; and to respond to selection of one of the replacement character strings by causing the selected displayed character string to be replaced on the display by the selected replacement character string. 24. The apparatus of claim 18, wherein the selected text editing option is a text character. 25. The apparatus of claim 24, wherein each replacement character string is modified by inserting the selected text character into the selected displayed character string at a predicted location. 26. The apparatus of claim 23, wherein each replacement character string is modified also by removing a character from the string. 27. The apparatus of any of claims 18, wherein the text editing option is a character removal option. 28. The apparatus of claim 27, wherein each identified replacement character string is modified by removing a text character from the predicted location in the selected displayed character string. 29. The apparatus of claim 17, wherein the at least one memory and the computer program code are configured, with the at least one processor, to cause the apparatus:
subsequent to predicting the location for modification, to position a cursor within the selected character string based on the predicted location. 30. At least one non-transitory computer readable memory medium having computer readable instructions stored thereon, the computer readable instructions, when executed by at least one processor, causing the at least one processor:
to cause a character string to be displayed on a display; to receive a signal indicative of user input for selecting the displayed character string; and to respond to the signal by using a language engine to predict a location within the selected character string for modification of the selected character string. | A method comprises causing a character string to be displayed on a display, receiving a signal indicative of user input for selecting the displayed character string, and responding to the signal by using a language engine to predict a location within the selected character string for modification of the selected character string.1. A method comprising:
causing a character string to be displayed on a display; receiving a signal indicative of user input for selecting the displayed character string; and responding to the signal by using a language engine to predict a location within the selected character string for modification of the selected character string. 2. The method of claim 1, comprising using the language engine to predict the location for modification of the selected character string based on the selected character string and a location of the user input within the selected character string. 3. The method of claim 1, further comprising receiving a signal indicative of user input in respect of a selection of a text editing option. 4. The method of claim 3, wherein the user input for selecting the displayed character string comprises a dynamic touch input which identifies both a location of an object representing the selected text editing option and the selected character string. 5. The method of claim 3, wherein using the language engine to predict the location comprises identifying a replacement character string based on the selected character string and the selected text editing option, wherein the replacement character string is a version of the selected character string that is modified at the predicted location based on the selected text editing option. 6. The method of claim 5, comprising subsequently causing the selected character string to be replaced on the display by the replacement character string. 7. The method of claim 5, wherein predicting the location for modification comprises identifying plural different replacement character strings based on the selected character string and the selected text editing option, each of the different replacement strings being a version of the selected character string that is modified at a different location based on the selected text editing option. 8. The method of claim 7, comprising activating a mechanism for allowing the user to select one of the plural replacement character strings; and
responding to selection of one of the replacement character strings by causing the selected displayed character string to be replaced on the display by the selected replacement character string. 9. The method of claim 4, wherein the selected text editing option is a text character. 10. The method of claim 9, wherein each replacement character string is modified by inserting the selected text character into the selected displayed character string at a predicted location. 11. The method of claim 10, wherein each replacement character string is modified also by removing a character from the string. 12. The method of claim 4, wherein the text editing option is a character removal option. 13. The method of claim 12, wherein each identified replacement character string is modified by removing a text character from the predicted location in the selected displayed character string. 14. The method of claim 1 comprising, subsequent to predicting the location for modification, positioning a cursor within the selected character string based on the predicted location. 15. The method of claim 1, wherein the displayed character string is a correctly spelled word. 16. Apparatus comprising at least one processor and at least one memory including computer program code, the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus:
to cause a character string to be displayed on a display; to receive a signal indicative of user input for selecting the displayed character string; and to respond to the signal by using a language engine to predict a location within the selected character string for modification of the selected character string. 17. The apparatus of claim 16, wherein the at least one memory and the computer program code are configured, with the at least one processor, to cause the apparatus:
to use the language engine to predict the location for modification of the selected character string based on the selected character string and a location of the user input within the selected character string. 18. The apparatus of claim 16, wherein the at least one memory and the computer program code are configured, with the at least one processor, to cause the apparatus:
receive a signal indicative of user input in respect of a selection of a text editing option. 19. The apparatus of claim 18, wherein the user input for selecting the displayed character string comprises a dynamic touch input which identifies a location of an object representing the selected text editing option and the selected character string. 20. The apparatus of claim 18, wherein the at least one memory and the computer program code are configured, with the at least one processor, to cause the apparatus:
to use the language engine to predict the location by identifying a replacement character string based on the selected character string and the selected text editing option, wherein the replacement character string is a version of the selected character string that is modified at the predicted location based on the selected text editing option. 21. The apparatus of claim 20, wherein the at least one memory and the computer program code are configured, with the at least one processor, to cause the apparatus:
subsequently to cause the selected character string to be replaced on the display by the replacement character string. 22. The apparatus of claim 20, wherein the at least one memory and the computer program code are configured, with the at least one processor, to cause the apparatus:
to predict the location for modification by identifying plural different replacement character strings based on the selected character string and the selected text editing option, each of the different replacement strings being a version of the selected character string that is modified at a different location based on the selected text editing option. 23. The apparatus of claim 22, wherein the at least one memory and the computer program code are configured, with the at least one processor, to cause the apparatus:
to activate a mechanism for allowing the user to select one of the plural replacement character strings; and to respond to selection of one of the replacement character strings by causing the selected displayed character string to be replaced on the display by the selected replacement character string. 24. The apparatus of claim 18, wherein the selected text editing option is a text character. 25. The apparatus of claim 24, wherein each replacement character string is modified by inserting the selected text character into the selected displayed character string at a predicted location. 26. The apparatus of claim 23, wherein each replacement character string is modified also by removing a character from the string. 27. The apparatus of any of claims 18, wherein the text editing option is a character removal option. 28. The apparatus of claim 27, wherein each identified replacement character string is modified by removing a text character from the predicted location in the selected displayed character string. 29. The apparatus of claim 17, wherein the at least one memory and the computer program code are configured, with the at least one processor, to cause the apparatus:
subsequent to predicting the location for modification, to position a cursor within the selected character string based on the predicted location. 30. At least one non-transitory computer readable memory medium having computer readable instructions stored thereon, the computer readable instructions, when executed by at least one processor, causing the at least one processor:
to cause a character string to be displayed on a display; to receive a signal indicative of user input for selecting the displayed character string; and to respond to the signal by using a language engine to predict a location within the selected character string for modification of the selected character string. | 2,100 |
5,153 | 12,610,038 | 2,157 | A method and a system are described for generation of sets of alternative terms based on queries received from users. For example, a query module may receive a query comprising syntax indicating alternative terms and may parse the alternative terms from the query. A frequency module forms groups of alternative terms from the parsed alternative terms and determines a first number of occurrences corresponding to each of the groups based on the received query and previous queries. For a first pair of the groups comprising a first alternative term and a second alternative term, a threshold module adds the first alternative term to an existing set of terms that already includes the second alternative term. The addition is based on a second number of occurrences of the first alternative and at least one other member of the existing set of terms. | 1. An online publishing system comprising:
a hardware-implemented query module to receive a query comprising syntax indicating alternative terms and to parse the alternative terms; a hardware-implemented frequency module to form groups of alternative terms from the parsed alternative terms and to determine a respective number of occurrences for each of the groups in queries received by the query module; and a hardware-implemented threshold module to, for a first group of the groups comprising a first alternative term and a second alternative term, add the first alternative term to an existing set of terms, the existing set including the second alternative term, the addition based on a number of occurrences in the queries received by the query module of the first alternative and at least one other term of the existing set of terms. 2. The system of claim 1, further comprising a hardware-implemented response module to transform a subsequent query based on the existing set of terms. 3. The system of claim 2, wherein the response module is to transform the subsequent query without further input from a user. 4. The system of claim 2, wherein the response module is to transform the subsequent query via a user interface and to indicate the first alternative member and the at least one other member of the existing set of terms. 5. The system of claim 1, further comprising a type module to identify a type of the existing set of terms. 6. The system of claim 5, wherein the type module is further to determine that the first alternative term is of the same type as the at least one other alternative term of the existing set of terms. 7. The system of claim 1, wherein the existing set of terms is domain-specific. 8. The system of claim 1, wherein the query module is to identify the queries based on a user that submitted the query. 9. The system of claim 1, wherein the syntax indicating the alternative terms comprises an “OR” operator in the query. 10. A method comprising:
parsing alternative terms from a query in an online publishing system; forming groups of the alternative terms, a first group of the groups comprising a first alternative term and a second alternative term, the first alternative term belonging to an existing set of terms; determining a first number of occurrences of the first group in queries received at the online publishing system; determining a second number of occurrences of the second alternative term in the queries received the online publishing system and that included at least one other alternative term belonging to the existing set; and adding the second alternative term to the existing set of terms based in part on the second number of occurrences. 11. The method of claim 10, further comprising transforming a subsequent query based on the existing set of terms. 12. The method of claim 11, wherein the operation of transforming of the subsequent query is performed without further input from a user. 13. The method of claim 11, wherein the operation transforming of the subsequent query comprises providing a user interface and indicating the first alternative member and the at least one other member of the existing set of terms. 14. The method of claim 10, further comprising identifying a type of the existing set of terms. 15. The method of claim 14, wherein the operation of identifying further comprises determining that the first alternative term is of the same type as the at least one other alternative term of the existing set of terms. 16. The method of claim 10, wherein the existing set of terms is domain-specific. 17. The method of claim 10, wherein the operation of parsing of the alternative terms comprises identifying the query based on a user that submitted the query. 18. The method of claim 10, wherein the syntax indicating the alternative terms comprises an “OR” operator in the query. 19. The method of claim 10, wherein the existing set of terms is associated with one or more products in a catalog. 20. A machine-readable storage medium having embodied thereon instructions executable by a processor to perform the method of claim 10. | A method and a system are described for generation of sets of alternative terms based on queries received from users. For example, a query module may receive a query comprising syntax indicating alternative terms and may parse the alternative terms from the query. A frequency module forms groups of alternative terms from the parsed alternative terms and determines a first number of occurrences corresponding to each of the groups based on the received query and previous queries. For a first pair of the groups comprising a first alternative term and a second alternative term, a threshold module adds the first alternative term to an existing set of terms that already includes the second alternative term. The addition is based on a second number of occurrences of the first alternative and at least one other member of the existing set of terms.1. An online publishing system comprising:
a hardware-implemented query module to receive a query comprising syntax indicating alternative terms and to parse the alternative terms; a hardware-implemented frequency module to form groups of alternative terms from the parsed alternative terms and to determine a respective number of occurrences for each of the groups in queries received by the query module; and a hardware-implemented threshold module to, for a first group of the groups comprising a first alternative term and a second alternative term, add the first alternative term to an existing set of terms, the existing set including the second alternative term, the addition based on a number of occurrences in the queries received by the query module of the first alternative and at least one other term of the existing set of terms. 2. The system of claim 1, further comprising a hardware-implemented response module to transform a subsequent query based on the existing set of terms. 3. The system of claim 2, wherein the response module is to transform the subsequent query without further input from a user. 4. The system of claim 2, wherein the response module is to transform the subsequent query via a user interface and to indicate the first alternative member and the at least one other member of the existing set of terms. 5. The system of claim 1, further comprising a type module to identify a type of the existing set of terms. 6. The system of claim 5, wherein the type module is further to determine that the first alternative term is of the same type as the at least one other alternative term of the existing set of terms. 7. The system of claim 1, wherein the existing set of terms is domain-specific. 8. The system of claim 1, wherein the query module is to identify the queries based on a user that submitted the query. 9. The system of claim 1, wherein the syntax indicating the alternative terms comprises an “OR” operator in the query. 10. A method comprising:
parsing alternative terms from a query in an online publishing system; forming groups of the alternative terms, a first group of the groups comprising a first alternative term and a second alternative term, the first alternative term belonging to an existing set of terms; determining a first number of occurrences of the first group in queries received at the online publishing system; determining a second number of occurrences of the second alternative term in the queries received the online publishing system and that included at least one other alternative term belonging to the existing set; and adding the second alternative term to the existing set of terms based in part on the second number of occurrences. 11. The method of claim 10, further comprising transforming a subsequent query based on the existing set of terms. 12. The method of claim 11, wherein the operation of transforming of the subsequent query is performed without further input from a user. 13. The method of claim 11, wherein the operation transforming of the subsequent query comprises providing a user interface and indicating the first alternative member and the at least one other member of the existing set of terms. 14. The method of claim 10, further comprising identifying a type of the existing set of terms. 15. The method of claim 14, wherein the operation of identifying further comprises determining that the first alternative term is of the same type as the at least one other alternative term of the existing set of terms. 16. The method of claim 10, wherein the existing set of terms is domain-specific. 17. The method of claim 10, wherein the operation of parsing of the alternative terms comprises identifying the query based on a user that submitted the query. 18. The method of claim 10, wherein the syntax indicating the alternative terms comprises an “OR” operator in the query. 19. The method of claim 10, wherein the existing set of terms is associated with one or more products in a catalog. 20. A machine-readable storage medium having embodied thereon instructions executable by a processor to perform the method of claim 10. | 2,100 |
5,154 | 14,818,034 | 2,159 | In various example embodiments, a system and method for enhancing autocomplete search suggestions are presented. The system receives a query portion with a token portion from a client device and generates a first search query suggestion set having a first order based on the token portion. The system accesses a token pool associated with the client device and generates a second search query suggestion set having a second order based on the token portion and the token pool. The system selects a first subset of search query suggestions and a second subset of search query suggestions. The system merges the first subset of search query suggestions and the second subset of search query suggestions into a third search query suggestion set, organizes the third search query suggestion set into a third order distinct from the first and second orders, and causes presentation of the third search query suggestion set. | 1. A method, comprising:
receiving a query portion including at least a token portion from a client device; generating a first search query suggestion set based on the token portion, the first search query suggestion set including a first suggested token set, the first search query suggestion set having a first order; accessing a token pool associated with the client device; generating, by at least one processor of a machine, a second search query suggestion set based on the token portion and the token pool, the second search query suggestion set including a second suggested token set, the second search query suggestion set having a second order; selecting, by at least one processor of the machine, a first subset of search query suggestions and a second subset of search query suggestions, the first subset of search query suggestions selected from the first search query suggestion set and the second subset of search query suggestions selected from the second search query suggestion set; merging the first subset of search query suggestions and the second subset of search query suggestions to form a third search query suggestion set; organizing the third search query suggestion set in a third order distinct from the first order and the second order; and causing presentation of the third search query suggestion set in the third order on the client device. 2. The method of claim 1, wherein generating the first search query suggestion set further comprises:
accessing a global token pool associated with a set of client devices including the client device; and generating the first search query suggestion set based on the token portion and the global token pool. 3. The method of claim 1, further comprising:
receiving a set of queries from the client device representing a set of historical queries, each query of the set of queries including a set of historical tokens. 4. The method of claim 3, wherein the set of historical tokens of each query of the set of historical queries forms the token pool. 5. The method of claim 4, wherein each historical token includes one or more features, and further comprising:
determining a token quality for each historical token of the token pool; and associating the token quality with each historical token of the token pool. 6. The method of claim 1 wherein accessing the token pool further comprises:
receiving a set of tokens forming a search query;
storing the set of tokens to form the token pool; and
associating the token pool with a user. 7. The method of claim 1, wherein generating the first search query suggestion set further comprises:
generating a first set of global scores, each global score of the first set of global scores associated with a search query suggestion of the first search query suggestion set; and organizing the first search query suggestion set in the first order based on the first set of global scores. 8. The method of claim 7, wherein generating the second search query suggestion set further comprises:
generating a second set of global scores, each global score of the second set of global scores associated with a search query suggestion of the second search query suggestion set; and organizing the second search query suggestion set in the second order based on the second set of global scores. 9. The method of claim 8, wherein organizing the third search query suggestion set in the third order further comprises:
calculating a boosting factor for each search query suggestion within the second subset of search query suggestions included in the third search query suggestion set; and determining the third order based on the boosting factor of each search query suggestion of the second subset of search query suggestions, the first set of global scores, and the second set of global scores. 10. The method of claim 8, wherein selecting the first subset of search query suggestions and the second subset of search query suggestions further comprises:
generating a global score threshold for the first search query suggestion set; determining one or more search query suggestions of the first search query suggestion set exceeding the global score threshold for inclusion in the first subset of search query suggestions; and determining one or more search query suggestions of the second search query suggestion set exceeding the global score threshold for inclusion in the second subset of search query suggestions. 11. A system, comprising:
a receiving module configured to receive a query portion including at least a token portion from a client device; a token access module configured to access a token pool associated with the client device; a suggestion generation module including at least one processor of a machine configured to generate a first search query suggestion set based on the token portion, the first search query suggestion set including a first suggested token set, the first search query suggestion set having a first order and configured to generate a second search query suggestion set based on the token portion and the token pool, the second search query suggestion set including a second suggested token set, the second search query suggestion set having a second order; a selection module including at least one processor of the machine configured to select a first subset of search query suggestions and a second subset of search query suggestions, the first subset of search query suggestions selected from the first search query suggestion set and the second subset of search query suggestions selected from the second search query suggestion set; a merge module configured to merge the first subset of search query suggestions and the second subset of search query suggestions to form a third search query suggestion set; an organization module configured to organize the third search query suggestion set in a third order distinct from the first order and the second order; and a presentation module configured to cause presentation of the third search query suggestion set in the third order on the client device. 12. The system of claim 11, wherein the receiver module receives a set of queries from the client device representing a set of historical queries, each query of the set of queries including a set of historical tokens and the set of historical tokens of each query of the set of historical queries forms the token pool, further comprising:
a token management module configured to determine a token quality for each historical token of the token pool and associate the token quality with each historical token of the token pool. 13. A non-transitory machine-readable storage medium comprising processor executable instructions that, when executed by a processor of a machine, cause the machine to perform operations comprising:
receiving a query portion including at least a token portion from a client device; generating a first search query suggestion set based on the token portion, the first search query suggestion set including a first suggested token set, the first search query suggestion set having a first order; accessing a token pool associated with the client device; generating a second search query suggestion set based on the token portion and the token pool, the second search query suggestion set including a second suggested token set, the second search query suggestion set having a second order; selecting a first subset of search query suggestions and a second subset of search query suggestions, the first subset of search query suggestions selected from the first search query suggestion set and the second subset of search query suggestions selected from the second search query suggestion set; merging the first subset of search query suggestions and the second subset of search query suggestions to form a third search query suggestion set; organizing the third search query suggestion set in a third order distinct from the first order and the second order; and causing presentation of the third search query suggestion set in the third order on the client device. 14. The non-transitory machine-readable storage medium of claim 13, wherein the operations further comprise:
accessing a global token pool associated with a set of client devices; and generating the first search query suggestion set based on the token portion and the global token pool. 15. The non-transitory machine-readable storage medium of claim 13, wherein the operations further comprise:
receiving a set of queries from the client device representing a set of historical queries, each query of the set of queries including a set of historical tokens. 16. The non-transitory machine-readable storage medium of claim 15, wherein the set of historical tokens of each query of the set of historical queries forms the token pool and the operations further comprise:
determining a token quality for each historical token of the token pool; and associating the token quality with each historical token of the token pool. 17. The non-transitory machine-readable storage medium of claim 13, wherein the operations further comprise:
receiving a set of tokens forming a search query; storing the set of tokens to form a token pool; and associating the token pool with a user. 18. The non-transitory machine-readable storage medium of claim 13, wherein the operations further comprise:
generating a first set of global scores, each global score of the first set of global scores associated with a search query suggestion of the first search query suggestion set; and organizing the first search query suggestion set in the first order based on the first set of global scores. 19. The non-transitory machine-readable storage medium of claim 18, wherein generating the second search query suggestion set further comprises operations:
generating a second set of global scores, each global score of the second set of global scores associated with a search query suggestion of the second search query suggestion set; and organizing the second search query suggestion in the second order based on the second set of global scores. 20. The non-transitory machine-readable storage medium of claim 19, wherein organizing the third search query suggestion set in the third order further comprises operations:
calculating a boosting factor for each search query suggestion within the second subset of search query suggestions included in the third search query suggestion set; and determining the third order based on the boosting factor of each search query suggestion of the second subset of search query suggestions, the first set of global scores, and the second set of global scores. | In various example embodiments, a system and method for enhancing autocomplete search suggestions are presented. The system receives a query portion with a token portion from a client device and generates a first search query suggestion set having a first order based on the token portion. The system accesses a token pool associated with the client device and generates a second search query suggestion set having a second order based on the token portion and the token pool. The system selects a first subset of search query suggestions and a second subset of search query suggestions. The system merges the first subset of search query suggestions and the second subset of search query suggestions into a third search query suggestion set, organizes the third search query suggestion set into a third order distinct from the first and second orders, and causes presentation of the third search query suggestion set.1. A method, comprising:
receiving a query portion including at least a token portion from a client device; generating a first search query suggestion set based on the token portion, the first search query suggestion set including a first suggested token set, the first search query suggestion set having a first order; accessing a token pool associated with the client device; generating, by at least one processor of a machine, a second search query suggestion set based on the token portion and the token pool, the second search query suggestion set including a second suggested token set, the second search query suggestion set having a second order; selecting, by at least one processor of the machine, a first subset of search query suggestions and a second subset of search query suggestions, the first subset of search query suggestions selected from the first search query suggestion set and the second subset of search query suggestions selected from the second search query suggestion set; merging the first subset of search query suggestions and the second subset of search query suggestions to form a third search query suggestion set; organizing the third search query suggestion set in a third order distinct from the first order and the second order; and causing presentation of the third search query suggestion set in the third order on the client device. 2. The method of claim 1, wherein generating the first search query suggestion set further comprises:
accessing a global token pool associated with a set of client devices including the client device; and generating the first search query suggestion set based on the token portion and the global token pool. 3. The method of claim 1, further comprising:
receiving a set of queries from the client device representing a set of historical queries, each query of the set of queries including a set of historical tokens. 4. The method of claim 3, wherein the set of historical tokens of each query of the set of historical queries forms the token pool. 5. The method of claim 4, wherein each historical token includes one or more features, and further comprising:
determining a token quality for each historical token of the token pool; and associating the token quality with each historical token of the token pool. 6. The method of claim 1 wherein accessing the token pool further comprises:
receiving a set of tokens forming a search query;
storing the set of tokens to form the token pool; and
associating the token pool with a user. 7. The method of claim 1, wherein generating the first search query suggestion set further comprises:
generating a first set of global scores, each global score of the first set of global scores associated with a search query suggestion of the first search query suggestion set; and organizing the first search query suggestion set in the first order based on the first set of global scores. 8. The method of claim 7, wherein generating the second search query suggestion set further comprises:
generating a second set of global scores, each global score of the second set of global scores associated with a search query suggestion of the second search query suggestion set; and organizing the second search query suggestion set in the second order based on the second set of global scores. 9. The method of claim 8, wherein organizing the third search query suggestion set in the third order further comprises:
calculating a boosting factor for each search query suggestion within the second subset of search query suggestions included in the third search query suggestion set; and determining the third order based on the boosting factor of each search query suggestion of the second subset of search query suggestions, the first set of global scores, and the second set of global scores. 10. The method of claim 8, wherein selecting the first subset of search query suggestions and the second subset of search query suggestions further comprises:
generating a global score threshold for the first search query suggestion set; determining one or more search query suggestions of the first search query suggestion set exceeding the global score threshold for inclusion in the first subset of search query suggestions; and determining one or more search query suggestions of the second search query suggestion set exceeding the global score threshold for inclusion in the second subset of search query suggestions. 11. A system, comprising:
a receiving module configured to receive a query portion including at least a token portion from a client device; a token access module configured to access a token pool associated with the client device; a suggestion generation module including at least one processor of a machine configured to generate a first search query suggestion set based on the token portion, the first search query suggestion set including a first suggested token set, the first search query suggestion set having a first order and configured to generate a second search query suggestion set based on the token portion and the token pool, the second search query suggestion set including a second suggested token set, the second search query suggestion set having a second order; a selection module including at least one processor of the machine configured to select a first subset of search query suggestions and a second subset of search query suggestions, the first subset of search query suggestions selected from the first search query suggestion set and the second subset of search query suggestions selected from the second search query suggestion set; a merge module configured to merge the first subset of search query suggestions and the second subset of search query suggestions to form a third search query suggestion set; an organization module configured to organize the third search query suggestion set in a third order distinct from the first order and the second order; and a presentation module configured to cause presentation of the third search query suggestion set in the third order on the client device. 12. The system of claim 11, wherein the receiver module receives a set of queries from the client device representing a set of historical queries, each query of the set of queries including a set of historical tokens and the set of historical tokens of each query of the set of historical queries forms the token pool, further comprising:
a token management module configured to determine a token quality for each historical token of the token pool and associate the token quality with each historical token of the token pool. 13. A non-transitory machine-readable storage medium comprising processor executable instructions that, when executed by a processor of a machine, cause the machine to perform operations comprising:
receiving a query portion including at least a token portion from a client device; generating a first search query suggestion set based on the token portion, the first search query suggestion set including a first suggested token set, the first search query suggestion set having a first order; accessing a token pool associated with the client device; generating a second search query suggestion set based on the token portion and the token pool, the second search query suggestion set including a second suggested token set, the second search query suggestion set having a second order; selecting a first subset of search query suggestions and a second subset of search query suggestions, the first subset of search query suggestions selected from the first search query suggestion set and the second subset of search query suggestions selected from the second search query suggestion set; merging the first subset of search query suggestions and the second subset of search query suggestions to form a third search query suggestion set; organizing the third search query suggestion set in a third order distinct from the first order and the second order; and causing presentation of the third search query suggestion set in the third order on the client device. 14. The non-transitory machine-readable storage medium of claim 13, wherein the operations further comprise:
accessing a global token pool associated with a set of client devices; and generating the first search query suggestion set based on the token portion and the global token pool. 15. The non-transitory machine-readable storage medium of claim 13, wherein the operations further comprise:
receiving a set of queries from the client device representing a set of historical queries, each query of the set of queries including a set of historical tokens. 16. The non-transitory machine-readable storage medium of claim 15, wherein the set of historical tokens of each query of the set of historical queries forms the token pool and the operations further comprise:
determining a token quality for each historical token of the token pool; and associating the token quality with each historical token of the token pool. 17. The non-transitory machine-readable storage medium of claim 13, wherein the operations further comprise:
receiving a set of tokens forming a search query; storing the set of tokens to form a token pool; and associating the token pool with a user. 18. The non-transitory machine-readable storage medium of claim 13, wherein the operations further comprise:
generating a first set of global scores, each global score of the first set of global scores associated with a search query suggestion of the first search query suggestion set; and organizing the first search query suggestion set in the first order based on the first set of global scores. 19. The non-transitory machine-readable storage medium of claim 18, wherein generating the second search query suggestion set further comprises operations:
generating a second set of global scores, each global score of the second set of global scores associated with a search query suggestion of the second search query suggestion set; and organizing the second search query suggestion in the second order based on the second set of global scores. 20. The non-transitory machine-readable storage medium of claim 19, wherein organizing the third search query suggestion set in the third order further comprises operations:
calculating a boosting factor for each search query suggestion within the second subset of search query suggestions included in the third search query suggestion set; and determining the third order based on the boosting factor of each search query suggestion of the second subset of search query suggestions, the first set of global scores, and the second set of global scores. | 2,100 |
5,155 | 14,089,623 | 2,126 | One embodiment of the present invention provides a system for advising a user. During operation, the system generates a set of rules for a digital representation of the user. Next, the system obtains data indicating the user's digital trace, wherein the digital trace is a data trail associated with the user's interactions in a digital or physical environment. The system then applies the rules to the obtained data to generate warnings and/or recommendations. The system subsequently communicates the warnings and/or recommendations to the user. | 1. A method for advising a user, comprising:
generating a set of rules for a digital representation of the user; obtaining data indicating the user's digital trace, wherein the digital trace is a data trail associated with the user's interactions in a digital or physical environment; and applying the rules to the obtained data to generate warnings and/or recommendations; and communicating the warnings and/or recommendations to the user. 2. The method of claim 1, wherein obtaining data indicating the user's digital trace comprises:
receiving data indicating that the user is accessing a location and/or service on the Internet, other network or in a physical environment; obtaining copies of the data that the user is submitting to the location and/or service; and adding the obtained data to a semantic graph and/or storing the obtained data in a personal imprints storage. 3. The method of claim 1, further comprising:
modifying the set of rules based on results of analyzing rule success and/or rule usage. 4. The method of claim 1, further comprising:
filtering data items for presentation at an appropriate time; and presenting and/or recommending the data item to the user at the appropriate time. 5. The method of claim 1, further comprising:
receiving data indicating that the user is accessing a location and/or service on the Internet, other network or in a physical environment; determining the privacy policy of the location and/or service; determining that the privacy policy of the location and/or service does not match the user's privacy preferences; and informing the user of the non-matching privacy policy. 6. The method of claim 1, further comprising:
receiving data indicating that the user is planning to perform an activity; and communicating a suggestion to the user to alter or supplement the activity. 7. A computer-readable storage medium storing instructions that when executed by a computer cause the computer to perform a method for advising a user, comprising:
generating a set of rules for a digital representation of the user; obtaining data indicating the user's digital trace, wherein the digital trace is a data trail associated with the user's interactions in a digital or physical environment; and applying the rules to the obtained data to generate warnings and/or recommendations; and communicating the warnings and/or recommendations to the user. 8. The computer-readable storage medium of claim 7, wherein obtaining data indicating the user's digital trace comprises:
receiving data indicating that the user is accessing a location and/or service on the Internet, other network, or in a physical environment; obtaining copies of the data that the user is submitting to the location and/or service; and adding the obtained data to a semantic graph and/or storing the obtained data in a personal imprints storage. 9. The computer-readable storage medium of claim 7, wherein the computer-readable storage medium stores additional instructions that, when executed, cause the computer to perform additional steps comprising:
modifying the set of rules based on results of analyzing rule success and/or rule usage. 10. The computer-readable storage medium of claim 7, wherein the computer-readable storage medium stores additional instructions that, when executed, cause the computer to perform additional steps comprising:
filtering data items for presentation at an appropriate time; and presenting and/or recommending the data item to the user at the appropriate time. 11. The computer-readable storage medium of claim 7, wherein the computer-readable storage medium stores additional instructions that, when executed, cause the computer to perform additional steps comprising:
receiving data indicating that the user is accessing a location and/or service on the Internet, other network, or in a physical environment; determining the privacy policy of the location and/or service; determining that the privacy policy of the location and/or service does not match the user's privacy preferences; and informing the user of the non-matching privacy policy. 12. The computer-readable storage medium of claim 7, wherein the computer-readable storage medium stores additional instructions that, when executed, cause the computer to perform additional steps comprising:
receiving data indicating that the user is planning to perform an activity; and communicating a suggestion to the user to alter or supplement the activity. 13. A computing system for advising a user, the system comprising:
one or more processors, a computer-readable medium coupled to the one or more processors having instructions stored thereon that, when executed by the one or more processors, cause the one or more processors to perform operations comprising: generating a set of rules for a digital representation of the user; obtaining data indicating the user's digital trace, wherein the digital trace is a data trail associated with the user's interactions in a digital or physical environment; and applying the rules to the obtained data to generate warnings and/or recommendations; and communicating the warnings and/or recommendations to the user. 14. The computing system of claim 13, wherein obtaining data indicating the user's digital trace comprises:
receiving data indicating that the user is accessing a location and/or service on the Internet, other network, or in a physical environment; obtaining copies of the data that the user is submitting to the location and/or service; and adding the obtained data to a semantic graph and/or storing the obtained data in a personal imprints storage. 15. The computing system of claim 13, wherein the computer-readable storage medium stores additional instructions that, when executed, cause the computer to perform additional steps comprising:
modifying the set of rules based on results of analyzing rule success and/or rule usage. 16. The computing system of claim 13, wherein the computer-readable storage medium stores additional instructions that, when executed, cause the computer to perform additional steps comprising:
filtering data items for presentation at an appropriate time; and presenting and/or recommending the data item to the user at the appropriate time. 17. The computing system of claim 13, wherein the computer-readable storage medium stores additional instructions that, when executed, cause the computer to perform additional steps comprising:
receiving data indicating that the user is accessing a location and/or service on the Internet, other network, or in a physical environment; determining the privacy policy of the location and/or service; determining that the privacy policy of the location and/or service does not match the user's privacy preferences; and informing the user of the non-matching privacy policy. 18. The computing system of claim 13, wherein the computer-readable storage medium stores additional instructions that, when executed, cause the computer to perform additional steps comprising:
receiving data indicating that the user is planning to perform an activity; and communicating a suggestion to the user to alter or supplement the activity. | One embodiment of the present invention provides a system for advising a user. During operation, the system generates a set of rules for a digital representation of the user. Next, the system obtains data indicating the user's digital trace, wherein the digital trace is a data trail associated with the user's interactions in a digital or physical environment. The system then applies the rules to the obtained data to generate warnings and/or recommendations. The system subsequently communicates the warnings and/or recommendations to the user.1. A method for advising a user, comprising:
generating a set of rules for a digital representation of the user; obtaining data indicating the user's digital trace, wherein the digital trace is a data trail associated with the user's interactions in a digital or physical environment; and applying the rules to the obtained data to generate warnings and/or recommendations; and communicating the warnings and/or recommendations to the user. 2. The method of claim 1, wherein obtaining data indicating the user's digital trace comprises:
receiving data indicating that the user is accessing a location and/or service on the Internet, other network or in a physical environment; obtaining copies of the data that the user is submitting to the location and/or service; and adding the obtained data to a semantic graph and/or storing the obtained data in a personal imprints storage. 3. The method of claim 1, further comprising:
modifying the set of rules based on results of analyzing rule success and/or rule usage. 4. The method of claim 1, further comprising:
filtering data items for presentation at an appropriate time; and presenting and/or recommending the data item to the user at the appropriate time. 5. The method of claim 1, further comprising:
receiving data indicating that the user is accessing a location and/or service on the Internet, other network or in a physical environment; determining the privacy policy of the location and/or service; determining that the privacy policy of the location and/or service does not match the user's privacy preferences; and informing the user of the non-matching privacy policy. 6. The method of claim 1, further comprising:
receiving data indicating that the user is planning to perform an activity; and communicating a suggestion to the user to alter or supplement the activity. 7. A computer-readable storage medium storing instructions that when executed by a computer cause the computer to perform a method for advising a user, comprising:
generating a set of rules for a digital representation of the user; obtaining data indicating the user's digital trace, wherein the digital trace is a data trail associated with the user's interactions in a digital or physical environment; and applying the rules to the obtained data to generate warnings and/or recommendations; and communicating the warnings and/or recommendations to the user. 8. The computer-readable storage medium of claim 7, wherein obtaining data indicating the user's digital trace comprises:
receiving data indicating that the user is accessing a location and/or service on the Internet, other network, or in a physical environment; obtaining copies of the data that the user is submitting to the location and/or service; and adding the obtained data to a semantic graph and/or storing the obtained data in a personal imprints storage. 9. The computer-readable storage medium of claim 7, wherein the computer-readable storage medium stores additional instructions that, when executed, cause the computer to perform additional steps comprising:
modifying the set of rules based on results of analyzing rule success and/or rule usage. 10. The computer-readable storage medium of claim 7, wherein the computer-readable storage medium stores additional instructions that, when executed, cause the computer to perform additional steps comprising:
filtering data items for presentation at an appropriate time; and presenting and/or recommending the data item to the user at the appropriate time. 11. The computer-readable storage medium of claim 7, wherein the computer-readable storage medium stores additional instructions that, when executed, cause the computer to perform additional steps comprising:
receiving data indicating that the user is accessing a location and/or service on the Internet, other network, or in a physical environment; determining the privacy policy of the location and/or service; determining that the privacy policy of the location and/or service does not match the user's privacy preferences; and informing the user of the non-matching privacy policy. 12. The computer-readable storage medium of claim 7, wherein the computer-readable storage medium stores additional instructions that, when executed, cause the computer to perform additional steps comprising:
receiving data indicating that the user is planning to perform an activity; and communicating a suggestion to the user to alter or supplement the activity. 13. A computing system for advising a user, the system comprising:
one or more processors, a computer-readable medium coupled to the one or more processors having instructions stored thereon that, when executed by the one or more processors, cause the one or more processors to perform operations comprising: generating a set of rules for a digital representation of the user; obtaining data indicating the user's digital trace, wherein the digital trace is a data trail associated with the user's interactions in a digital or physical environment; and applying the rules to the obtained data to generate warnings and/or recommendations; and communicating the warnings and/or recommendations to the user. 14. The computing system of claim 13, wherein obtaining data indicating the user's digital trace comprises:
receiving data indicating that the user is accessing a location and/or service on the Internet, other network, or in a physical environment; obtaining copies of the data that the user is submitting to the location and/or service; and adding the obtained data to a semantic graph and/or storing the obtained data in a personal imprints storage. 15. The computing system of claim 13, wherein the computer-readable storage medium stores additional instructions that, when executed, cause the computer to perform additional steps comprising:
modifying the set of rules based on results of analyzing rule success and/or rule usage. 16. The computing system of claim 13, wherein the computer-readable storage medium stores additional instructions that, when executed, cause the computer to perform additional steps comprising:
filtering data items for presentation at an appropriate time; and presenting and/or recommending the data item to the user at the appropriate time. 17. The computing system of claim 13, wherein the computer-readable storage medium stores additional instructions that, when executed, cause the computer to perform additional steps comprising:
receiving data indicating that the user is accessing a location and/or service on the Internet, other network, or in a physical environment; determining the privacy policy of the location and/or service; determining that the privacy policy of the location and/or service does not match the user's privacy preferences; and informing the user of the non-matching privacy policy. 18. The computing system of claim 13, wherein the computer-readable storage medium stores additional instructions that, when executed, cause the computer to perform additional steps comprising:
receiving data indicating that the user is planning to perform an activity; and communicating a suggestion to the user to alter or supplement the activity. | 2,100 |
5,156 | 12,630,381 | 2,174 | A touch screen input device is provided which simulates a 3-state input device such as a mouse. One of these states is used to preview the effect of activating a graphical user interface element when the screen is touched. In this preview state touching a graphical user interface element on the screen with a finger or stylus does not cause the action associated with that element to be performed. Rather, when the screen is touched while in the preview state audio cues are provided to the user indicating what action would arise if the action associated with the touched element were to be performed. | 1. A method of providing a user interface for a mobile device, comprising:
displaying one or more graphical user interface elements on a touch-screen; receiving a first touch on the touch-screen at a location of the graphical user interface element; and responding to receipt of the first touch by entering a preview state in which an audio cue is rendered indicating a function performed by the graphical user interface element. 2. The method of claim 1 further comprising:
receiving a second touch on the touch-screen while continuing to receive the first touch; and
responding to receipt of the second touch by entering a second state associated with the graphical user interface element that is different from the preview state. 3. The method of claim 2 wherein the second state allows the graphical user interface element to be dragged on the touch screen in response to movement of the first touch along the touch screen while in the second state. 4. The method of claim 2 wherein the second state is only entered if the second touch is received on a predefined portion of the touch-screen. 5. The method of claim 2 wherein the second state is only entered if the second touch is received on a portion of the touch screen that is less than a predefined distance away from the location at which the first touch is received. 6. The method of claim 1 wherein the graphical user interface element represents a portion of a user interface to an application that is executed on an electronic device and the function performed by the graphical user interface element causes the application to respond in a predefined manner. 7. The method of claim 6 wherein entering the preview state does not cause the application to respond in accordance with the function performed graphical user interface element. 8. The method of claim 2 further comprising:
detecting an absence of the second touch; and
in response to the absence of the second touch, returning to the preview state. 9. A touch screen display system for use in an electronic device, comprising:
a touch screen configured to receive user input and display one or more graphical user interface elements; and an audio preview component configured to respond to receipt of a first touch on the touch screen at a location of the graphical user interface element by entering a preview state in which an audio cue is rendered indicating a function performed by the graphical user interface element. 10. The touch screen display system of claim 9 further comprising an application residing on the electronic device, the application having a user interface that includes the graphical user interface element, and wherein the audio preview component includes a text-to-speech converter component for converting text associated with the graphical user interface element into the audio cue, said text being exposed to the audio preview component by the application. 11. The touch screen display system of claim 9 further comprising a touch screen controller configured to respond to receipt of a second touch on the touch screen while continuing to receive the first touch by entering a second state associated with the graphical user interface element that is different from the preview state. 12. The touch screen display system of claim 11 wherein the second state allows the graphical user interface element to be dragged on the touch screen in response to movement of the first touch along the touch screen. 13. The touch screen display system of claim 11 wherein the second state is only entered if the second touch is received on a predefined portion of the touch-screen. 14. The touch screen display system of claim 11 wherein the second state is only entered if the second touch is received on a portion of the touch screen that is less than a predefined distance away from the location at which the first touch is received. 15. The touch screen display system of claim 9 further comprising an application residing on the electronic device, the application having a user interface that includes the graphical user interface element, wherein a function performed by the graphical user interface element causes the application to respond in a predefined manner. 16. A medium comprising instructions executable by a computing system, wherein the instructions configure the computing system to perform a method of interpreting a user contact on a touch screen, comprising:
presenting on a touch screen a graphical user interface element associated with the application; and in response to user contact with a portion of the touch screen at which the graphical user interface element is located, generating an audio response that indicates an action performed by the application in response to selection of the graphical user interface element. 17. The medium of claim 16 wherein the audio response includes speech. 18. The medium of claim 17 wherein the speech identifies a function performed by activation of the graphical user interface element. 19. The medium of claim 16 wherein the graphical user interface element represents a portion of a user interface to an application that is executed on an electronic device and the function performed by the graphical user interface element causes the application to respond in a predefined manner. 20. The medium of claim 19 wherein the user contact does not cause the application to respond in accordance with the function performed by the graphical user interface element. | A touch screen input device is provided which simulates a 3-state input device such as a mouse. One of these states is used to preview the effect of activating a graphical user interface element when the screen is touched. In this preview state touching a graphical user interface element on the screen with a finger or stylus does not cause the action associated with that element to be performed. Rather, when the screen is touched while in the preview state audio cues are provided to the user indicating what action would arise if the action associated with the touched element were to be performed.1. A method of providing a user interface for a mobile device, comprising:
displaying one or more graphical user interface elements on a touch-screen; receiving a first touch on the touch-screen at a location of the graphical user interface element; and responding to receipt of the first touch by entering a preview state in which an audio cue is rendered indicating a function performed by the graphical user interface element. 2. The method of claim 1 further comprising:
receiving a second touch on the touch-screen while continuing to receive the first touch; and
responding to receipt of the second touch by entering a second state associated with the graphical user interface element that is different from the preview state. 3. The method of claim 2 wherein the second state allows the graphical user interface element to be dragged on the touch screen in response to movement of the first touch along the touch screen while in the second state. 4. The method of claim 2 wherein the second state is only entered if the second touch is received on a predefined portion of the touch-screen. 5. The method of claim 2 wherein the second state is only entered if the second touch is received on a portion of the touch screen that is less than a predefined distance away from the location at which the first touch is received. 6. The method of claim 1 wherein the graphical user interface element represents a portion of a user interface to an application that is executed on an electronic device and the function performed by the graphical user interface element causes the application to respond in a predefined manner. 7. The method of claim 6 wherein entering the preview state does not cause the application to respond in accordance with the function performed graphical user interface element. 8. The method of claim 2 further comprising:
detecting an absence of the second touch; and
in response to the absence of the second touch, returning to the preview state. 9. A touch screen display system for use in an electronic device, comprising:
a touch screen configured to receive user input and display one or more graphical user interface elements; and an audio preview component configured to respond to receipt of a first touch on the touch screen at a location of the graphical user interface element by entering a preview state in which an audio cue is rendered indicating a function performed by the graphical user interface element. 10. The touch screen display system of claim 9 further comprising an application residing on the electronic device, the application having a user interface that includes the graphical user interface element, and wherein the audio preview component includes a text-to-speech converter component for converting text associated with the graphical user interface element into the audio cue, said text being exposed to the audio preview component by the application. 11. The touch screen display system of claim 9 further comprising a touch screen controller configured to respond to receipt of a second touch on the touch screen while continuing to receive the first touch by entering a second state associated with the graphical user interface element that is different from the preview state. 12. The touch screen display system of claim 11 wherein the second state allows the graphical user interface element to be dragged on the touch screen in response to movement of the first touch along the touch screen. 13. The touch screen display system of claim 11 wherein the second state is only entered if the second touch is received on a predefined portion of the touch-screen. 14. The touch screen display system of claim 11 wherein the second state is only entered if the second touch is received on a portion of the touch screen that is less than a predefined distance away from the location at which the first touch is received. 15. The touch screen display system of claim 9 further comprising an application residing on the electronic device, the application having a user interface that includes the graphical user interface element, wherein a function performed by the graphical user interface element causes the application to respond in a predefined manner. 16. A medium comprising instructions executable by a computing system, wherein the instructions configure the computing system to perform a method of interpreting a user contact on a touch screen, comprising:
presenting on a touch screen a graphical user interface element associated with the application; and in response to user contact with a portion of the touch screen at which the graphical user interface element is located, generating an audio response that indicates an action performed by the application in response to selection of the graphical user interface element. 17. The medium of claim 16 wherein the audio response includes speech. 18. The medium of claim 17 wherein the speech identifies a function performed by activation of the graphical user interface element. 19. The medium of claim 16 wherein the graphical user interface element represents a portion of a user interface to an application that is executed on an electronic device and the function performed by the graphical user interface element causes the application to respond in a predefined manner. 20. The medium of claim 19 wherein the user contact does not cause the application to respond in accordance with the function performed by the graphical user interface element. | 2,100 |
5,157 | 14,870,594 | 2,132 | Prefetch apparatus and a method of prefetching are presented. The prefetch apparatus monitors access requests, each having an access request address, and has request tracking storage to store region entries for regions of memory space which each span multiple access request addresses. The request tracking storage keeps access information for access requests received in their corresponding region entries. When a new region access request is received, which belongs to a new region for which there is no region entry, and when the request tracking storage has an adjacent region entry for which the access information shows that at least a predetermined number of the access request addresses have been accessed, a page mode region prefetching process is initiated for all access request addresses in the new region. | 1. Prefetch apparatus comprising:
access request reception circuitry to receive access requests, each access request having an access request address; request tracking storage to store a plurality of region entries, wherein each region entry corresponds to a region of memory space and corresponds to a plurality of access request addresses within that region of memory space, and wherein the request tracking storage is responsive to reception of each access request to update access information in its corresponding region entry; and prefetch control circuitry responsive to the access request reception circuitry receiving a new region access request which belongs to a new region for which there is no region entry, and when the request tracking storage has an adjacent region entry corresponding to an adjacent region of memory space to the new region for which the access information indicates that at least a predetermined number of the access request addresses in the adjacent region of memory space have been accessed, to initiate a region prefetching process for all access request addresses in the new region. 2. Prefetch apparatus as claimed in claim 1, wherein the request tracking storage is responsive to reception of the new region access request which belongs to the new region for which there is no region entry to create a new region entry for the new region. 3. The prefetch apparatus as claimed in claim 1, wherein the access information in each region entry comprises a plurality of access indications corresponding to the plurality of access requests whose access request addresses are within that region of memory space, and wherein the request tracking storage is responsive to reception of each access request to set an access indication corresponding to the access request address of that access request. 4. The prefetch apparatus as claimed in claim 1, wherein the plurality of region entries each comprise a counter and the access information in each region entry comprises a count value of the counter. 5. The prefetch apparatus as claimed in claim 1, wherein the prefetch control circuitry is responsive to the adjacent region of memory space being below the new region to cause the region prefetching process to prefetch the access request addresses in the new region in ascending order. 6. The prefetch apparatus as claimed in claim 1, wherein the prefetch control circuitry is responsive to the adjacent region of memory space being above the new region to cause the region prefetching process to prefetch the access request addresses in the new region in descending order. 7. The prefetch apparatus as claimed in claim 1, wherein the access request address received by the access request reception circuitry is specified as a region tag and an offset in an offset range, and the prefetch control circuitry is responsive to the offset being in a lower half of the offset range to examine the access information in the adjacent region of memory space below the access request address and is responsive to the offset being in a upper half of the offset range to examine the access information in the adjacent region of memory space above the access request address. 8. The prefetch apparatus as claimed in claim 1, wherein the access requests are cache line requests and each region entry corresponds to a plurality of cache line requests. 9. The prefetch apparatus as claimed in claim 1, wherein the region prefetching process comprises sequentially issuing plural prefetch requests for subgroups of access request addresses in the new region. 10. The prefetch apparatus as claimed in claim 1, wherein the region prefetching process comprises issuing as a group prefetch requests for all access request addresses in the new region. 11. The prefetch apparatus as claimed in claim 1, further comprising prefetch pattern storage to store indications of previously received access requests and the prefetch control circuitry is responsive to the indications of previously received access requests in the prefetch pattern storage corresponding to a predetermined pattern of access requests to perform an extrapolation of the indications of previously received access requests in the prefetch pattern storage and issue a prefetch request resulting from the extrapolation. 12. The prefetch apparatus as claimed in claim 11, wherein the request tracking storage comprises region prefetching marker storage to store for each region entry a region prefetching marker indicating whether the region prefetching process has been initiated for that region,
and prefetch control circuitry is responsive to the region prefetching marker to disable access to the prefetch pattern storage. 13. The prefetch apparatus as claimed in claim 11, wherein the prefetch pattern storage comprises the request tracking storage. 14. The prefetch apparatus as claimed in claim 1, further comprising prefetch stride storage circuitry to store a last received access request address, an access request stride length and a stride confidence value, and
the prefetch control circuitry is arranged to perform a comparison between the access request stride length, the last received access request address and a current access request address and to update the stride confidence value in dependence on a result of the comparison, and to issue a prefetch request for a predicted access request corresponding to the access request stride length added to the current access request address in dependence on the stride confidence value. 15. The prefetch apparatus as claimed in claim 1, wherein the access requests comprise load requests and each load request has a load request address. 16. The prefetch apparatus as claimed in claim 1, wherein the access requests comprise store requests and each store request has a store request address. 17. The prefetch apparatus as claimed in claim 1, wherein the access requests comprise both load requests and store requests, wherein each load request has a load request address and each store request has a store request address. 18. A method of issuing prefetch requests in a prefetch apparatus comprising:
receiving access requests, each access request having an access request address; storing a plurality of region entries in request tracking storage, wherein each region entry corresponds to a region of memory space and corresponds to a plurality of access request addresses within that region of memory space; updating access information in a corresponding region entry for each access request received; and initiating a region prefetching process for all access request addresses in the new region in response to receiving the new region access request, when the request tracking storage has an adjacent region entry corresponding to an adjacent region of memory space to the new region for which the access information indicates that at least a predetermined number of the access request addresses in the adjacent region of memory space have been accessed. 19. Prefetch apparatus comprising:
means for receiving access requests, each access request having an access request address; means for storing a plurality of region entries, wherein each region entry corresponds to a region of memory space and corresponds to a plurality of access request addresses within that region of memory space; means for updating access information in a corresponding region entry for each access request received; and means for initiating a region prefetching process for all access request addresses in the new region in response to receiving the new region access request, when the means for storing the plurality of region entries has an adjacent region entry corresponding to an adjacent region of memory space to the new region for which the access information indicates that at least a predetermined number of the access request addresses in the adjacent region of memory space have been accessed. | Prefetch apparatus and a method of prefetching are presented. The prefetch apparatus monitors access requests, each having an access request address, and has request tracking storage to store region entries for regions of memory space which each span multiple access request addresses. The request tracking storage keeps access information for access requests received in their corresponding region entries. When a new region access request is received, which belongs to a new region for which there is no region entry, and when the request tracking storage has an adjacent region entry for which the access information shows that at least a predetermined number of the access request addresses have been accessed, a page mode region prefetching process is initiated for all access request addresses in the new region.1. Prefetch apparatus comprising:
access request reception circuitry to receive access requests, each access request having an access request address; request tracking storage to store a plurality of region entries, wherein each region entry corresponds to a region of memory space and corresponds to a plurality of access request addresses within that region of memory space, and wherein the request tracking storage is responsive to reception of each access request to update access information in its corresponding region entry; and prefetch control circuitry responsive to the access request reception circuitry receiving a new region access request which belongs to a new region for which there is no region entry, and when the request tracking storage has an adjacent region entry corresponding to an adjacent region of memory space to the new region for which the access information indicates that at least a predetermined number of the access request addresses in the adjacent region of memory space have been accessed, to initiate a region prefetching process for all access request addresses in the new region. 2. Prefetch apparatus as claimed in claim 1, wherein the request tracking storage is responsive to reception of the new region access request which belongs to the new region for which there is no region entry to create a new region entry for the new region. 3. The prefetch apparatus as claimed in claim 1, wherein the access information in each region entry comprises a plurality of access indications corresponding to the plurality of access requests whose access request addresses are within that region of memory space, and wherein the request tracking storage is responsive to reception of each access request to set an access indication corresponding to the access request address of that access request. 4. The prefetch apparatus as claimed in claim 1, wherein the plurality of region entries each comprise a counter and the access information in each region entry comprises a count value of the counter. 5. The prefetch apparatus as claimed in claim 1, wherein the prefetch control circuitry is responsive to the adjacent region of memory space being below the new region to cause the region prefetching process to prefetch the access request addresses in the new region in ascending order. 6. The prefetch apparatus as claimed in claim 1, wherein the prefetch control circuitry is responsive to the adjacent region of memory space being above the new region to cause the region prefetching process to prefetch the access request addresses in the new region in descending order. 7. The prefetch apparatus as claimed in claim 1, wherein the access request address received by the access request reception circuitry is specified as a region tag and an offset in an offset range, and the prefetch control circuitry is responsive to the offset being in a lower half of the offset range to examine the access information in the adjacent region of memory space below the access request address and is responsive to the offset being in a upper half of the offset range to examine the access information in the adjacent region of memory space above the access request address. 8. The prefetch apparatus as claimed in claim 1, wherein the access requests are cache line requests and each region entry corresponds to a plurality of cache line requests. 9. The prefetch apparatus as claimed in claim 1, wherein the region prefetching process comprises sequentially issuing plural prefetch requests for subgroups of access request addresses in the new region. 10. The prefetch apparatus as claimed in claim 1, wherein the region prefetching process comprises issuing as a group prefetch requests for all access request addresses in the new region. 11. The prefetch apparatus as claimed in claim 1, further comprising prefetch pattern storage to store indications of previously received access requests and the prefetch control circuitry is responsive to the indications of previously received access requests in the prefetch pattern storage corresponding to a predetermined pattern of access requests to perform an extrapolation of the indications of previously received access requests in the prefetch pattern storage and issue a prefetch request resulting from the extrapolation. 12. The prefetch apparatus as claimed in claim 11, wherein the request tracking storage comprises region prefetching marker storage to store for each region entry a region prefetching marker indicating whether the region prefetching process has been initiated for that region,
and prefetch control circuitry is responsive to the region prefetching marker to disable access to the prefetch pattern storage. 13. The prefetch apparatus as claimed in claim 11, wherein the prefetch pattern storage comprises the request tracking storage. 14. The prefetch apparatus as claimed in claim 1, further comprising prefetch stride storage circuitry to store a last received access request address, an access request stride length and a stride confidence value, and
the prefetch control circuitry is arranged to perform a comparison between the access request stride length, the last received access request address and a current access request address and to update the stride confidence value in dependence on a result of the comparison, and to issue a prefetch request for a predicted access request corresponding to the access request stride length added to the current access request address in dependence on the stride confidence value. 15. The prefetch apparatus as claimed in claim 1, wherein the access requests comprise load requests and each load request has a load request address. 16. The prefetch apparatus as claimed in claim 1, wherein the access requests comprise store requests and each store request has a store request address. 17. The prefetch apparatus as claimed in claim 1, wherein the access requests comprise both load requests and store requests, wherein each load request has a load request address and each store request has a store request address. 18. A method of issuing prefetch requests in a prefetch apparatus comprising:
receiving access requests, each access request having an access request address; storing a plurality of region entries in request tracking storage, wherein each region entry corresponds to a region of memory space and corresponds to a plurality of access request addresses within that region of memory space; updating access information in a corresponding region entry for each access request received; and initiating a region prefetching process for all access request addresses in the new region in response to receiving the new region access request, when the request tracking storage has an adjacent region entry corresponding to an adjacent region of memory space to the new region for which the access information indicates that at least a predetermined number of the access request addresses in the adjacent region of memory space have been accessed. 19. Prefetch apparatus comprising:
means for receiving access requests, each access request having an access request address; means for storing a plurality of region entries, wherein each region entry corresponds to a region of memory space and corresponds to a plurality of access request addresses within that region of memory space; means for updating access information in a corresponding region entry for each access request received; and means for initiating a region prefetching process for all access request addresses in the new region in response to receiving the new region access request, when the means for storing the plurality of region entries has an adjacent region entry corresponding to an adjacent region of memory space to the new region for which the access information indicates that at least a predetermined number of the access request addresses in the adjacent region of memory space have been accessed. | 2,100 |
5,158 | 11,839,850 | 2,174 | A method to control a portlet associated with a portal page may include deactivating a selected portlet in response to operating a deactivation feature. The method may also include reactivating the selected portlet in response to operating a reactivation feature. The method may also include freezing a portlet content in the selected portlet in response to deactivating the selected portlet. The method may further include disabling hyperlinks, buttons and other inputs to the selected portlet in response to deactivating the selected portlet. The method may further include reconfiguring a portal server to ensure that a portlet content of a selected portlet cannot be affected while the selected portlet is deactivated. | 1. A method to control operation of a portlet associated with a portal page, comprising:
deactivating a selected portlet in response to operating a deactivation feature; freezing a portlet content in the selected portlet except a reactivation feature in response to deactivating the selected portlet; and reactivating the selected portlet in response to operating the reactivation feature, wherein the deactivated selected portlet is prevented from being moved, closed, edited or affected. 2. The method of claim 1, further comprising disabling hyperlinks, buttons and other inputs to the selected portlet in response to deactivating the selected portlet. 3. The method of claim 1, further comprising reconfiguring a portal server associated with the portal page to ensure that a portlet content of the selected portlet cannot be affected while the selected portlet is deactivated. 4. The method of claim 1, further comprising detecting a deactivated state of the selected portlet. 5. The method of claim 1, further comprising replacing a content of the selected portlet with a frozen content in response to a portal server detecting a deactivated state of the selected portlet. 6. The method of claim 1, further comprising enabling hyperlinks, buttons and other inputs to the selected portlet in response to reactivating the selected portlet. 7. The method of claim 1, further comprising permitting a content of the selected portlet to be updated in response to reactivating the selected portlet. 8. The method of claim 1, further comprising launching a new portlet similar to the deactivated, selected portlet in response to a portal server receiving a request that calls for use of the deactivated, selected portlet if the deactivated, selected portlet is a singleton portlet. 9. A method to control operation of a portlet associated with a portal page, comprising:
deactivating a selected portlet in response to operating a deactivation feature; overlaying the selected portlet with an electronic pane or window to block all inputs of the selected portlet while the selected portlet is deactivated except a reactivation feature in the portlet; and reactivating the selected portlet in response to operating the reactivation feature, wherein the deactivated selected portlet is prevented from being moved, closed, edited or affected. 10. The method of claim 9, further comprising automatically replacing a content of the selected portlet with a frozen content in response to detecting a deactivated state of the selected portlet. 11. The method of claim 9, further comprising removing the overlaying pane in response to a portal server detecting a reactivated state of the selected portlet. 12. The method of claim 9, further comprising automatically replacing a frozen content of the selected portlet with any updated content in response to reactivating the selected portlet. 13. The method of claim 9, further comprising launching a new portlet similar to the deactivated, selected portlet in response to a portal server receiving a request that calls for the deactivated, selected portlet and the deactivated, selected portlet being a singleton portlet. 14. A method to control operation of a portlet associated with a portal page, comprising:
deactivating a selected portlet by at least one of preserving, freezing or caching data or information in the selected portlet; and changing a behavior of the deactivated selected portlet on the portal page, wherein the deactivated selected portlet is prevented from being moved, closed, edited or affected. 15. The method of claim 14, further comprising preventing the portlet from being affected by refreshes across the portal page. 16. The method of claim 14, further comprising selectively toggling the portlet to change the portlet's ability to be targeted by a portal click-to-action feature. 17. The method of claim 14, further comprising:
selectively ignoring a presence of a singleton portlet; and creating a new instance of the singleton portlet in response to the singleton portlet being needed to perform a task. 18. A method to form a portal page, comprising:
providing a plurality of portlets; providing a deactivation feature associated with at least one of the plurality of portlets to deactivate the portlet to preserve a selected content of the at least one portlet; and forming a reactivation feature in response to the at least one portlet being deactivated, wherein the deactivated portlet is prevented from being moved, closed, edited or affected. 19. The method of claim 18, further comprising forming an electronic pane or window overlaying the at least one portlet to block all inputs of the at least one portlet except the reactivation feature while the at least one portlet is deactivated. 20. The method of claim 18, further comprising providing another portlet similar to the at least one portlet in response to a request that calls for use of the at least one portlet, if the at least one portlet is deactivated and a singleton portlet. 21. A method of making a system to control operation of a portlet, comprising:
providing a portal server; providing a portlet deactivation/reactivation feature operable on the portal servers; and providing means for freezing a portlet content in a selected portlet in response to deactivating the selected portlet, wherein the deactivated selected portlet is prevented from being moved, closed, edited or affected. 22. The method of claim 21, further comprising providing means for disabling hyperlinks, buttons and other inputs to a selected portlet in response to deactivating the selected portlet. 23. The method of claim 21, further comprising providing means to reconfigure the portal server to ensure that a portlet content of a selected portlet cannot be affected while the selected portlet in deactivated. 24. The method of claim 21, further comprising providing means for replacing a content of a deactivated portlet with a frozen content in response to the portal server detecting a deactivated state of the portlet. 25. The method of claim 21, further comprising providing means for launching a new portlet similar to a deactivated portlet in response to the portal server receiving a request that calls for use of the deactivated portlet if the deactivated portlet is a singleton. 26. A computer-readable medium comprising one from the group consisting of an electronic medium, a magnetic medium, an electromagnetic medium a semiconductor medium, having computer-executable instructions for performing a method, comprising:
deactivating a selected portlet in response to operating a deactivation feature; freezing a portlet content in the selected portlet in response to deactivating the selected portlet; and reactivating the selected portlet in response to operating a reactivation feature, wherein the deactivated selected portlet is prevented from being moved, closed, edited or affected. 27. The computer-readable medium having computer executable instructions for performing the method of claim 26, further comprising disabling hyperlinks, buttons and other inputs to the selected portlet in response to deactivating the selected portlet. 28. The computer-readable medium having computer executable instructions for performing the method of claim 26, further comprising reconfiguring a portal server associated with the portal page to ensure that a portlet content of the selected portlet cannot be affected while the selected portlet is deactivated. 29. The computer-readable medium having computer executable instructions for performing the method of claim 26, further comprising overlaying the selected portlet with an electronic pane or window to block all inputs of the selected portlet while the selected portlet is deactivated. | A method to control a portlet associated with a portal page may include deactivating a selected portlet in response to operating a deactivation feature. The method may also include reactivating the selected portlet in response to operating a reactivation feature. The method may also include freezing a portlet content in the selected portlet in response to deactivating the selected portlet. The method may further include disabling hyperlinks, buttons and other inputs to the selected portlet in response to deactivating the selected portlet. The method may further include reconfiguring a portal server to ensure that a portlet content of a selected portlet cannot be affected while the selected portlet is deactivated.1. A method to control operation of a portlet associated with a portal page, comprising:
deactivating a selected portlet in response to operating a deactivation feature; freezing a portlet content in the selected portlet except a reactivation feature in response to deactivating the selected portlet; and reactivating the selected portlet in response to operating the reactivation feature, wherein the deactivated selected portlet is prevented from being moved, closed, edited or affected. 2. The method of claim 1, further comprising disabling hyperlinks, buttons and other inputs to the selected portlet in response to deactivating the selected portlet. 3. The method of claim 1, further comprising reconfiguring a portal server associated with the portal page to ensure that a portlet content of the selected portlet cannot be affected while the selected portlet is deactivated. 4. The method of claim 1, further comprising detecting a deactivated state of the selected portlet. 5. The method of claim 1, further comprising replacing a content of the selected portlet with a frozen content in response to a portal server detecting a deactivated state of the selected portlet. 6. The method of claim 1, further comprising enabling hyperlinks, buttons and other inputs to the selected portlet in response to reactivating the selected portlet. 7. The method of claim 1, further comprising permitting a content of the selected portlet to be updated in response to reactivating the selected portlet. 8. The method of claim 1, further comprising launching a new portlet similar to the deactivated, selected portlet in response to a portal server receiving a request that calls for use of the deactivated, selected portlet if the deactivated, selected portlet is a singleton portlet. 9. A method to control operation of a portlet associated with a portal page, comprising:
deactivating a selected portlet in response to operating a deactivation feature; overlaying the selected portlet with an electronic pane or window to block all inputs of the selected portlet while the selected portlet is deactivated except a reactivation feature in the portlet; and reactivating the selected portlet in response to operating the reactivation feature, wherein the deactivated selected portlet is prevented from being moved, closed, edited or affected. 10. The method of claim 9, further comprising automatically replacing a content of the selected portlet with a frozen content in response to detecting a deactivated state of the selected portlet. 11. The method of claim 9, further comprising removing the overlaying pane in response to a portal server detecting a reactivated state of the selected portlet. 12. The method of claim 9, further comprising automatically replacing a frozen content of the selected portlet with any updated content in response to reactivating the selected portlet. 13. The method of claim 9, further comprising launching a new portlet similar to the deactivated, selected portlet in response to a portal server receiving a request that calls for the deactivated, selected portlet and the deactivated, selected portlet being a singleton portlet. 14. A method to control operation of a portlet associated with a portal page, comprising:
deactivating a selected portlet by at least one of preserving, freezing or caching data or information in the selected portlet; and changing a behavior of the deactivated selected portlet on the portal page, wherein the deactivated selected portlet is prevented from being moved, closed, edited or affected. 15. The method of claim 14, further comprising preventing the portlet from being affected by refreshes across the portal page. 16. The method of claim 14, further comprising selectively toggling the portlet to change the portlet's ability to be targeted by a portal click-to-action feature. 17. The method of claim 14, further comprising:
selectively ignoring a presence of a singleton portlet; and creating a new instance of the singleton portlet in response to the singleton portlet being needed to perform a task. 18. A method to form a portal page, comprising:
providing a plurality of portlets; providing a deactivation feature associated with at least one of the plurality of portlets to deactivate the portlet to preserve a selected content of the at least one portlet; and forming a reactivation feature in response to the at least one portlet being deactivated, wherein the deactivated portlet is prevented from being moved, closed, edited or affected. 19. The method of claim 18, further comprising forming an electronic pane or window overlaying the at least one portlet to block all inputs of the at least one portlet except the reactivation feature while the at least one portlet is deactivated. 20. The method of claim 18, further comprising providing another portlet similar to the at least one portlet in response to a request that calls for use of the at least one portlet, if the at least one portlet is deactivated and a singleton portlet. 21. A method of making a system to control operation of a portlet, comprising:
providing a portal server; providing a portlet deactivation/reactivation feature operable on the portal servers; and providing means for freezing a portlet content in a selected portlet in response to deactivating the selected portlet, wherein the deactivated selected portlet is prevented from being moved, closed, edited or affected. 22. The method of claim 21, further comprising providing means for disabling hyperlinks, buttons and other inputs to a selected portlet in response to deactivating the selected portlet. 23. The method of claim 21, further comprising providing means to reconfigure the portal server to ensure that a portlet content of a selected portlet cannot be affected while the selected portlet in deactivated. 24. The method of claim 21, further comprising providing means for replacing a content of a deactivated portlet with a frozen content in response to the portal server detecting a deactivated state of the portlet. 25. The method of claim 21, further comprising providing means for launching a new portlet similar to a deactivated portlet in response to the portal server receiving a request that calls for use of the deactivated portlet if the deactivated portlet is a singleton. 26. A computer-readable medium comprising one from the group consisting of an electronic medium, a magnetic medium, an electromagnetic medium a semiconductor medium, having computer-executable instructions for performing a method, comprising:
deactivating a selected portlet in response to operating a deactivation feature; freezing a portlet content in the selected portlet in response to deactivating the selected portlet; and reactivating the selected portlet in response to operating a reactivation feature, wherein the deactivated selected portlet is prevented from being moved, closed, edited or affected. 27. The computer-readable medium having computer executable instructions for performing the method of claim 26, further comprising disabling hyperlinks, buttons and other inputs to the selected portlet in response to deactivating the selected portlet. 28. The computer-readable medium having computer executable instructions for performing the method of claim 26, further comprising reconfiguring a portal server associated with the portal page to ensure that a portlet content of the selected portlet cannot be affected while the selected portlet is deactivated. 29. The computer-readable medium having computer executable instructions for performing the method of claim 26, further comprising overlaying the selected portlet with an electronic pane or window to block all inputs of the selected portlet while the selected portlet is deactivated. | 2,100 |
5,159 | 15,596,649 | 2,136 | The present invention is directed to a system and method which employ two memory access paths: 1) a cache-access path in which block data is fetched from main memory for loading to a cache, and 2) a direct-access path in which individually-addressed data is fetched from main memory. The system may comprise one or more processor cores that utilize the cache-access path for accessing data. The system may further comprise at least one heterogeneous functional unit that is operable to utilize the direct-access path for accessing data. In certain embodiments, the one or more processor cores, cache, and the at least one heterogeneous functional unit may be included on a common semiconductor die (e.g., as part of an integrated circuit). Embodiments of the present invention enable improved system performance by selectively employing the cache-access path for certain instructions while selectively employing the direct-access path for other instructions. | 1. A memory system providing memory access for a multiple processor system including at least one processor and at least one heterogeneous functional unit, the memory system comprising:
a main memory configured for individually-addressed data access; a block oriented cache-access path coupling the main memory and a cache memory, wherein the block oriented cache-access path is configured to provide fixed-size data block access to the main memory, and wherein the cache memory provides storage of fixed-size data blocks of main memory data for data access by the at least one processor; and an address oriented cache-bypass path coupling the main memory and the at least one heterogeneous functional unit, wherein the address oriented cache-bypass path provides individually-addressed data access to the main memory. 2. The memory system of claim 1, wherein the fixed-size data block access to the main memory returns data in addition to data referenced by a cache memory access by the at least one processor, and wherein the individually-addressed data access returns only data referenced by a physical address access by the at least one heterogeneous processor. 3. The memory system of claim 1, wherein the main memory is configured to emulate block data access for the block oriented cache-access path. 4. The memory system of claim 1, wherein the main memory comprises a scatter/gather memory module. 5. The memory system of claim 1, further comprising:
a cache interrogation path coupling the cache memory and the heterogeneous functional unit, wherein the cache interrogation path is configured to provide information regarding encached data to the heterogeneous functional unit in response to an interrogation by the heterogeneous functional unit regarding referenced data to be accessed by the heterogeneous functional unit. 6. The memory system of claim 5, wherein the cache interrogation path is configured initiate writing a cache block containing the referenced data to the main memory for individually-addressed data access of the referenced data from the main memory by the heterogeneous functional unit using the address oriented cache-bypass path. 7. The memory system of claim 5, wherein the cache interrogation path is configured to invalidate the referenced data in the cache memory in association with individually-addressed data access of the referenced data from the main memory by the heterogeneous functional unit using the address oriented cache-bypass path. 8. The memory system of claim 1, wherein the at least one processor and the at least one heterogeneous functional unit comprise different instruction sets. 9. A method comprising:
providing fixed-size data block access to a main memory by at least one processor of a multiple processor system including the at least one processor and at least one heterogeneous functional unit via a block oriented cache-access path coupling the main memory and a cache memory, wherein the cache memory provides storage of fixed-size data blocks of main memory data for data access by the at least one processor; and providing individually-addressed data access to the main memory by the at least one heterogeneous functional unit of the multiple processor system via an address oriented cache-bypass path coupling the main memory and the at least one heterogeneous functional unit. 10. The method of claim 9, wherein the fixed-size data block access to the main memory returns data in addition to data referenced by a cache memory access by the at least one processor, and wherein the individually-addressed data access returns only data referenced by a physical address access by the at least one heterogeneous processor. 11. The method of claim 9, wherein the main memory comprises scatter/gather memory configured for individually-addressed data access, and wherein the providing fixed-size data block access to the main memory comprises:
emulating block data access to the main memory for the block oriented cache-access path. 12. The method of claim 9, further comprising:
providing information regarding data encached in the cache memory to the heterogeneous functional unit in response to an interrogation by the heterogeneous functional unit regarding referenced data to be accessed by the heterogeneous functional unit. 13. The method of claim 12, further comprising:
writing a cache block containing the referenced data to the main memory for individually-addressed data access of the referenced data from the main memory by the heterogeneous functional unit. 14. The method of claim 12, further comprising:
invalidating the referenced data in the cache memory in association with individually-addressed data access of the referenced data from the main memory by the heterogeneous functional unit. 15. The method of claim 9, wherein the at least one processor and the at least one heterogeneous functional unit comprise different instruction sets. 16. The method of claim 9, further comprising:
off-loading an instruction from a processor of the at least one processor to a heterogeneous functional unit of the at least one heterogeneous functional unit so that the heterogeneous functional unit takes advantage of the address oriented cache-bypass path to access the main memory using the individually-addressed data access for processing the off-loaded instruction. 17. A system comprising:
at least one processor; at least one heterogeneous functional unit; a main memory configured for individually-addressed data access and for fixed-size data block access; a cache memory configured to provide storage of fixed-size data blocks of main memory data for data access by the at least one processor a block oriented cache-access path coupling the main memory and the cache memory, wherein the block oriented cache-access path is configured to provide fixed-size data block access to the main memory; and an address oriented cache-bypass path coupling the main memory and the at least one heterogeneous functional unit, wherein the address oriented cache-bypass path provides individually-addressed data access to the main memory. 18. The system of claim 17, further comprising:
a cache interrogation path coupling the cache memory and the heterogeneous functional unit, wherein the cache interrogation path is configured to provide information regarding encached data to the heterogeneous functional unit in response to an interrogation by the heterogeneous functional unit regarding referenced data to be accessed by the heterogeneous functional unit. 19. The system of claim 18, wherein the cache interrogation path is configured initiate writing a cache block containing the referenced data to the main memory for individually-addressed data access of the referenced data from the main memory by the heterogeneous functional unit using the address oriented cache-bypass path. 20. The system of claim 18, wherein the cache interrogation path is configured to invalidate the referenced data in the cache memory in association with individually-addressed data access of the referenced data from the main memory by the heterogeneous functional unit using the address oriented cache-bypass path. | The present invention is directed to a system and method which employ two memory access paths: 1) a cache-access path in which block data is fetched from main memory for loading to a cache, and 2) a direct-access path in which individually-addressed data is fetched from main memory. The system may comprise one or more processor cores that utilize the cache-access path for accessing data. The system may further comprise at least one heterogeneous functional unit that is operable to utilize the direct-access path for accessing data. In certain embodiments, the one or more processor cores, cache, and the at least one heterogeneous functional unit may be included on a common semiconductor die (e.g., as part of an integrated circuit). Embodiments of the present invention enable improved system performance by selectively employing the cache-access path for certain instructions while selectively employing the direct-access path for other instructions.1. A memory system providing memory access for a multiple processor system including at least one processor and at least one heterogeneous functional unit, the memory system comprising:
a main memory configured for individually-addressed data access; a block oriented cache-access path coupling the main memory and a cache memory, wherein the block oriented cache-access path is configured to provide fixed-size data block access to the main memory, and wherein the cache memory provides storage of fixed-size data blocks of main memory data for data access by the at least one processor; and an address oriented cache-bypass path coupling the main memory and the at least one heterogeneous functional unit, wherein the address oriented cache-bypass path provides individually-addressed data access to the main memory. 2. The memory system of claim 1, wherein the fixed-size data block access to the main memory returns data in addition to data referenced by a cache memory access by the at least one processor, and wherein the individually-addressed data access returns only data referenced by a physical address access by the at least one heterogeneous processor. 3. The memory system of claim 1, wherein the main memory is configured to emulate block data access for the block oriented cache-access path. 4. The memory system of claim 1, wherein the main memory comprises a scatter/gather memory module. 5. The memory system of claim 1, further comprising:
a cache interrogation path coupling the cache memory and the heterogeneous functional unit, wherein the cache interrogation path is configured to provide information regarding encached data to the heterogeneous functional unit in response to an interrogation by the heterogeneous functional unit regarding referenced data to be accessed by the heterogeneous functional unit. 6. The memory system of claim 5, wherein the cache interrogation path is configured initiate writing a cache block containing the referenced data to the main memory for individually-addressed data access of the referenced data from the main memory by the heterogeneous functional unit using the address oriented cache-bypass path. 7. The memory system of claim 5, wherein the cache interrogation path is configured to invalidate the referenced data in the cache memory in association with individually-addressed data access of the referenced data from the main memory by the heterogeneous functional unit using the address oriented cache-bypass path. 8. The memory system of claim 1, wherein the at least one processor and the at least one heterogeneous functional unit comprise different instruction sets. 9. A method comprising:
providing fixed-size data block access to a main memory by at least one processor of a multiple processor system including the at least one processor and at least one heterogeneous functional unit via a block oriented cache-access path coupling the main memory and a cache memory, wherein the cache memory provides storage of fixed-size data blocks of main memory data for data access by the at least one processor; and providing individually-addressed data access to the main memory by the at least one heterogeneous functional unit of the multiple processor system via an address oriented cache-bypass path coupling the main memory and the at least one heterogeneous functional unit. 10. The method of claim 9, wherein the fixed-size data block access to the main memory returns data in addition to data referenced by a cache memory access by the at least one processor, and wherein the individually-addressed data access returns only data referenced by a physical address access by the at least one heterogeneous processor. 11. The method of claim 9, wherein the main memory comprises scatter/gather memory configured for individually-addressed data access, and wherein the providing fixed-size data block access to the main memory comprises:
emulating block data access to the main memory for the block oriented cache-access path. 12. The method of claim 9, further comprising:
providing information regarding data encached in the cache memory to the heterogeneous functional unit in response to an interrogation by the heterogeneous functional unit regarding referenced data to be accessed by the heterogeneous functional unit. 13. The method of claim 12, further comprising:
writing a cache block containing the referenced data to the main memory for individually-addressed data access of the referenced data from the main memory by the heterogeneous functional unit. 14. The method of claim 12, further comprising:
invalidating the referenced data in the cache memory in association with individually-addressed data access of the referenced data from the main memory by the heterogeneous functional unit. 15. The method of claim 9, wherein the at least one processor and the at least one heterogeneous functional unit comprise different instruction sets. 16. The method of claim 9, further comprising:
off-loading an instruction from a processor of the at least one processor to a heterogeneous functional unit of the at least one heterogeneous functional unit so that the heterogeneous functional unit takes advantage of the address oriented cache-bypass path to access the main memory using the individually-addressed data access for processing the off-loaded instruction. 17. A system comprising:
at least one processor; at least one heterogeneous functional unit; a main memory configured for individually-addressed data access and for fixed-size data block access; a cache memory configured to provide storage of fixed-size data blocks of main memory data for data access by the at least one processor a block oriented cache-access path coupling the main memory and the cache memory, wherein the block oriented cache-access path is configured to provide fixed-size data block access to the main memory; and an address oriented cache-bypass path coupling the main memory and the at least one heterogeneous functional unit, wherein the address oriented cache-bypass path provides individually-addressed data access to the main memory. 18. The system of claim 17, further comprising:
a cache interrogation path coupling the cache memory and the heterogeneous functional unit, wherein the cache interrogation path is configured to provide information regarding encached data to the heterogeneous functional unit in response to an interrogation by the heterogeneous functional unit regarding referenced data to be accessed by the heterogeneous functional unit. 19. The system of claim 18, wherein the cache interrogation path is configured initiate writing a cache block containing the referenced data to the main memory for individually-addressed data access of the referenced data from the main memory by the heterogeneous functional unit using the address oriented cache-bypass path. 20. The system of claim 18, wherein the cache interrogation path is configured to invalidate the referenced data in the cache memory in association with individually-addressed data access of the referenced data from the main memory by the heterogeneous functional unit using the address oriented cache-bypass path. | 2,100 |
5,160 | 14,824,846 | 2,174 | A dual-screen user device and methods for revealing a combination of selected desktops and applications on single and dual screens are disclosed. Desktops and applications can be shifted between screens by user gestures, and/or moved off of the screens and therefore hidden. Hidden desktops and screens can be re-displayed by other gestures. The desktops and applications are arranged in a window stack that represents a logical order of the desktops and applications providing a user with an intuitive ability to manage multiple applications/desktops running simultaneously. One embodiment provides an annunciator window extending across both screens in a dual screen configuration. The annunciator window provides alerts, notifications, and statuses of the device in an increased area thereby enhancing viewability of the information in the window. The annunciator window can be expanded over a selected screen to view full contents of the window without having to minimize or close running applications. | 1-20. (canceled) 21. A method of displaying information on a multi-screen device including a plurality of desktops and/or applications each having at least one window, and an annunciator window, the method comprising:
receiving, by a processor, a first input that represents an instruction to reveal one of a desktop or application on a selected one of a first or second display of the multi-screen device and selecting a desktop or application to display on the selected one of the first or second display; displaying, by a processor, the selected desktop or application on the selected one of the first or second displays; displaying, by a processor, a pre-configured annunciator window having information therein showing at least one of a device status, a connectivity status, and a messaging status; configuring, by a processor, the annunciator window to extend across both said first and second displays; expanding, by a processor, a size of the annunciator window in response to a user input gesture wherein the annunciator is expanded as a drawer over a selected one of said first or second displays and maintaining the size of the annunciator window in response to the user input gesture wherein the annunciator is not expanded over a non-selected one of said first or second displays; and wherein the annunciator window displays information selectively across substantially all or part of said expanded annunciator window. 22. The method of claim 21, further including:
modifying, by a processor, the display of the annunciator window in response to a changed state of at least one of said device status, a connectivity status, and messaging status. 23. The method of claim 22, wherein said modifying step includes displaying the changed state including text corresponding to at least one of a phone message, email message, or text message. 24. The method of claim 22, wherein said modifying step includes displaying the changed state across a portion of said annunciator window and masking at least one icon representing said device status, a connectivity status, or messaging status. 25. The method of claim 21, wherein said modifying step includes displaying the changed state across substantially all of said annunciator window. 26. The method of claim 21, further including:
positioning, by a processor, the annunciator window across adjacent upper or lower edges of said first and second displays. 27. The method of claim 21, wherein the annunciator window is expanded across the selected one of said first or second displays in response to the user input gesture executed on the selected display. 28. The method of claim 21, wherein the selected desktop or application runs on the selected one of the first or second display, the user executes the user input gesture on the same display upon which the desktop or application is running resulting in the annunciator window expanding over the desktop or application without the user having to close or minimize the desktop or application. 29. The method of claim 28, wherein the user executes another user input gesture to minimize or close the annunciator window drawer causing the running desktop or application to be re-displayed on the same first or second display. 30. A non-transitory computer-readable medium having stored thereon instructions that cause a computing system to execute a method, the instructions comprising:
instructions configured to receive a first input that represents an instruction to determine and reveal a desktop or application on a selected one of a first or second display of the multi-screen device; instructions configured to respond to the first input with an output that cause the desktop or application to be displayed on the selected one of the first or second displays; instructions configured to receive a second input that represents an instruction to display a pre-configured annunciator window having information therein showing at least one of a device status, a connectivity status, and a messaging status; instructions configured to respond to the second input with an output that causes the annunciator window to be displayed in a configuration extending across both of said first and second displays; instructions configured to receive a third input that represents an instruction to expand the annunciator window over a selected one of said first or second displays and maintaining the annunciator window over a non-selected one of said first or second displays; instructions configured to respond to the third input with an output that causes an annunciator window drawer to be expanded over the selected one of said first or second displays. 31. The computer-readable medium of claim 30, further including:
instructions configured to receive a fourth input that represents instructions to display a changed state of said device including a display of text corresponding to at least one of a phone message, email message, or text message; and instructions configured to respond to the fourth input with an output that causes the annunciator window to be displayed in a changed configuration extending across both of said first and second displays. 32. The computer-readable medium of claim 30, wherein the third input is a user gesture executed on the same display upon which the desktop or application is running, resulting in the annunciator window expanding over the desktop or application without the user having to close or minimize the desktop or application. 33. The computer-readable medium of claim 30, further including:
instructions configured to receive a fourth input that represents an instruction to minimize or close the annunciator window on the selected one of said first or second displays; and instructions configured to respond to the fourth input with an output that causes the annunciator window drawer to be minimized or closed causing the running desktop or application to be re-displayed on the same first or second display. 34. The computer-readable medium of claim 31, wherein said instructions configured to respond to the fourth input cause a changed configuration to be displayed masking at least one icon representing said device status, a connectivity status, or messaging status. 35. The computer-readable medium of claim 31, wherein said instructions configured to respond to the second predetermined input causes said annunciator window to be displayed across adjacent upper or lower edges of said first and second displays. 36. A multi-screen user device, comprising:
a first display including a first display area; a second display including a second display area; a first user input gesture area of the first display; a second user input gesture area of the second display, wherein the first and second user input gesture areas are configured to accept input from a user; an annunciator display extending across a portion said first and second display areas of said first and second displays for displaying at least one of a device status, a connectivity status, and a messaging status; a computer-readable medium having instructions stored thereon that include:
a first set of instructions configured to determine a number and identity of desktops or applications selected to be run by a user and subsequently displayed on selected ones of said first or second displays;
a second set of instructions configured to determine information to be displayed in said annunciator display based on selected user gestures and respective states of said device status, a connectivity status, and a messaging status; and
a third set of instructions configured to expand an area of the annunciator display defining a drawer, as presented on the selected one of the first or second displays in response to a user gesture executed on a selected display, and maintaining the area of the annunciator display as presented on the non-selected one of said first or second displays. 37. The device of claim 36, wherein: the second set of instructions include information regarding a changed state of one of said statuses including text displayed corresponding to at least one of a phone message, email message, or text message. 38. The device of claim 36, wherein said second set of instructions results in displaying said annunciator window across adjacent upper or lower edges of said first and second displays. 39. The device of claim 36, wherein the third set of instructions results in the annunciator display expanding over a corresponding desktop or application without further instructions required to close or minimize displayed desktops or applications. 40. The device of claim 36, further including:
a fourth set of instructions configured to minimize or close the annunciator window drawer on the selected one of the first or second displays in response to another user gesture executed on the selected display causing the desktop or application to be re-displayed on the same first or second displays. | A dual-screen user device and methods for revealing a combination of selected desktops and applications on single and dual screens are disclosed. Desktops and applications can be shifted between screens by user gestures, and/or moved off of the screens and therefore hidden. Hidden desktops and screens can be re-displayed by other gestures. The desktops and applications are arranged in a window stack that represents a logical order of the desktops and applications providing a user with an intuitive ability to manage multiple applications/desktops running simultaneously. One embodiment provides an annunciator window extending across both screens in a dual screen configuration. The annunciator window provides alerts, notifications, and statuses of the device in an increased area thereby enhancing viewability of the information in the window. The annunciator window can be expanded over a selected screen to view full contents of the window without having to minimize or close running applications.1-20. (canceled) 21. A method of displaying information on a multi-screen device including a plurality of desktops and/or applications each having at least one window, and an annunciator window, the method comprising:
receiving, by a processor, a first input that represents an instruction to reveal one of a desktop or application on a selected one of a first or second display of the multi-screen device and selecting a desktop or application to display on the selected one of the first or second display; displaying, by a processor, the selected desktop or application on the selected one of the first or second displays; displaying, by a processor, a pre-configured annunciator window having information therein showing at least one of a device status, a connectivity status, and a messaging status; configuring, by a processor, the annunciator window to extend across both said first and second displays; expanding, by a processor, a size of the annunciator window in response to a user input gesture wherein the annunciator is expanded as a drawer over a selected one of said first or second displays and maintaining the size of the annunciator window in response to the user input gesture wherein the annunciator is not expanded over a non-selected one of said first or second displays; and wherein the annunciator window displays information selectively across substantially all or part of said expanded annunciator window. 22. The method of claim 21, further including:
modifying, by a processor, the display of the annunciator window in response to a changed state of at least one of said device status, a connectivity status, and messaging status. 23. The method of claim 22, wherein said modifying step includes displaying the changed state including text corresponding to at least one of a phone message, email message, or text message. 24. The method of claim 22, wherein said modifying step includes displaying the changed state across a portion of said annunciator window and masking at least one icon representing said device status, a connectivity status, or messaging status. 25. The method of claim 21, wherein said modifying step includes displaying the changed state across substantially all of said annunciator window. 26. The method of claim 21, further including:
positioning, by a processor, the annunciator window across adjacent upper or lower edges of said first and second displays. 27. The method of claim 21, wherein the annunciator window is expanded across the selected one of said first or second displays in response to the user input gesture executed on the selected display. 28. The method of claim 21, wherein the selected desktop or application runs on the selected one of the first or second display, the user executes the user input gesture on the same display upon which the desktop or application is running resulting in the annunciator window expanding over the desktop or application without the user having to close or minimize the desktop or application. 29. The method of claim 28, wherein the user executes another user input gesture to minimize or close the annunciator window drawer causing the running desktop or application to be re-displayed on the same first or second display. 30. A non-transitory computer-readable medium having stored thereon instructions that cause a computing system to execute a method, the instructions comprising:
instructions configured to receive a first input that represents an instruction to determine and reveal a desktop or application on a selected one of a first or second display of the multi-screen device; instructions configured to respond to the first input with an output that cause the desktop or application to be displayed on the selected one of the first or second displays; instructions configured to receive a second input that represents an instruction to display a pre-configured annunciator window having information therein showing at least one of a device status, a connectivity status, and a messaging status; instructions configured to respond to the second input with an output that causes the annunciator window to be displayed in a configuration extending across both of said first and second displays; instructions configured to receive a third input that represents an instruction to expand the annunciator window over a selected one of said first or second displays and maintaining the annunciator window over a non-selected one of said first or second displays; instructions configured to respond to the third input with an output that causes an annunciator window drawer to be expanded over the selected one of said first or second displays. 31. The computer-readable medium of claim 30, further including:
instructions configured to receive a fourth input that represents instructions to display a changed state of said device including a display of text corresponding to at least one of a phone message, email message, or text message; and instructions configured to respond to the fourth input with an output that causes the annunciator window to be displayed in a changed configuration extending across both of said first and second displays. 32. The computer-readable medium of claim 30, wherein the third input is a user gesture executed on the same display upon which the desktop or application is running, resulting in the annunciator window expanding over the desktop or application without the user having to close or minimize the desktop or application. 33. The computer-readable medium of claim 30, further including:
instructions configured to receive a fourth input that represents an instruction to minimize or close the annunciator window on the selected one of said first or second displays; and instructions configured to respond to the fourth input with an output that causes the annunciator window drawer to be minimized or closed causing the running desktop or application to be re-displayed on the same first or second display. 34. The computer-readable medium of claim 31, wherein said instructions configured to respond to the fourth input cause a changed configuration to be displayed masking at least one icon representing said device status, a connectivity status, or messaging status. 35. The computer-readable medium of claim 31, wherein said instructions configured to respond to the second predetermined input causes said annunciator window to be displayed across adjacent upper or lower edges of said first and second displays. 36. A multi-screen user device, comprising:
a first display including a first display area; a second display including a second display area; a first user input gesture area of the first display; a second user input gesture area of the second display, wherein the first and second user input gesture areas are configured to accept input from a user; an annunciator display extending across a portion said first and second display areas of said first and second displays for displaying at least one of a device status, a connectivity status, and a messaging status; a computer-readable medium having instructions stored thereon that include:
a first set of instructions configured to determine a number and identity of desktops or applications selected to be run by a user and subsequently displayed on selected ones of said first or second displays;
a second set of instructions configured to determine information to be displayed in said annunciator display based on selected user gestures and respective states of said device status, a connectivity status, and a messaging status; and
a third set of instructions configured to expand an area of the annunciator display defining a drawer, as presented on the selected one of the first or second displays in response to a user gesture executed on a selected display, and maintaining the area of the annunciator display as presented on the non-selected one of said first or second displays. 37. The device of claim 36, wherein: the second set of instructions include information regarding a changed state of one of said statuses including text displayed corresponding to at least one of a phone message, email message, or text message. 38. The device of claim 36, wherein said second set of instructions results in displaying said annunciator window across adjacent upper or lower edges of said first and second displays. 39. The device of claim 36, wherein the third set of instructions results in the annunciator display expanding over a corresponding desktop or application without further instructions required to close or minimize displayed desktops or applications. 40. The device of claim 36, further including:
a fourth set of instructions configured to minimize or close the annunciator window drawer on the selected one of the first or second displays in response to another user gesture executed on the selected display causing the desktop or application to be re-displayed on the same first or second displays. | 2,100 |
5,161 | 14,668,180 | 2,196 | Systems, methods, and software described herein manage volumes and virtual machines using a location database gathered from a hypervisor management system. In one example, a method of operating a volume attachment service to manage volumes and virtual machines includes transferring a location request to a hypervisor management service to identify locations of one or more virtual machines. The method further provides, receiving the locations of the one or more virtual machines and storing the locations in a location database. The method also includes identifying a volume action request for a first virtual machine, and directing the volume action request to a hypervisor of the first virtual machine based on the locations in the location database. | 1. A method of operating a volume attachment service to manage volumes and virtual machines, the method comprising:
transferring a location request to a hypervisor management service to identify locations of one or more virtual machines; receiving the locations of the one or more virtual machines and storing the locations in a location database; and in response to a volume action request for a first virtual machine, directing the volume action request to a hypervisor for the first virtual machine based on the locations in the location database. 2. The method of claim 1 wherein the locations of the one or more virtual machines each comprise a virtual machine identifier associated with a host identifier. 3. The method of claim 1 wherein the volume action request comprises a volume attach request to attach one or more volumes to the first virtual machine. 4. The method of claim 3 wherein the one or more volumes comprise one or more application volumes containing at least one application. 5. The method of claim 1 wherein the volume action request comprises a volume detach request to detach one or more volumes from the first virtual machine. 6. The method of claim 5 wherein the one or more volumes comprise one or more application volumes containing at least one application. 7. The method of claim 1 further comprising:
identifying a second volume action request for a second virtual machine; and
directing the second volume action request to a hypervisor of the second virtual machine based on the locations in the location database. 8. The method of claim 7 wherein the hypervisor of the first virtual machine comprises a different hypervisor than the hypervisor of the second virtual machine. 9. The method of claim 1 further comprising:
periodically transferring supplemental location requests to the hypervisor management service to identify the locations of the one or more virtual machines; and
receiving the locations of the one or more virtual machines and storing the locations in the location database. 10. An apparatus to manage volumes and virtual machines, the apparatus comprising:
one or more non-transitory computer readable media; and processing instructions stored on the one or more non-transitory computer readable media that, when executed by processing circuitry, direct the processing circuitry to:
transfer a location request to a hypervisor management service to identify locations of one or more virtual machines;
receive the locations of the one or more virtual machines and store the locations in a location database, wherein the locations of the one or more virtual machines each comprise a virtual machine identifier associated with a host identifier; and
in response to a volume action request for a first virtual machine, direct the volume action request to a hypervisor of the first virtual machine based on the locations in the location database. 11. The apparatus of claim 10 further comprising the processing circuitry. 12. The apparatus of claim 10 wherein the volume action request comprises a volume attach request to attach one or more volumes to the first virtual machine. 13. The apparatus of claim 12 wherein the one or more volumes comprise one or more application volumes containing at least one application. 14. The apparatus of claim 10 wherein the volume action request comprises a volume detach request to detach one or more volumes from the first virtual machine. 15. The apparatus of claim 14 wherein the one or more volumes comprise one or more application volumes containing at least one application. 16. The apparatus of claim 10 wherein the processing instructions further direct the processing circuitry to:
identify a second volume action request for a second virtual machine; and
direct the second volume action request to a hypervisor of the second virtual machine based on the locations in the location database. 17. The apparatus of claim 16 wherein the hypervisor of the first virtual machine comprises a different hypervisor than the hypervisor of the second virtual machine. 18. The apparatus of claim 10 wherein the processing instructions further direct the processing circuitry to:
periodically transfer supplemental location requests to the hypervisor management service to identify the locations of the one or more virtual machines; and
receive the locations of the one or more virtual machines and storing the locations in the location database. 19. A system to manage a plurality of storage volumes and a plurality of virtual machines, the system comprising:
the plurality of virtual machines executing via a plurality of hypervisors; and a volume action service configured to:
transfer a location request to a hypervisor management service to identify locations of the plurality of virtual machines;
receive the locations of the plurality of virtual machines and store the locations in a location database; and
in response to a volume action request for a first virtual machine, direct the volume action request to a hypervisor of the plurality of hypervisors for the first virtual machine. 20. The system of claim 19 wherein the volume action request for the first virtual machine comprises one of:
a volume attach request to attach one or more volumes to the first virtual machine; or
a volume detach request to detach one or more volumes from the first virtual machine. | Systems, methods, and software described herein manage volumes and virtual machines using a location database gathered from a hypervisor management system. In one example, a method of operating a volume attachment service to manage volumes and virtual machines includes transferring a location request to a hypervisor management service to identify locations of one or more virtual machines. The method further provides, receiving the locations of the one or more virtual machines and storing the locations in a location database. The method also includes identifying a volume action request for a first virtual machine, and directing the volume action request to a hypervisor of the first virtual machine based on the locations in the location database.1. A method of operating a volume attachment service to manage volumes and virtual machines, the method comprising:
transferring a location request to a hypervisor management service to identify locations of one or more virtual machines; receiving the locations of the one or more virtual machines and storing the locations in a location database; and in response to a volume action request for a first virtual machine, directing the volume action request to a hypervisor for the first virtual machine based on the locations in the location database. 2. The method of claim 1 wherein the locations of the one or more virtual machines each comprise a virtual machine identifier associated with a host identifier. 3. The method of claim 1 wherein the volume action request comprises a volume attach request to attach one or more volumes to the first virtual machine. 4. The method of claim 3 wherein the one or more volumes comprise one or more application volumes containing at least one application. 5. The method of claim 1 wherein the volume action request comprises a volume detach request to detach one or more volumes from the first virtual machine. 6. The method of claim 5 wherein the one or more volumes comprise one or more application volumes containing at least one application. 7. The method of claim 1 further comprising:
identifying a second volume action request for a second virtual machine; and
directing the second volume action request to a hypervisor of the second virtual machine based on the locations in the location database. 8. The method of claim 7 wherein the hypervisor of the first virtual machine comprises a different hypervisor than the hypervisor of the second virtual machine. 9. The method of claim 1 further comprising:
periodically transferring supplemental location requests to the hypervisor management service to identify the locations of the one or more virtual machines; and
receiving the locations of the one or more virtual machines and storing the locations in the location database. 10. An apparatus to manage volumes and virtual machines, the apparatus comprising:
one or more non-transitory computer readable media; and processing instructions stored on the one or more non-transitory computer readable media that, when executed by processing circuitry, direct the processing circuitry to:
transfer a location request to a hypervisor management service to identify locations of one or more virtual machines;
receive the locations of the one or more virtual machines and store the locations in a location database, wherein the locations of the one or more virtual machines each comprise a virtual machine identifier associated with a host identifier; and
in response to a volume action request for a first virtual machine, direct the volume action request to a hypervisor of the first virtual machine based on the locations in the location database. 11. The apparatus of claim 10 further comprising the processing circuitry. 12. The apparatus of claim 10 wherein the volume action request comprises a volume attach request to attach one or more volumes to the first virtual machine. 13. The apparatus of claim 12 wherein the one or more volumes comprise one or more application volumes containing at least one application. 14. The apparatus of claim 10 wherein the volume action request comprises a volume detach request to detach one or more volumes from the first virtual machine. 15. The apparatus of claim 14 wherein the one or more volumes comprise one or more application volumes containing at least one application. 16. The apparatus of claim 10 wherein the processing instructions further direct the processing circuitry to:
identify a second volume action request for a second virtual machine; and
direct the second volume action request to a hypervisor of the second virtual machine based on the locations in the location database. 17. The apparatus of claim 16 wherein the hypervisor of the first virtual machine comprises a different hypervisor than the hypervisor of the second virtual machine. 18. The apparatus of claim 10 wherein the processing instructions further direct the processing circuitry to:
periodically transfer supplemental location requests to the hypervisor management service to identify the locations of the one or more virtual machines; and
receive the locations of the one or more virtual machines and storing the locations in the location database. 19. A system to manage a plurality of storage volumes and a plurality of virtual machines, the system comprising:
the plurality of virtual machines executing via a plurality of hypervisors; and a volume action service configured to:
transfer a location request to a hypervisor management service to identify locations of the plurality of virtual machines;
receive the locations of the plurality of virtual machines and store the locations in a location database; and
in response to a volume action request for a first virtual machine, direct the volume action request to a hypervisor of the plurality of hypervisors for the first virtual machine. 20. The system of claim 19 wherein the volume action request for the first virtual machine comprises one of:
a volume attach request to attach one or more volumes to the first virtual machine; or
a volume detach request to detach one or more volumes from the first virtual machine. | 2,100 |
5,162 | 13,782,071 | 2,116 | Systems and methods for managing device controls are disclosed. One method can comprise determining an orientation of a controller and comparing the orientation of the controller and an activation orientation. If the orientation of the controller substantially matches the activation orientation, a control relationship between the controller and the user device may be automatically activated, and if the orientation of the controller does not substantially match the activation orientation, control options to a user of the controller. | 1. A method for controlling a plurality of user devices comprising:
determining a first orientation of a controller; identifying a first user device, of the plurality of user devices, associated with the first orientation of the controller; activating a control relationship between the controller and the first user device; determining a second orientation of the controller; identifying a second user device, of the plurality of user devices, associated with the second orientation of the controller; and activating a control relationship between the controller and the second user device. 2. The method of claim 1, wherein determining a first orientation of a controller comprises receiving information relating to the first orientation from an orientation element. 3. The method of claim 2, wherein the orientation element is integrated with the controller. 4. The method of claim 1, wherein identifying a first user device comprises substantially matching the determined first orientation to a stored heading associated with the first device. 5. The method of claim 1, wherein activating a control relationship between the controller and the first user device comprises facilitating the control of the first user device by the controller. 6. The method of claim 1, wherein identifying a second user device comprises substantially matching the determined second orientation to a stored orientation associated with the second device. 7. The method of claim 1, wherein activating a control relationship between the controller and the second user device comprises facilitating the control of the second user device by the controller. 8. A method for controlling a user device having an established relationship with a controller, the method comprising:
determining an orientation of a controller; comparing the orientation of the controller and an activation orientation; if the orientation of the controller substantially matches the activation orientation, automatically activating a control relationship between the controller and the user device; and if the orientation of the controller does not substantially match the activation orientation, presenting control options to a user of the controller. 9. The method of claim 8, wherein determining an orientation of a controller comprises receiving information from an orientation element integrated with the controller. 10. The method of claim 8, wherein automatically activating the control relationship between the controller and the user device comprises facilitating the control of the user device by the controller. 11. The method of claim 8, wherein presenting control options to a user of the controller comprises presenting options relating to one or more alternative user devices, wherein the one or more alternative user devices have a control relationship with the controller. 12. The method of claim 8, wherein presenting control options to a user of the controller comprises presenting an option to establish a control relationship with another user device. 13. The method of claim 12, wherein establishing a control relationship between a controller and another user device comprises receiving command codes at the controller to facilitate control of the another user device by the controller. 14. A method for controlling a user device comprising:
determining a state of a user device; determining a state of a controller; comparing the state of the controller and the state of the user device; and automatically activating a control relationship between the controller and the user device based upon the comparison of the state of the controller and the state of the user device. 15. The method of claim 14, wherein the state of the user device comprises one of an activation position and an activation orientation. 16. The method of claim 14, wherein determining a state of the user device comprises identifying content presented by the user device. 17. The method of claim 14, wherein the state of the controller is one of a position and orientation of the controller. 18. The method of claim 14, wherein determining a state of the controller comprises receiving content and identifying the content received by the controller. 19. The method of claim 14, wherein comparing the state of the controller and the state of the user device comprises comparing content presented by the user device and content received by the controller. 20. The method of claim 14, wherein automatically activating the control relationship between the controller and the user device is executed when the state of the controller substantially matches the state of the user device. | Systems and methods for managing device controls are disclosed. One method can comprise determining an orientation of a controller and comparing the orientation of the controller and an activation orientation. If the orientation of the controller substantially matches the activation orientation, a control relationship between the controller and the user device may be automatically activated, and if the orientation of the controller does not substantially match the activation orientation, control options to a user of the controller.1. A method for controlling a plurality of user devices comprising:
determining a first orientation of a controller; identifying a first user device, of the plurality of user devices, associated with the first orientation of the controller; activating a control relationship between the controller and the first user device; determining a second orientation of the controller; identifying a second user device, of the plurality of user devices, associated with the second orientation of the controller; and activating a control relationship between the controller and the second user device. 2. The method of claim 1, wherein determining a first orientation of a controller comprises receiving information relating to the first orientation from an orientation element. 3. The method of claim 2, wherein the orientation element is integrated with the controller. 4. The method of claim 1, wherein identifying a first user device comprises substantially matching the determined first orientation to a stored heading associated with the first device. 5. The method of claim 1, wherein activating a control relationship between the controller and the first user device comprises facilitating the control of the first user device by the controller. 6. The method of claim 1, wherein identifying a second user device comprises substantially matching the determined second orientation to a stored orientation associated with the second device. 7. The method of claim 1, wherein activating a control relationship between the controller and the second user device comprises facilitating the control of the second user device by the controller. 8. A method for controlling a user device having an established relationship with a controller, the method comprising:
determining an orientation of a controller; comparing the orientation of the controller and an activation orientation; if the orientation of the controller substantially matches the activation orientation, automatically activating a control relationship between the controller and the user device; and if the orientation of the controller does not substantially match the activation orientation, presenting control options to a user of the controller. 9. The method of claim 8, wherein determining an orientation of a controller comprises receiving information from an orientation element integrated with the controller. 10. The method of claim 8, wherein automatically activating the control relationship between the controller and the user device comprises facilitating the control of the user device by the controller. 11. The method of claim 8, wherein presenting control options to a user of the controller comprises presenting options relating to one or more alternative user devices, wherein the one or more alternative user devices have a control relationship with the controller. 12. The method of claim 8, wherein presenting control options to a user of the controller comprises presenting an option to establish a control relationship with another user device. 13. The method of claim 12, wherein establishing a control relationship between a controller and another user device comprises receiving command codes at the controller to facilitate control of the another user device by the controller. 14. A method for controlling a user device comprising:
determining a state of a user device; determining a state of a controller; comparing the state of the controller and the state of the user device; and automatically activating a control relationship between the controller and the user device based upon the comparison of the state of the controller and the state of the user device. 15. The method of claim 14, wherein the state of the user device comprises one of an activation position and an activation orientation. 16. The method of claim 14, wherein determining a state of the user device comprises identifying content presented by the user device. 17. The method of claim 14, wherein the state of the controller is one of a position and orientation of the controller. 18. The method of claim 14, wherein determining a state of the controller comprises receiving content and identifying the content received by the controller. 19. The method of claim 14, wherein comparing the state of the controller and the state of the user device comprises comparing content presented by the user device and content received by the controller. 20. The method of claim 14, wherein automatically activating the control relationship between the controller and the user device is executed when the state of the controller substantially matches the state of the user device. | 2,100 |
5,163 | 14,969,414 | 2,139 | An apparatus and method are provided for issuing access requests to a memory controller for a memory device whose memory structure consists of a plurality of sub-structures. The apparatus has a request interface for issuing access requests to the memory controller, each access request identifying a memory address. Within the apparatus static abstraction data is stored providing an indication of one or more of the sub-structures of the memory device, and the apparatus also stores an indication of outstanding access requests issued from the request interface. Next access request selection circuitry is then arranged to select from a plurality of candidate access requests a next access request to issue from the request interface. That selection is dependent on sub-structure indication data that is derived from application of an abstraction data function, using the static abstraction data, to the memory addresses of the candidate access requests and the outstanding access requests. Such an approach enables the apparatus to provide a series of access requests to the memory controller with the aim of enabling the memory controller to perform a more optimal access sequence with regard to the memory device. | 1. An apparatus, comprising:
a request interface to issue access requests to a memory controller for a memory device whose memory structure consists of a plurality of sub-structures, each access request identifying a memory address; an abstraction data storage to store static abstraction data providing an indication of one or more of the sub-structures; an outstanding access requests storage to store an indication of outstanding access requests issued from the request interface; and next access request selection circuitry to select from a plurality of candidate access requests a next access request for issuance from the request interface, said selection being dependent on sub-structure indication data derived from application of an abstraction data function, using said static abstraction data, to the memory addresses of the candidate access requests and the outstanding access requests. 2. An apparatus as claimed in claim 1, further comprising:
comparison data generation circuitry to produce comparison data for a memory address by applying said abstraction data function to said memory address; and sub-structure indication data generation circuitry to generate said sub-structure indication data for each candidate access request by comparing the comparison data produced for the memory address of that candidate access request with the comparison data produced for the memory address of at least a subset of said outstanding access requests. 3. An apparatus as claimed in claim 2, wherein said at least a subset of said outstanding access requests comprises all outstanding access requests indicated in said outstanding access requests storage. 4. An apparatus as claimed in claim 1, wherein said plurality of sub-structures comprise a plurality of parallel sub-structures that are accessible in parallel, each parallel sub-structure comprising a plurality of locality sub-structures, for each parallel sub-structure only one locality sub-structure being accessible at a time. 5. An apparatus as claimed in claim 4, wherein the static abstraction data provides an encoding of said parallel sub-structures and said locality sub-structures. 6. An apparatus as claimed in claim 5, wherein:
the static abstraction data comprises a parallelism mask and a locality mask; and for a chosen memory address, the application of said abstraction data function comprises applying the parallelism mask to said chosen memory address to produce first comparison data indicative of a parallel sub-structure associated with the chosen memory address, and applying the locality mask to said chosen memory address to produce second comparison data indicative of a locality sub-structure associated with the chosen memory address. 7. An apparatus as claimed in claim 1, wherein said sub-structure indication data provides locality indication data for each candidate access request with respect to the outstanding access requests. 8. An apparatus as claimed in claim 7 wherein:
the static abstraction data comprises a parallelism mask and a locality mask; and
for a chosen memory address, the application of said abstraction data function comprises applying the parallelism mask to said chosen memory address to produce first comparison data indicative of a parallel sub-structure associated with the chosen memory address, and applying the locality mask to said chosen memory address to produce second comparison data indicative of a locality sub-structure associated with the chosen memory address;
wherein said locality indication data provides a locality hit indication for a candidate access request if the first and second comparison data produced for the memory address of the candidate access request matches the first and second comparison data produced for the memory address of an outstanding access request. 9. An apparatus as claimed in claim 7, wherein:
the static abstraction data comprises a parallelism mask and a locality mask; and for a chosen memory address, the application of said abstraction data function comprises applying the parallelism mask to said chosen memory address to produce first comparison data indicative of a parallel sub-structure associated with the chosen memory address, and applying the locality mask to said chosen memory address to produce second comparison data indicative of a locality sub-structure associated with the chosen memory address; wherein said locality indication data provides a locality conflict indication for a candidate access request if the first comparison data produced for the memory address of the candidate access request matches the first comparison data produced for the memory address of an outstanding access request, but the second comparison data produced for the memory address of the candidate access request does not match the second comparison data produced for the memory address of that outstanding access request. 10. Apparatus as claimed in claim 9, wherein said locality indication data provides a locality hit indication for a candidate access request if the first and second comparison data produced for the memory address of the candidate access request matches the first and second comparison data produced for the memory address of an outstanding access request, and wherein the next access request selection circuitry is arranged to select the next access request for issuance from the request interface with reference to the locality hit indications and locality conflict indications produced for each of the plurality of candidate access requests. 11. Apparatus as claimed in claim 10, wherein the next access request selection circuitry is arranged to select access requests for issuance from the request interface so as to give preference to access requests having locality hit indications. 12. Apparatus as claimed in claim 10, wherein the next access request selection circuitry is arranged to select access requests for issuance from the request interface so as to give preference to access requests that do not have locality conflict indications. 13. Apparatus as claimed in claim 1, wherein the static abstraction data is generated at initialisation time of the memory controller. 14. Apparatus as claimed in claim 13, wherein the static abstraction data is not altered during run-time of the memory controller. 15. Apparatus as claimed in claim 1, wherein the outstanding access requests storage is responsive to acknowledgement data from the memory controller to remove from the indication of outstanding access requests any access request that is no longer outstanding. 16. Apparatus as claimed in claim 15, wherein for at least one type of access request the outstanding access requests storage is arranged to apply predetermined criteria to determine when an outstanding access request is no longer to be considered outstanding, and to remove from the indication of outstanding access requests any access request that is no longer considered outstanding. 17. Apparatus as claimed in claim 1, wherein the request interface is coupled to the memory controller via an interconnect structure employing an interconnect protocol. 18. Apparatus as claimed in claim 1, wherein the apparatus is a cache provided within a data processing system. 19. Apparatus as claimed in claim 1, wherein the apparatus comprises on-chip memory interface circuitry of an integrated circuit, and the memory controller is off-chip. 20. A method of issuing access requests to a memory controller for a memory device whose memory structure consists of a plurality of sub-structures, each access request identifying a memory address, the method comprising:
storing static abstraction data providing an indication of one or more of the sub-structures; storing an indication of outstanding access requests issued from a request interface; and selecting from a plurality of candidate access requests a next access request for issuance from the request interface, said selection being dependent on sub-structure indication data derived from application of an abstraction data function, using said static abstraction data, to the memory addresses of the candidate access requests and the outstanding access requests. | An apparatus and method are provided for issuing access requests to a memory controller for a memory device whose memory structure consists of a plurality of sub-structures. The apparatus has a request interface for issuing access requests to the memory controller, each access request identifying a memory address. Within the apparatus static abstraction data is stored providing an indication of one or more of the sub-structures of the memory device, and the apparatus also stores an indication of outstanding access requests issued from the request interface. Next access request selection circuitry is then arranged to select from a plurality of candidate access requests a next access request to issue from the request interface. That selection is dependent on sub-structure indication data that is derived from application of an abstraction data function, using the static abstraction data, to the memory addresses of the candidate access requests and the outstanding access requests. Such an approach enables the apparatus to provide a series of access requests to the memory controller with the aim of enabling the memory controller to perform a more optimal access sequence with regard to the memory device.1. An apparatus, comprising:
a request interface to issue access requests to a memory controller for a memory device whose memory structure consists of a plurality of sub-structures, each access request identifying a memory address; an abstraction data storage to store static abstraction data providing an indication of one or more of the sub-structures; an outstanding access requests storage to store an indication of outstanding access requests issued from the request interface; and next access request selection circuitry to select from a plurality of candidate access requests a next access request for issuance from the request interface, said selection being dependent on sub-structure indication data derived from application of an abstraction data function, using said static abstraction data, to the memory addresses of the candidate access requests and the outstanding access requests. 2. An apparatus as claimed in claim 1, further comprising:
comparison data generation circuitry to produce comparison data for a memory address by applying said abstraction data function to said memory address; and sub-structure indication data generation circuitry to generate said sub-structure indication data for each candidate access request by comparing the comparison data produced for the memory address of that candidate access request with the comparison data produced for the memory address of at least a subset of said outstanding access requests. 3. An apparatus as claimed in claim 2, wherein said at least a subset of said outstanding access requests comprises all outstanding access requests indicated in said outstanding access requests storage. 4. An apparatus as claimed in claim 1, wherein said plurality of sub-structures comprise a plurality of parallel sub-structures that are accessible in parallel, each parallel sub-structure comprising a plurality of locality sub-structures, for each parallel sub-structure only one locality sub-structure being accessible at a time. 5. An apparatus as claimed in claim 4, wherein the static abstraction data provides an encoding of said parallel sub-structures and said locality sub-structures. 6. An apparatus as claimed in claim 5, wherein:
the static abstraction data comprises a parallelism mask and a locality mask; and for a chosen memory address, the application of said abstraction data function comprises applying the parallelism mask to said chosen memory address to produce first comparison data indicative of a parallel sub-structure associated with the chosen memory address, and applying the locality mask to said chosen memory address to produce second comparison data indicative of a locality sub-structure associated with the chosen memory address. 7. An apparatus as claimed in claim 1, wherein said sub-structure indication data provides locality indication data for each candidate access request with respect to the outstanding access requests. 8. An apparatus as claimed in claim 7 wherein:
the static abstraction data comprises a parallelism mask and a locality mask; and
for a chosen memory address, the application of said abstraction data function comprises applying the parallelism mask to said chosen memory address to produce first comparison data indicative of a parallel sub-structure associated with the chosen memory address, and applying the locality mask to said chosen memory address to produce second comparison data indicative of a locality sub-structure associated with the chosen memory address;
wherein said locality indication data provides a locality hit indication for a candidate access request if the first and second comparison data produced for the memory address of the candidate access request matches the first and second comparison data produced for the memory address of an outstanding access request. 9. An apparatus as claimed in claim 7, wherein:
the static abstraction data comprises a parallelism mask and a locality mask; and for a chosen memory address, the application of said abstraction data function comprises applying the parallelism mask to said chosen memory address to produce first comparison data indicative of a parallel sub-structure associated with the chosen memory address, and applying the locality mask to said chosen memory address to produce second comparison data indicative of a locality sub-structure associated with the chosen memory address; wherein said locality indication data provides a locality conflict indication for a candidate access request if the first comparison data produced for the memory address of the candidate access request matches the first comparison data produced for the memory address of an outstanding access request, but the second comparison data produced for the memory address of the candidate access request does not match the second comparison data produced for the memory address of that outstanding access request. 10. Apparatus as claimed in claim 9, wherein said locality indication data provides a locality hit indication for a candidate access request if the first and second comparison data produced for the memory address of the candidate access request matches the first and second comparison data produced for the memory address of an outstanding access request, and wherein the next access request selection circuitry is arranged to select the next access request for issuance from the request interface with reference to the locality hit indications and locality conflict indications produced for each of the plurality of candidate access requests. 11. Apparatus as claimed in claim 10, wherein the next access request selection circuitry is arranged to select access requests for issuance from the request interface so as to give preference to access requests having locality hit indications. 12. Apparatus as claimed in claim 10, wherein the next access request selection circuitry is arranged to select access requests for issuance from the request interface so as to give preference to access requests that do not have locality conflict indications. 13. Apparatus as claimed in claim 1, wherein the static abstraction data is generated at initialisation time of the memory controller. 14. Apparatus as claimed in claim 13, wherein the static abstraction data is not altered during run-time of the memory controller. 15. Apparatus as claimed in claim 1, wherein the outstanding access requests storage is responsive to acknowledgement data from the memory controller to remove from the indication of outstanding access requests any access request that is no longer outstanding. 16. Apparatus as claimed in claim 15, wherein for at least one type of access request the outstanding access requests storage is arranged to apply predetermined criteria to determine when an outstanding access request is no longer to be considered outstanding, and to remove from the indication of outstanding access requests any access request that is no longer considered outstanding. 17. Apparatus as claimed in claim 1, wherein the request interface is coupled to the memory controller via an interconnect structure employing an interconnect protocol. 18. Apparatus as claimed in claim 1, wherein the apparatus is a cache provided within a data processing system. 19. Apparatus as claimed in claim 1, wherein the apparatus comprises on-chip memory interface circuitry of an integrated circuit, and the memory controller is off-chip. 20. A method of issuing access requests to a memory controller for a memory device whose memory structure consists of a plurality of sub-structures, each access request identifying a memory address, the method comprising:
storing static abstraction data providing an indication of one or more of the sub-structures; storing an indication of outstanding access requests issued from a request interface; and selecting from a plurality of candidate access requests a next access request for issuance from the request interface, said selection being dependent on sub-structure indication data derived from application of an abstraction data function, using said static abstraction data, to the memory addresses of the candidate access requests and the outstanding access requests. | 2,100 |
5,164 | 13,827,917 | 2,199 | Object-oriented application languages often provide resources to applications for accessing objects stored in the volatile application memory region, and, separately, for packaging objects for persistent storage and network transport by serialization and deserialization involving a storage format. However, this design creates discrepancies between the application language and storage format, and depends on affirmative serialization and deserialization by the application. Presented herein are techniques for providing object access to objects involving persisting the objects as documents in a document store, where such persistence occurs automatically upon object creation and updating, and where such objects are stored in a language format integral to the application language (e.g., when a JavaScript application creates an object, the objects are automatically stored as documents of the document store in a JavaScript Object Notation (JSON) format). This design enables various advantages in efficiency, flexibility, and seamless interaction between the application and the objects. | 1. A method of accessing objects on behalf of an application in an application language specifying a language format on a device having a processor and a document store, the method comprising:
executing on the processor instructions configured to:
upon receiving a document including at least one object represented in the language format, store the document in the document store;
upon receiving a request from the application to create an object, store the object as a document in the document store in the language format;
upon receiving a request from the application to read an object, provide the document representing the object in the language format from the document store; and
upon receiving a request from the application to apply an operation in the application language to an object, apply the operation to the document comprising the object in the document store on behalf of the application. 2. The method of claim 1:
the application language comprising JavaScript; the language format comprising a JavaScript Object Notation (JSON) format; and the document store comprising a JSON document store. 3. The method of claim 1:
the device comprising a webserver; respective requests directed to a service uniform resource identifier; and respective objects in the document store identified by an object uniform resource identifier. 4. The method of claim 1:
the application associated with a volatile memory of the device; and the request to create the object in the absence of a request to persist the object outside of the volatile memory associated with the application. 5. The method of claim 1:
the application language specifying an application sandbox model; and applying the operation further comprising: executing the operation within an application sandbox for the application according to the application sandbox model. 6. The method of claim 5, the application sandbox model prohibiting the operation from causing a state change within the application sandbox persisting after completion of the operation. 7. The method of claim 1:
applying a first operation to the document comprising the object in the document store comprising: storing the first operation in a batch comprising at least one other operation to be applied to an object in the document store; and upon receiving a batch commit request, applying the batch comprising the first operation and the at least one other operation on the objects in the document store. 8. The method of claim 1:
the objects represented in the documents of the document store also stored as a local representation on the device; respective operations specifying an update of an object stored in the document store; and applying the operation to the object comprising:
at a first time, applying the update to the local representation of the object; and
at a second time after the first time, synchronizing the local representation of the object with the document comprising the object in the document store. 9. The method of claim 1:
the instructions further configured to, upon receiving from the application a request to associate the operation with an event, store the operation associated with the event; and applying the operation comprising: upon detecting the event associated with the operation, applying the operation to the document comprising the object in the document store on behalf of the application. 10. The method of claim 9:
the request to associate a first operation with an event comprising a second operation to be applied to at least one object of the document store; and applying the operation comprising: upon detecting the second operation, applying the first operation to the document comprising the object in the document store on behalf of the application. 11. The method of claim 9:
the request specifying an execution order with respect to the operation and the event, the execution order selected from an execution order set comprising:
a preceding execution order specifying applying the operation before the event;
a following sequential execution order specifying applying the operation after the event; and
a concurrent execution order specifying concurrently applying the operation during the event; and
applying the operation comprising: applying the operation to at least one object in the document store according to the execution order. 12. The method of claim 1:
the operation comprising a query identifying at least one query criterion; and applying the operation further comprising:
retrieving at least one selected document from the document store respectively comprising an object satisfying the at least one query criterion;
applying the operation to the at least one selected document to generate at least one query result; and
providing the query result to the application in the language format. 13. The method of claim 1:
at least a portion of the document store distributed over a remote data store; creating the object in the document store comprising: sending the request to create the object to the remote data store; reading the object comprising:
sending the request to read the document comprising the object to the remote data store, and
upon receiving the document from the remote data store, providing the object to the application; and
applying the operation to the object comprising: sending the request to apply the operation to the object to the remote data store. 14. The method of claim 13:
the document store partitioned over at least two remote data stores; and sending respective requests involving a selected object comprising:
among the at least two remote data stores, selecting a selected remote data store storing the selected object; and
sending the request to the selected remote data store. 15. The method of claim 13:
the operation comprising a query identifying at least one query criterion involving an object set comprising at least one queried object; and sending the request to apply the operation comprising:
selecting a selected remote data store storing at least a portion of the object set; and
sending the query to the selected remote data store. 16. The method of claim 15:
at least two remote data stores storing a replica of the selected object; and selecting the selected remote data store comprising: selecting one of the at least two remote data stores storing a replica of the selected object. 17. The method of claim 16:
the operation specifying at least one selection criterion for selecting one of the at least two remote data stores storing a replica of the selected object; and selecting the selected remote data store comprising: selecting one of the at least two remote data stores storing a replica of the selected object according to the at least one selection criterion specified by the operation. 18. The method of claim 1:
the application executing on a remote device; respective requests received from the remote device on behalf of the application; and reading the object comprising: providing the document comprising the object to the remote device. 19. A system for accessing objects on behalf of an application in an application language specifying a language format on a device having a processor, a memory, and a document store, the system comprising:
a document creating component comprising instructions stored in the memory that, when executed on the processor, cause the device to:
upon receiving a document including at least one object represented in the language format, store the document in the document store; and
upon receiving a request from the application to create an object, store the object as a document in the document store in the language format;
an object reading component comprising instructions stored in the memory that, when executed on the processor, cause the device to, upon receiving a request from the application to read an object, provide the document representing the object in the language format from the document store; and an operation applying component comprising instructions stored in the memory that, when executed on the processor, cause the device to, upon receiving a request from the application to apply an operation in the application language to an object, apply the operation to the document comprising the object in the document store on behalf of the application. 20. A computer-readable storage device storing instructions that, when executed on a processor of a device having a document store, access objects on behalf of an application in an application language specifying a language format by:
upon receiving a document including at least one object represented in the language format, storing the document in the document store; upon receiving a request from the application to create an object, storing the object as a document in the document store in the language format; upon receiving a request from the application to read an object, providing the document representing the object in the language format from the document store; and upon receiving a request from the application to apply an operation in the application language to an object in the document store, applying the operation to the document comprising the object in the document store on behalf of the application. | Object-oriented application languages often provide resources to applications for accessing objects stored in the volatile application memory region, and, separately, for packaging objects for persistent storage and network transport by serialization and deserialization involving a storage format. However, this design creates discrepancies between the application language and storage format, and depends on affirmative serialization and deserialization by the application. Presented herein are techniques for providing object access to objects involving persisting the objects as documents in a document store, where such persistence occurs automatically upon object creation and updating, and where such objects are stored in a language format integral to the application language (e.g., when a JavaScript application creates an object, the objects are automatically stored as documents of the document store in a JavaScript Object Notation (JSON) format). This design enables various advantages in efficiency, flexibility, and seamless interaction between the application and the objects.1. A method of accessing objects on behalf of an application in an application language specifying a language format on a device having a processor and a document store, the method comprising:
executing on the processor instructions configured to:
upon receiving a document including at least one object represented in the language format, store the document in the document store;
upon receiving a request from the application to create an object, store the object as a document in the document store in the language format;
upon receiving a request from the application to read an object, provide the document representing the object in the language format from the document store; and
upon receiving a request from the application to apply an operation in the application language to an object, apply the operation to the document comprising the object in the document store on behalf of the application. 2. The method of claim 1:
the application language comprising JavaScript; the language format comprising a JavaScript Object Notation (JSON) format; and the document store comprising a JSON document store. 3. The method of claim 1:
the device comprising a webserver; respective requests directed to a service uniform resource identifier; and respective objects in the document store identified by an object uniform resource identifier. 4. The method of claim 1:
the application associated with a volatile memory of the device; and the request to create the object in the absence of a request to persist the object outside of the volatile memory associated with the application. 5. The method of claim 1:
the application language specifying an application sandbox model; and applying the operation further comprising: executing the operation within an application sandbox for the application according to the application sandbox model. 6. The method of claim 5, the application sandbox model prohibiting the operation from causing a state change within the application sandbox persisting after completion of the operation. 7. The method of claim 1:
applying a first operation to the document comprising the object in the document store comprising: storing the first operation in a batch comprising at least one other operation to be applied to an object in the document store; and upon receiving a batch commit request, applying the batch comprising the first operation and the at least one other operation on the objects in the document store. 8. The method of claim 1:
the objects represented in the documents of the document store also stored as a local representation on the device; respective operations specifying an update of an object stored in the document store; and applying the operation to the object comprising:
at a first time, applying the update to the local representation of the object; and
at a second time after the first time, synchronizing the local representation of the object with the document comprising the object in the document store. 9. The method of claim 1:
the instructions further configured to, upon receiving from the application a request to associate the operation with an event, store the operation associated with the event; and applying the operation comprising: upon detecting the event associated with the operation, applying the operation to the document comprising the object in the document store on behalf of the application. 10. The method of claim 9:
the request to associate a first operation with an event comprising a second operation to be applied to at least one object of the document store; and applying the operation comprising: upon detecting the second operation, applying the first operation to the document comprising the object in the document store on behalf of the application. 11. The method of claim 9:
the request specifying an execution order with respect to the operation and the event, the execution order selected from an execution order set comprising:
a preceding execution order specifying applying the operation before the event;
a following sequential execution order specifying applying the operation after the event; and
a concurrent execution order specifying concurrently applying the operation during the event; and
applying the operation comprising: applying the operation to at least one object in the document store according to the execution order. 12. The method of claim 1:
the operation comprising a query identifying at least one query criterion; and applying the operation further comprising:
retrieving at least one selected document from the document store respectively comprising an object satisfying the at least one query criterion;
applying the operation to the at least one selected document to generate at least one query result; and
providing the query result to the application in the language format. 13. The method of claim 1:
at least a portion of the document store distributed over a remote data store; creating the object in the document store comprising: sending the request to create the object to the remote data store; reading the object comprising:
sending the request to read the document comprising the object to the remote data store, and
upon receiving the document from the remote data store, providing the object to the application; and
applying the operation to the object comprising: sending the request to apply the operation to the object to the remote data store. 14. The method of claim 13:
the document store partitioned over at least two remote data stores; and sending respective requests involving a selected object comprising:
among the at least two remote data stores, selecting a selected remote data store storing the selected object; and
sending the request to the selected remote data store. 15. The method of claim 13:
the operation comprising a query identifying at least one query criterion involving an object set comprising at least one queried object; and sending the request to apply the operation comprising:
selecting a selected remote data store storing at least a portion of the object set; and
sending the query to the selected remote data store. 16. The method of claim 15:
at least two remote data stores storing a replica of the selected object; and selecting the selected remote data store comprising: selecting one of the at least two remote data stores storing a replica of the selected object. 17. The method of claim 16:
the operation specifying at least one selection criterion for selecting one of the at least two remote data stores storing a replica of the selected object; and selecting the selected remote data store comprising: selecting one of the at least two remote data stores storing a replica of the selected object according to the at least one selection criterion specified by the operation. 18. The method of claim 1:
the application executing on a remote device; respective requests received from the remote device on behalf of the application; and reading the object comprising: providing the document comprising the object to the remote device. 19. A system for accessing objects on behalf of an application in an application language specifying a language format on a device having a processor, a memory, and a document store, the system comprising:
a document creating component comprising instructions stored in the memory that, when executed on the processor, cause the device to:
upon receiving a document including at least one object represented in the language format, store the document in the document store; and
upon receiving a request from the application to create an object, store the object as a document in the document store in the language format;
an object reading component comprising instructions stored in the memory that, when executed on the processor, cause the device to, upon receiving a request from the application to read an object, provide the document representing the object in the language format from the document store; and an operation applying component comprising instructions stored in the memory that, when executed on the processor, cause the device to, upon receiving a request from the application to apply an operation in the application language to an object, apply the operation to the document comprising the object in the document store on behalf of the application. 20. A computer-readable storage device storing instructions that, when executed on a processor of a device having a document store, access objects on behalf of an application in an application language specifying a language format by:
upon receiving a document including at least one object represented in the language format, storing the document in the document store; upon receiving a request from the application to create an object, storing the object as a document in the document store in the language format; upon receiving a request from the application to read an object, providing the document representing the object in the language format from the document store; and upon receiving a request from the application to apply an operation in the application language to an object in the document store, applying the operation to the document comprising the object in the document store on behalf of the application. | 2,100 |
5,165 | 15,058,262 | 2,138 | A memory device includes a target memory, having a memory address space, and a volatile buffer memory, which is coupled to receive data written over a bus to the memory device for storage in specified addresses within the memory address space. A memory controller is configured to receive, via the bus, a flush instruction and, in response to the flush instruction, to immediately flush the data held in the buffer memory with specified addresses within the memory address space to the target memory. | 1. A memory device, comprising:
a target memory, having a memory address space; a volatile buffer memory, which is coupled to receive data written over a bus to the memory device for storage in specified addresses within the memory address space; and a memory controller, which is configured to receive, via the bus, a flush instruction and, in response to the flush instruction, to immediately flush the data held in the buffer memory with specified addresses within the memory address space to the target memory. 2. The device according to claim 1, wherein the target memory comprises a persistent memory. 3. The device according to claim 1, wherein the flush instruction causes the memory controller to flush to the target memory all of the data conveyed over the bus to the target memory in write commands posted previously to the flush instruction. 4. The device according to claim 1, wherein the flush instruction identifies a range that is to be flushed within the memory address space, and causes the memory controller to immediately flush the data held in the buffer memory with specified addresses within the identified range to the target memory. 5. The device according to claim 4, wherein the memory controller is configured to flush, in response to the flush instruction, the data only within the identified range, while leaving further data with specified addresses outside the identified range in the buffer memory without immediate flushing to the target memory. 6. The device according to claim 1, wherein the memory controller is configured, after flushing the data to the target memory, to send a completion message over the bus to a sender of the flush instruction. 7. The device according to claim 1, wherein the bus over which the data and flush instruction are written is a peripheral component bus of a computer, having a bus address space in which a range to be flushed is identified in terms of memory pages, and wherein the memory controller is configured to translate the identified range of memory pages from the bus address space to memory blocks for flushing within the memory address space. 8. The device according to claim 1, wherein the memory controller is configured to identify multiple regions within the memory address space and to associate respective flush attributes with the regions, wherein the flush instruction causes the memory controller to flush the data held in the buffer memory with specified addresses within any given region in accordance with the respective flush attributes. 9. The device according to claim 8, wherein the respective flush attributes indicate whether the given region corresponds to a range in the target memory that comprises persistent memory. 10. Computing apparatus, comprising:
the memory device according to claims 1; and a network interface controller (NIC), which is coupled to receive from a peer node, via a network, a remote direct memory access (RDMA) write packet containing the data to be written to the memory device and specifying the addresses to which the data are to be written, and to receive an RDMA flush packet, and which is configured, in response to the RDMA write and flush packets, to convey the data and the flush instruction over the bus to the memory device. 11. The apparatus according to claim 10, wherein the data and the flush instruction are conveyed from the NIC to the memory device, and the data are flushed by the memory controller from the buffer memory to the target memory without generating an interrupt to a central processing unit (CPU) that is coupled to the bus in the apparatus. 12. The apparatus according to claim 10, wherein the NIC is configured to receive the RDMA write and flush packets from the peer node over a transport service instance established between the NIC and the peer node, wherein a memory region in the memory device is associated with the transport service instance, wherein the write packet causes the NIC to write the data to the associated memory region, and wherein the flush packet causes the NIC to issue the flush instruction with respect to the associated memory region. 13. The apparatus according to claim 12, wherein the NIC is configured to associate respective flush attributes with the memory region, and wherein the flush instruction causes the memory controller to flush the data written by the NIC to specified addresses within the memory region in accordance with the associated flush attributes. 14. The apparatus according to claim 10, and comprising a peer NIC deployed at the peer node, wherein the peer NIC is configured to transmit the RDMA write and flush packets over the network in response to RDMA write and flush work requests submitted to the peer NIC by a process running on the peer node. 15. A memory device, comprising:
a target memory, having a memory address space; a volatile buffer memory, which is coupled to receive data written over a bus in transaction packets to the memory device for storage in specified addresses within the memory address space, each transaction packet comprising a transaction descriptor, which comprises a flush flag; and a memory controller, which is configured to receive, via the bus, a flush instruction and, in response to the flush instruction, to immediately flush to the target memory the data held in the buffer memory for which the flush flag was set in the transaction packets that conveyed the data to the memory device. 16. The device according to claim 15, wherein the target memory comprises a persistent memory. 17. The device according to claim 15, wherein the memory controller is configured to flush, in response to the flush instruction, only the data for which the flush flag was set, while leaving further data that arrived in transaction packets in which the flush flag was not set in the buffer memory without immediate flushing to the target memory. 18. The device according to claim 15, wherein the memory controller is configured, after flushing the data to the target memory, to send a completion message over the bus to a sender of the flush instruction. 19. The device according to claim 15, wherein the transaction descriptor comprises a “No Snoop” attribute field, which comprises the flush flag. 20. Computing apparatus, comprising:
the memory device according to claim 15; and a network interface controller (NIC), which is coupled to receive, via a network, a remote direct memory access (RDMA) write packet containing the data to be written to the memory device, specifying the addresses to which the data are to be written, and indicating that the data are to be flushed to the target memory, and to receive an RDMA flush packet following the RDMA write packet, and which is configured, in response to the RDMA write packet, to convey the data over the bus to the memory device in a transaction packet in which the flush flag is set, and to convey the flush instruction to the memory device in response to the RDMA flush packet. 21. The apparatus according to claim 20, wherein the data and the flush instruction are conveyed from the NIC to the memory device, and the data are flushed by the memory controller from the buffer memory to the persistent memory without generating an interrupt to a central processing unit (CPU) that is coupled to the bus in the apparatus. 22. The apparatus according to claim 20, wherein the NIC is configured to receive the RDMA write and flush packets from the peer node over a transport service instance established between the NIC and the peer node, wherein a memory region in the memory device is associated with the transport service instance, wherein the write packet causes the NIC to write the data to the associated memory region, and wherein the flush packet causes the NIC to issue the flush instruction with respect to the associated memory region. 23. The apparatus according to claim 22, wherein the NIC is configured to associate respective flush attributes with the memory region, and wherein the flush instruction causes the memory controller to flush the data written by the NIC to specified addresses within the memory region in accordance with the associated flush attributes. 24. The apparatus according to claim 20, and comprising a peer NIC deployed at the peer node, wherein the peer NIC is configured to transmit the RDMA write and flush packets over the network in response to RDMA write and flush work requests submitted to the peer NIC by a process running on the peer node. 25. A method for data storage in a memory device that includes a target memory and a volatile buffer memory, the method comprising:
receiving in the volatile buffer memory data written over a bus to the memory device for storage in specified addresses within a memory address space of the memory device; receiving, via the bus, a flush instruction; and in response to the flush instruction, immediately flushing the data held in the buffer memory with specified addresses within the memory address space to the target memory. 26. The method according to claim 25, wherein the target memory comprises a persistent memory. 27. The method according to claim 25, wherein flushing the data comprises immediately flushing to the target memory all of the data conveyed over the bus to the target memory in write commands posted previously to the flush instruction. 28. The method according to claim 25, wherein the flush instruction identifies a range that is to be flushed within the memory address space, and wherein flushing the data comprises immediately flushing the data held in the buffer memory with specified addresses within the identified range to the target memory. 29. The method according to claim 28, wherein flushing the data comprises flushing, in response to the flush instruction, the data only within the identified range, while leaving further data with specified addresses outside the identified range in the buffer memory without immediate flushing to the target memory. 30. The method according to claim 25, and comprising, after flushing the data to the target memory, sending a completion message over the bus to a sender of the flush instruction. 31. The method according to claim 25, wherein the bus over which the data and flush instruction are written is a peripheral component bus of a computer, having a bus address space in which a range to be flushed is identified in terms of memory pages, and wherein flushing the data comprises translating the identified range of memory pages from the bus address space to memory blocks for flushing within the memory address space. 32. The method according to claim 25, and comprising associating respective flush attributes with multiple regions within the memory address space, wherein flushing the data comprises applying the flush instruction to the data held in the buffer memory with specified addresses within any given region in accordance with the respective flush attributes. 33. The method according to claim 32, wherein the respective flush attributes indicate whether the given region corresponds to a range in the target memory that comprises persistent memory. 34. The method according to claim 25, wherein receiving the data comprises receiving in a network interface controller (NIC) coupled to the bus, from a peer node via a network, a remote direct memory access (RDMA) write packet containing the data to be written to the memory device and specifying the addresses to which the data are to be written, and conveying the data over the bus from the NIC to the memory device, and
wherein receiving the flush instruction comprises receiving in the NIC over the network an RDMA flush packet, and in response to the RDMA flush packet, conveying the flush instruction from the NIC over the bus to the memory device. 35. The method according to claim 34, wherein the data and the flush instruction are conveyed from the NIC to the memory device, and the data are flushed from the buffer memory to the target memory without generating an interrupt to a central processing unit (CPU) that is coupled to the bus. 36. The method according to claim 34, wherein the RDMA write and flush packets are received from the peer node over a transport service instance established between the NIC and the peer node, wherein a memory region in the memory device is associated with the transport service instance, wherein the write packet causes the NIC to write the data to the associated memory region, and wherein the flush packet causes the NIC to issue the flush instruction with respect to the associated memory region. 37. The method according to claim 36, and comprising associating respective flush attributes with the memory region, wherein flushing the data comprises immediately flushing the data written by the NIC to specified addresses within the memory region in accordance with the associated flush attributes. 38. The method according to claim 34, and comprising transmitting the RDMA write and flush packets over the network in response to RDMA write and flush work requests submitted to a peer NIC at the peer node by a process running on the peer node. 39. A method for data storage in a memory device that includes a target memory and a volatile buffer memory, the method comprising:
receiving in the volatile buffer memory data written over a bus in transaction packets to the memory device for storage in specified addresses within a memory address space of the memory device, each transaction packet comprising a transaction descriptor, which comprises a flush flag; and receiving, via the bus, a flush instruction; and in response to the flush instruction, immediately flushing to the target memory the data held in the buffer memory for which the flush flag was set in the transaction packets that conveyed the data to the memory device. 40. The method according to claim 39, wherein the target memory comprises a persistent memory. 41. The method according to claim 39, wherein flushing the data comprises flushing, in response to the flush instruction, only the data for which the flush flag was set, while leaving further data that arrived in transaction packets in which the flush flag was not set in the buffer memory without immediate flushing to the target memory. 42. The method according to claim 39, and comprising, after flushing the data to the target memory, sending a completion message over the bus to a sender of the flush instruction. 43. The method according to claim 39, wherein the transaction descriptor comprises a “No Snoop” attribute field, which comprises the flush flag. 44. The method according to claim 39, wherein receiving the data comprises receiving in a network interface controller (NIC) coupled to the bus, from a peer node via a network, a remote direct memory access (RDMA) write packet containing the data to be written to the memory device and specifying the addresses to which the data are to be written and indicating that the data are to be flushed to the target memory, and conveying the data over the bus from the NIC to the memory device in a transaction packet in which the flush flag is set, and
wherein receiving the flush instruction comprises receiving in the NIC over the network an RDMA flush packet following the RDMA write packet, and in response to the RDMA flush packet, conveying the flush instruction from the NIC over the bus to the memory device. 45. The method according to claim 44, wherein the data and the flush instruction are conveyed from the NIC to the memory device, and the data are flushed from the buffer memory to the persistent memory without generating an interrupt to a central processing unit (CPU) that is coupled to the bus. 46. The method according to claim 44, wherein the RDMA write and flush packets are received from the peer node over a transport service instance established between the NIC and the peer node, wherein a memory region in the memory device is associated with the transport service instance, wherein the write packet causes the NIC to write the data to the associated memory region, and wherein the flush packet causes the NIC to issue the flush instruction with respect to the associated memory region. 47. The method according to claim 46, and comprising associating respective flush attributes with the memory region, wherein flushing the data comprises immediately flushing the data written by the NIC to specified addresses within the memory region in accordance with the associated flush attributes. 48. The method according to claim 44, and comprising transmitting the RDMA write and flush packets over the network in response to RDMA write and flush work requests submitted to a peer NIC at the peer node by a process running on the peer node. | A memory device includes a target memory, having a memory address space, and a volatile buffer memory, which is coupled to receive data written over a bus to the memory device for storage in specified addresses within the memory address space. A memory controller is configured to receive, via the bus, a flush instruction and, in response to the flush instruction, to immediately flush the data held in the buffer memory with specified addresses within the memory address space to the target memory.1. A memory device, comprising:
a target memory, having a memory address space; a volatile buffer memory, which is coupled to receive data written over a bus to the memory device for storage in specified addresses within the memory address space; and a memory controller, which is configured to receive, via the bus, a flush instruction and, in response to the flush instruction, to immediately flush the data held in the buffer memory with specified addresses within the memory address space to the target memory. 2. The device according to claim 1, wherein the target memory comprises a persistent memory. 3. The device according to claim 1, wherein the flush instruction causes the memory controller to flush to the target memory all of the data conveyed over the bus to the target memory in write commands posted previously to the flush instruction. 4. The device according to claim 1, wherein the flush instruction identifies a range that is to be flushed within the memory address space, and causes the memory controller to immediately flush the data held in the buffer memory with specified addresses within the identified range to the target memory. 5. The device according to claim 4, wherein the memory controller is configured to flush, in response to the flush instruction, the data only within the identified range, while leaving further data with specified addresses outside the identified range in the buffer memory without immediate flushing to the target memory. 6. The device according to claim 1, wherein the memory controller is configured, after flushing the data to the target memory, to send a completion message over the bus to a sender of the flush instruction. 7. The device according to claim 1, wherein the bus over which the data and flush instruction are written is a peripheral component bus of a computer, having a bus address space in which a range to be flushed is identified in terms of memory pages, and wherein the memory controller is configured to translate the identified range of memory pages from the bus address space to memory blocks for flushing within the memory address space. 8. The device according to claim 1, wherein the memory controller is configured to identify multiple regions within the memory address space and to associate respective flush attributes with the regions, wherein the flush instruction causes the memory controller to flush the data held in the buffer memory with specified addresses within any given region in accordance with the respective flush attributes. 9. The device according to claim 8, wherein the respective flush attributes indicate whether the given region corresponds to a range in the target memory that comprises persistent memory. 10. Computing apparatus, comprising:
the memory device according to claims 1; and a network interface controller (NIC), which is coupled to receive from a peer node, via a network, a remote direct memory access (RDMA) write packet containing the data to be written to the memory device and specifying the addresses to which the data are to be written, and to receive an RDMA flush packet, and which is configured, in response to the RDMA write and flush packets, to convey the data and the flush instruction over the bus to the memory device. 11. The apparatus according to claim 10, wherein the data and the flush instruction are conveyed from the NIC to the memory device, and the data are flushed by the memory controller from the buffer memory to the target memory without generating an interrupt to a central processing unit (CPU) that is coupled to the bus in the apparatus. 12. The apparatus according to claim 10, wherein the NIC is configured to receive the RDMA write and flush packets from the peer node over a transport service instance established between the NIC and the peer node, wherein a memory region in the memory device is associated with the transport service instance, wherein the write packet causes the NIC to write the data to the associated memory region, and wherein the flush packet causes the NIC to issue the flush instruction with respect to the associated memory region. 13. The apparatus according to claim 12, wherein the NIC is configured to associate respective flush attributes with the memory region, and wherein the flush instruction causes the memory controller to flush the data written by the NIC to specified addresses within the memory region in accordance with the associated flush attributes. 14. The apparatus according to claim 10, and comprising a peer NIC deployed at the peer node, wherein the peer NIC is configured to transmit the RDMA write and flush packets over the network in response to RDMA write and flush work requests submitted to the peer NIC by a process running on the peer node. 15. A memory device, comprising:
a target memory, having a memory address space; a volatile buffer memory, which is coupled to receive data written over a bus in transaction packets to the memory device for storage in specified addresses within the memory address space, each transaction packet comprising a transaction descriptor, which comprises a flush flag; and a memory controller, which is configured to receive, via the bus, a flush instruction and, in response to the flush instruction, to immediately flush to the target memory the data held in the buffer memory for which the flush flag was set in the transaction packets that conveyed the data to the memory device. 16. The device according to claim 15, wherein the target memory comprises a persistent memory. 17. The device according to claim 15, wherein the memory controller is configured to flush, in response to the flush instruction, only the data for which the flush flag was set, while leaving further data that arrived in transaction packets in which the flush flag was not set in the buffer memory without immediate flushing to the target memory. 18. The device according to claim 15, wherein the memory controller is configured, after flushing the data to the target memory, to send a completion message over the bus to a sender of the flush instruction. 19. The device according to claim 15, wherein the transaction descriptor comprises a “No Snoop” attribute field, which comprises the flush flag. 20. Computing apparatus, comprising:
the memory device according to claim 15; and a network interface controller (NIC), which is coupled to receive, via a network, a remote direct memory access (RDMA) write packet containing the data to be written to the memory device, specifying the addresses to which the data are to be written, and indicating that the data are to be flushed to the target memory, and to receive an RDMA flush packet following the RDMA write packet, and which is configured, in response to the RDMA write packet, to convey the data over the bus to the memory device in a transaction packet in which the flush flag is set, and to convey the flush instruction to the memory device in response to the RDMA flush packet. 21. The apparatus according to claim 20, wherein the data and the flush instruction are conveyed from the NIC to the memory device, and the data are flushed by the memory controller from the buffer memory to the persistent memory without generating an interrupt to a central processing unit (CPU) that is coupled to the bus in the apparatus. 22. The apparatus according to claim 20, wherein the NIC is configured to receive the RDMA write and flush packets from the peer node over a transport service instance established between the NIC and the peer node, wherein a memory region in the memory device is associated with the transport service instance, wherein the write packet causes the NIC to write the data to the associated memory region, and wherein the flush packet causes the NIC to issue the flush instruction with respect to the associated memory region. 23. The apparatus according to claim 22, wherein the NIC is configured to associate respective flush attributes with the memory region, and wherein the flush instruction causes the memory controller to flush the data written by the NIC to specified addresses within the memory region in accordance with the associated flush attributes. 24. The apparatus according to claim 20, and comprising a peer NIC deployed at the peer node, wherein the peer NIC is configured to transmit the RDMA write and flush packets over the network in response to RDMA write and flush work requests submitted to the peer NIC by a process running on the peer node. 25. A method for data storage in a memory device that includes a target memory and a volatile buffer memory, the method comprising:
receiving in the volatile buffer memory data written over a bus to the memory device for storage in specified addresses within a memory address space of the memory device; receiving, via the bus, a flush instruction; and in response to the flush instruction, immediately flushing the data held in the buffer memory with specified addresses within the memory address space to the target memory. 26. The method according to claim 25, wherein the target memory comprises a persistent memory. 27. The method according to claim 25, wherein flushing the data comprises immediately flushing to the target memory all of the data conveyed over the bus to the target memory in write commands posted previously to the flush instruction. 28. The method according to claim 25, wherein the flush instruction identifies a range that is to be flushed within the memory address space, and wherein flushing the data comprises immediately flushing the data held in the buffer memory with specified addresses within the identified range to the target memory. 29. The method according to claim 28, wherein flushing the data comprises flushing, in response to the flush instruction, the data only within the identified range, while leaving further data with specified addresses outside the identified range in the buffer memory without immediate flushing to the target memory. 30. The method according to claim 25, and comprising, after flushing the data to the target memory, sending a completion message over the bus to a sender of the flush instruction. 31. The method according to claim 25, wherein the bus over which the data and flush instruction are written is a peripheral component bus of a computer, having a bus address space in which a range to be flushed is identified in terms of memory pages, and wherein flushing the data comprises translating the identified range of memory pages from the bus address space to memory blocks for flushing within the memory address space. 32. The method according to claim 25, and comprising associating respective flush attributes with multiple regions within the memory address space, wherein flushing the data comprises applying the flush instruction to the data held in the buffer memory with specified addresses within any given region in accordance with the respective flush attributes. 33. The method according to claim 32, wherein the respective flush attributes indicate whether the given region corresponds to a range in the target memory that comprises persistent memory. 34. The method according to claim 25, wherein receiving the data comprises receiving in a network interface controller (NIC) coupled to the bus, from a peer node via a network, a remote direct memory access (RDMA) write packet containing the data to be written to the memory device and specifying the addresses to which the data are to be written, and conveying the data over the bus from the NIC to the memory device, and
wherein receiving the flush instruction comprises receiving in the NIC over the network an RDMA flush packet, and in response to the RDMA flush packet, conveying the flush instruction from the NIC over the bus to the memory device. 35. The method according to claim 34, wherein the data and the flush instruction are conveyed from the NIC to the memory device, and the data are flushed from the buffer memory to the target memory without generating an interrupt to a central processing unit (CPU) that is coupled to the bus. 36. The method according to claim 34, wherein the RDMA write and flush packets are received from the peer node over a transport service instance established between the NIC and the peer node, wherein a memory region in the memory device is associated with the transport service instance, wherein the write packet causes the NIC to write the data to the associated memory region, and wherein the flush packet causes the NIC to issue the flush instruction with respect to the associated memory region. 37. The method according to claim 36, and comprising associating respective flush attributes with the memory region, wherein flushing the data comprises immediately flushing the data written by the NIC to specified addresses within the memory region in accordance with the associated flush attributes. 38. The method according to claim 34, and comprising transmitting the RDMA write and flush packets over the network in response to RDMA write and flush work requests submitted to a peer NIC at the peer node by a process running on the peer node. 39. A method for data storage in a memory device that includes a target memory and a volatile buffer memory, the method comprising:
receiving in the volatile buffer memory data written over a bus in transaction packets to the memory device for storage in specified addresses within a memory address space of the memory device, each transaction packet comprising a transaction descriptor, which comprises a flush flag; and receiving, via the bus, a flush instruction; and in response to the flush instruction, immediately flushing to the target memory the data held in the buffer memory for which the flush flag was set in the transaction packets that conveyed the data to the memory device. 40. The method according to claim 39, wherein the target memory comprises a persistent memory. 41. The method according to claim 39, wherein flushing the data comprises flushing, in response to the flush instruction, only the data for which the flush flag was set, while leaving further data that arrived in transaction packets in which the flush flag was not set in the buffer memory without immediate flushing to the target memory. 42. The method according to claim 39, and comprising, after flushing the data to the target memory, sending a completion message over the bus to a sender of the flush instruction. 43. The method according to claim 39, wherein the transaction descriptor comprises a “No Snoop” attribute field, which comprises the flush flag. 44. The method according to claim 39, wherein receiving the data comprises receiving in a network interface controller (NIC) coupled to the bus, from a peer node via a network, a remote direct memory access (RDMA) write packet containing the data to be written to the memory device and specifying the addresses to which the data are to be written and indicating that the data are to be flushed to the target memory, and conveying the data over the bus from the NIC to the memory device in a transaction packet in which the flush flag is set, and
wherein receiving the flush instruction comprises receiving in the NIC over the network an RDMA flush packet following the RDMA write packet, and in response to the RDMA flush packet, conveying the flush instruction from the NIC over the bus to the memory device. 45. The method according to claim 44, wherein the data and the flush instruction are conveyed from the NIC to the memory device, and the data are flushed from the buffer memory to the persistent memory without generating an interrupt to a central processing unit (CPU) that is coupled to the bus. 46. The method according to claim 44, wherein the RDMA write and flush packets are received from the peer node over a transport service instance established between the NIC and the peer node, wherein a memory region in the memory device is associated with the transport service instance, wherein the write packet causes the NIC to write the data to the associated memory region, and wherein the flush packet causes the NIC to issue the flush instruction with respect to the associated memory region. 47. The method according to claim 46, and comprising associating respective flush attributes with the memory region, wherein flushing the data comprises immediately flushing the data written by the NIC to specified addresses within the memory region in accordance with the associated flush attributes. 48. The method according to claim 44, and comprising transmitting the RDMA write and flush packets over the network in response to RDMA write and flush work requests submitted to a peer NIC at the peer node by a process running on the peer node. | 2,100 |
5,166 | 14,619,881 | 2,129 | Simulation of execution of a processing workload by a target hardware device is provided by providing workload data specifying the processing workload, passing the workload data to both a primary partial simulation and a complementary partial simulation that run in parallel and acquire input data from different levels of abstraction of the target hardware and then simulating execution of the processing workload using a primary partial simulation to generate primary partial result state data and using the complementary partial simulation to generate complementary partial result state data. The target hardware device may be a graphics processing unit and the workload data may specify the processing to be performed in a hardware independent form, such as, for example, OpenGL ES. The host system supporting the simulation may include a graphics processing unit serving to provide the complementary partial simulation due to its own execution of the workload data. | 1. A method of simulating execution of a processing workload by a target hardware device including generating result state data, said method comprising the steps of:
providing workload data specifying said processing workload; passing said workload data both to a primary partial simulation and to a complementary partial simulation running in parallel and acquiring input data from different levels of abstraction of said target hardware; simulating execution of said processing workload using said primary partial simulation to generate primary partial result state data representing at least part of said result state data; and simulating execution of said processing workload using said complementary partial simulation to generate complementary partial result state data representing at lease part of said result state data. 2. A method as claimed in claim 1, comprising the step of combining said primary partial result data and said complementary partial result state data to generate said result state data. 3. A method as claimed in claim 1, wherein said workload data specifies said processing workload in a form independent of a hardware implementation of said target hardware device. 4. A method as claimed in claim 1, wherein said primary partial result state data includes simulated hardware register content of said target hardware. 5. A method as claimed in claim 1, wherein said complementary partial result state data includes output data to be stored within a memory as an output of said processing workload, said memory serving as a simulated memory of said target hardware. 6. A method as claimed in claim 5, wherein said primary partial result state data includes a memory pointer value indicating an address within said memory at which said output data is to be written. 7. A method as claimed in claim 5, wherein said primary partial result state data includes format data read by said complementary partial simulation and specifying one or more parameters of a format in which said output data is written in said memory by said complementary partial simulation. 8. A method as claimed in claim 5, wherein said second primary result state data includes one or more pointer values specifying respective addresses within said memory storing additional state data for use in said simulated execution of said processing workload. 9. A method as claimed in claim 5, wherein said second primary result state data includes memory address translation data corresponding to page table data used by a memory management unit of said target hardware and said complementary partial simulation reads said memory address translation data and generates memory addresses for said memory in dependence upon said memory address translation data. 10. A method as claimed in claim 1, wherein said complementary partial simulation is performed using a host processing device including host execution hardware having said processing workload as a native workload. 11. A method as claimed in claim 1, wherein said complementary partial simulation is performed by a device separated from a host device for said primary partial simulation. 12. A method as claimed in claim 1, wherein said processing workload is a hardware-independent graphics program. 13. A method as claimed in claim 10, wherein said host execution hardware is a host graphics processing unit and said target device is a target graphics processing unit. 14. A method as claimed in claim 12, wherein said primary partial simulation uses a target device driver for said target hardware device together with a target operating system to generate said primary partial result state data. 15. A method as claimed in claim 1, wherein said complementary partial result state data and said primary partial result state data both include marker data and said method comprises the step of correlating said complementary partial result state data with said primary partial result state data using said marker data. 16. A method as claimed in claim 1, comprising the step of translating between dynamic variables generated by said complementary partial simulation and dynamic variables generated by said primary partial simulation. 17. A method as claimed in claim 16, wherein said translating uses mapping data maintained as part of one of said complementary partial simulation and said primary partial simulation. 18. A method as claimed in claim 1, wherein said primary partial simulation includes executing software interrupt instructions to interrupt execution of said primary partial simulation and to trigger passing of a portion of said processing workload to said complementary partial simulation for simulation. 19. A method as claimed in claim 1, wherein said primary partial simulation generates a progress signal indicating completion of a portion of said processing workload in dependence upon detecting completion by said complementary partial simulation of a portion of said complementary partial result state data corresponding to said portion of said processing workload. 20. A method as claimed in claim 19, wherein said progress signal simulates an interrupt signal generated by said target hardware device. 21. A method as claimed in claim 1, wherein said workload data includes one or more pointer values pointing to input data values for use by said complementary partial simulation and one of:
said complementary partial simulation uses said one or more pointer values to read said input data values from result state data; and said input data values are read by a shim program using said one or pointer values and are passed to said complementary partial simulation by said shim program. 22. Apparatus for executing a processing workload specified by workload data to generate result state data in place of a target hardware device, said apparatus comprising:
a workload allocator configured to pass said workload data both to a primary simulator and to a complementary simulator; wherein said primary partial simulator is configured to execute said processing workload to generate primary partial result state data representing at least part of said result state data; and said complementary partial simulator is configured to execute said processing workload to generate complementary partial result state data representing at least part of said result state data, wherein said primary partial simulator and said complementary partial simulator are configured to run in parallel and to acquire input data from different levels of abstraction of said target hardware 23. A computer program for controlling a computer to perform a method as claimed in claim 1. | Simulation of execution of a processing workload by a target hardware device is provided by providing workload data specifying the processing workload, passing the workload data to both a primary partial simulation and a complementary partial simulation that run in parallel and acquire input data from different levels of abstraction of the target hardware and then simulating execution of the processing workload using a primary partial simulation to generate primary partial result state data and using the complementary partial simulation to generate complementary partial result state data. The target hardware device may be a graphics processing unit and the workload data may specify the processing to be performed in a hardware independent form, such as, for example, OpenGL ES. The host system supporting the simulation may include a graphics processing unit serving to provide the complementary partial simulation due to its own execution of the workload data.1. A method of simulating execution of a processing workload by a target hardware device including generating result state data, said method comprising the steps of:
providing workload data specifying said processing workload; passing said workload data both to a primary partial simulation and to a complementary partial simulation running in parallel and acquiring input data from different levels of abstraction of said target hardware; simulating execution of said processing workload using said primary partial simulation to generate primary partial result state data representing at least part of said result state data; and simulating execution of said processing workload using said complementary partial simulation to generate complementary partial result state data representing at lease part of said result state data. 2. A method as claimed in claim 1, comprising the step of combining said primary partial result data and said complementary partial result state data to generate said result state data. 3. A method as claimed in claim 1, wherein said workload data specifies said processing workload in a form independent of a hardware implementation of said target hardware device. 4. A method as claimed in claim 1, wherein said primary partial result state data includes simulated hardware register content of said target hardware. 5. A method as claimed in claim 1, wherein said complementary partial result state data includes output data to be stored within a memory as an output of said processing workload, said memory serving as a simulated memory of said target hardware. 6. A method as claimed in claim 5, wherein said primary partial result state data includes a memory pointer value indicating an address within said memory at which said output data is to be written. 7. A method as claimed in claim 5, wherein said primary partial result state data includes format data read by said complementary partial simulation and specifying one or more parameters of a format in which said output data is written in said memory by said complementary partial simulation. 8. A method as claimed in claim 5, wherein said second primary result state data includes one or more pointer values specifying respective addresses within said memory storing additional state data for use in said simulated execution of said processing workload. 9. A method as claimed in claim 5, wherein said second primary result state data includes memory address translation data corresponding to page table data used by a memory management unit of said target hardware and said complementary partial simulation reads said memory address translation data and generates memory addresses for said memory in dependence upon said memory address translation data. 10. A method as claimed in claim 1, wherein said complementary partial simulation is performed using a host processing device including host execution hardware having said processing workload as a native workload. 11. A method as claimed in claim 1, wherein said complementary partial simulation is performed by a device separated from a host device for said primary partial simulation. 12. A method as claimed in claim 1, wherein said processing workload is a hardware-independent graphics program. 13. A method as claimed in claim 10, wherein said host execution hardware is a host graphics processing unit and said target device is a target graphics processing unit. 14. A method as claimed in claim 12, wherein said primary partial simulation uses a target device driver for said target hardware device together with a target operating system to generate said primary partial result state data. 15. A method as claimed in claim 1, wherein said complementary partial result state data and said primary partial result state data both include marker data and said method comprises the step of correlating said complementary partial result state data with said primary partial result state data using said marker data. 16. A method as claimed in claim 1, comprising the step of translating between dynamic variables generated by said complementary partial simulation and dynamic variables generated by said primary partial simulation. 17. A method as claimed in claim 16, wherein said translating uses mapping data maintained as part of one of said complementary partial simulation and said primary partial simulation. 18. A method as claimed in claim 1, wherein said primary partial simulation includes executing software interrupt instructions to interrupt execution of said primary partial simulation and to trigger passing of a portion of said processing workload to said complementary partial simulation for simulation. 19. A method as claimed in claim 1, wherein said primary partial simulation generates a progress signal indicating completion of a portion of said processing workload in dependence upon detecting completion by said complementary partial simulation of a portion of said complementary partial result state data corresponding to said portion of said processing workload. 20. A method as claimed in claim 19, wherein said progress signal simulates an interrupt signal generated by said target hardware device. 21. A method as claimed in claim 1, wherein said workload data includes one or more pointer values pointing to input data values for use by said complementary partial simulation and one of:
said complementary partial simulation uses said one or more pointer values to read said input data values from result state data; and said input data values are read by a shim program using said one or pointer values and are passed to said complementary partial simulation by said shim program. 22. Apparatus for executing a processing workload specified by workload data to generate result state data in place of a target hardware device, said apparatus comprising:
a workload allocator configured to pass said workload data both to a primary simulator and to a complementary simulator; wherein said primary partial simulator is configured to execute said processing workload to generate primary partial result state data representing at least part of said result state data; and said complementary partial simulator is configured to execute said processing workload to generate complementary partial result state data representing at least part of said result state data, wherein said primary partial simulator and said complementary partial simulator are configured to run in parallel and to acquire input data from different levels of abstraction of said target hardware 23. A computer program for controlling a computer to perform a method as claimed in claim 1. | 2,100 |
5,167 | 12,833,233 | 2,178 | Implementations of systems and methods allow mobile users to send replies to, or to forward, truncated electronic mail messages, and yet still send the entire body of the original electronic mail message, without having to download the entire body of the mail message locally to the mobile device and then re-transmit the entire message from the mobile device. | 1. A method of sending an electronic mail (e-mail) message in response to an original e-mail message having a message body, comprising:
storing the original e-mail message in a data store; sending a truncated e-mail message to a mobile device, the truncated e-mail message corresponding to the original e-mail message with a portion thereof removed; selecting a smart response mode by a user of the mobile device; receiving, from the mobile device, a responsive e-mail in response to the truncated e-mail identifying a recipient and including an indication that the user has selected to operate in the smart response mode; and in response to the indication that the user has selected to operate in the smart response mode, retrieving the original e-mail message from the data store and sending to the recipient a resultant e-mail message including the portion removed from the original e-mail message. 2. The method of claim 1 wherein sending a truncated e-mail message comprises:
sending the truncated e-mail message with at least a portion of the message body removed from the truncated e-mail message. 3. The method of claim 2 wherein sending the recipient a resultant e-mail message comprises:
sending to the recipient the message body from the retrieved original e-mail message. 4. The method of claim 1 wherein receiving a responsive e-mail comprises:
receiving a reply e-mail. 5. The method of claim 1 wherein receiving a responsive e-mail comprises:
receiving a forward e-mail. 6. The method of claim 1 wherein the original e-mail message includes an attachment, and wherein sending a truncated e-mail message comprises:
sending the truncated e-mail message to the mobile device without the attachment. 7. The method of claim 6 wherein sending the recipient a resultant e-mail message comprises:
attaching the attachment to the resultant e-mail message prior to sending the resultant e-mail message. 8. A computer system comprising:
a server adapted to generate a truncated message corresponding to a first e-mail message, but having a portion of the first e-mail message removed therefrom, and send the truncated message to a mobile device; and the mobile device adapted to perform a selection of a smart response mode by a user of the mobile device, and send a responsive e-mail message to the server, the responsive e-mail message identifying a recipient and including an indication that the user of the mobile device has selected to operate in the smart response mode, in response to the truncated message received by the mobile device, wherein the server is further adapted to form a resultant e-mail message including the portion removed from the first e-mail message, in response to receiving the responsive e-mail message including the indication that the user has selected to operate in the smart response mode, and send the resultant e-mail message to the recipient. 9. The computer system of claim 8, wherein the server is further adapted to receive the first e-mail message for transmission to the mobile device. 10. The computer system of claim 9, wherein the server is further adapted to form the truncated message based on the first e-mail message. 11. The computer system of claim 10 wherein the server is further adapted to store the first e-mail message on a message store. 12. The computer system of claim 11 wherein the server is adapted to form the resultant e-mail message by accessing the message store and adding the removed portion of the first e-mail message to the resultant e-mail message. 13. The computer system of claim 10 wherein the server is adapted to form the truncated message by removing at least a portion of a message body from the first e-mail message. 14. The computer system of claim 13 wherein the server is further adapted to retrieve the message body and send to the recipient the message body from the first e-mail message. 15. The computer system of claim 14 wherein the responsive e-mail message is a reply e-mail message. 16. The computer system of claim 14 wherein the responsive e-mail message is a forward e-mail message. 17. The computer system of claim 16 wherein the first e-mail message includes an attachment, and wherein the truncated e-mail message does not include the attachment. 18. The computer system of claim 17 wherein the server is adapted to form the resultant message by attaching the attachment to the resultant e-mail message prior to sending the resultant e-mail message. | Implementations of systems and methods allow mobile users to send replies to, or to forward, truncated electronic mail messages, and yet still send the entire body of the original electronic mail message, without having to download the entire body of the mail message locally to the mobile device and then re-transmit the entire message from the mobile device.1. A method of sending an electronic mail (e-mail) message in response to an original e-mail message having a message body, comprising:
storing the original e-mail message in a data store; sending a truncated e-mail message to a mobile device, the truncated e-mail message corresponding to the original e-mail message with a portion thereof removed; selecting a smart response mode by a user of the mobile device; receiving, from the mobile device, a responsive e-mail in response to the truncated e-mail identifying a recipient and including an indication that the user has selected to operate in the smart response mode; and in response to the indication that the user has selected to operate in the smart response mode, retrieving the original e-mail message from the data store and sending to the recipient a resultant e-mail message including the portion removed from the original e-mail message. 2. The method of claim 1 wherein sending a truncated e-mail message comprises:
sending the truncated e-mail message with at least a portion of the message body removed from the truncated e-mail message. 3. The method of claim 2 wherein sending the recipient a resultant e-mail message comprises:
sending to the recipient the message body from the retrieved original e-mail message. 4. The method of claim 1 wherein receiving a responsive e-mail comprises:
receiving a reply e-mail. 5. The method of claim 1 wherein receiving a responsive e-mail comprises:
receiving a forward e-mail. 6. The method of claim 1 wherein the original e-mail message includes an attachment, and wherein sending a truncated e-mail message comprises:
sending the truncated e-mail message to the mobile device without the attachment. 7. The method of claim 6 wherein sending the recipient a resultant e-mail message comprises:
attaching the attachment to the resultant e-mail message prior to sending the resultant e-mail message. 8. A computer system comprising:
a server adapted to generate a truncated message corresponding to a first e-mail message, but having a portion of the first e-mail message removed therefrom, and send the truncated message to a mobile device; and the mobile device adapted to perform a selection of a smart response mode by a user of the mobile device, and send a responsive e-mail message to the server, the responsive e-mail message identifying a recipient and including an indication that the user of the mobile device has selected to operate in the smart response mode, in response to the truncated message received by the mobile device, wherein the server is further adapted to form a resultant e-mail message including the portion removed from the first e-mail message, in response to receiving the responsive e-mail message including the indication that the user has selected to operate in the smart response mode, and send the resultant e-mail message to the recipient. 9. The computer system of claim 8, wherein the server is further adapted to receive the first e-mail message for transmission to the mobile device. 10. The computer system of claim 9, wherein the server is further adapted to form the truncated message based on the first e-mail message. 11. The computer system of claim 10 wherein the server is further adapted to store the first e-mail message on a message store. 12. The computer system of claim 11 wherein the server is adapted to form the resultant e-mail message by accessing the message store and adding the removed portion of the first e-mail message to the resultant e-mail message. 13. The computer system of claim 10 wherein the server is adapted to form the truncated message by removing at least a portion of a message body from the first e-mail message. 14. The computer system of claim 13 wherein the server is further adapted to retrieve the message body and send to the recipient the message body from the first e-mail message. 15. The computer system of claim 14 wherein the responsive e-mail message is a reply e-mail message. 16. The computer system of claim 14 wherein the responsive e-mail message is a forward e-mail message. 17. The computer system of claim 16 wherein the first e-mail message includes an attachment, and wherein the truncated e-mail message does not include the attachment. 18. The computer system of claim 17 wherein the server is adapted to form the resultant message by attaching the attachment to the resultant e-mail message prior to sending the resultant e-mail message. | 2,100 |
5,168 | 14,734,691 | 2,117 | Systems and methods for power plant data reconciliation are provided. According to one embodiment of the disclosure, a system may include a controller and a processor in communication with the controller. The processor may be configured to run a power plant under a plurality of operational conditions. While the power plant is running, the processor may be configured to automatically collect operational data associated with the power plant. The collected data may be stored in a predefined location. Furthermore, the processor may be configured to select stable data from the operational data to coincide with output data associated with a power plant model. One or more parameters of the power plant model may be modified, and at least one difference may be minimized between the output data associated with the power plant model and a measured value in the power plant operational data. At least one control action for a power plant component using the power plant model may be determined | 1. A method for implementing data reconciliation using a power plant model, comprising:
receiving, by at least one processor, power plant operational data; selecting, by at least one processor, thermally stable data from the operational data to coincide with output data associated with a power plant model; modifying, by at least one processor, one or more parameters of the power plant model, wherein at least one difference is minimized between the output data associated with the power plant model and a measured value in the power plant operational data; and determining, by at least one processor, at least one control action for a power plant component using the power plant model. 2. The method of claim 1, wherein the operational data comprises at least one of the following: gas turbine power, gas turbine compressor pressure and temperature, gas turbine exhaust temperature, gas turbine fuel flow rate, gas turbine inlet pressure drop, feedwater flow rates, steam turbine flow rates, steam turbine temperatures and pressures, admission temperatures, steam turbine power, condenser steam saturation temperature, and condenser cooling water temperatures. 3. The method of claim 1, wherein the selecting stable data comprises checking the operational data and scoring the data points based at least in part on stability. 4. The method of claim 1, wherein the modifying is based at least in part on performing: an initial analysis of gradient-based data reconciliation optimization, global-based data reconciliation optimization to remove any local minima, and one or more additional analysis of gradient-based data reconciliation optimization. 5. The method of claim 1, wherein the power plant model is based at least in part on a neural-net surrogate model, wherein the neural-net surrogate model indicates plant component degradation by reconciling the operational data, determining data match multipliers (DMMs), and determining performance factors. 6. The method of claim 5, wherein the neural net surrogate model is created based on a physics based model. 7. The method of claim 5, wherein the control action is determined from the DMMs and the performance factors. 8. A system for implementing data reconciliation using a power plant model, comprising:
a controller; and a processor communicatively coupled to the controller and configured to:
receive power plant operational data;
select stable data from the operational data to coincide with output data associated with a power plant model;
modify one or more parameters of the power plant model, wherein at least one difference is minimized between the output data associated with the power plant model and a measured value in the power plant operational data; and
determine at least one control action for a power plant component using the power plant model. 9. The system of claim 8, wherein the operational data comprises at least one of the following: gas turbine power, gas turbine compressor pressure and temperature, gas turbine exhaust temperature, gas turbine fuel flow rate, gas turbine inlet pressure drop, feedwater flow rates, steam turbine flow rates, steam turbine temperatures and pressures, admission temperatures, steam turbine power, condenser steam saturation temperature, and condenser cooling water temperatures. 10. The system of claim 8, wherein the selecting stability data comprises checking the operational data and scoring the data points based at least in part on stability. 11. The system of claim 8, wherein the modifying is based at least in part on performing a first analysis of gradient-based data reconciliation optimization, global-based data reconciliation optimization to remove any local minima, and one or more additional analysis of gradient-based data reconciliation optimization. 12. The system of claim 9, wherein the power plant model is based at least in part on a neural-net surrogate model, wherein the neural-net surrogate model indicates plant component degradation by reconciling the operational data, determining data match multipliers (DMMs), and determining performance factors. 13. The system of claim 9, wherein the neural net surrogate model is created based on a physics based model. 14. The system of claim 9, wherein the control action is determined from the DMMs and the performance factors. 15. A system comprising:
power plant equipment; a controller in communication with the power plant equipment, wherein the controller includes a power plant control system; and a processor in communication with the controller and configured to:
receive power plant operational data;
select stable data from the operational data to coincide with output data associated with a power plant model;
modify one or more parameters of the power plant model, wherein at least one difference is minimized between the output data associated with the power plant model and a measured value in the power plant operational data; and
determine at least one control action for a power plant component using the power plant model. 16. The system of claim 15, wherein the selecting stability data comprises checking the operational data and scoring the data points based at least in part on stability. 17. The system of claim 15, wherein the modifying is based at least in part on performing a first analysis of gradient-based data reconciliation optimization, global-based data reconciliation optimization to remove any local minima, and one or more additional analysis of gradient-based data reconciliation optimization. 18. The system of claim 15, wherein the power plant model is based at least in part on a neural-net surrogate model, wherein the neural-net surrogate model indicates plant component degradation by reconciling the operational data, determining data match multipliers (DMMs), and determining performance factors. 19. The system of claim 15, wherein the neural net surrogate model is created based on a physics based model. 20. The system of claim 15, wherein the control action is determined from the DMMs and the performance factors. | Systems and methods for power plant data reconciliation are provided. According to one embodiment of the disclosure, a system may include a controller and a processor in communication with the controller. The processor may be configured to run a power plant under a plurality of operational conditions. While the power plant is running, the processor may be configured to automatically collect operational data associated with the power plant. The collected data may be stored in a predefined location. Furthermore, the processor may be configured to select stable data from the operational data to coincide with output data associated with a power plant model. One or more parameters of the power plant model may be modified, and at least one difference may be minimized between the output data associated with the power plant model and a measured value in the power plant operational data. At least one control action for a power plant component using the power plant model may be determined1. A method for implementing data reconciliation using a power plant model, comprising:
receiving, by at least one processor, power plant operational data; selecting, by at least one processor, thermally stable data from the operational data to coincide with output data associated with a power plant model; modifying, by at least one processor, one or more parameters of the power plant model, wherein at least one difference is minimized between the output data associated with the power plant model and a measured value in the power plant operational data; and determining, by at least one processor, at least one control action for a power plant component using the power plant model. 2. The method of claim 1, wherein the operational data comprises at least one of the following: gas turbine power, gas turbine compressor pressure and temperature, gas turbine exhaust temperature, gas turbine fuel flow rate, gas turbine inlet pressure drop, feedwater flow rates, steam turbine flow rates, steam turbine temperatures and pressures, admission temperatures, steam turbine power, condenser steam saturation temperature, and condenser cooling water temperatures. 3. The method of claim 1, wherein the selecting stable data comprises checking the operational data and scoring the data points based at least in part on stability. 4. The method of claim 1, wherein the modifying is based at least in part on performing: an initial analysis of gradient-based data reconciliation optimization, global-based data reconciliation optimization to remove any local minima, and one or more additional analysis of gradient-based data reconciliation optimization. 5. The method of claim 1, wherein the power plant model is based at least in part on a neural-net surrogate model, wherein the neural-net surrogate model indicates plant component degradation by reconciling the operational data, determining data match multipliers (DMMs), and determining performance factors. 6. The method of claim 5, wherein the neural net surrogate model is created based on a physics based model. 7. The method of claim 5, wherein the control action is determined from the DMMs and the performance factors. 8. A system for implementing data reconciliation using a power plant model, comprising:
a controller; and a processor communicatively coupled to the controller and configured to:
receive power plant operational data;
select stable data from the operational data to coincide with output data associated with a power plant model;
modify one or more parameters of the power plant model, wherein at least one difference is minimized between the output data associated with the power plant model and a measured value in the power plant operational data; and
determine at least one control action for a power plant component using the power plant model. 9. The system of claim 8, wherein the operational data comprises at least one of the following: gas turbine power, gas turbine compressor pressure and temperature, gas turbine exhaust temperature, gas turbine fuel flow rate, gas turbine inlet pressure drop, feedwater flow rates, steam turbine flow rates, steam turbine temperatures and pressures, admission temperatures, steam turbine power, condenser steam saturation temperature, and condenser cooling water temperatures. 10. The system of claim 8, wherein the selecting stability data comprises checking the operational data and scoring the data points based at least in part on stability. 11. The system of claim 8, wherein the modifying is based at least in part on performing a first analysis of gradient-based data reconciliation optimization, global-based data reconciliation optimization to remove any local minima, and one or more additional analysis of gradient-based data reconciliation optimization. 12. The system of claim 9, wherein the power plant model is based at least in part on a neural-net surrogate model, wherein the neural-net surrogate model indicates plant component degradation by reconciling the operational data, determining data match multipliers (DMMs), and determining performance factors. 13. The system of claim 9, wherein the neural net surrogate model is created based on a physics based model. 14. The system of claim 9, wherein the control action is determined from the DMMs and the performance factors. 15. A system comprising:
power plant equipment; a controller in communication with the power plant equipment, wherein the controller includes a power plant control system; and a processor in communication with the controller and configured to:
receive power plant operational data;
select stable data from the operational data to coincide with output data associated with a power plant model;
modify one or more parameters of the power plant model, wherein at least one difference is minimized between the output data associated with the power plant model and a measured value in the power plant operational data; and
determine at least one control action for a power plant component using the power plant model. 16. The system of claim 15, wherein the selecting stability data comprises checking the operational data and scoring the data points based at least in part on stability. 17. The system of claim 15, wherein the modifying is based at least in part on performing a first analysis of gradient-based data reconciliation optimization, global-based data reconciliation optimization to remove any local minima, and one or more additional analysis of gradient-based data reconciliation optimization. 18. The system of claim 15, wherein the power plant model is based at least in part on a neural-net surrogate model, wherein the neural-net surrogate model indicates plant component degradation by reconciling the operational data, determining data match multipliers (DMMs), and determining performance factors. 19. The system of claim 15, wherein the neural net surrogate model is created based on a physics based model. 20. The system of claim 15, wherein the control action is determined from the DMMs and the performance factors. | 2,100 |
5,169 | 14,483,661 | 2,139 | Systems, methods, and software described herein facilitate a cache service that allocates shared memory in a data processing cluster based on quality of service. In one example, a method for operating a cache service includes identifying one or more jobs to be processed in a cluster environment. The method further provides determining a quality of service for the one or more jobs and allocating shared memory for the one or more jobs based on the quality of service. | 1. A method of providing shared memory in a data processing cluster environment, the method comprising:
identifying one or more jobs to be processed in the data processing cluster environment; determining a quality of service for each of the one or more jobs; and allocating the shared memory for each of the one or more jobs in the data processing cluster environment based on the quality of service for each of the one or more jobs. 2. The method of claim 1 wherein the data processing cluster environment comprises one or more host computing devices executing one or more virtual machines. 3. The method of claim 2 wherein the shared memory comprises cache memory allocated on each of the one or more host computing devices. 4. The method of claim 3 wherein the cache memory for a first host computing device in the data processing cluster environment comprises memory accessible by at least one process on the first host computing device and a second process within at least one virtual machine executing on the first host computing device. 5. The method of claim 4 wherein the first process comprises a process executing outside of the at least one virtual machine. 6. The method of claim 1 wherein the one or more jobs comprise one or more distributed processing jobs. 7. The method of claim 1 wherein the quality of service for each of the one or more jobs comprises a service level assigned by an administrator. 8. The method of claim 1 wherein allocating the shared memory for each of the one or more jobs in the data processing cluster environment based on the quality of service for each of the one or more jobs comprises assigning the one or more jobs to virtual machines based on the quality of service for each of the one or more jobs, wherein the virtual machines are each allocated one portion of the shared memory. 9. The method of claim 8 wherein at least one of the portions of the shared memory allocated to the virtual machines is a different size than at least one other portion of the shared memory. 10. A computer apparatus to manage shared memory in a data processing cluster environment, the computer apparatus comprising:
processing instructions that direct a computing system, when executed by the computing system, to:
identify one or more jobs to be processed in the data processing cluster environment;
determine a quality of service for each of the one or more jobs; and
allocate the shared memory for each of the one or more jobs in the data processing cluster environment based on the quality of service for each of the one or more jobs.
one or more non-transitory computer readable media that store the processing instructions. 11. The computer apparatus of claim 10 wherein the data processing cluster environment comprises one or more host computing devices executing one or more virtual machines. 12. The computer apparatus of claim 11 wherein the shared memory comprises cache memory allocated on each of the one or more host computing devices. 13. The computer apparatus of claim 12 wherein the cache memory for a first host computing device in the data processing cluster environment comprises memory accessible by at least one process on the first host computing device and a second process within at least one virtual machine executing on the first host computing device. 14. The computer apparatus of claim 13 wherein the first process comprises a process executing outside of the at least one virtual machine. 15. The computer apparatus of claim 10 wherein the one or more jobs comprise one or more distributed processing jobs. 16. The computer apparatus of claim 10 wherein the quality of service for each of the one or more jobs comprises a service level assigned by an administrator. 17. The computer apparatus of claim 10 wherein the processing instructions to allocate the shared memory for each of the one or more jobs in the data processing cluster environment based on the quality of service for each of the one or more jobs direct the computing system to assign the one or more jobs to virtual machines based on the quality of service for each of the one or more jobs, wherein the virtual machines are each allocated with a portion of the shared memory. 18. The computer apparatus of claim 17 wherein at least one of the portions of the shared memory allocated to the virtual machines is a different size than at least one other portion of the shared memory. | Systems, methods, and software described herein facilitate a cache service that allocates shared memory in a data processing cluster based on quality of service. In one example, a method for operating a cache service includes identifying one or more jobs to be processed in a cluster environment. The method further provides determining a quality of service for the one or more jobs and allocating shared memory for the one or more jobs based on the quality of service.1. A method of providing shared memory in a data processing cluster environment, the method comprising:
identifying one or more jobs to be processed in the data processing cluster environment; determining a quality of service for each of the one or more jobs; and allocating the shared memory for each of the one or more jobs in the data processing cluster environment based on the quality of service for each of the one or more jobs. 2. The method of claim 1 wherein the data processing cluster environment comprises one or more host computing devices executing one or more virtual machines. 3. The method of claim 2 wherein the shared memory comprises cache memory allocated on each of the one or more host computing devices. 4. The method of claim 3 wherein the cache memory for a first host computing device in the data processing cluster environment comprises memory accessible by at least one process on the first host computing device and a second process within at least one virtual machine executing on the first host computing device. 5. The method of claim 4 wherein the first process comprises a process executing outside of the at least one virtual machine. 6. The method of claim 1 wherein the one or more jobs comprise one or more distributed processing jobs. 7. The method of claim 1 wherein the quality of service for each of the one or more jobs comprises a service level assigned by an administrator. 8. The method of claim 1 wherein allocating the shared memory for each of the one or more jobs in the data processing cluster environment based on the quality of service for each of the one or more jobs comprises assigning the one or more jobs to virtual machines based on the quality of service for each of the one or more jobs, wherein the virtual machines are each allocated one portion of the shared memory. 9. The method of claim 8 wherein at least one of the portions of the shared memory allocated to the virtual machines is a different size than at least one other portion of the shared memory. 10. A computer apparatus to manage shared memory in a data processing cluster environment, the computer apparatus comprising:
processing instructions that direct a computing system, when executed by the computing system, to:
identify one or more jobs to be processed in the data processing cluster environment;
determine a quality of service for each of the one or more jobs; and
allocate the shared memory for each of the one or more jobs in the data processing cluster environment based on the quality of service for each of the one or more jobs.
one or more non-transitory computer readable media that store the processing instructions. 11. The computer apparatus of claim 10 wherein the data processing cluster environment comprises one or more host computing devices executing one or more virtual machines. 12. The computer apparatus of claim 11 wherein the shared memory comprises cache memory allocated on each of the one or more host computing devices. 13. The computer apparatus of claim 12 wherein the cache memory for a first host computing device in the data processing cluster environment comprises memory accessible by at least one process on the first host computing device and a second process within at least one virtual machine executing on the first host computing device. 14. The computer apparatus of claim 13 wherein the first process comprises a process executing outside of the at least one virtual machine. 15. The computer apparatus of claim 10 wherein the one or more jobs comprise one or more distributed processing jobs. 16. The computer apparatus of claim 10 wherein the quality of service for each of the one or more jobs comprises a service level assigned by an administrator. 17. The computer apparatus of claim 10 wherein the processing instructions to allocate the shared memory for each of the one or more jobs in the data processing cluster environment based on the quality of service for each of the one or more jobs direct the computing system to assign the one or more jobs to virtual machines based on the quality of service for each of the one or more jobs, wherein the virtual machines are each allocated with a portion of the shared memory. 18. The computer apparatus of claim 17 wherein at least one of the portions of the shared memory allocated to the virtual machines is a different size than at least one other portion of the shared memory. | 2,100 |
5,170 | 14,230,222 | 2,124 | Systems and techniques are provided for determining mutual information with absolute dependency for feature selection. Items may be received from a dataset. Each item may include two random variables. A first random variable may be associated with a first range of discrete values, and a second random variable may be associated with a second range of discrete values. Mutual information between the two random variables may be determined according to one of:
I
(
X
,
Y
)
=
∑
x
∈
X
∑
y
∈
Y
p
(
x
,
y
)
·
log
(
p
(
x
,
y
)
p
(
x
)
·
p
(
y
)
)
and
I
(
X
,
Y
)
=
∑
x
∈
X
∑
y
∈
Y
p
(
y
)
·
log
(
p
(
x
,
y
)
p
(
x
)
·
p
(
y
)
)
,
I(X,Y) may be the mutual information between X and Y, x may be a value for X, y may be a value for Y, p(x,y) may be a joint probability distribution function of x and y, p(x) may be a marginal probability distribution function of x, and p(y) may be a marginal probability distribution function of y. The mutual information may be used in a machine learning system to predict a value for one of the random variables for an item for which the value is unknown. | 1. A computer-implemented method performed by a data processing apparatus, the method comprising:
receiving at least two items from a dataset, wherein each item comprises two random variables, and wherein a first of the two random variables is associated with a first range of discrete values, and a second of the two random variables is associated with a second range of discrete values; determining mutual information between the two random variables according to at least one of:
I
(
X
,
Y
)
=
∑
x
∈
X
∑
y
∈
Y
p
(
x
,
y
)
·
log
(
p
(
x
,
y
)
p
(
x
)
·
p
(
y
)
)
and
I
(
X
,
Y
)
=
∑
x
∈
X
∑
y
∈
Y
p
(
y
)
·
log
(
p
(
x
,
y
)
p
(
x
)
·
p
(
y
)
)
,
wherein I(X,Y) is the mutual information between the first random variable X and the second random variable Y, x is a value from the range of discrete values for the random variable X, y is a value from the range of values for the random variable Y, p(x,y) is a joint probability distribution function of x and y, p(x) is a marginal probability distribution function of x, and p(y) is a marginal probability distribution function of y; and
storing the mutual information. 2. The computer-implemented method of claim 1, wherein the first of the two random variables is a feature of the item, and wherein the second of the two random variables is a label for the item. 3. The computer-implemented method of claim 1, further comprising using the mutual information in a machine learning system to predict a value for at least one of the random variables for an item for which the value is unknown. 4. The computer-implemented method of claim 1, wherein the item is an account in an application ecosystem, the first of the two random variables is feature of the account, and the second of the two random variables is a label for the account. 5. The computer-implemented method of claim 4, wherein the feature of the account is one of: whether an application is installed on a device associated with the account and the number of times an application has been used by a device associated with the account, and wherein the label is one of the gender of the owner of the account and the age of the owner of the account. 6. The computer-implemented method of claim 1, wherein each of the at least two items further comprises a third random variable associated with a third range of discrete values, and further comprising:
determining the mutual information between the three random variables according to
I
(
X
,
Y
)
=
∑
z
∈
Z
∑
x
∈
X
∑
y
∈
Y
p
(
y
,
z
)
·
log
(
p
(
z
)
·
p
(
x
,
y
,
z
)
p
(
x
,
z
)
·
p
(
y
,
z
)
)
,
wherein I(X,Y) is the mutual information between the two random variables X and Y that is additional to the mutual information between the third random variable Z and the second random variable Y, z is a value from the range of discrete values for the third random variable Z, p(z) is the marginal distribution function of z, p(y,z) is the joint probability distribution function of y and z, p(x,z) is the joint probability distribution function of x and z, and p(x,y,z) is the joint probability distribution function of x, y and z; and
storing the mutual information. 7. The computer-implemented method of claim 6, wherein the third random variable is a feature of the item. 8. A computer-implemented method performed by a data processing apparatus, the method comprising:
receiving at least two items from a dataset, wherein each item comprises two random variables, and wherein a first of the two random variables is associated with a first continuous function and the second of the two random variables is associated with a second continuous function; determining mutual information between the two random variables according to at least one of:
I
(
X
,
Y
)
=
∫
Y
∫
X
f
(
x
,
y
)
·
log
(
f
(
x
,
y
)
f
(
x
)
·
f
(
y
)
)
x
y
and
I
(
X
,
Y
)
=
∫
Y
∫
X
f
(
x
)
·
log
(
f
(
x
,
y
)
f
(
x
)
·
f
(
y
)
)
x
y
,
wherein I(X,Y) is the mutual information between the two random variables X and Y, x is a value from the continuous function for the random variable X, y is a value from the continuous function for the random variable Y, f(x,y) is a joint probability density function of x and y, f(x) is a marginal probability density function of x, and f(y) is a marginal probability density function of y; and
storing the mutual information. 9. The computer-implemented method of claim 8, wherein a first of the two random variables is a feature of the item, and wherein a second of the two random variables is a label for the item. 10. The computer-implemented method of claim 8, further comprising selecting based on the determined mutual information the first random variable for use by a machine learning system in predicting a value for the second random variable for an item. 11. The computer-implemented method of claim 8, wherein each of the at least two items further comprises a third random variable associated with a third continuous function, and further comprising:
determining the mutual information between the three random variables according to
I
(
X
,
Y
)
=
∫
Z
∫
Y
∫
X
f
(
y
,
z
)
·
log
(
f
(
z
)
·
f
(
x
,
y
,
z
)
f
(
x
,
z
)
·
f
(
y
,
z
)
)
x
y
,
wherein I(X,Y) is the mutual information between the two random variables X and Y that is additional to the mutual information between the third random variable Z and the random variable Y, z is a value from the continuous third random variable Z, f(z) is the marginal density function of z, f(y,z) is the joint probability density function of y and z, f(x,z) is the joint probability density function of x and z, and f(x,y,z) is the joint probability density function of x, y and z; and
storing the mutual information. 12. The computer-implemented method of claim 13, wherein the third random variable is a feature of the item. 13. A computer-implemented method performed by a data processing apparatus, the method comprising:
receiving a dataset comprising items, wherein the items comprise features and labels, each feature comprising a value from a range of discrete values associated with the feature and each label comprising a value from a range of discrete values associated with the label, and wherein at least one feature and one label are common to at least two items in the dataset; determining mutual information between each of the labels and each of the features for the items in the dataset, wherein the mutual information is at least one of mutual information with absolute dependency, accuracy optimized mutual information with absolute dependency, and accuracy optimized adapted conditional mutual information with absolute dependency; and storing the mutual information. 14. The computer-implemented method of claim 13, wherein mutual information with absolute dependency is determined according to:
I
(
X
,
Y
)
=
∑
x
∈
X
∑
y
∈
Y
p
(
x
,
y
)
·
log
(
p
(
x
,
y
)
p
(
x
)
·
p
(
y
)
)
,
wherein I(X,Y) is the mutual information between a feature X and a label Y, x is a value from the range of discrete values for the feature X, y is a value from the range of values for the label Y, p(x,y) is a joint probability distribution function of x and y, p(x) is a marginal probability distribution function of x, and p(y) is a marginal probability distribution function of y. 15. The computer-implemented method of claim 13, wherein accuracy optimized mutual information with absolute dependency is determined according to:
I
(
X
,
Y
)
=
∑
x
∈
X
∑
y
∈
Y
p
(
y
)
·
log
(
p
(
x
,
y
)
p
(
x
)
·
p
(
y
)
)
,
wherein I(X,Y) is the mutual information between a feature X and a label Y, x is a value from the range of discrete values for the feature X, y is a value from the range of values for the label Y, p(x,y) is a joint probability distribution function of x and y, p(x) is a marginal probability distribution function of x, and p(y) is a marginal probability distribution function of y. 16. The computer-implemented method of claim 13, wherein accuracy optimized adapted conditional mutual information with absolute dependency is determined according to:
I
(
X
,
Y
)
=
∑
z
∈
Z
∑
x
∈
X
∑
y
∈
Y
p
(
y
,
z
)
·
log
(
p
(
z
)
·
p
(
x
,
y
,
z
)
p
(
x
,
z
)
·
p
(
y
,
z
)
)
,
wherein I(X,Y) is the mutual information between a feature X and a label Y that is additional to the mutual information between a feature Z and the label Y, x is a value from the range of discrete values for the feature X, y is a value from the range of values for the label Y, z is a value from the range of discrete values for the feature Z, p(z) is the marginal distribution function of z, p(y,z) is the joint probability distribution function of y and z, p(x,z) is the joint probability distribution function of x and z, and p(x,y,z) is the joint probability distribution function of x, y and z. 17. The computer-implemented method of claim 13, wherein the items are accounts in an application ecosystem. 18. The computer-implemented method of claim 17, wherein at least one of the features is whether an application is installed on a device associated with an account. 19. The computer-implemented method of claim 17, wherein at least one of the labels is the gender of the account owner. 20. The computer-implemented method of claim 17, further comprising selecting based on the determined mutual information at least one feature for use by a machine learning system in predicting a value for at least one label for an item. 21. A computer-implemented system for determining mutual information comprising:
a storage comprising mutual information and a dataset, wherein the dataset comprises items, and the items comprises features and labels, each feature and each label associated with a value; and a feature selector adapted to receive the dataset, and generate the mutual information for the features and labels of the items in the dataset according to at least one of wherein the mutual information is at least one of mutual information with absolute dependency, accuracy optimized mutual information with absolute dependency, and accuracy optimized adapted conditional mutual information with absolute dependency. 22. The computer-implemented system of claim 21, wherein the feature selector is further adapted to select based on the mutual information at least one feature for use in predicting a value for a label for an item. 23. A system comprising: one or more computers and one or more storage devices storing instructions which are operable, when executed by the one or more computers, to cause the one or more computers to perform operations comprising:
receiving at least two items from a dataset, wherein each item comprises two random variables, and wherein a first of the two random variables is associated with a first range of discrete values, and a second of the two random variables is associated with a second range of discrete values; determining mutual information between the two random variables according to at least one of:
I
(
X
,
Y
)
=
∑
x
∈
X
∑
y
∈
Y
p
(
x
,
y
)
·
log
(
p
(
x
,
y
)
p
(
x
)
·
p
(
y
)
)
and
I
(
X
,
Y
)
=
∑
x
∈
X
∑
y
∈
Y
p
(
y
)
·
log
(
p
(
x
,
y
)
p
(
x
)
·
p
(
y
)
)
,
wherein I(X,Y) is the mutual information between the first random variable X and the second random variable Y, x is a value from the range of discrete values for the random variable X, y is a value from the range of values for the random variable Y, p(x,y) is a joint probability distribution function of x and y, p(x) is a marginal probability distribution function of x, and p(y) is a marginal probability distribution function of y; and
storing the mutual information. 24. The system of claim 23, wherein each of the at least two items further comprises a third random variable associated with a third range of discrete values, and wherein the instructions further cause the one more computers to perform operations further comprising:
determining the mutual information between the three random variables according to
I
(
X
,
Y
)
=
∑
z
∈
Z
∑
x
∈
X
∑
y
∈
Y
p
(
y
,
z
)
·
log
(
p
(
z
)
·
p
(
x
,
y
,
z
)
p
(
x
,
z
)
·
p
(
y
,
z
)
)
,
wherein I(X,Y) is the mutual information between the two random variables X and Y that is additional to the mutual information between the third random variable Z and the second random variable Y, z is a value from the range of discrete values for the third random variable Z, p(z) is the marginal distribution function of z, p(y,z) is the joint probability distribution function of y and z, p(x,z) is the joint probability distribution function of x and z, and p(x,y,z) is the joint probability distribution function of x, y and z; and
storing the mutual information. | Systems and techniques are provided for determining mutual information with absolute dependency for feature selection. Items may be received from a dataset. Each item may include two random variables. A first random variable may be associated with a first range of discrete values, and a second random variable may be associated with a second range of discrete values. Mutual information between the two random variables may be determined according to one of:
I
(
X
,
Y
)
=
∑
x
∈
X
∑
y
∈
Y
p
(
x
,
y
)
·
log
(
p
(
x
,
y
)
p
(
x
)
·
p
(
y
)
)
and
I
(
X
,
Y
)
=
∑
x
∈
X
∑
y
∈
Y
p
(
y
)
·
log
(
p
(
x
,
y
)
p
(
x
)
·
p
(
y
)
)
,
I(X,Y) may be the mutual information between X and Y, x may be a value for X, y may be a value for Y, p(x,y) may be a joint probability distribution function of x and y, p(x) may be a marginal probability distribution function of x, and p(y) may be a marginal probability distribution function of y. The mutual information may be used in a machine learning system to predict a value for one of the random variables for an item for which the value is unknown.1. A computer-implemented method performed by a data processing apparatus, the method comprising:
receiving at least two items from a dataset, wherein each item comprises two random variables, and wherein a first of the two random variables is associated with a first range of discrete values, and a second of the two random variables is associated with a second range of discrete values; determining mutual information between the two random variables according to at least one of:
I
(
X
,
Y
)
=
∑
x
∈
X
∑
y
∈
Y
p
(
x
,
y
)
·
log
(
p
(
x
,
y
)
p
(
x
)
·
p
(
y
)
)
and
I
(
X
,
Y
)
=
∑
x
∈
X
∑
y
∈
Y
p
(
y
)
·
log
(
p
(
x
,
y
)
p
(
x
)
·
p
(
y
)
)
,
wherein I(X,Y) is the mutual information between the first random variable X and the second random variable Y, x is a value from the range of discrete values for the random variable X, y is a value from the range of values for the random variable Y, p(x,y) is a joint probability distribution function of x and y, p(x) is a marginal probability distribution function of x, and p(y) is a marginal probability distribution function of y; and
storing the mutual information. 2. The computer-implemented method of claim 1, wherein the first of the two random variables is a feature of the item, and wherein the second of the two random variables is a label for the item. 3. The computer-implemented method of claim 1, further comprising using the mutual information in a machine learning system to predict a value for at least one of the random variables for an item for which the value is unknown. 4. The computer-implemented method of claim 1, wherein the item is an account in an application ecosystem, the first of the two random variables is feature of the account, and the second of the two random variables is a label for the account. 5. The computer-implemented method of claim 4, wherein the feature of the account is one of: whether an application is installed on a device associated with the account and the number of times an application has been used by a device associated with the account, and wherein the label is one of the gender of the owner of the account and the age of the owner of the account. 6. The computer-implemented method of claim 1, wherein each of the at least two items further comprises a third random variable associated with a third range of discrete values, and further comprising:
determining the mutual information between the three random variables according to
I
(
X
,
Y
)
=
∑
z
∈
Z
∑
x
∈
X
∑
y
∈
Y
p
(
y
,
z
)
·
log
(
p
(
z
)
·
p
(
x
,
y
,
z
)
p
(
x
,
z
)
·
p
(
y
,
z
)
)
,
wherein I(X,Y) is the mutual information between the two random variables X and Y that is additional to the mutual information between the third random variable Z and the second random variable Y, z is a value from the range of discrete values for the third random variable Z, p(z) is the marginal distribution function of z, p(y,z) is the joint probability distribution function of y and z, p(x,z) is the joint probability distribution function of x and z, and p(x,y,z) is the joint probability distribution function of x, y and z; and
storing the mutual information. 7. The computer-implemented method of claim 6, wherein the third random variable is a feature of the item. 8. A computer-implemented method performed by a data processing apparatus, the method comprising:
receiving at least two items from a dataset, wherein each item comprises two random variables, and wherein a first of the two random variables is associated with a first continuous function and the second of the two random variables is associated with a second continuous function; determining mutual information between the two random variables according to at least one of:
I
(
X
,
Y
)
=
∫
Y
∫
X
f
(
x
,
y
)
·
log
(
f
(
x
,
y
)
f
(
x
)
·
f
(
y
)
)
x
y
and
I
(
X
,
Y
)
=
∫
Y
∫
X
f
(
x
)
·
log
(
f
(
x
,
y
)
f
(
x
)
·
f
(
y
)
)
x
y
,
wherein I(X,Y) is the mutual information between the two random variables X and Y, x is a value from the continuous function for the random variable X, y is a value from the continuous function for the random variable Y, f(x,y) is a joint probability density function of x and y, f(x) is a marginal probability density function of x, and f(y) is a marginal probability density function of y; and
storing the mutual information. 9. The computer-implemented method of claim 8, wherein a first of the two random variables is a feature of the item, and wherein a second of the two random variables is a label for the item. 10. The computer-implemented method of claim 8, further comprising selecting based on the determined mutual information the first random variable for use by a machine learning system in predicting a value for the second random variable for an item. 11. The computer-implemented method of claim 8, wherein each of the at least two items further comprises a third random variable associated with a third continuous function, and further comprising:
determining the mutual information between the three random variables according to
I
(
X
,
Y
)
=
∫
Z
∫
Y
∫
X
f
(
y
,
z
)
·
log
(
f
(
z
)
·
f
(
x
,
y
,
z
)
f
(
x
,
z
)
·
f
(
y
,
z
)
)
x
y
,
wherein I(X,Y) is the mutual information between the two random variables X and Y that is additional to the mutual information between the third random variable Z and the random variable Y, z is a value from the continuous third random variable Z, f(z) is the marginal density function of z, f(y,z) is the joint probability density function of y and z, f(x,z) is the joint probability density function of x and z, and f(x,y,z) is the joint probability density function of x, y and z; and
storing the mutual information. 12. The computer-implemented method of claim 13, wherein the third random variable is a feature of the item. 13. A computer-implemented method performed by a data processing apparatus, the method comprising:
receiving a dataset comprising items, wherein the items comprise features and labels, each feature comprising a value from a range of discrete values associated with the feature and each label comprising a value from a range of discrete values associated with the label, and wherein at least one feature and one label are common to at least two items in the dataset; determining mutual information between each of the labels and each of the features for the items in the dataset, wherein the mutual information is at least one of mutual information with absolute dependency, accuracy optimized mutual information with absolute dependency, and accuracy optimized adapted conditional mutual information with absolute dependency; and storing the mutual information. 14. The computer-implemented method of claim 13, wherein mutual information with absolute dependency is determined according to:
I
(
X
,
Y
)
=
∑
x
∈
X
∑
y
∈
Y
p
(
x
,
y
)
·
log
(
p
(
x
,
y
)
p
(
x
)
·
p
(
y
)
)
,
wherein I(X,Y) is the mutual information between a feature X and a label Y, x is a value from the range of discrete values for the feature X, y is a value from the range of values for the label Y, p(x,y) is a joint probability distribution function of x and y, p(x) is a marginal probability distribution function of x, and p(y) is a marginal probability distribution function of y. 15. The computer-implemented method of claim 13, wherein accuracy optimized mutual information with absolute dependency is determined according to:
I
(
X
,
Y
)
=
∑
x
∈
X
∑
y
∈
Y
p
(
y
)
·
log
(
p
(
x
,
y
)
p
(
x
)
·
p
(
y
)
)
,
wherein I(X,Y) is the mutual information between a feature X and a label Y, x is a value from the range of discrete values for the feature X, y is a value from the range of values for the label Y, p(x,y) is a joint probability distribution function of x and y, p(x) is a marginal probability distribution function of x, and p(y) is a marginal probability distribution function of y. 16. The computer-implemented method of claim 13, wherein accuracy optimized adapted conditional mutual information with absolute dependency is determined according to:
I
(
X
,
Y
)
=
∑
z
∈
Z
∑
x
∈
X
∑
y
∈
Y
p
(
y
,
z
)
·
log
(
p
(
z
)
·
p
(
x
,
y
,
z
)
p
(
x
,
z
)
·
p
(
y
,
z
)
)
,
wherein I(X,Y) is the mutual information between a feature X and a label Y that is additional to the mutual information between a feature Z and the label Y, x is a value from the range of discrete values for the feature X, y is a value from the range of values for the label Y, z is a value from the range of discrete values for the feature Z, p(z) is the marginal distribution function of z, p(y,z) is the joint probability distribution function of y and z, p(x,z) is the joint probability distribution function of x and z, and p(x,y,z) is the joint probability distribution function of x, y and z. 17. The computer-implemented method of claim 13, wherein the items are accounts in an application ecosystem. 18. The computer-implemented method of claim 17, wherein at least one of the features is whether an application is installed on a device associated with an account. 19. The computer-implemented method of claim 17, wherein at least one of the labels is the gender of the account owner. 20. The computer-implemented method of claim 17, further comprising selecting based on the determined mutual information at least one feature for use by a machine learning system in predicting a value for at least one label for an item. 21. A computer-implemented system for determining mutual information comprising:
a storage comprising mutual information and a dataset, wherein the dataset comprises items, and the items comprises features and labels, each feature and each label associated with a value; and a feature selector adapted to receive the dataset, and generate the mutual information for the features and labels of the items in the dataset according to at least one of wherein the mutual information is at least one of mutual information with absolute dependency, accuracy optimized mutual information with absolute dependency, and accuracy optimized adapted conditional mutual information with absolute dependency. 22. The computer-implemented system of claim 21, wherein the feature selector is further adapted to select based on the mutual information at least one feature for use in predicting a value for a label for an item. 23. A system comprising: one or more computers and one or more storage devices storing instructions which are operable, when executed by the one or more computers, to cause the one or more computers to perform operations comprising:
receiving at least two items from a dataset, wherein each item comprises two random variables, and wherein a first of the two random variables is associated with a first range of discrete values, and a second of the two random variables is associated with a second range of discrete values; determining mutual information between the two random variables according to at least one of:
I
(
X
,
Y
)
=
∑
x
∈
X
∑
y
∈
Y
p
(
x
,
y
)
·
log
(
p
(
x
,
y
)
p
(
x
)
·
p
(
y
)
)
and
I
(
X
,
Y
)
=
∑
x
∈
X
∑
y
∈
Y
p
(
y
)
·
log
(
p
(
x
,
y
)
p
(
x
)
·
p
(
y
)
)
,
wherein I(X,Y) is the mutual information between the first random variable X and the second random variable Y, x is a value from the range of discrete values for the random variable X, y is a value from the range of values for the random variable Y, p(x,y) is a joint probability distribution function of x and y, p(x) is a marginal probability distribution function of x, and p(y) is a marginal probability distribution function of y; and
storing the mutual information. 24. The system of claim 23, wherein each of the at least two items further comprises a third random variable associated with a third range of discrete values, and wherein the instructions further cause the one more computers to perform operations further comprising:
determining the mutual information between the three random variables according to
I
(
X
,
Y
)
=
∑
z
∈
Z
∑
x
∈
X
∑
y
∈
Y
p
(
y
,
z
)
·
log
(
p
(
z
)
·
p
(
x
,
y
,
z
)
p
(
x
,
z
)
·
p
(
y
,
z
)
)
,
wherein I(X,Y) is the mutual information between the two random variables X and Y that is additional to the mutual information between the third random variable Z and the second random variable Y, z is a value from the range of discrete values for the third random variable Z, p(z) is the marginal distribution function of z, p(y,z) is the joint probability distribution function of y and z, p(x,z) is the joint probability distribution function of x and z, and p(x,y,z) is the joint probability distribution function of x, y and z; and
storing the mutual information. | 2,100 |
5,171 | 14,914,695 | 2,129 | A method and a device for verifying one or more safety volumes for a movable mechanical unit positioned in an environment, wherein a world-coordinate system is defined in relation to the mechanical unit and in relation to the environment of the mechanical unit. The method includes storing a description of one or more safety volumes defined in relation to the world-coordinate system, and repeatedly determining position and orientation of a portable display unit in relation to the world-coordinate system, determining a graphical representation of the safety volumes based on the description of the safety volumes and the position and orientation of the portable display unit, overlaying the graphical representation of the safety volumes on a view of the real mechanical unit and its environment to provide a composited augmented reality image, and displaying the augmented reality image on the portable display unit. | 1. A method for verifying one or more safety volumes for a movable mechanical unit with respect to an environment of the mechanical unit, wherein a world-coordinate system is defined in relation to the mechanical unit and in relation to the environment of the mechanical unit, characterized in that the method comprises:
storing a description of one or more safety volumes defined in relation to the world-coordinate system, and repeatedly: determining position and orientation of a portable display unit in relation to the world-coordinate system, determining a graphical representation of the safety volumes based on the description of the safety volumes and the position and orientation of the portable display unit, overlaying the graphical representation of the safety volumes on a view of the real environment of the mechanical unit to provide a composited augmented reality image, and displaying the augmented reality image on the portable display unit. 2. The method according to claim 1, wherein at least one of said safety volumes is a fixed safety volume having a fixed position in relation to the world-coordinate system. 3. The method according to claim 1, wherein the method comprises verifying the fixed safety volume based on the displayed augmented reality image and modifying the fixed safety volume upon detecting an incorrect safety volume. 4. The method according to claim 2, wherein the method comprises detecting user interactions with the graphical representation of the fixed safety volume, and modifying the description of the fixed safety volume based on said detected user interactions. 5. The method according to claim 1, wherein at least one of said safety volumes is a moving safety volume having a size and position that depends on the velocity and position of a critical part of the mechanical unit, and the method comprises repeatedly:
obtaining position and velocity of the critical part of the mechanical unit, determining the moving safety volume for the critical part of the mechanical unit based on the position and velocity of the critical part, and storing a description of the moving safety volume defined in relation to the world-coordinate system. 6. The method according to claim 5, wherein the method comprises:
simulating a programmed movement path for the mechanical unit, determining position and velocity of the critical part along the movement path based on the simulation, and determining said moving safety volume based on the determined position and velocity of the critical part. 7. The method according to claim 5, wherein the method comprises:
calculating a safety distance for said critical part based on the velocity and load of the critical part, and determining said moving safety volume based on the calculated safety distance. 8. The method according to claim 1, wherein at least one of said safety volumes is a fixed safety volume and at least one of said safety volumes is a moving safety volume, and the method comprises repeatedly:
determining a graphical representation of each of the fixed safety volume and the moving safety volume based on the descriptions of the safety volumes and the position and orientation of the portable display unit, overlaying the graphical representations of the fixed safety volume and the moving safety volume on said real view of the environment to provide a composited augmented reality image, and displaying the augmented reality image on the portable display unit. 9. A device for verifying one or more safety volumes for at least one movable mechanical unit positioned in an environment, wherein a world coordinate system is defined in relation to the mechanical unit and in relation to the environment of the mechanical unit, characterized in that the device comprises:
a storage unit for storing descriptions of the safety volumes. a portable display unit, a position detector configured to continuously determine position and orientation of the portable display unit in relation to the world coordinate system, a graphical unit configured to determine graphical representations of the safety volumes based on the stored descriptions of the safety volumes and the position and orientation of the portable display unit, and an augmented reality unit configured to overlay the graphical representations of the safety volumes on a view of the real environment of mechanical unit to provide a composited augmented reality image, and to display the augmented reality image on the portable display unit. 10. The device according to claim 9, wherein the device comprises a description generator configured to obtain positions and velocities of a critical part of the mechanical unit, to determine moving safety volumes for the critical part of the mechanical unit based on the positions and velocities of the critical part, and to store a description of the moving safety volume defined in relation to the world coordinate system in said storage unit. 11. The device according to claim 10, wherein the device comprises a simulation unit configured to simulate a programmed movement path for the mechanical unit, and to determine the position and velocity of the critical part during execution of the movement path based on the simulation, and said description generator is configured to obtain the position and velocity of the critical part from the simulation unit and to determine said moving safety volume based on the obtained position and velocity. 12. The device according to claim 10, wherein said storage unit is configured to store descriptions of fixed safety volumes having fixed position in relation to the world coordinate system, said graphical unit is configured to determine graphical representations of the fixed safety volumes and the moving safety volumes based on the descriptions of the safety volumes and the position and orientation of the portable display unit, and the augmented reality unit is configured to overlay the graphical representations of the fixed and moving safety volumes on the view of the real mechanical unit and its environment to provide a composited augmented reality image. 13. The device according to claim 9, wherein said storage unit is configured to store descriptions of fixed safety volumes having fixed position in relation to the world coordinate system, and the device comprises an interaction unit configured to detect user interactions with the graphical representations of the fixed safety volumes, and a modification unit configured to modify the stored description of the fixed safety volumes based on the detected user interactions. 14. The device according to claim 9, wherein the device comprises a camera configured to capture an image of the mechanical unit and its environment, and the augmented reality unit is configured to register the graphical representations of the safety volumes on the image of the real mechanical unit and its environment to provide a composited augmented reality image. 15. Use of the device according to claim 9 for verification of safety volumes for an industrial robot. 16. The method according to claim 2, wherein the method comprises verifying the fixed safety volume based on the displayed augmented reality image and modifying the fixed safety volume upon detecting an incorrect safety volume. 17. The method according to claim 3, wherein the method comprises detecting user interactions with the graphical representation of the fixed safety volume, and modifying the description of the fixed safety volume based on said detected user interactions. 18. The method according to claim 6, wherein the method comprises:
calculating a safety distance for said critical part based on the velocity and load of the critical part, and determining said moving safety volume based on the calculated safety distance. 19. The device according to claim 11, wherein said storage unit is configured to store descriptions of fixed safety volumes having fixed position in relation to the world coordinate system, said graphical unit is configured to determine graphical representations of the fixed safety volumes and the moving safety volumes based on the descriptions of the safety volumes and the position and orientation of the portable display unit, and the augmented reality unit is configured to overlay the graphical representations of the fixed and moving safety volumes on the view of the real mechanical unit and its environment to provide a composited augmented reality image. | A method and a device for verifying one or more safety volumes for a movable mechanical unit positioned in an environment, wherein a world-coordinate system is defined in relation to the mechanical unit and in relation to the environment of the mechanical unit. The method includes storing a description of one or more safety volumes defined in relation to the world-coordinate system, and repeatedly determining position and orientation of a portable display unit in relation to the world-coordinate system, determining a graphical representation of the safety volumes based on the description of the safety volumes and the position and orientation of the portable display unit, overlaying the graphical representation of the safety volumes on a view of the real mechanical unit and its environment to provide a composited augmented reality image, and displaying the augmented reality image on the portable display unit.1. A method for verifying one or more safety volumes for a movable mechanical unit with respect to an environment of the mechanical unit, wherein a world-coordinate system is defined in relation to the mechanical unit and in relation to the environment of the mechanical unit, characterized in that the method comprises:
storing a description of one or more safety volumes defined in relation to the world-coordinate system, and repeatedly: determining position and orientation of a portable display unit in relation to the world-coordinate system, determining a graphical representation of the safety volumes based on the description of the safety volumes and the position and orientation of the portable display unit, overlaying the graphical representation of the safety volumes on a view of the real environment of the mechanical unit to provide a composited augmented reality image, and displaying the augmented reality image on the portable display unit. 2. The method according to claim 1, wherein at least one of said safety volumes is a fixed safety volume having a fixed position in relation to the world-coordinate system. 3. The method according to claim 1, wherein the method comprises verifying the fixed safety volume based on the displayed augmented reality image and modifying the fixed safety volume upon detecting an incorrect safety volume. 4. The method according to claim 2, wherein the method comprises detecting user interactions with the graphical representation of the fixed safety volume, and modifying the description of the fixed safety volume based on said detected user interactions. 5. The method according to claim 1, wherein at least one of said safety volumes is a moving safety volume having a size and position that depends on the velocity and position of a critical part of the mechanical unit, and the method comprises repeatedly:
obtaining position and velocity of the critical part of the mechanical unit, determining the moving safety volume for the critical part of the mechanical unit based on the position and velocity of the critical part, and storing a description of the moving safety volume defined in relation to the world-coordinate system. 6. The method according to claim 5, wherein the method comprises:
simulating a programmed movement path for the mechanical unit, determining position and velocity of the critical part along the movement path based on the simulation, and determining said moving safety volume based on the determined position and velocity of the critical part. 7. The method according to claim 5, wherein the method comprises:
calculating a safety distance for said critical part based on the velocity and load of the critical part, and determining said moving safety volume based on the calculated safety distance. 8. The method according to claim 1, wherein at least one of said safety volumes is a fixed safety volume and at least one of said safety volumes is a moving safety volume, and the method comprises repeatedly:
determining a graphical representation of each of the fixed safety volume and the moving safety volume based on the descriptions of the safety volumes and the position and orientation of the portable display unit, overlaying the graphical representations of the fixed safety volume and the moving safety volume on said real view of the environment to provide a composited augmented reality image, and displaying the augmented reality image on the portable display unit. 9. A device for verifying one or more safety volumes for at least one movable mechanical unit positioned in an environment, wherein a world coordinate system is defined in relation to the mechanical unit and in relation to the environment of the mechanical unit, characterized in that the device comprises:
a storage unit for storing descriptions of the safety volumes. a portable display unit, a position detector configured to continuously determine position and orientation of the portable display unit in relation to the world coordinate system, a graphical unit configured to determine graphical representations of the safety volumes based on the stored descriptions of the safety volumes and the position and orientation of the portable display unit, and an augmented reality unit configured to overlay the graphical representations of the safety volumes on a view of the real environment of mechanical unit to provide a composited augmented reality image, and to display the augmented reality image on the portable display unit. 10. The device according to claim 9, wherein the device comprises a description generator configured to obtain positions and velocities of a critical part of the mechanical unit, to determine moving safety volumes for the critical part of the mechanical unit based on the positions and velocities of the critical part, and to store a description of the moving safety volume defined in relation to the world coordinate system in said storage unit. 11. The device according to claim 10, wherein the device comprises a simulation unit configured to simulate a programmed movement path for the mechanical unit, and to determine the position and velocity of the critical part during execution of the movement path based on the simulation, and said description generator is configured to obtain the position and velocity of the critical part from the simulation unit and to determine said moving safety volume based on the obtained position and velocity. 12. The device according to claim 10, wherein said storage unit is configured to store descriptions of fixed safety volumes having fixed position in relation to the world coordinate system, said graphical unit is configured to determine graphical representations of the fixed safety volumes and the moving safety volumes based on the descriptions of the safety volumes and the position and orientation of the portable display unit, and the augmented reality unit is configured to overlay the graphical representations of the fixed and moving safety volumes on the view of the real mechanical unit and its environment to provide a composited augmented reality image. 13. The device according to claim 9, wherein said storage unit is configured to store descriptions of fixed safety volumes having fixed position in relation to the world coordinate system, and the device comprises an interaction unit configured to detect user interactions with the graphical representations of the fixed safety volumes, and a modification unit configured to modify the stored description of the fixed safety volumes based on the detected user interactions. 14. The device according to claim 9, wherein the device comprises a camera configured to capture an image of the mechanical unit and its environment, and the augmented reality unit is configured to register the graphical representations of the safety volumes on the image of the real mechanical unit and its environment to provide a composited augmented reality image. 15. Use of the device according to claim 9 for verification of safety volumes for an industrial robot. 16. The method according to claim 2, wherein the method comprises verifying the fixed safety volume based on the displayed augmented reality image and modifying the fixed safety volume upon detecting an incorrect safety volume. 17. The method according to claim 3, wherein the method comprises detecting user interactions with the graphical representation of the fixed safety volume, and modifying the description of the fixed safety volume based on said detected user interactions. 18. The method according to claim 6, wherein the method comprises:
calculating a safety distance for said critical part based on the velocity and load of the critical part, and determining said moving safety volume based on the calculated safety distance. 19. The device according to claim 11, wherein said storage unit is configured to store descriptions of fixed safety volumes having fixed position in relation to the world coordinate system, said graphical unit is configured to determine graphical representations of the fixed safety volumes and the moving safety volumes based on the descriptions of the safety volumes and the position and orientation of the portable display unit, and the augmented reality unit is configured to overlay the graphical representations of the fixed and moving safety volumes on the view of the real mechanical unit and its environment to provide a composited augmented reality image. | 2,100 |
5,172 | 13,329,852 | 2,129 | A generalized approach to particle interaction can confer advantages over previously described method in terms of one or more of communications bandwidth and latency and memory access characteristics. These generalizations can involve one or more of at least spatial decomposition, import region rounding, and multiple zone communication scheduling. An architecture for computation of particle interactions makes use various forms of parallelism. In one implementation, the parallelism involves using multiple computation nodes arranged according to a geometric partitioning of a simulation volume. | 1. A method for performing computations associated with bodies located in a computation region, the method comprising:
for each subset of multiple subsets of the computations, performing the computations in that subset of computations, including accepting data of bodies located in each of a plurality of import regions associated with the subset of the computations, the import regions being parts of the computation region; for each combination of a predetermined plurality of combinations of multiple of the import regions, performing computations associated with sets of bodies, wherein for each of the sets of bodies, at least one body of the set is located in each import region of the combination. 2. The method of claim 1, wherein at least some of the combinations of multiple of the import regions each consists of a pair of the import regions. 3. The method of claim 1, wherein each of the subsets of computations is performed on a different node of a multiple node computing system. 4. The method of claim 3, wherein accepting the data for bodies from the import regions includes accepting data from a communication medium coupling at least two of the nodes of the computing system. 5. The method of claim 1, wherein each of the subsets of computations is performed in sequence on a computing system. 6. The method of claim 5, wherein the subsets of computations are selected according to memory limitations of the computing system. 7. The method of claim 1, further comprising associating each of the subsets of computations with an iteration in an iterative sequence of computation phases. 8. The method of claim 7, wherein accepting the data for bodies from the import regions includes loading the data into a local memory associated with a processor on which the computations for the iteration are performed. 9. The method of claim 1, wherein each of the subsets of computations is associated with a separate sub-region of the computation region. 10. The method of claim 9, wherein for each of the subsets of computations, the import regions are separate from the sub-region of the computation region with which the subset is associated. 11. The method of claim 9, wherein the sub-regions associated with the multiple subsets of computations form a partition of the computation region. 12. The method of claim 9, wherein the sub-regions form a regular partition of the computation region. 13. The method of claim 12, wherein the sub-regions form a parallelepiped partition of the computation region. 14. The method of claim 9, wherein performing the computations in each subset of computations further includes:
performing computations associated with sets of bodies, for each of the sets each body of the set being located in the sub-region associated with the subset of computations; and performing computations associated with sets of bodies, for each of the sets one body being located in the sub-region associated with the subset of computations and the other bodies of the set being located in the import regions associated with the subset of computations. 15. The method of claim 14, wherein the performing of computations associated with sets of bodies in which each body of the set of bodies is located in the sub-region associated with the subset of computations is performed while accepting the data for bodies from the import regions. 16. The method of claim 9, wherein performing the computations in each subset of computations further includes:
performing computations associated with sets of bodies, each body of the set being located in one of the import regions associated with the subset of computations, and no body of the set being located in the sub-region associated with the subset of computations. 17. The method of claim 1, wherein performing the computations in each subset of computations includes applying a schedule of computations specified according to the import regions. 18. The method of claim 1, wherein each of the computations in the set of computations includes a computation of data characterizing an interaction of the set of bodies associated with that computation. 19. The method of claim 1, wherein each of the computations in the set of computations includes recording in a data structure an identification of the set of bodies associated with that computation. 20. The method of claim 19, further comprising performing computations of data characterizing an interaction of each of the sets of bodies recorded in the data structure. 21. The method of claim 1, wherein in performing the computations in all the subsets of computations, for any set of bodies, a computation for that set of bodies is performed in at most one of the subsets. 22. The method of claim 1, wherein for at least some of the selected plurality of combinations of multiple import regions, a computation is performed for every combination of one body in each of the multiple import regions. 23. The method of claim 22, wherein in performing the computations in all the subsets of computations, for any set of bodies, a computation for that set of bodies is performed in at most one of the subsets. 24. The method of claim 1, wherein the steps are repeated for each of a series of time steps, the computations performed at each time step being used to update locations of the bodies in the computation region for use in a subsequent time step. 25. A method for performing a set of computations associated with bodies located in a computation region, each of the computations in the set of computations being associated with a pair of the bodies, the method comprising:
accepting data for bodies located in a neighborhood, the neighborhood comprising a plurality of zones; and performing computations associated with pair of bodies, the bodies of the pair being located in different of the zones; wherein a spatial extent of at least one of the zones is determined to eliminate at least some points in one of the zones that are further away than a minimum distance from all points in another of the zones. 26. The method of claim 25, wherein the spatial extent is determined according to a threshold distance between pairs of bodies for which computations are to be performed. 27. The method of claim 25, wherein a spatial boundary of one of the plurality of zones is determined according to a minimum distance to points within another of the plurality of zones. 28. The method of claim 25, wherein at least one of the plurality of zones includes a non-planar boundary. 29. The method of claim 25, wherein the computation region is partitioned into regular regions, and at least one of the plurality of zones includes some but not all of one of the regular regions. 30. The method of claim 25, wherein the computation region is partitioned into regular regions and each region is associated with a subset of the computations. 31. The method of claim 30, wherein the neighborhood corresponds to one of the regular regions. 32. The method of claim 31, wherein each regular region comprises one of the zones of the neighborhood corresponding to the regular region. 33. The method of claim 31, wherein each regular region is associated with a corresponding computation unit, and wherein accepting the data for bodies in the neighborhood corresponding to the regular region comprises accepting data for one or more of the zones of the neighborhood from another computation unit. 34. A method for performing a set of computations associated with bodies located in a computation region, the computation region being partitioned into regular regions, each of the computations in the set of computations being associated with a set of the bodies, the method comprising:
for at least some of the regular regions, accepting data for bodies located in a neighborhood of the regular region, the neighborhood comprising a plurality of zones; wherein the plurality of zones includes at least one zone that is not contiguous with parts being distributed in at least two dimensions of the computation region. 35. The method of claim 34, wherein the plurality of zones includes at least one zone that is not contiguous with parts being distributed in at least three dimensions of the computation region. 36. The method of claim 34, wherein each computation in the set of computations is associated with a pair of bodies. 37. The method of claim 36, wherein the neighborhood consists of two zones, and for each of the pairs of bodies, one body of the pair is located in a different one of the two zones. 38. The method of claim 34, wherein the plurality of zones includes at least one contiguous zone. 39. The method of claim 38, wherein the contiguous zone is contiguous with the regular region. 40. The method of claim 34, wherein at least two of the zones are elongated in one dimension of the computation region. 41. The method of claim 40, wherein at least one of the zones extends over at least one other dimension of the computation region. 42. A method for performing computations associated with bodies located in a computation region using a processor coupled to a local memory, the method comprising:
iteratively performing multiple subsets of the computations, in each iteration performing one subset of the multiple subsets of computations, including loading into the local memory data of bodies located in each of a plurality of import regions associated with the subset of computations, the import regions being parts of the computation region; performing on the processor computations associated with pairs of bodies, wherein for each pair, one body of the pair is located in a first of the import regions and the other body of the pair is located in a second of the import regions. 43. The method of claim 42 wherein the performing the computations associated with pairs of bodies is performed for each of a predetermined plurality of combinations of a first and a second of the import regions. 44. The method of claim 42 wherein performing the computations associate with the pairs of bodies includes performing computations associated with substantially all pairs of bodies in which one body of the pair is located in the first of the import regions and the other body of the pair is located in the second of the import regions. 45. The method of claim 42 wherein the subsets of computations are selected according to a limitation of the local memory. 46. A method for performing computations associated with bodies located in a computation region, the method comprising:
for each of a plurality of sub-regions of the computation region, maintaining data for bodies in that sub-region in a corresponding separate storage area, wherein the sub-regions overlap such that at least some bodies have data maintained in multiple of the storage areas; and for each of the sub-regions, accessing the data for bodies in that sub-region from the corresponding storage area and performing computations associated with sets of two or more of the bodies in that sub-region. 47. The method of claim 46 wherein each of the separate storage areas is associated with a node of a multiple node computing system. 48. The method of claim 47 wherein performing the computations associated with pairs of the bodies in the sub-region is performed on the node associated with the storage area corresponding to the sub-region. 49. The method of claim 47 wherein each of the separate storage areas is associated with a different node. 50. The method of claim 46 wherein each of the sub-regions includes a home region and a region extending at least a predetermined distance from the home region. 51. The method of claim 50 wherein the home regions form a partition of the computation region. 52. The method of claim 50 wherein the predetermined distance is at least half an interaction radius for pairwise interactions between bodies. 53. The method of claim 52 wherein performing the computations associated with the pairs of bodies in the sub-region includes performing computations for pairs of bodies for which a midpoint of locations of the bodies is within the home region for the sub-region. 54-130. (canceled) 131. A method of simulating physical interactions between bodies having locations in a computation region, said method comprising:
dividing said computation region into a plurality of import regions, each of which contains bodies; selecting, from said import regions, a first import region having a first body set and a second import region having a second body set; identifying combinations of bodies, each of said combinations including a body from said first body set and a body from said second body set; from said identified combinations,
identifying a first combination set, wherein bodies associated with each combination in said first combination set satisfy a condition; and
identifying a second combination set, wherein bodies associated with each combination in said second combination set fail to satisfy said condition;
for all of said identified combinations, other than said combinations in said first combination set, performing computations for simulating interactions between bodies in said combination, whereby computations to simulate interactions between bodies in combinations that satisfy said condition are avoided and only computations to simulate interactions between bodies in combinations that fail to satisfy said condition are carried out. 132. A method of simulating physical interactions between bodies having locations in a computation region, said method comprising:
dividing said computation region into a plurality of import regions, each of which contains bodies; selecting, from said import regions, a first import region having a first body set and a second import region having a second body set; identifying combinations of bodies, each of said combinations including a body from said first body set and a body from said second body set; from said identified combinations,
identifying a first combination set, wherein bodies associated with each combination in said first combination set satisfy a condition; and
identifying a second combination set, wherein bodies associated with each combination in said second combination set fail to satisfy said condition;
performing computations for simulating interactions between bodies in said identified combinations, wherein performing said computations includes
performing computations for simulating interactions between bodies in said combinations from said second combination set; and
omitting performance of computations for simulating interactions between bodies in said combinations from said first combination set;
whereby computations to simulate interactions between bodies in combinations that satisfy said condition are avoided and only computations to simulate interactions between bodies in combinations that fail to satisfy said condition are carried out. | A generalized approach to particle interaction can confer advantages over previously described method in terms of one or more of communications bandwidth and latency and memory access characteristics. These generalizations can involve one or more of at least spatial decomposition, import region rounding, and multiple zone communication scheduling. An architecture for computation of particle interactions makes use various forms of parallelism. In one implementation, the parallelism involves using multiple computation nodes arranged according to a geometric partitioning of a simulation volume.1. A method for performing computations associated with bodies located in a computation region, the method comprising:
for each subset of multiple subsets of the computations, performing the computations in that subset of computations, including accepting data of bodies located in each of a plurality of import regions associated with the subset of the computations, the import regions being parts of the computation region; for each combination of a predetermined plurality of combinations of multiple of the import regions, performing computations associated with sets of bodies, wherein for each of the sets of bodies, at least one body of the set is located in each import region of the combination. 2. The method of claim 1, wherein at least some of the combinations of multiple of the import regions each consists of a pair of the import regions. 3. The method of claim 1, wherein each of the subsets of computations is performed on a different node of a multiple node computing system. 4. The method of claim 3, wherein accepting the data for bodies from the import regions includes accepting data from a communication medium coupling at least two of the nodes of the computing system. 5. The method of claim 1, wherein each of the subsets of computations is performed in sequence on a computing system. 6. The method of claim 5, wherein the subsets of computations are selected according to memory limitations of the computing system. 7. The method of claim 1, further comprising associating each of the subsets of computations with an iteration in an iterative sequence of computation phases. 8. The method of claim 7, wherein accepting the data for bodies from the import regions includes loading the data into a local memory associated with a processor on which the computations for the iteration are performed. 9. The method of claim 1, wherein each of the subsets of computations is associated with a separate sub-region of the computation region. 10. The method of claim 9, wherein for each of the subsets of computations, the import regions are separate from the sub-region of the computation region with which the subset is associated. 11. The method of claim 9, wherein the sub-regions associated with the multiple subsets of computations form a partition of the computation region. 12. The method of claim 9, wherein the sub-regions form a regular partition of the computation region. 13. The method of claim 12, wherein the sub-regions form a parallelepiped partition of the computation region. 14. The method of claim 9, wherein performing the computations in each subset of computations further includes:
performing computations associated with sets of bodies, for each of the sets each body of the set being located in the sub-region associated with the subset of computations; and performing computations associated with sets of bodies, for each of the sets one body being located in the sub-region associated with the subset of computations and the other bodies of the set being located in the import regions associated with the subset of computations. 15. The method of claim 14, wherein the performing of computations associated with sets of bodies in which each body of the set of bodies is located in the sub-region associated with the subset of computations is performed while accepting the data for bodies from the import regions. 16. The method of claim 9, wherein performing the computations in each subset of computations further includes:
performing computations associated with sets of bodies, each body of the set being located in one of the import regions associated with the subset of computations, and no body of the set being located in the sub-region associated with the subset of computations. 17. The method of claim 1, wherein performing the computations in each subset of computations includes applying a schedule of computations specified according to the import regions. 18. The method of claim 1, wherein each of the computations in the set of computations includes a computation of data characterizing an interaction of the set of bodies associated with that computation. 19. The method of claim 1, wherein each of the computations in the set of computations includes recording in a data structure an identification of the set of bodies associated with that computation. 20. The method of claim 19, further comprising performing computations of data characterizing an interaction of each of the sets of bodies recorded in the data structure. 21. The method of claim 1, wherein in performing the computations in all the subsets of computations, for any set of bodies, a computation for that set of bodies is performed in at most one of the subsets. 22. The method of claim 1, wherein for at least some of the selected plurality of combinations of multiple import regions, a computation is performed for every combination of one body in each of the multiple import regions. 23. The method of claim 22, wherein in performing the computations in all the subsets of computations, for any set of bodies, a computation for that set of bodies is performed in at most one of the subsets. 24. The method of claim 1, wherein the steps are repeated for each of a series of time steps, the computations performed at each time step being used to update locations of the bodies in the computation region for use in a subsequent time step. 25. A method for performing a set of computations associated with bodies located in a computation region, each of the computations in the set of computations being associated with a pair of the bodies, the method comprising:
accepting data for bodies located in a neighborhood, the neighborhood comprising a plurality of zones; and performing computations associated with pair of bodies, the bodies of the pair being located in different of the zones; wherein a spatial extent of at least one of the zones is determined to eliminate at least some points in one of the zones that are further away than a minimum distance from all points in another of the zones. 26. The method of claim 25, wherein the spatial extent is determined according to a threshold distance between pairs of bodies for which computations are to be performed. 27. The method of claim 25, wherein a spatial boundary of one of the plurality of zones is determined according to a minimum distance to points within another of the plurality of zones. 28. The method of claim 25, wherein at least one of the plurality of zones includes a non-planar boundary. 29. The method of claim 25, wherein the computation region is partitioned into regular regions, and at least one of the plurality of zones includes some but not all of one of the regular regions. 30. The method of claim 25, wherein the computation region is partitioned into regular regions and each region is associated with a subset of the computations. 31. The method of claim 30, wherein the neighborhood corresponds to one of the regular regions. 32. The method of claim 31, wherein each regular region comprises one of the zones of the neighborhood corresponding to the regular region. 33. The method of claim 31, wherein each regular region is associated with a corresponding computation unit, and wherein accepting the data for bodies in the neighborhood corresponding to the regular region comprises accepting data for one or more of the zones of the neighborhood from another computation unit. 34. A method for performing a set of computations associated with bodies located in a computation region, the computation region being partitioned into regular regions, each of the computations in the set of computations being associated with a set of the bodies, the method comprising:
for at least some of the regular regions, accepting data for bodies located in a neighborhood of the regular region, the neighborhood comprising a plurality of zones; wherein the plurality of zones includes at least one zone that is not contiguous with parts being distributed in at least two dimensions of the computation region. 35. The method of claim 34, wherein the plurality of zones includes at least one zone that is not contiguous with parts being distributed in at least three dimensions of the computation region. 36. The method of claim 34, wherein each computation in the set of computations is associated with a pair of bodies. 37. The method of claim 36, wherein the neighborhood consists of two zones, and for each of the pairs of bodies, one body of the pair is located in a different one of the two zones. 38. The method of claim 34, wherein the plurality of zones includes at least one contiguous zone. 39. The method of claim 38, wherein the contiguous zone is contiguous with the regular region. 40. The method of claim 34, wherein at least two of the zones are elongated in one dimension of the computation region. 41. The method of claim 40, wherein at least one of the zones extends over at least one other dimension of the computation region. 42. A method for performing computations associated with bodies located in a computation region using a processor coupled to a local memory, the method comprising:
iteratively performing multiple subsets of the computations, in each iteration performing one subset of the multiple subsets of computations, including loading into the local memory data of bodies located in each of a plurality of import regions associated with the subset of computations, the import regions being parts of the computation region; performing on the processor computations associated with pairs of bodies, wherein for each pair, one body of the pair is located in a first of the import regions and the other body of the pair is located in a second of the import regions. 43. The method of claim 42 wherein the performing the computations associated with pairs of bodies is performed for each of a predetermined plurality of combinations of a first and a second of the import regions. 44. The method of claim 42 wherein performing the computations associate with the pairs of bodies includes performing computations associated with substantially all pairs of bodies in which one body of the pair is located in the first of the import regions and the other body of the pair is located in the second of the import regions. 45. The method of claim 42 wherein the subsets of computations are selected according to a limitation of the local memory. 46. A method for performing computations associated with bodies located in a computation region, the method comprising:
for each of a plurality of sub-regions of the computation region, maintaining data for bodies in that sub-region in a corresponding separate storage area, wherein the sub-regions overlap such that at least some bodies have data maintained in multiple of the storage areas; and for each of the sub-regions, accessing the data for bodies in that sub-region from the corresponding storage area and performing computations associated with sets of two or more of the bodies in that sub-region. 47. The method of claim 46 wherein each of the separate storage areas is associated with a node of a multiple node computing system. 48. The method of claim 47 wherein performing the computations associated with pairs of the bodies in the sub-region is performed on the node associated with the storage area corresponding to the sub-region. 49. The method of claim 47 wherein each of the separate storage areas is associated with a different node. 50. The method of claim 46 wherein each of the sub-regions includes a home region and a region extending at least a predetermined distance from the home region. 51. The method of claim 50 wherein the home regions form a partition of the computation region. 52. The method of claim 50 wherein the predetermined distance is at least half an interaction radius for pairwise interactions between bodies. 53. The method of claim 52 wherein performing the computations associated with the pairs of bodies in the sub-region includes performing computations for pairs of bodies for which a midpoint of locations of the bodies is within the home region for the sub-region. 54-130. (canceled) 131. A method of simulating physical interactions between bodies having locations in a computation region, said method comprising:
dividing said computation region into a plurality of import regions, each of which contains bodies; selecting, from said import regions, a first import region having a first body set and a second import region having a second body set; identifying combinations of bodies, each of said combinations including a body from said first body set and a body from said second body set; from said identified combinations,
identifying a first combination set, wherein bodies associated with each combination in said first combination set satisfy a condition; and
identifying a second combination set, wherein bodies associated with each combination in said second combination set fail to satisfy said condition;
for all of said identified combinations, other than said combinations in said first combination set, performing computations for simulating interactions between bodies in said combination, whereby computations to simulate interactions between bodies in combinations that satisfy said condition are avoided and only computations to simulate interactions between bodies in combinations that fail to satisfy said condition are carried out. 132. A method of simulating physical interactions between bodies having locations in a computation region, said method comprising:
dividing said computation region into a plurality of import regions, each of which contains bodies; selecting, from said import regions, a first import region having a first body set and a second import region having a second body set; identifying combinations of bodies, each of said combinations including a body from said first body set and a body from said second body set; from said identified combinations,
identifying a first combination set, wherein bodies associated with each combination in said first combination set satisfy a condition; and
identifying a second combination set, wherein bodies associated with each combination in said second combination set fail to satisfy said condition;
performing computations for simulating interactions between bodies in said identified combinations, wherein performing said computations includes
performing computations for simulating interactions between bodies in said combinations from said second combination set; and
omitting performance of computations for simulating interactions between bodies in said combinations from said first combination set;
whereby computations to simulate interactions between bodies in combinations that satisfy said condition are avoided and only computations to simulate interactions between bodies in combinations that fail to satisfy said condition are carried out. | 2,100 |
5,173 | 14,071,269 | 2,141 | Various devices may benefit from determinations of how users are using the devices. For example, hand-held or hand-operated devices may benefit from handedness detection and from modifications based on or related to such detection. A method can include determining a used hand of a user of a device. The method can also include modifying a graphical user interface of the device based on the determined used hand, wherein determination of the used hand occurs prior to any querying of the user regarding the used hand of the user. | 1. A method, comprising:
determining a used hand of a user of a device; and modifying a graphical user interface of the device based on the determined used hand, wherein determination of the used hand occurs prior to any querying of the user regarding the used hand of the user. 2. The method of claim 1, further comprising:
identifying a tilt of the device, wherein an identified tilt of the device is used in determination of the used hand. 3. The method of claim 2, wherein when the tilt of the device is about seventy degrees from a horizontal level, the determining comprises determining the used hand to be a right hand. 4. The method of claim 2, wherein when the tilt of the device is about one hundred ten degrees from a horizontal level, the determining comprises determining the used hand to be a left hand. 5. The method of claim 1, further comprising:
detecting a shaking event, wherein the shaking event is used in determination of the used hand. 6. The method of claim 5, wherein when the shaking event is detected, the determining comprises determining the used hand to be neutral. 7. The method of claim 5, further comprising:
when the shaking event is detected, resetting the used hand to be neutral. 8. The method of claim 1, further comprising:
requesting user confirmation of the determined used hand upon determination of the determined used hand. 9. The method of claim 8, further comprising:
locking the determined used hand upon receiving user confirmation as requested. 10. The method of claim 1, wherein the determining is performed periodically, and wherein the modifying is performed when the determining has a predetermined confidence. 11. An apparatus, comprising:
at least one processor, and at least one memory including computer program code, wherein the at least one memory and the computer program code are configured to, with the at least one processor, cause the apparatus at least to determine a used hand of a user of a device; and modify a graphical user interface of the device based on the determined used hand, wherein determination of the used hand occurs prior to any querying of the user regarding the used hand of the user. 12. The apparatus of claim 11, wherein the at least one memory and the computer program code are configured to, with the at least one processor, cause the apparatus at least to identify a tilt of the device, wherein an identified tilt of the device is used in determination of the used hand. 13. The apparatus of claim 12, wherein when the tilt of the device is about seventy degrees from a horizontal level, the at least one memory and the computer program code are configured to, with the at least one processor, cause the apparatus at least to determine the used hand to be a right hand. 14. The apparatus of claim 12, wherein when the tilt of the device is about one hundred ten degrees from a horizontal level, the at least one memory and the computer program code are configured to, with the at least one processor, cause the apparatus at least to determine the used hand to be a left hand. 15. The apparatus of claim 11, wherein the at least one memory and the computer program code are configured to, with the at least one processor, cause the apparatus at least to detect a shaking event, wherein the shaking event is used in determination of the used hand. 16. The apparatus of claim 15, wherein when the shaking event is detected, the at least one memory and the computer program code are configured to, with the at least one processor, cause the apparatus at least to reset the used hand to be neutral. 17. The apparatus of claim 11, wherein the at least one memory and the computer program code are configured to, with the at least one processor, cause the apparatus at least to request user confirmation of the determined used hand upon determination of the determined used hand. 18. The apparatus of claim 17, wherein the at least one memory and the computer program code are configured to, with the at least one processor, cause the apparatus at least to lock the determined used hand upon receiving user confirmation as requested. 19. The apparatus of claim 11, wherein the at least one memory and the computer program code are configured to, with the at least one processor, cause the apparatus at least to perform the determination periodically, and to perform modification of the graphical user interface when the determination has a predetermined minimum confidence. 20. A method, comprising:
identifying the initiation of a contact to a touch interface; setting an area of a display as selected point based on the contact; identifying a motion of the contact in a first device; moving a virtual wheel in response to the motion; and automatically selecting an item at the selected point when the virtual wheel stops. | Various devices may benefit from determinations of how users are using the devices. For example, hand-held or hand-operated devices may benefit from handedness detection and from modifications based on or related to such detection. A method can include determining a used hand of a user of a device. The method can also include modifying a graphical user interface of the device based on the determined used hand, wherein determination of the used hand occurs prior to any querying of the user regarding the used hand of the user.1. A method, comprising:
determining a used hand of a user of a device; and modifying a graphical user interface of the device based on the determined used hand, wherein determination of the used hand occurs prior to any querying of the user regarding the used hand of the user. 2. The method of claim 1, further comprising:
identifying a tilt of the device, wherein an identified tilt of the device is used in determination of the used hand. 3. The method of claim 2, wherein when the tilt of the device is about seventy degrees from a horizontal level, the determining comprises determining the used hand to be a right hand. 4. The method of claim 2, wherein when the tilt of the device is about one hundred ten degrees from a horizontal level, the determining comprises determining the used hand to be a left hand. 5. The method of claim 1, further comprising:
detecting a shaking event, wherein the shaking event is used in determination of the used hand. 6. The method of claim 5, wherein when the shaking event is detected, the determining comprises determining the used hand to be neutral. 7. The method of claim 5, further comprising:
when the shaking event is detected, resetting the used hand to be neutral. 8. The method of claim 1, further comprising:
requesting user confirmation of the determined used hand upon determination of the determined used hand. 9. The method of claim 8, further comprising:
locking the determined used hand upon receiving user confirmation as requested. 10. The method of claim 1, wherein the determining is performed periodically, and wherein the modifying is performed when the determining has a predetermined confidence. 11. An apparatus, comprising:
at least one processor, and at least one memory including computer program code, wherein the at least one memory and the computer program code are configured to, with the at least one processor, cause the apparatus at least to determine a used hand of a user of a device; and modify a graphical user interface of the device based on the determined used hand, wherein determination of the used hand occurs prior to any querying of the user regarding the used hand of the user. 12. The apparatus of claim 11, wherein the at least one memory and the computer program code are configured to, with the at least one processor, cause the apparatus at least to identify a tilt of the device, wherein an identified tilt of the device is used in determination of the used hand. 13. The apparatus of claim 12, wherein when the tilt of the device is about seventy degrees from a horizontal level, the at least one memory and the computer program code are configured to, with the at least one processor, cause the apparatus at least to determine the used hand to be a right hand. 14. The apparatus of claim 12, wherein when the tilt of the device is about one hundred ten degrees from a horizontal level, the at least one memory and the computer program code are configured to, with the at least one processor, cause the apparatus at least to determine the used hand to be a left hand. 15. The apparatus of claim 11, wherein the at least one memory and the computer program code are configured to, with the at least one processor, cause the apparatus at least to detect a shaking event, wherein the shaking event is used in determination of the used hand. 16. The apparatus of claim 15, wherein when the shaking event is detected, the at least one memory and the computer program code are configured to, with the at least one processor, cause the apparatus at least to reset the used hand to be neutral. 17. The apparatus of claim 11, wherein the at least one memory and the computer program code are configured to, with the at least one processor, cause the apparatus at least to request user confirmation of the determined used hand upon determination of the determined used hand. 18. The apparatus of claim 17, wherein the at least one memory and the computer program code are configured to, with the at least one processor, cause the apparatus at least to lock the determined used hand upon receiving user confirmation as requested. 19. The apparatus of claim 11, wherein the at least one memory and the computer program code are configured to, with the at least one processor, cause the apparatus at least to perform the determination periodically, and to perform modification of the graphical user interface when the determination has a predetermined minimum confidence. 20. A method, comprising:
identifying the initiation of a contact to a touch interface; setting an area of a display as selected point based on the contact; identifying a motion of the contact in a first device; moving a virtual wheel in response to the motion; and automatically selecting an item at the selected point when the virtual wheel stops. | 2,100 |
5,174 | 15,378,473 | 2,112 | The present application describes embodiments of an interface for coupling flash memory and dynamic random access memory (DRAM) in a processing system. Some embodiments include a dedicated interface between a flash memory and DRAM. The dedicated interface is to provide access to the flash memory in response to instructions received over a DRAM interface between the DRAM and a processing device. Some embodiments of a method include accessing a flash memory via a dedicated interface between the flash memory and a dynamic random access memory (DRAM) in response to an instruction received over a DRAM interface between the DRAM and a processing device. | 1-20. (canceled) 21. A memory system, comprising:
a dynamic random access memory (DRAM); a flash memory; and a dedicated interface between the DRAM and the flash memory, wherein a first portion of the dedicated interface is implemented in the DRAM and a second portion of the dedicated interface is implemented in the flash memory. 22. The memory system of claim 1, wherein the first portion of the dedicated interface includes control logic to control operation of the dedicated interface. 23. The memory system of claim 1, wherein the second portion of the dedicated interface includes multiple pipeline stages to perform pipelined execution of instructions in the flash memory. 24. The memory system of claim 3, wherein the multiple pipeline stages are configured so that a plurality of requests can be processed concurrently by the dedicated interface. 25. The memory system of claim 1, further comprising:
a DRAM interface between the DRAM and a processing device, wherein the dedicated interface is to provide prefetch data from the flash memory into the DRAM in response to a prefetch request provided over the DRAM interface prior to the DRAM receiving a request for the prefetched data. 26. The memory system of claim 5, wherein the dedicated interface is to convey at least one page from the flash memory into the DRAM over the dedicated interface in response to a page-in instruction received by the DRAM over the DRAM interface. 27. A method, comprising:
accessing a flash memory via a dedicated interface between the flash memory and a dynamic random access memory (DRAM), wherein a first portion of the dedicated interface is implemented in the DRAM and a second portion of the dedicated interface is implemented in the flash memory. 28. The method of claim 7, further comprising:
concurrently performing a plurality of requests in a plurality of pipeline stages of the second portion of the dedicated interface. 29. The method of claim 7, further comprising:
controlling operations of the dedicated interface using control logic at the first portion of the dedicated interface. 30. The method of claim 7, wherein accessing the flash memory further comprises:
accessing the flash memory in response to an instruction received over a DRAM interface between the DRAM and a processing device. 31. The method of claim 10, wherein accessing the flash memory further comprises:
prefetching data from the flash memory into the DRAM via the dedicated interface in response to a prefetch request provided over the DRAM interface prior to the DRAM receiving a request for the prefetched data over the DRAM interface. 32. The method of claim 10, wherein accessing the flash memory further comprises:
conveying at least one page from the flash memory into the DRAM over the dedicated interface in response to a page-in instruction received by the DRAM over the DRAM interface. 33. The method of claim 10, wherein accessing the flash memory further comprises:
conveying at least one page from the DRAM into the flash memory over the dedicated interface in response to a page-out instruction received by the DRAM over the DRAM interface. 34. The method of claim 10, wherein accessing the flash memory further comprises:
accessing the flash memory over a plurality of through silicon vias (TSVs) that couple the flash memory to the DRAM. 35. A memory system, comprising:
a volatile memory; a non-volatile memory; and a dedicated interface between the volatile memory and the non-volatile memory, wherein a first portion of the dedicated interface is implemented in the volatile memory and a second portion of the dedicated interface is implemented in the non-volatile memory. 36. The memory system of claim 15, wherein the first portion of the dedicated interface includes control logic to control operation of the dedicated interface. 37. The memory system of claim 15, wherein the second portion of the dedicated interface includes multiple pipeline stages to perform pipelined execution of instructions in the non-volatile memory. 38. The memory system of claim 17, wherein the multiple pipeline stages are configured so that a plurality of requests can be processed concurrently by the dedicated interface. 39. The memory system of claim 15, further comprising:
a volatile memory interface between the volatile memory and a processing device, wherein the dedicated interface is to provide prefetch data from the non-volatile memory into the volatile memory in response to a prefetch request provided over the volatile memory interface prior to the volatile memory receiving a request for the prefetched data. 40. The memory system of claim 19, wherein the dedicated interface is to convey at least one page from the non-volatile memory into the volatile memory over the dedicated interface in response to a page-in instruction received by the volatile over the volatile memory interface. | The present application describes embodiments of an interface for coupling flash memory and dynamic random access memory (DRAM) in a processing system. Some embodiments include a dedicated interface between a flash memory and DRAM. The dedicated interface is to provide access to the flash memory in response to instructions received over a DRAM interface between the DRAM and a processing device. Some embodiments of a method include accessing a flash memory via a dedicated interface between the flash memory and a dynamic random access memory (DRAM) in response to an instruction received over a DRAM interface between the DRAM and a processing device.1-20. (canceled) 21. A memory system, comprising:
a dynamic random access memory (DRAM); a flash memory; and a dedicated interface between the DRAM and the flash memory, wherein a first portion of the dedicated interface is implemented in the DRAM and a second portion of the dedicated interface is implemented in the flash memory. 22. The memory system of claim 1, wherein the first portion of the dedicated interface includes control logic to control operation of the dedicated interface. 23. The memory system of claim 1, wherein the second portion of the dedicated interface includes multiple pipeline stages to perform pipelined execution of instructions in the flash memory. 24. The memory system of claim 3, wherein the multiple pipeline stages are configured so that a plurality of requests can be processed concurrently by the dedicated interface. 25. The memory system of claim 1, further comprising:
a DRAM interface between the DRAM and a processing device, wherein the dedicated interface is to provide prefetch data from the flash memory into the DRAM in response to a prefetch request provided over the DRAM interface prior to the DRAM receiving a request for the prefetched data. 26. The memory system of claim 5, wherein the dedicated interface is to convey at least one page from the flash memory into the DRAM over the dedicated interface in response to a page-in instruction received by the DRAM over the DRAM interface. 27. A method, comprising:
accessing a flash memory via a dedicated interface between the flash memory and a dynamic random access memory (DRAM), wherein a first portion of the dedicated interface is implemented in the DRAM and a second portion of the dedicated interface is implemented in the flash memory. 28. The method of claim 7, further comprising:
concurrently performing a plurality of requests in a plurality of pipeline stages of the second portion of the dedicated interface. 29. The method of claim 7, further comprising:
controlling operations of the dedicated interface using control logic at the first portion of the dedicated interface. 30. The method of claim 7, wherein accessing the flash memory further comprises:
accessing the flash memory in response to an instruction received over a DRAM interface between the DRAM and a processing device. 31. The method of claim 10, wherein accessing the flash memory further comprises:
prefetching data from the flash memory into the DRAM via the dedicated interface in response to a prefetch request provided over the DRAM interface prior to the DRAM receiving a request for the prefetched data over the DRAM interface. 32. The method of claim 10, wherein accessing the flash memory further comprises:
conveying at least one page from the flash memory into the DRAM over the dedicated interface in response to a page-in instruction received by the DRAM over the DRAM interface. 33. The method of claim 10, wherein accessing the flash memory further comprises:
conveying at least one page from the DRAM into the flash memory over the dedicated interface in response to a page-out instruction received by the DRAM over the DRAM interface. 34. The method of claim 10, wherein accessing the flash memory further comprises:
accessing the flash memory over a plurality of through silicon vias (TSVs) that couple the flash memory to the DRAM. 35. A memory system, comprising:
a volatile memory; a non-volatile memory; and a dedicated interface between the volatile memory and the non-volatile memory, wherein a first portion of the dedicated interface is implemented in the volatile memory and a second portion of the dedicated interface is implemented in the non-volatile memory. 36. The memory system of claim 15, wherein the first portion of the dedicated interface includes control logic to control operation of the dedicated interface. 37. The memory system of claim 15, wherein the second portion of the dedicated interface includes multiple pipeline stages to perform pipelined execution of instructions in the non-volatile memory. 38. The memory system of claim 17, wherein the multiple pipeline stages are configured so that a plurality of requests can be processed concurrently by the dedicated interface. 39. The memory system of claim 15, further comprising:
a volatile memory interface between the volatile memory and a processing device, wherein the dedicated interface is to provide prefetch data from the non-volatile memory into the volatile memory in response to a prefetch request provided over the volatile memory interface prior to the volatile memory receiving a request for the prefetched data. 40. The memory system of claim 19, wherein the dedicated interface is to convey at least one page from the non-volatile memory into the volatile memory over the dedicated interface in response to a page-in instruction received by the volatile over the volatile memory interface. | 2,100 |
5,175 | 12,959,985 | 2,145 | Providing a user interface for configuring a computer-executable application includes receiving a specification defining: relationships among user interface elements, the relationships based on dependencies between components of a dataflow graph that includes multiple nodes representing components of the dataflow graph and links between the nodes representing flows of data between the components, parameters defining respective characteristics of the components of the dataflow graph, and variables defining respective characteristics of the user interface elements. During operation of a user interface, user interface elements are displayed based on the relationships defined in the specification. | 1. A method for providing a user interface for configuring a computer-executable application, including:
receiving a specification defining
relationships among user interface elements, the relationships based on dependencies between components of a dataflow graph that includes multiple nodes representing components of the dataflow graph and links between the nodes representing flows of data between the components,
parameters defining respective characteristics of the components of the dataflow graph, and
variables defining respective characteristics of the user interface elements; and
during operation of a user interface, displaying user interface elements based on the relationships defined in the specification. 2. The method of claim 1 in which at least some of the relationships among the user interface elements are based on dependencies between data elements received from at least one of the group consisting of: a database, a data file, a metadata repository, and a web service. 3. The method of claim 1 in which the specification defines source values indicating data received during the operation of the user interface and defines target values indicating data updated during the operation of the user interface. 4. The method of claim 1, further including, during operation of the user interface, updating data based on a user's interaction with the user interface elements. 5. The method of claim 4 in which at least some of the parameters include the updated data. 6. The method of claim 4 in which at least some of the updated data is included in at least one of the group consisting of: a data file, a database, and a metadata engine, and a data source associated with a web service. 7. The method of claim 1, further including receiving data associated with the parameters from an external source. 8. The method of claim 7 in which the external source is at least one of the group consisting of: a data file, a database, a metadata engine, and a web service. 9. The method of claim 1, further including displaying component output data associated with at least one flow of data represented by a link of the dataflow graph. 10. The method of claim 1 in which at least one parameter defines a property of at least one of the components of the dataflow graph, the property associated with one of the user interface elements. 11. The method of claim 10 in which the user interface element is defined to provide data to the property. 12. The method of claim 10 in which the user interface element is defined to receive data from the property. 13. The method of claim 1 in which, during the operation of a user interface, at least one user interface element is displayed based on at least one of the variables. 14. The method of claim 13 in which the user interface element is displayed in response to a change in one of the variables. 15. The method of claim 1 in which the specification is defined in an extensible markup language. 16. The method of claim 1 in which the specification includes an expression defined in a language native to a database management system. 17. The method of claim 1, further including automatically acquiring at least one parameter from the dataflow graph. 18. The method of claim 1 in which at least one variable defines a reference to an object stored in a database system. 19. The method of claim 1 in which the specification defines a reference to a data file external to the specification. 20. The method of claim 19 in which the reference includes a pointer to a value stored in the data file. 21. The method of claim 19 in which at least one variable defines the reference. 22. The method of claim 19 in which at least one parameter defines the reference. 23. The method of claim 1 in which the specification includes a query string for accessing data stored in a database system. 24. The method of claim 23 in which the query string includes an argument specified by a user during the operation of the user interface. 25. The method of claim 23 in which the query string is executable during the operation of the user interface. 26. The method of claim 23 in which at least one parameter includes the query string. 27. The method of claim 23 in which at least one variable includes the query string. 28. A computer-readable medium storing a computer program for providing a user interface for configuring a computer-executable application, the computer program including instructions for causing a computer to:
receive a specification defining
relationships among user interface elements, the relationships based on dependencies between components of a dataflow graph that includes multiple nodes representing components of the dataflow graph and links between the nodes representing flows of data between the components,
parameters defining respective characteristics of the components of the dataflow graph, and
variables defining respective characteristics of the user interface elements; and
during operation of a user interface, display user interface elements based on the relationships defined in the specification. 29. A system for configuring a computer-executable application, the system including:
means for receiving a specification defining
relationships among user interface elements, the relationships based on dependencies between components of a dataflow graph that includes multiple nodes representing components of the dataflow graph and links between the nodes representing flows of data between the components,
parameters defining respective characteristics of the components of the dataflow graph, and
variables defining respective characteristics of the user interface elements; and
means for displaying user interface elements based on the relationships defined in the specification, during operation of a user interface. | Providing a user interface for configuring a computer-executable application includes receiving a specification defining: relationships among user interface elements, the relationships based on dependencies between components of a dataflow graph that includes multiple nodes representing components of the dataflow graph and links between the nodes representing flows of data between the components, parameters defining respective characteristics of the components of the dataflow graph, and variables defining respective characteristics of the user interface elements. During operation of a user interface, user interface elements are displayed based on the relationships defined in the specification.1. A method for providing a user interface for configuring a computer-executable application, including:
receiving a specification defining
relationships among user interface elements, the relationships based on dependencies between components of a dataflow graph that includes multiple nodes representing components of the dataflow graph and links between the nodes representing flows of data between the components,
parameters defining respective characteristics of the components of the dataflow graph, and
variables defining respective characteristics of the user interface elements; and
during operation of a user interface, displaying user interface elements based on the relationships defined in the specification. 2. The method of claim 1 in which at least some of the relationships among the user interface elements are based on dependencies between data elements received from at least one of the group consisting of: a database, a data file, a metadata repository, and a web service. 3. The method of claim 1 in which the specification defines source values indicating data received during the operation of the user interface and defines target values indicating data updated during the operation of the user interface. 4. The method of claim 1, further including, during operation of the user interface, updating data based on a user's interaction with the user interface elements. 5. The method of claim 4 in which at least some of the parameters include the updated data. 6. The method of claim 4 in which at least some of the updated data is included in at least one of the group consisting of: a data file, a database, and a metadata engine, and a data source associated with a web service. 7. The method of claim 1, further including receiving data associated with the parameters from an external source. 8. The method of claim 7 in which the external source is at least one of the group consisting of: a data file, a database, a metadata engine, and a web service. 9. The method of claim 1, further including displaying component output data associated with at least one flow of data represented by a link of the dataflow graph. 10. The method of claim 1 in which at least one parameter defines a property of at least one of the components of the dataflow graph, the property associated with one of the user interface elements. 11. The method of claim 10 in which the user interface element is defined to provide data to the property. 12. The method of claim 10 in which the user interface element is defined to receive data from the property. 13. The method of claim 1 in which, during the operation of a user interface, at least one user interface element is displayed based on at least one of the variables. 14. The method of claim 13 in which the user interface element is displayed in response to a change in one of the variables. 15. The method of claim 1 in which the specification is defined in an extensible markup language. 16. The method of claim 1 in which the specification includes an expression defined in a language native to a database management system. 17. The method of claim 1, further including automatically acquiring at least one parameter from the dataflow graph. 18. The method of claim 1 in which at least one variable defines a reference to an object stored in a database system. 19. The method of claim 1 in which the specification defines a reference to a data file external to the specification. 20. The method of claim 19 in which the reference includes a pointer to a value stored in the data file. 21. The method of claim 19 in which at least one variable defines the reference. 22. The method of claim 19 in which at least one parameter defines the reference. 23. The method of claim 1 in which the specification includes a query string for accessing data stored in a database system. 24. The method of claim 23 in which the query string includes an argument specified by a user during the operation of the user interface. 25. The method of claim 23 in which the query string is executable during the operation of the user interface. 26. The method of claim 23 in which at least one parameter includes the query string. 27. The method of claim 23 in which at least one variable includes the query string. 28. A computer-readable medium storing a computer program for providing a user interface for configuring a computer-executable application, the computer program including instructions for causing a computer to:
receive a specification defining
relationships among user interface elements, the relationships based on dependencies between components of a dataflow graph that includes multiple nodes representing components of the dataflow graph and links between the nodes representing flows of data between the components,
parameters defining respective characteristics of the components of the dataflow graph, and
variables defining respective characteristics of the user interface elements; and
during operation of a user interface, display user interface elements based on the relationships defined in the specification. 29. A system for configuring a computer-executable application, the system including:
means for receiving a specification defining
relationships among user interface elements, the relationships based on dependencies between components of a dataflow graph that includes multiple nodes representing components of the dataflow graph and links between the nodes representing flows of data between the components,
parameters defining respective characteristics of the components of the dataflow graph, and
variables defining respective characteristics of the user interface elements; and
means for displaying user interface elements based on the relationships defined in the specification, during operation of a user interface. | 2,100 |
5,176 | 14,513,109 | 2,141 | A system incorporating techniques described in this paper includes a shared session server system that enables clients to view and interact with content simultaneously. The system enables a first shared session client to send an event stream sufficient to depict results of interaction with the content at a second shared session client. | 1. A method at a shared session server having at least a processor and a memory therein for enabling a plurality of shared session clients to view and interact with content simultaneously within a shared browsing session common to the plurality of shared session clients, wherein the method comprises:
creating the shared browsing session at the shared session server; connecting the shared browsing session with at least a first shared session client and a second shared session client communicatively interfaced with the shared session server via a network; receiving a request from the first shared session client for a URL; downloading, at the shared session server, a webpage corresponding to the URL; modifying source code of the webpage at the shared session server; and returning the webpage having the modified source code therein to the first and second shared session clients for display. 2. The method of claim 1, wherein modifying source code of the webpage at the shared session server comprises modifying the source code of the webpage to embed code that enables a user interface for collaborating on the webpage by the first and second shared session clients. 3. The method of claim 1, wherein modifying source code of the webpage at the shared session server comprises converting all URLs within the webpage which are capable of changing location. 4. The method of claim 3, wherein converting all URLs within the webpage which are capable of changing location comprises converting any of links, forms, URLs, and URLs within scripts to of the webpage to direct the first and second shared session clients to download resources from the shared session server. 5. The method of claim 1, wherein modifying source code of the webpage at the shared session server comprises modifying the source code of the webpage to direct any shared session client of the shared browsing session to download the webpage's resources from the shared session server in place of a content server referenced by the URL requested. 6. The method of claim 5, wherein modifying source code of the webpage at the shared session server further comprises:
removing or modifying any source code from the webpage that prevents the content from displaying or behaving at the first and second shared session clients as it would if such content were downloaded from a content server referenced by the URL requested during an unshared session rather than having been downloaded at the shared session server on behalf of the first and second shared session clients during the shared browsing session. 7. The method of claim 1, wherein modifying source code of the webpage at the shared session server comprises adding collaboration features and user interface features to the source code at the shared session server prior to returning the webpage having the modified source code therein to the first and second shared session clients for display. 8. The method of claim 1, wherein modifying source code of the webpage at the shared session server comprises performing frame busting operations to prevent the webpage, as modified and returned to the first and second shared session clients for display, from loading into another party's framed webpage. 9. The method of claim 1, further comprising:
storing the modified source code as cached content at the shared session server for later retrieval; and wherein returning the webpage having the modified source code therein to the first and second shared session clients for display comprises sending the cached content to at least one of the plurality of shared session clients in the shared browsing session. 10. The method of claim 1, further comprising:
notifying the plurality of shared session clients of changes to the content being shared via the shared browsing session; and instructing the plurality of shared session clients to make a request to the shared session server with a URL structured to download the shared content from a cache at the shared session server. 11. Non-transitory computer readable storage media having instructions stored thereon that, when executed by a processor of a shared session server, the instructions cause the shared session server to perform operations for enabling a plurality of shared session clients to view and interact with content simultaneously within a shared browsing session common to the plurality of shared session clients, the operations comprising:
creating the shared browsing session at the shared session server; connecting the shared browsing session with at least a first shared session client and a second shared session client communicatively interfaced with the shared session server via a network; receiving a request from the first shared session client for a URL; downloading, at the shared session server, a webpage corresponding to the URL; modifying source code of the webpage at the shared session server; and returning the webpage having the modified source code therein to the first and second shared session clients for display. 12. The non-transitory computer readable storage media of claim 11, wherein modifying source code of the webpage at the shared session server comprises modifying the source code of the webpage to embed code that enables a user interface for collaborating on the webpage by the first and second shared session clients. 13. The non-transitory computer readable storage media of claim 11, wherein modifying source code of the webpage at the shared session server comprises converting all URLs within the webpage which are capable of changing location. 14. The non-transitory computer readable storage media of claim 11, wherein modifying source code of the webpage at the shared session server comprises modifying the source code of the webpage to direct any shared session client of the shared browsing session to download the webpage's resources from the shared session server in place of a content server referenced by the URL requested. 15. The non-transitory computer readable storage media of claim 14, wherein modifying source code of the webpage at the shared session server further comprises:
removing or modifying any source code from the webpage that prevents the content from displaying or behaving at the first and second shared session clients as it would if such content were downloaded from a content server referenced by the URL requested during an unshared session rather than having been downloaded at the shared session server on behalf of the first and second shared session clients during the shared browsing session. 16. The non-transitory computer readable storage media of claim 11, wherein modifying source code of the webpage at the shared session server comprises adding collaboration features and user interface features to the source code at the shared session server prior to returning the webpage having the modified source code therein to the first and second shared session clients for display. 17. The non-transitory computer readable storage media of claim 11, wherein the instructions cause the shared session server to perform operations further comprising:
storing the modified source code as cached content at the shared session server for later retrieval; and wherein returning the webpage having the modified source code therein to the first and second shared session clients for display comprises sending the cached content to at least one of the plurality of shared session clients in the shared browsing session. 18. The non-transitory computer readable storage media of claim 11, wherein the instructions cause the shared session server to perform operations further comprising:
notifying the plurality of shared session clients of changes to the content being shared via the shared browsing session; and instructing the plurality of shared session clients to make a request to the shared session server with a URL structured to download the shared content from a cache at the shared session server. 19. The non-transitory computer readable storage media of claim 11, wherein modifying source code of the webpage at the shared session server comprises performing frame busting operations to prevent the webpage, as modified and returned to the first and second shared session clients for display, from loading into another party's framed webpage. 20. A shared session server to enable a plurality of shared session clients to view and interact with content simultaneously within a shared browsing session common to the plurality of shared session clients, wherein the shared session server comprises:
a processor; a memory; a shared content synchronization server engine to create the shared browsing session at the shared session server; a load balancing engine to connect the shared browsing session with at least a first shared session client and a second shared session client communicatively interfaced with the shared session server via a network; a core-server to receive a request from the first shared session client for a URL; a web client engine to download, at the shared session server, a webpage corresponding to the URL; a real-time server engine to modify source code of the webpage at the shared session server; and the core-server to further return the webpage having the modified source code therein to the first and second shared session clients for display. 21. The shared session server of claim 20, wherein the core-server is to further respond to port 80 requests from clients and serve web pages to the first and second shared session clients. | A system incorporating techniques described in this paper includes a shared session server system that enables clients to view and interact with content simultaneously. The system enables a first shared session client to send an event stream sufficient to depict results of interaction with the content at a second shared session client.1. A method at a shared session server having at least a processor and a memory therein for enabling a plurality of shared session clients to view and interact with content simultaneously within a shared browsing session common to the plurality of shared session clients, wherein the method comprises:
creating the shared browsing session at the shared session server; connecting the shared browsing session with at least a first shared session client and a second shared session client communicatively interfaced with the shared session server via a network; receiving a request from the first shared session client for a URL; downloading, at the shared session server, a webpage corresponding to the URL; modifying source code of the webpage at the shared session server; and returning the webpage having the modified source code therein to the first and second shared session clients for display. 2. The method of claim 1, wherein modifying source code of the webpage at the shared session server comprises modifying the source code of the webpage to embed code that enables a user interface for collaborating on the webpage by the first and second shared session clients. 3. The method of claim 1, wherein modifying source code of the webpage at the shared session server comprises converting all URLs within the webpage which are capable of changing location. 4. The method of claim 3, wherein converting all URLs within the webpage which are capable of changing location comprises converting any of links, forms, URLs, and URLs within scripts to of the webpage to direct the first and second shared session clients to download resources from the shared session server. 5. The method of claim 1, wherein modifying source code of the webpage at the shared session server comprises modifying the source code of the webpage to direct any shared session client of the shared browsing session to download the webpage's resources from the shared session server in place of a content server referenced by the URL requested. 6. The method of claim 5, wherein modifying source code of the webpage at the shared session server further comprises:
removing or modifying any source code from the webpage that prevents the content from displaying or behaving at the first and second shared session clients as it would if such content were downloaded from a content server referenced by the URL requested during an unshared session rather than having been downloaded at the shared session server on behalf of the first and second shared session clients during the shared browsing session. 7. The method of claim 1, wherein modifying source code of the webpage at the shared session server comprises adding collaboration features and user interface features to the source code at the shared session server prior to returning the webpage having the modified source code therein to the first and second shared session clients for display. 8. The method of claim 1, wherein modifying source code of the webpage at the shared session server comprises performing frame busting operations to prevent the webpage, as modified and returned to the first and second shared session clients for display, from loading into another party's framed webpage. 9. The method of claim 1, further comprising:
storing the modified source code as cached content at the shared session server for later retrieval; and wherein returning the webpage having the modified source code therein to the first and second shared session clients for display comprises sending the cached content to at least one of the plurality of shared session clients in the shared browsing session. 10. The method of claim 1, further comprising:
notifying the plurality of shared session clients of changes to the content being shared via the shared browsing session; and instructing the plurality of shared session clients to make a request to the shared session server with a URL structured to download the shared content from a cache at the shared session server. 11. Non-transitory computer readable storage media having instructions stored thereon that, when executed by a processor of a shared session server, the instructions cause the shared session server to perform operations for enabling a plurality of shared session clients to view and interact with content simultaneously within a shared browsing session common to the plurality of shared session clients, the operations comprising:
creating the shared browsing session at the shared session server; connecting the shared browsing session with at least a first shared session client and a second shared session client communicatively interfaced with the shared session server via a network; receiving a request from the first shared session client for a URL; downloading, at the shared session server, a webpage corresponding to the URL; modifying source code of the webpage at the shared session server; and returning the webpage having the modified source code therein to the first and second shared session clients for display. 12. The non-transitory computer readable storage media of claim 11, wherein modifying source code of the webpage at the shared session server comprises modifying the source code of the webpage to embed code that enables a user interface for collaborating on the webpage by the first and second shared session clients. 13. The non-transitory computer readable storage media of claim 11, wherein modifying source code of the webpage at the shared session server comprises converting all URLs within the webpage which are capable of changing location. 14. The non-transitory computer readable storage media of claim 11, wherein modifying source code of the webpage at the shared session server comprises modifying the source code of the webpage to direct any shared session client of the shared browsing session to download the webpage's resources from the shared session server in place of a content server referenced by the URL requested. 15. The non-transitory computer readable storage media of claim 14, wherein modifying source code of the webpage at the shared session server further comprises:
removing or modifying any source code from the webpage that prevents the content from displaying or behaving at the first and second shared session clients as it would if such content were downloaded from a content server referenced by the URL requested during an unshared session rather than having been downloaded at the shared session server on behalf of the first and second shared session clients during the shared browsing session. 16. The non-transitory computer readable storage media of claim 11, wherein modifying source code of the webpage at the shared session server comprises adding collaboration features and user interface features to the source code at the shared session server prior to returning the webpage having the modified source code therein to the first and second shared session clients for display. 17. The non-transitory computer readable storage media of claim 11, wherein the instructions cause the shared session server to perform operations further comprising:
storing the modified source code as cached content at the shared session server for later retrieval; and wherein returning the webpage having the modified source code therein to the first and second shared session clients for display comprises sending the cached content to at least one of the plurality of shared session clients in the shared browsing session. 18. The non-transitory computer readable storage media of claim 11, wherein the instructions cause the shared session server to perform operations further comprising:
notifying the plurality of shared session clients of changes to the content being shared via the shared browsing session; and instructing the plurality of shared session clients to make a request to the shared session server with a URL structured to download the shared content from a cache at the shared session server. 19. The non-transitory computer readable storage media of claim 11, wherein modifying source code of the webpage at the shared session server comprises performing frame busting operations to prevent the webpage, as modified and returned to the first and second shared session clients for display, from loading into another party's framed webpage. 20. A shared session server to enable a plurality of shared session clients to view and interact with content simultaneously within a shared browsing session common to the plurality of shared session clients, wherein the shared session server comprises:
a processor; a memory; a shared content synchronization server engine to create the shared browsing session at the shared session server; a load balancing engine to connect the shared browsing session with at least a first shared session client and a second shared session client communicatively interfaced with the shared session server via a network; a core-server to receive a request from the first shared session client for a URL; a web client engine to download, at the shared session server, a webpage corresponding to the URL; a real-time server engine to modify source code of the webpage at the shared session server; and the core-server to further return the webpage having the modified source code therein to the first and second shared session clients for display. 21. The shared session server of claim 20, wherein the core-server is to further respond to port 80 requests from clients and serve web pages to the first and second shared session clients. | 2,100 |
5,177 | 14,835,676 | 2,129 | Disclosed herein are techniques and systems for discovering functional groups in an area, such as an urban area. A process includes segmenting a map of the area into sections, and inferring, for each section, a distribution of functions according to a topic model framework which considers mobility patters of users and points of interest (POIs) in the section. The topic model framework regards the section as a document, each function as a topic, the mobility patterns as words, and a POI feature vector for the section as metadata. The process may further include clustering the sections based at least in part on a similarity of the distribution of functions between each of the sections to obtain functional groups, estimating a functionality intensity for each of the functional groups, and annotating each of the functional groups. | 1-20. (canceled) 21. A system comprising:
one or more processors; memory storing instructions executable on the one or more processors to perform acts comprising:
segmenting a map of an area into a set of sections;
inferring a distribution of functions for each section in the set of sections according to a topic model framework which uses mobility patterns of users leaving from and arriving at each section and uses points of interest (POIs) in each section; and
determining functional groups of the area based at least in part on the distribution of functions. 22. The system of claim 21, wherein the topic model framework is a Dirichlet Multinomial Regression (DMR)-based topic model. 23. The system of claim 21, wherein the topic model framework stores a point of interest (POI) feature vector associated with the POIs in each section as metadata. 24. The system of claim 23, wherein the POI feature vector for each section is based at least in part on frequency densities of different types of POIs in each section. 25. The system of claim 23, wherein the topic model framework uses the set of sections as a set of documents, uses each function of the distribution of functions as a topic, and uses the mobility patterns as words. 26. The system of claim 21, the acts further comprising estimating a functionality intensity for each of the functional groups based on a Kernel Density Estimation (KDE) model, wherein origin and destination data of the mobility patterns is provided as input to the KDE model. 27. The system of claim 21, the acts further comprising annotating each of the functional groups on a visual representation of the area. 28. The system of claim 21, wherein the inferring the distribution of functions further comprises generating a leaving transition matrix and an arriving transition matrix which represents leaving mobility patterns and arriving mobility patterns, respectively, obtained over a period of time. 29. The system of claim 21, the acts further comprising determining one or more representative mobility patterns of each of the sections using a term frequency-inverse document frequency (TF-IDF) technique. 30. A method of determining functional groups of an area, comprising:
segmenting, by one or more processors, a map of the area into sections; for each section:
determining, by the one or more processors, mobility patterns of users leaving from and arriving at the section,
determining, by the one or more processors, one or more points of interest (POIs) that are located in the section, and
inferring, by the one or more processors, a distribution of functions for the section according to a topic model framework based at least in part on the mobility patterns and the one or more POIs; and
determining, by the one or more processors, a set of functional groups based at least in part on the distribution of functions for each section. 31. The method of claim 30, wherein the topic model framework that applies the section as a document, applies each function of the distribution of functions as a topic, and applies the mobility patterns as words. 32. The method of claim 30, wherein the mobility patterns comprise leaving mobility patterns and arriving mobility patterns determined over a period of time, each leaving mobility pattern describing a leaving time when the users leave from the section and a destination section that the users leave toward, each arriving mobility pattern describing an arriving time when the users arrive at the section and an origin section that the users arrive from. 33. The method of claim 30, further comprising determining a number of the one or more POIs in each of a plurality of point of interest (POI) categories to obtain a POI feature vector for the section, wherein the POI feature vector is based at least in part on calculating a frequency density of each of the plurality of POI categories, and wherein inferring the distribution of functions for the section is further based on the POI feature vector. 34. A method comprising:
segmenting, by one or more processors, a map of an area into sections; inferring, for each section and by the one or more processors, a distribution of functions according to a topic model framework which uses mobility patterns of users leaving from and arriving at the section and points of interest (POIs) in the section; and clustering, by the one or more processors, the sections based at least in part on a similarity of the distribution of functions between each of the sections to obtain functional groups. 35. The method of claim 34, wherein the topic model framework uses the section as a document, uses each function of the distribution of functions as a topic, uses the mobility patterns as words, and uses a point of interest (POI) feature vector of the POIs in the section as metadata. 36. The method of claim 35, wherein the POI feature vector is based at least in part on calculating a frequency density of each of a plurality of POI categories. 37. The method of claim 34, wherein the inferring the distribution of functions further comprises generating a leaving transition matrix and an arriving transition matrix which represents a frequency of the mobility patterns. 38. The method of claim 34, further comprising estimating a functionality intensity for each of the functional groups based on a Kernel Density Estimation (KDE) model, wherein an origin and a destination of each of the mobility patterns is provided as input to the KDE model. 39. The method of claim 34, wherein using the mobility patterns comprises determining one or more representative mobility patterns of each of the sections using a term frequency-inverse document frequency (TF-IDF) technique. 40. The method of claim 34, wherein the segmenting the map is based at least in part on a road network of the area. | Disclosed herein are techniques and systems for discovering functional groups in an area, such as an urban area. A process includes segmenting a map of the area into sections, and inferring, for each section, a distribution of functions according to a topic model framework which considers mobility patters of users and points of interest (POIs) in the section. The topic model framework regards the section as a document, each function as a topic, the mobility patterns as words, and a POI feature vector for the section as metadata. The process may further include clustering the sections based at least in part on a similarity of the distribution of functions between each of the sections to obtain functional groups, estimating a functionality intensity for each of the functional groups, and annotating each of the functional groups.1-20. (canceled) 21. A system comprising:
one or more processors; memory storing instructions executable on the one or more processors to perform acts comprising:
segmenting a map of an area into a set of sections;
inferring a distribution of functions for each section in the set of sections according to a topic model framework which uses mobility patterns of users leaving from and arriving at each section and uses points of interest (POIs) in each section; and
determining functional groups of the area based at least in part on the distribution of functions. 22. The system of claim 21, wherein the topic model framework is a Dirichlet Multinomial Regression (DMR)-based topic model. 23. The system of claim 21, wherein the topic model framework stores a point of interest (POI) feature vector associated with the POIs in each section as metadata. 24. The system of claim 23, wherein the POI feature vector for each section is based at least in part on frequency densities of different types of POIs in each section. 25. The system of claim 23, wherein the topic model framework uses the set of sections as a set of documents, uses each function of the distribution of functions as a topic, and uses the mobility patterns as words. 26. The system of claim 21, the acts further comprising estimating a functionality intensity for each of the functional groups based on a Kernel Density Estimation (KDE) model, wherein origin and destination data of the mobility patterns is provided as input to the KDE model. 27. The system of claim 21, the acts further comprising annotating each of the functional groups on a visual representation of the area. 28. The system of claim 21, wherein the inferring the distribution of functions further comprises generating a leaving transition matrix and an arriving transition matrix which represents leaving mobility patterns and arriving mobility patterns, respectively, obtained over a period of time. 29. The system of claim 21, the acts further comprising determining one or more representative mobility patterns of each of the sections using a term frequency-inverse document frequency (TF-IDF) technique. 30. A method of determining functional groups of an area, comprising:
segmenting, by one or more processors, a map of the area into sections; for each section:
determining, by the one or more processors, mobility patterns of users leaving from and arriving at the section,
determining, by the one or more processors, one or more points of interest (POIs) that are located in the section, and
inferring, by the one or more processors, a distribution of functions for the section according to a topic model framework based at least in part on the mobility patterns and the one or more POIs; and
determining, by the one or more processors, a set of functional groups based at least in part on the distribution of functions for each section. 31. The method of claim 30, wherein the topic model framework that applies the section as a document, applies each function of the distribution of functions as a topic, and applies the mobility patterns as words. 32. The method of claim 30, wherein the mobility patterns comprise leaving mobility patterns and arriving mobility patterns determined over a period of time, each leaving mobility pattern describing a leaving time when the users leave from the section and a destination section that the users leave toward, each arriving mobility pattern describing an arriving time when the users arrive at the section and an origin section that the users arrive from. 33. The method of claim 30, further comprising determining a number of the one or more POIs in each of a plurality of point of interest (POI) categories to obtain a POI feature vector for the section, wherein the POI feature vector is based at least in part on calculating a frequency density of each of the plurality of POI categories, and wherein inferring the distribution of functions for the section is further based on the POI feature vector. 34. A method comprising:
segmenting, by one or more processors, a map of an area into sections; inferring, for each section and by the one or more processors, a distribution of functions according to a topic model framework which uses mobility patterns of users leaving from and arriving at the section and points of interest (POIs) in the section; and clustering, by the one or more processors, the sections based at least in part on a similarity of the distribution of functions between each of the sections to obtain functional groups. 35. The method of claim 34, wherein the topic model framework uses the section as a document, uses each function of the distribution of functions as a topic, uses the mobility patterns as words, and uses a point of interest (POI) feature vector of the POIs in the section as metadata. 36. The method of claim 35, wherein the POI feature vector is based at least in part on calculating a frequency density of each of a plurality of POI categories. 37. The method of claim 34, wherein the inferring the distribution of functions further comprises generating a leaving transition matrix and an arriving transition matrix which represents a frequency of the mobility patterns. 38. The method of claim 34, further comprising estimating a functionality intensity for each of the functional groups based on a Kernel Density Estimation (KDE) model, wherein an origin and a destination of each of the mobility patterns is provided as input to the KDE model. 39. The method of claim 34, wherein using the mobility patterns comprises determining one or more representative mobility patterns of each of the sections using a term frequency-inverse document frequency (TF-IDF) technique. 40. The method of claim 34, wherein the segmenting the map is based at least in part on a road network of the area. | 2,100 |
5,178 | 14,725,124 | 2,139 | A method, system and computer readable medium for managing and profiling control blocks via a storage control block administration operation. More specifically, in certain embodiments, the control block administration operation includes identifying areas of storage that are currently being used by storage control blocks. When the areas of storage being used by the control blocks are identified, the control blocks are profiled. In certain embodiments, the profiles enable limits and recovery actions to be specified by the control block administration operation. | 1. A method for administering control blocks, the method comprising:
identifying areas of storage that are currently being used as control blocks; profiling the control blocks to provide control block profile information; storing at least some of the control block profile information in a storage location remote from the control blocks; and, administering the control blocks using the control block profile information. 2. The method of claim 1, wherein:
the profiling further comprises associating a unique identifier with each control block. 3. The method of claim 1, wherein:
the profiling further comprises determining a type of the control block; and further comprising establishing control block properties to be monitored based upon the type of control block. 4. The method of claim 3, further comprising:
storing the control block properties for control blocks to be monitored within a control block administration data structure. 5. The method of claim 1, further comprising:
when an area of storage is identified as a control block to be monitored, the administering comprises a plurality of possible options affecting how the area of storage is to be used. 6. The method of claim 1, wherein:
the control block information includes at least one of a control block unique identifier length indicator, a location of the unique identifier of the control block, an identification of the unique identifier, secondary identifying characteristic of the control block if available, a control block length indicator of each control block, an indication of a limit to a total number of allowable control blocks of a particular type, control section (CSECT) names indicating a location from which the storage for control block is obtained, information regarding common storage task termination handling for the control block. 7. A system comprising:
a processor; a data bus coupled to the processor; and a computer-usable medium embodying computer program code, the computer-usable medium being coupled to the data bus, the computer program code comprising instructions executable by the processor and configured for: identifying areas of storage that are currently being used as control blocks; profiling the control blocks to provide control block profile information; storing at least some of the control block profile information in a storage location remote from the control blocks; and, administering the control blocks using the control block profile information. 8. The system of claim 7, wherein:
the profiling further comprises associating a unique identifier with each control block. 9. The system of claim 7, wherein:
the profiling further comprises determining a type of the control block; and the computer program code further comprises instructions executable by the processor and configured for: establishing properties to be monitored based upon the type of control block. 10. The system of claim 9, wherein the computer program code further comprises instructions executable by the processor and configured for:
storing the properties for control blocks to be monitored within a control block administration data structure. 11. The system of claim 7, wherein the computer program code further comprises instructions executable by the processor and configured for:
when an area of storage is identified as a control block to be monitored, the administering comprises a plurality of possible options affecting how the area of storage is to be used. 12. The system of claim 7, wherein:
the control block information includes at least one of a control block unique identifier length indicator, a location of the unique identifier of the control block, an identification of the unique identifier, secondary identifying characteristic of the control block if available, a control block length indicator of each control block, an indication of a limit to a total number of allowable control blocks of a particular type, control section (CSECT) names indicating a location from which the storage for control block is obtained, information regarding common storage task termination handling for the control block. 13. A computer-usable medium embodying computer program code, the computer program code comprising computer executable instructions configured for:
identifying areas of storage that are currently being used as control blocks; profiling the control blocks to provide control block profile information; storing at least some of the control block profile information in a storage location remote from the control blocks; and, administering the control blocks using the control block profile information. 14. The computer-usable medium of claim 13, wherein:
the profiling further comprises associating a unique identifier with each control block. 15. The computer-usable medium of claim 13, wherein:
the profiling further comprises determining a type of the control block; and the computer program code further comprises instructions executable by the processor and configured for: establishing properties to be monitored based upon the type of control block. 16. The computer-usable medium of claim 15, wherein the computer program code further comprises instructions executable by the processor and configured for:
storing the properties for control blocks to be monitored within a control block administration data structure. 17. The computer-usable medium of claim 13, wherein the computer program code further comprises instructions executable by the processor and configured for:
when an area of storage is identified as a control block to be monitored, the administering comprises a plurality of possible options affecting how the area of storage is to be used. 18. The computer-usable medium of claim 13, wherein:
the control block information includes at least one of a control block unique identifier length indicator, a location of the unique identifier of the control block, an identification of the unique identifier, secondary identifying characteristic of the control block if available, a control block length indicator of each control block, an indication of a limit to a total number of allowable control blocks of a particular type, control section (CSECT) names indicating a location from which the storage for control block is obtained, information regarding common storage task termination handling for the control block. | A method, system and computer readable medium for managing and profiling control blocks via a storage control block administration operation. More specifically, in certain embodiments, the control block administration operation includes identifying areas of storage that are currently being used by storage control blocks. When the areas of storage being used by the control blocks are identified, the control blocks are profiled. In certain embodiments, the profiles enable limits and recovery actions to be specified by the control block administration operation.1. A method for administering control blocks, the method comprising:
identifying areas of storage that are currently being used as control blocks; profiling the control blocks to provide control block profile information; storing at least some of the control block profile information in a storage location remote from the control blocks; and, administering the control blocks using the control block profile information. 2. The method of claim 1, wherein:
the profiling further comprises associating a unique identifier with each control block. 3. The method of claim 1, wherein:
the profiling further comprises determining a type of the control block; and further comprising establishing control block properties to be monitored based upon the type of control block. 4. The method of claim 3, further comprising:
storing the control block properties for control blocks to be monitored within a control block administration data structure. 5. The method of claim 1, further comprising:
when an area of storage is identified as a control block to be monitored, the administering comprises a plurality of possible options affecting how the area of storage is to be used. 6. The method of claim 1, wherein:
the control block information includes at least one of a control block unique identifier length indicator, a location of the unique identifier of the control block, an identification of the unique identifier, secondary identifying characteristic of the control block if available, a control block length indicator of each control block, an indication of a limit to a total number of allowable control blocks of a particular type, control section (CSECT) names indicating a location from which the storage for control block is obtained, information regarding common storage task termination handling for the control block. 7. A system comprising:
a processor; a data bus coupled to the processor; and a computer-usable medium embodying computer program code, the computer-usable medium being coupled to the data bus, the computer program code comprising instructions executable by the processor and configured for: identifying areas of storage that are currently being used as control blocks; profiling the control blocks to provide control block profile information; storing at least some of the control block profile information in a storage location remote from the control blocks; and, administering the control blocks using the control block profile information. 8. The system of claim 7, wherein:
the profiling further comprises associating a unique identifier with each control block. 9. The system of claim 7, wherein:
the profiling further comprises determining a type of the control block; and the computer program code further comprises instructions executable by the processor and configured for: establishing properties to be monitored based upon the type of control block. 10. The system of claim 9, wherein the computer program code further comprises instructions executable by the processor and configured for:
storing the properties for control blocks to be monitored within a control block administration data structure. 11. The system of claim 7, wherein the computer program code further comprises instructions executable by the processor and configured for:
when an area of storage is identified as a control block to be monitored, the administering comprises a plurality of possible options affecting how the area of storage is to be used. 12. The system of claim 7, wherein:
the control block information includes at least one of a control block unique identifier length indicator, a location of the unique identifier of the control block, an identification of the unique identifier, secondary identifying characteristic of the control block if available, a control block length indicator of each control block, an indication of a limit to a total number of allowable control blocks of a particular type, control section (CSECT) names indicating a location from which the storage for control block is obtained, information regarding common storage task termination handling for the control block. 13. A computer-usable medium embodying computer program code, the computer program code comprising computer executable instructions configured for:
identifying areas of storage that are currently being used as control blocks; profiling the control blocks to provide control block profile information; storing at least some of the control block profile information in a storage location remote from the control blocks; and, administering the control blocks using the control block profile information. 14. The computer-usable medium of claim 13, wherein:
the profiling further comprises associating a unique identifier with each control block. 15. The computer-usable medium of claim 13, wherein:
the profiling further comprises determining a type of the control block; and the computer program code further comprises instructions executable by the processor and configured for: establishing properties to be monitored based upon the type of control block. 16. The computer-usable medium of claim 15, wherein the computer program code further comprises instructions executable by the processor and configured for:
storing the properties for control blocks to be monitored within a control block administration data structure. 17. The computer-usable medium of claim 13, wherein the computer program code further comprises instructions executable by the processor and configured for:
when an area of storage is identified as a control block to be monitored, the administering comprises a plurality of possible options affecting how the area of storage is to be used. 18. The computer-usable medium of claim 13, wherein:
the control block information includes at least one of a control block unique identifier length indicator, a location of the unique identifier of the control block, an identification of the unique identifier, secondary identifying characteristic of the control block if available, a control block length indicator of each control block, an indication of a limit to a total number of allowable control blocks of a particular type, control section (CSECT) names indicating a location from which the storage for control block is obtained, information regarding common storage task termination handling for the control block. | 2,100 |
5,179 | 14,635,821 | 2,191 | In a website development tool, a web server is configured to communicatively couple to an Internet browser. An Internet browser opens a website administered by the web server. The website generates interactive objects associated with the backend processing of the web server. The website development tool includes a theme editor portion arranged to modify themes associated with pages of the website. When a modification command received at the theme editor requests a change to a first web page theme, a first theme identifier is communicated to a sector system controller. A theme draft is created based on the first theme, and a new URL is created by incorporating the theme draft's identifier into the original website URL. When the new URL is communicated to the web server, the web server delivers a web page having a control panel interface to the theme editor to the Internet browser via a proxy. | 1. A website development tool method, comprising:
operating a web server, the web server configured to execute backend processing and frontend processing, the web server configured to establish at least one frontend session communicatively coupling the web server to an Internet browser; opening a website with the Internet browser, the website addressed by a first uniform resource locator (URL), the website having a plurality of web pages, each web page of the website including a set of computer readable instructions, at least some of the computer readable instructions configured to create one or more interactive objects, the one or more interactive objects associated with the backend processing of the web server; operating a theme editor portion of the website development tool, the theme editor portion arranged to modify themes associated with web pages; receiving a modification command at the theme editor portion, the modification command arranged to request a change to a first theme associated with a first web page; based on the modification command, communicating a first theme identifier of the first theme to a sector system controller; creating a theme draft based on the first theme, the theme draft having a theme draft identifier; creating a new URL by incorporating the theme draft identifier into the first URL; communicating the new URL to the web server; and delivering, from the web server to the Internet browser, a web page having a control panel interface to the theme editor portion. 2. The website development tool method of claim 1 wherein the backend processing includes secure checkout processing for an Internet-based payment. 3. The website development tool method of claim 1 wherein the backend processing includes financial transaction processing. 4. The website development tool method of claim 3 wherein the financial transaction processing includes at least one of credit card processing, encrypted payment processing, and bitcoin processing. 5. The website development tool method of claim 1, comprising:
creating a proxy between the backend processing and the frontend session; and communicating information between the Internet browser and the web server via the proxy. 6. The website development tool method of claim 1 wherein opening the website includes creating a session between the Internet browser and the frontend processing. 7. The website development tool method of claim 1 wherein creating the theme draft, comprises:
making a copy of the first theme associated with the first web page. 8. The website development tool method of claim 1 wherein the first theme associated with the first web page defines a number of web page columns. 9. The website development tool method of claim 1 wherein the website is a retail storefront website configured to display merchandise on merchandise web pages of the plurality of web pages and configured to permit users to purchase the merchandise via an Internet-based transaction. 10. The website development tool method of claim 1, comprising:
receiving user input to save the theme draft; and updating the web server such that first theme identifier is directed to information of the theme draft. 11. A web server, comprising:
a processing unit; a transceiver to bi-directionally communicate information between a plurality of remote computing devices and the web server such that each remote computing device maintains at least one session identifying a communicative relationship between the web server and a respective Internet browser executing on each remote computing device; and a memory, the memory having stored program instructions arranged to be executed by the processing unit, the program instructions configured to:
execute web server backend processing logic;
execute web server frontend processing logic;
serve web pages of one or more websites, wherein each website has a top-level domain uniform resource locator (URL), wherein each website has a plurality of web pages, wherein each web page includes a set of computer readable instructions, at least some of the computer readable instructions configured to create one or more interactive objects, the one or more interactive objects associated with the backend processing logic, wherein each web page is formatted according to a theme, the theme having an associated theme identifier;
recognize a command from a first Internet browser to modify a first theme associated with a first web page;
create a theme draft based on the first theme in response to the command to modify the first theme, the theme draft having a theme draft identifier;
communicate the theme draft identifier to the first Internet browser;
recognize a URL incorporating the theme draft identifier;
serve a web page having a control panel interface to a theme editor; and
serve at least one additional web page structured according to a modified theme, the modified theme directed by user input to the theme editor. 12. The web server according to claim 11 wherein the program instructions are further configured to:
configure a proxy between the web server and a first computing device, the proxy arranged to communicate information between the backend processing logic and the first Internet browser. 13. The web server according to claim 11 wherein the backend processing logic includes financial transaction processing. 14. The web server according to claim 11 wherein a URL of the first web page and the URL incorporating the theme draft identifier share a common top-level domain. 15. The web server according to claim 11 wherein the program instructions are further configured to:
permit real-time manipulation of web pages associated with a first website that administers the first web page;
serve web pages constructed according to the modified theme; and
update the first theme in real-time based on a command from the first Internet browser to publish the first theme. 16. At least one non-transitory computer readable storage medium whose stored contents configure a computing system to perform a method, the method comprising:
executing backend processing of a web server; executing frontend processing of the web server; forming at least one frontend session communicatively coupling the web server to an Internet browser; serving a plurality of web pages of a website, the website addressed by a first uniform resource locator (URL), at least one web page of the website including a set of computer readable instructions configured to create one or more interactive objects, the one or more interactive objects associated with the backend processing of the web server; administering a theme editor, the theme editor configured to modify themes associated with web pages; receiving a request to modify a first theme associated with a first web page; based on the request, creating a theme draft based on the first theme, the theme draft having a theme draft identifier; recognizing a new URL, the new URL having a portion formed from the first URL and a portion formed from the theme draft identifier; receiving from the Internet browser at least one modification to the theme draft; and delivering to the Internet browser, an updated web page structured according to the modified theme draft. 17. The at least one non-transitory computer readable storage medium according to claim 16 whose stored contents configure the computing system to perform the method wherein opening a web page design editor comprises:
performing backend processing on information received from the Internet browser through the updated web page. 18. The at least one non-transitory computer readable storage medium according to claim 16 whose stored contents configure the computing system to perform the method wherein the backend processing includes financial transaction processing. 19. The at least one non-transitory computer readable storage medium according to claim 16 whose stored contents configure the computing system to perform the method wherein the website is a retail storefront website configured to display merchandise on merchandise web pages of the plurality of web pages and configured to permit users to purchase the merchandise via an Internet-based transaction. 20. The at least one non-transitory computer readable storage medium according to claim 16 whose stored contents configure the computing system to perform the method wherein opening the web page design editor comprises:
creating a proxy between the backend processing and the at least one frontend session; and
communicating information between the Internet browser and the web server via the proxy. | In a website development tool, a web server is configured to communicatively couple to an Internet browser. An Internet browser opens a website administered by the web server. The website generates interactive objects associated with the backend processing of the web server. The website development tool includes a theme editor portion arranged to modify themes associated with pages of the website. When a modification command received at the theme editor requests a change to a first web page theme, a first theme identifier is communicated to a sector system controller. A theme draft is created based on the first theme, and a new URL is created by incorporating the theme draft's identifier into the original website URL. When the new URL is communicated to the web server, the web server delivers a web page having a control panel interface to the theme editor to the Internet browser via a proxy.1. A website development tool method, comprising:
operating a web server, the web server configured to execute backend processing and frontend processing, the web server configured to establish at least one frontend session communicatively coupling the web server to an Internet browser; opening a website with the Internet browser, the website addressed by a first uniform resource locator (URL), the website having a plurality of web pages, each web page of the website including a set of computer readable instructions, at least some of the computer readable instructions configured to create one or more interactive objects, the one or more interactive objects associated with the backend processing of the web server; operating a theme editor portion of the website development tool, the theme editor portion arranged to modify themes associated with web pages; receiving a modification command at the theme editor portion, the modification command arranged to request a change to a first theme associated with a first web page; based on the modification command, communicating a first theme identifier of the first theme to a sector system controller; creating a theme draft based on the first theme, the theme draft having a theme draft identifier; creating a new URL by incorporating the theme draft identifier into the first URL; communicating the new URL to the web server; and delivering, from the web server to the Internet browser, a web page having a control panel interface to the theme editor portion. 2. The website development tool method of claim 1 wherein the backend processing includes secure checkout processing for an Internet-based payment. 3. The website development tool method of claim 1 wherein the backend processing includes financial transaction processing. 4. The website development tool method of claim 3 wherein the financial transaction processing includes at least one of credit card processing, encrypted payment processing, and bitcoin processing. 5. The website development tool method of claim 1, comprising:
creating a proxy between the backend processing and the frontend session; and communicating information between the Internet browser and the web server via the proxy. 6. The website development tool method of claim 1 wherein opening the website includes creating a session between the Internet browser and the frontend processing. 7. The website development tool method of claim 1 wherein creating the theme draft, comprises:
making a copy of the first theme associated with the first web page. 8. The website development tool method of claim 1 wherein the first theme associated with the first web page defines a number of web page columns. 9. The website development tool method of claim 1 wherein the website is a retail storefront website configured to display merchandise on merchandise web pages of the plurality of web pages and configured to permit users to purchase the merchandise via an Internet-based transaction. 10. The website development tool method of claim 1, comprising:
receiving user input to save the theme draft; and updating the web server such that first theme identifier is directed to information of the theme draft. 11. A web server, comprising:
a processing unit; a transceiver to bi-directionally communicate information between a plurality of remote computing devices and the web server such that each remote computing device maintains at least one session identifying a communicative relationship between the web server and a respective Internet browser executing on each remote computing device; and a memory, the memory having stored program instructions arranged to be executed by the processing unit, the program instructions configured to:
execute web server backend processing logic;
execute web server frontend processing logic;
serve web pages of one or more websites, wherein each website has a top-level domain uniform resource locator (URL), wherein each website has a plurality of web pages, wherein each web page includes a set of computer readable instructions, at least some of the computer readable instructions configured to create one or more interactive objects, the one or more interactive objects associated with the backend processing logic, wherein each web page is formatted according to a theme, the theme having an associated theme identifier;
recognize a command from a first Internet browser to modify a first theme associated with a first web page;
create a theme draft based on the first theme in response to the command to modify the first theme, the theme draft having a theme draft identifier;
communicate the theme draft identifier to the first Internet browser;
recognize a URL incorporating the theme draft identifier;
serve a web page having a control panel interface to a theme editor; and
serve at least one additional web page structured according to a modified theme, the modified theme directed by user input to the theme editor. 12. The web server according to claim 11 wherein the program instructions are further configured to:
configure a proxy between the web server and a first computing device, the proxy arranged to communicate information between the backend processing logic and the first Internet browser. 13. The web server according to claim 11 wherein the backend processing logic includes financial transaction processing. 14. The web server according to claim 11 wherein a URL of the first web page and the URL incorporating the theme draft identifier share a common top-level domain. 15. The web server according to claim 11 wherein the program instructions are further configured to:
permit real-time manipulation of web pages associated with a first website that administers the first web page;
serve web pages constructed according to the modified theme; and
update the first theme in real-time based on a command from the first Internet browser to publish the first theme. 16. At least one non-transitory computer readable storage medium whose stored contents configure a computing system to perform a method, the method comprising:
executing backend processing of a web server; executing frontend processing of the web server; forming at least one frontend session communicatively coupling the web server to an Internet browser; serving a plurality of web pages of a website, the website addressed by a first uniform resource locator (URL), at least one web page of the website including a set of computer readable instructions configured to create one or more interactive objects, the one or more interactive objects associated with the backend processing of the web server; administering a theme editor, the theme editor configured to modify themes associated with web pages; receiving a request to modify a first theme associated with a first web page; based on the request, creating a theme draft based on the first theme, the theme draft having a theme draft identifier; recognizing a new URL, the new URL having a portion formed from the first URL and a portion formed from the theme draft identifier; receiving from the Internet browser at least one modification to the theme draft; and delivering to the Internet browser, an updated web page structured according to the modified theme draft. 17. The at least one non-transitory computer readable storage medium according to claim 16 whose stored contents configure the computing system to perform the method wherein opening a web page design editor comprises:
performing backend processing on information received from the Internet browser through the updated web page. 18. The at least one non-transitory computer readable storage medium according to claim 16 whose stored contents configure the computing system to perform the method wherein the backend processing includes financial transaction processing. 19. The at least one non-transitory computer readable storage medium according to claim 16 whose stored contents configure the computing system to perform the method wherein the website is a retail storefront website configured to display merchandise on merchandise web pages of the plurality of web pages and configured to permit users to purchase the merchandise via an Internet-based transaction. 20. The at least one non-transitory computer readable storage medium according to claim 16 whose stored contents configure the computing system to perform the method wherein opening the web page design editor comprises:
creating a proxy between the backend processing and the at least one frontend session; and
communicating information between the Internet browser and the web server via the proxy. | 2,100 |
5,180 | 13,316,624 | 2,127 | A computer-implemented method of representing a software application to be coded in a procedural language is provided. An initial UML class diagram modelizing the software application is received. Data definition classes within the initial UML class diagram are identified. Class operations within the initial UML class diagram are identified. The initial UML class diagram is modified by a processor to generate an extended UML class diagram by applying a data object stereotype to the identified data definition classes, and applying a program stereotype to the identified class operations. The data definition classes represent logical data, and the class operations represents programs. | 1-6. (canceled) 7. A computer-implemented method of representing a software application to be coded in a procedural language, comprising
receiving an initial UML class diagram modelizing the software application; identifying data definition classes within the initial UML class diagram; identifying class operations within the initial UML class diagram; and modifying, by a processor, the initial UML class diagram to generate an extended UML class diagram by
applying a data object stereotype to the identified data definition classes, and
applying a program stereotype to the identified class operations, wherein
the data definition classes represent logical data, and the class operations represents programs. 8. The method of claim 7, further comprising:
for each parameter of the identified class operations, identifying whether the parameter is a resource or external data. 9. The method of claim 8, further comprising:
upon identifying the parameter as external data, taking no further action and proceeding to process a next parameter. 10. The method of claim 7, wherein
the procedural language is COBOL. 11. The method of claim 7, further comprising
using the extended UML class diagram to create program code in the procedural language. 12. A computer-hardware system for representing a software application to be coded in a procedural language, comprising
a processor, wherein the processor is configured to perform:
receiving an initial UML class diagram modelizing the software application;
identifying data definition classes within the initial UML class diagram;
identifying class operations within the initial UML class diagram; and
modifying, by a processor, the initial UML class diagram to generate an extended UML class diagram by
applying a data object stereotype to the identified data definition classes, and
applying a program stereotype to the identified class operations, wherein
the data definition classes represent logical data, and the class operations represents programs. 13. The computer-hardware system of claim 12, wherein the processor is further configured to perform:
for each parameter of the identified class operations, identify whether the parameter is a resource or external data. 14. The computer-hardware system of claim 13, wherein the processor is further configured to perform:
upon identifying the parameter as external data, taking no further action and proceeding to process a next parameter. 15. The computer-hardware system of claim 12, wherein
the procedural language is COBOL. 16. The computer-hardware system of claim 12, wherein the processor is further configured to perform:
using the extended UML class diagram to create program code in the procedural language. | A computer-implemented method of representing a software application to be coded in a procedural language is provided. An initial UML class diagram modelizing the software application is received. Data definition classes within the initial UML class diagram are identified. Class operations within the initial UML class diagram are identified. The initial UML class diagram is modified by a processor to generate an extended UML class diagram by applying a data object stereotype to the identified data definition classes, and applying a program stereotype to the identified class operations. The data definition classes represent logical data, and the class operations represents programs.1-6. (canceled) 7. A computer-implemented method of representing a software application to be coded in a procedural language, comprising
receiving an initial UML class diagram modelizing the software application; identifying data definition classes within the initial UML class diagram; identifying class operations within the initial UML class diagram; and modifying, by a processor, the initial UML class diagram to generate an extended UML class diagram by
applying a data object stereotype to the identified data definition classes, and
applying a program stereotype to the identified class operations, wherein
the data definition classes represent logical data, and the class operations represents programs. 8. The method of claim 7, further comprising:
for each parameter of the identified class operations, identifying whether the parameter is a resource or external data. 9. The method of claim 8, further comprising:
upon identifying the parameter as external data, taking no further action and proceeding to process a next parameter. 10. The method of claim 7, wherein
the procedural language is COBOL. 11. The method of claim 7, further comprising
using the extended UML class diagram to create program code in the procedural language. 12. A computer-hardware system for representing a software application to be coded in a procedural language, comprising
a processor, wherein the processor is configured to perform:
receiving an initial UML class diagram modelizing the software application;
identifying data definition classes within the initial UML class diagram;
identifying class operations within the initial UML class diagram; and
modifying, by a processor, the initial UML class diagram to generate an extended UML class diagram by
applying a data object stereotype to the identified data definition classes, and
applying a program stereotype to the identified class operations, wherein
the data definition classes represent logical data, and the class operations represents programs. 13. The computer-hardware system of claim 12, wherein the processor is further configured to perform:
for each parameter of the identified class operations, identify whether the parameter is a resource or external data. 14. The computer-hardware system of claim 13, wherein the processor is further configured to perform:
upon identifying the parameter as external data, taking no further action and proceeding to process a next parameter. 15. The computer-hardware system of claim 12, wherein
the procedural language is COBOL. 16. The computer-hardware system of claim 12, wherein the processor is further configured to perform:
using the extended UML class diagram to create program code in the procedural language. | 2,100 |
5,181 | 14,488,164 | 2,199 | A maintenance mode mechanism (MMM) expedites host maintenance in a cloud computing environment by intelligently suspending essentially inactive virtual machines. The user is given the option to enter maintenance mode using the MMM. The MMM determines essentially inactive VMs that can be suspended to reduce the number of VMs that need to be migrated prior to entering a maintenance mode. Metrics of the VMs associated with the host are analyzed to determine which VMs can be suspended. Parameters can also be set by the user to instruct the MMM to verify the selection of a specific VM with the user. | 1. A method for placing a host with virtual machines in maintenance mode comprising:
determining at least one virtual machine on a host computer in a cloud computing system is an essentially inactive virtual machine; suspending the at least one essentially inactive virtual machines to reduce the number of active machines that must be reallocated before entering a maintenance mode; and entering the maintenance mode. 2. The method of claim 1 where in the step of determining the at least one virtual machine is an essentially inactive virtual machine further comprises the steps of:
analyzing a VM based on a host metric,
comparing the metric to a threshold; and
determining to suspend the VM. 3. The method of claim 2 wherein the metric of the host computer is a metric of the physical properties of the physical machine hosting the host computer. 4. The method of claim 3 wherein the physical properties of the physical machine hosting the host computer include central processing unit (CPU) utilization, disk utilization and network utilization and the determination to suspend the VM is made when any one of these metrics is above a threshold. 5. The method of claim 1 wherein a user it allowed to set the threshold. 6. The method of claim 1 further comprising storing a hold active bit for each virtual machine in the host, where the hold active bit is set to indicate that a corresponding virtual machine should not be suspended. 7. The method of claim 6 wherein the hold active bit for each virtual machine in the host is stored in a table with virtual machine identifiers and corresponding hold active bits. 8. The method of claim 7 further comprising the step of allowing the user to set a hold active bit in the table. 9. The method of claim 1 further comprising the step of providing an option to a user to expedite the maintenance mode by suspending essentially inactive virtual machines. 10. The method of claim 1 further comprising the step of providing an option to a user to verify the selection of essentially inactive virtual machines to suspend. 11. A method for placing a host with virtual machines in maintenance mode comprising:
allowing a user to set a threshold; providing an option to the user to expedite the maintenance mode by suspending essentially inactive virtual machines determining at least one virtual machine on a host computer in a cloud computing system is an essentially inactive virtual machine by performing the steps of:
analyzing a VM based on a host metric
comparing the metric to the threshold;
determining to suspend the VM;
wherein the physical properties of the metric include central processing unit (CPU) utilization, disk utilization and network utilization and the determination to suspend the VM is made when all the metrics are below the thresholds; storing a hold active bit in a table for each virtual machine in the host, where the hold active bit is set to indicate that a corresponding virtual machine should not be suspended; allowing the user to set a hold active bit in the table; and suspending the at least one essentially inactive virtual machines prior to entering a maintenance mode when a corresponding hold active bit is not set. | A maintenance mode mechanism (MMM) expedites host maintenance in a cloud computing environment by intelligently suspending essentially inactive virtual machines. The user is given the option to enter maintenance mode using the MMM. The MMM determines essentially inactive VMs that can be suspended to reduce the number of VMs that need to be migrated prior to entering a maintenance mode. Metrics of the VMs associated with the host are analyzed to determine which VMs can be suspended. Parameters can also be set by the user to instruct the MMM to verify the selection of a specific VM with the user.1. A method for placing a host with virtual machines in maintenance mode comprising:
determining at least one virtual machine on a host computer in a cloud computing system is an essentially inactive virtual machine; suspending the at least one essentially inactive virtual machines to reduce the number of active machines that must be reallocated before entering a maintenance mode; and entering the maintenance mode. 2. The method of claim 1 where in the step of determining the at least one virtual machine is an essentially inactive virtual machine further comprises the steps of:
analyzing a VM based on a host metric,
comparing the metric to a threshold; and
determining to suspend the VM. 3. The method of claim 2 wherein the metric of the host computer is a metric of the physical properties of the physical machine hosting the host computer. 4. The method of claim 3 wherein the physical properties of the physical machine hosting the host computer include central processing unit (CPU) utilization, disk utilization and network utilization and the determination to suspend the VM is made when any one of these metrics is above a threshold. 5. The method of claim 1 wherein a user it allowed to set the threshold. 6. The method of claim 1 further comprising storing a hold active bit for each virtual machine in the host, where the hold active bit is set to indicate that a corresponding virtual machine should not be suspended. 7. The method of claim 6 wherein the hold active bit for each virtual machine in the host is stored in a table with virtual machine identifiers and corresponding hold active bits. 8. The method of claim 7 further comprising the step of allowing the user to set a hold active bit in the table. 9. The method of claim 1 further comprising the step of providing an option to a user to expedite the maintenance mode by suspending essentially inactive virtual machines. 10. The method of claim 1 further comprising the step of providing an option to a user to verify the selection of essentially inactive virtual machines to suspend. 11. A method for placing a host with virtual machines in maintenance mode comprising:
allowing a user to set a threshold; providing an option to the user to expedite the maintenance mode by suspending essentially inactive virtual machines determining at least one virtual machine on a host computer in a cloud computing system is an essentially inactive virtual machine by performing the steps of:
analyzing a VM based on a host metric
comparing the metric to the threshold;
determining to suspend the VM;
wherein the physical properties of the metric include central processing unit (CPU) utilization, disk utilization and network utilization and the determination to suspend the VM is made when all the metrics are below the thresholds; storing a hold active bit in a table for each virtual machine in the host, where the hold active bit is set to indicate that a corresponding virtual machine should not be suspended; allowing the user to set a hold active bit in the table; and suspending the at least one essentially inactive virtual machines prior to entering a maintenance mode when a corresponding hold active bit is not set. | 2,100 |
5,182 | 13,743,989 | 2,123 | In some implementations, a method for determining behavior associated with a user device includes receiving behavior data of the user device that includes multiple types of behavior data. The behavior data is compared with patterns of behavior data associated with the user device. The behavior-data patterns are generated from previously-received behavior data. A notification is generated based on comparing the behavior data to the behavior-data patterns. | 1. A method for determining behavior associated with a user device, comprising:
receiving behavior data identifying multiple types of user interaction with the user device; comparing the behavior data with patterns of behavior data associated with the user device, wherein the behavior-data patterns are generated from previously-received behavior data of an original user; determining a current user is potentially different from the original user based on the comparison of the behavior data with the patterns; and transmitting a command to the user device to lock the user device until the current user is verified as the original user. 2. The method of claim 1, wherein the multiple types of user interaction includes at least one of grammar, punctuation, typing speed, spelling errors, vocabulary, application usage, online activity, or communication with third-party devices. 3. The method of claim 1, wherein comparing the behavior data with patterns of behavior data comprises:
iteratively identifying representative behavior data and an associated threshold for each type of user interaction with the user device for the patterns; and for each iteration, determining whether the behavior data matches a magnitude range for a pattern selected during that iteration, wherein the magnitude range for each type of behavior data is defined by the representative behavior data and the associated threshold. 4. The method of claim 1, wherein the behavior data includes data from multiple sensors. 5. The method of claim 4, wherein the data from multiple sensors includes data from at least one of a magnetometer, a location processor, a light sensor, an accelerometer, thermometer, a proximity sensor, or a touch screen. 6. The method of claim 1, further comprising applying a pattern recognition technique to previously received behavior data to generate patterns of behavior data. 7. The method of claim 1, further comprising presenting a request to select participation in determining unusual behavior patterns or filtering out certain types of behavior data. 8. A method for determining behavior associated with a user device, comprising:
receiving data from multiple sensors identifying current physical activity and an associated time from the user device; comparing the data from multiple sensors and the associated time with patterns of sensor data associated with the user device, wherein the sensor-data patterns are generated from previously-received data from multiple sensors and associated times associated with a user; determining the current physical activity indicates unusual physical activity for the user based on the comparison of the data with the patterns; and transmitting a notification to a third-party device indicating the unusual physical activity of the user. 9. The method of claim 8, further comprising:
receiving relative locations associated with the data from multiple sensors and the associated time period; and determining whether the data from the multiple sensors, the associated time period, and the relative locations match any of the patterns of sensor data. 10. The method of claim 8, wherein the data from multiple sensors includes data from at least two of a magnetometer, a location processor, a light sensor, an accelerometer, thermometer, a proximity sensor, or a touch screen. 11. The method of claim 8, wherein the unusual physical activity indicates a period of inactivity at a residence of the user. 12. A computer program product encoded on a non-transitory medium, the product comprising computer readable instructions for causing one or more processors to perform operations comprising:
receiving behavior data identifying multiple types of user interaction with the user device; comparing the behavior data with patterns of behavior data associated with the user device, wherein the behavior-data patterns are generated from previously-received behavior data of an original user; determining a current user is potentially different from the original user based on the comparison of the behavior data with the patterns; and transmitting a command to the user device to lock the user device until the current user is verified as the original user. 12. The computer program product of claim 11, wherein the multiple types of user interaction includes at least one of grammar, punctuation, typing speed, spelling errors, vocabulary, application usage, online activity, or communication with third-party devices. 13. The computer program product of claim 11, wherein the instructions comprising comparing the behavior data with patterns of behavior data includes the instructions comprising:
iteratively identifying representative behavior data and an associated threshold for each type of user interaction with the user device for the patterns; and for each iteration, determining whether the behavior data matches a magnitude range for a pattern selected during that iteration, wherein the magnitude range for each type of behavior data is defined by the representative behavior data and the associated threshold. 14. The computer program product of claim 11, wherein the behavior data includes data from multiple sensors of the user device. 15. The computer program product of claim 14, wherein the data from multiple sensors includes data from at least two of a magnetometer, a location processor, a light sensor, an accelerometer, thermometer, a proximity sensor, or a touch screen. 16. The computer program product of claim 11, the instructions further comprising applying a pattern recognition technique to previously received behavior data to generate patterns of behavior data. 17. The computer program product of claim 11, the instructions further comprising presenting a request to select participation in determining unusual behavior patterns or filtering out certain types of behavior data. 18. A computer program product encoded on a non-transitory medium, the product comprising computer readable instructions for causing one or more processors to perform operations comprising:
receiving data from multiple sensors identifying current physical activity and an associated time from the user device; comparing the data from multiple sensors and the associated time with patterns of sensor data associated with the user device, wherein the sensor-data patterns are generated from previously-received data from multiple sensors and associated times associated with a user; determining the current physical activity indicates unusual physical activity for the user based on the comparison of the data with the patterns; and transmitting a notification to a third-party device indicating the unusual physical activity of the user. 19. The computer program product of claim 18, the instructions further comprising:
receiving relative locations associated with the data from multiple sensors and the associated time period; and determining whether the data from the multiple sensors, the associated time period, and the relative locations match any of the patterns of sensor data. 20. The computer program product of claim 18, wherein the data from multiple sensors includes data from at least two of a magnetometer, a location processor, a light sensor, an accelerometer, thermometer, a proximity sensor, or a touch screen. | In some implementations, a method for determining behavior associated with a user device includes receiving behavior data of the user device that includes multiple types of behavior data. The behavior data is compared with patterns of behavior data associated with the user device. The behavior-data patterns are generated from previously-received behavior data. A notification is generated based on comparing the behavior data to the behavior-data patterns.1. A method for determining behavior associated with a user device, comprising:
receiving behavior data identifying multiple types of user interaction with the user device; comparing the behavior data with patterns of behavior data associated with the user device, wherein the behavior-data patterns are generated from previously-received behavior data of an original user; determining a current user is potentially different from the original user based on the comparison of the behavior data with the patterns; and transmitting a command to the user device to lock the user device until the current user is verified as the original user. 2. The method of claim 1, wherein the multiple types of user interaction includes at least one of grammar, punctuation, typing speed, spelling errors, vocabulary, application usage, online activity, or communication with third-party devices. 3. The method of claim 1, wherein comparing the behavior data with patterns of behavior data comprises:
iteratively identifying representative behavior data and an associated threshold for each type of user interaction with the user device for the patterns; and for each iteration, determining whether the behavior data matches a magnitude range for a pattern selected during that iteration, wherein the magnitude range for each type of behavior data is defined by the representative behavior data and the associated threshold. 4. The method of claim 1, wherein the behavior data includes data from multiple sensors. 5. The method of claim 4, wherein the data from multiple sensors includes data from at least one of a magnetometer, a location processor, a light sensor, an accelerometer, thermometer, a proximity sensor, or a touch screen. 6. The method of claim 1, further comprising applying a pattern recognition technique to previously received behavior data to generate patterns of behavior data. 7. The method of claim 1, further comprising presenting a request to select participation in determining unusual behavior patterns or filtering out certain types of behavior data. 8. A method for determining behavior associated with a user device, comprising:
receiving data from multiple sensors identifying current physical activity and an associated time from the user device; comparing the data from multiple sensors and the associated time with patterns of sensor data associated with the user device, wherein the sensor-data patterns are generated from previously-received data from multiple sensors and associated times associated with a user; determining the current physical activity indicates unusual physical activity for the user based on the comparison of the data with the patterns; and transmitting a notification to a third-party device indicating the unusual physical activity of the user. 9. The method of claim 8, further comprising:
receiving relative locations associated with the data from multiple sensors and the associated time period; and determining whether the data from the multiple sensors, the associated time period, and the relative locations match any of the patterns of sensor data. 10. The method of claim 8, wherein the data from multiple sensors includes data from at least two of a magnetometer, a location processor, a light sensor, an accelerometer, thermometer, a proximity sensor, or a touch screen. 11. The method of claim 8, wherein the unusual physical activity indicates a period of inactivity at a residence of the user. 12. A computer program product encoded on a non-transitory medium, the product comprising computer readable instructions for causing one or more processors to perform operations comprising:
receiving behavior data identifying multiple types of user interaction with the user device; comparing the behavior data with patterns of behavior data associated with the user device, wherein the behavior-data patterns are generated from previously-received behavior data of an original user; determining a current user is potentially different from the original user based on the comparison of the behavior data with the patterns; and transmitting a command to the user device to lock the user device until the current user is verified as the original user. 12. The computer program product of claim 11, wherein the multiple types of user interaction includes at least one of grammar, punctuation, typing speed, spelling errors, vocabulary, application usage, online activity, or communication with third-party devices. 13. The computer program product of claim 11, wherein the instructions comprising comparing the behavior data with patterns of behavior data includes the instructions comprising:
iteratively identifying representative behavior data and an associated threshold for each type of user interaction with the user device for the patterns; and for each iteration, determining whether the behavior data matches a magnitude range for a pattern selected during that iteration, wherein the magnitude range for each type of behavior data is defined by the representative behavior data and the associated threshold. 14. The computer program product of claim 11, wherein the behavior data includes data from multiple sensors of the user device. 15. The computer program product of claim 14, wherein the data from multiple sensors includes data from at least two of a magnetometer, a location processor, a light sensor, an accelerometer, thermometer, a proximity sensor, or a touch screen. 16. The computer program product of claim 11, the instructions further comprising applying a pattern recognition technique to previously received behavior data to generate patterns of behavior data. 17. The computer program product of claim 11, the instructions further comprising presenting a request to select participation in determining unusual behavior patterns or filtering out certain types of behavior data. 18. A computer program product encoded on a non-transitory medium, the product comprising computer readable instructions for causing one or more processors to perform operations comprising:
receiving data from multiple sensors identifying current physical activity and an associated time from the user device; comparing the data from multiple sensors and the associated time with patterns of sensor data associated with the user device, wherein the sensor-data patterns are generated from previously-received data from multiple sensors and associated times associated with a user; determining the current physical activity indicates unusual physical activity for the user based on the comparison of the data with the patterns; and transmitting a notification to a third-party device indicating the unusual physical activity of the user. 19. The computer program product of claim 18, the instructions further comprising:
receiving relative locations associated with the data from multiple sensors and the associated time period; and determining whether the data from the multiple sensors, the associated time period, and the relative locations match any of the patterns of sensor data. 20. The computer program product of claim 18, wherein the data from multiple sensors includes data from at least two of a magnetometer, a location processor, a light sensor, an accelerometer, thermometer, a proximity sensor, or a touch screen. | 2,100 |
5,183 | 14,148,095 | 2,163 | A data model extends or supplements an entity/resource association to include a “quality” of that association, where the quality is defined by an ordered set of relative values/characteristics. In an example scenario, an entity/resource association is augmented to include a quality characteristic that is defined by a tuple that is preferably an ordered set of relative values. The number of values and their designations in the data model will depend on nature of the underlying entity/resource association. When entity/resource associations are annotated to include relative quality values in this manner, much more useful comparisons of apparently similar entity/resource associations may be carried out. | 1. A method of categorizing activity in a computing system, comprising:
monitoring an interaction between an entity and a resource to define an entity/resource association; associating a quality to the entity/resource association, the quality being one of a set of relative qualities, and wherein the quality associated is dependent on a characteristic of the interaction; and recording the entity/resource association together with the quality; wherein at least one of the monitoring, associating and recording steps is carried out in software executing in a hardware element. 2. The method as described in claim 1 further including defining or obtaining the set of relative qualities prior to the monitoring. 3. The method as described in claim 1 further including:
comparing qualities associated with first and second entity/resource associations; and
making a determination regarding the first and second entity/resource associations based on the qualities. 4. The method as described in claim 3 wherein the determination is that one of the respective first and second entity/resource associations is not reliable. 5. The method as described in claim 1 wherein the activity is an authentication activity and the set of relative qualities are one of: a strong authentication, a loose binding, and a loose association. 6. The method as described in claim 1 wherein the quality is designated as one of: an enumerated value, and a numerical value. 7. The method as described in claim 1 wherein the entity/resource association is recorded together with the quality in a log file. 8. Apparatus, comprising:
a processor; computer memory holding computer program instructions that when executed by the processor categorize activity in a computing system, the computer program instructions comprising:
program code to monitor an interaction between an entity and a resource to define an entity/resource association;
program code to associate a quality to the entity/resource association, the quality being one of a set of relative qualities, and wherein the quality associated is dependent on a characteristic of the interaction; and
program code to record the entity/resource association together with the quality. 9. The apparatus as described in claim 8 wherein the computer program instructions further include program code to define or obtain the set of relative qualities prior to monitoring the interaction. 10. The apparatus as described in claim 8 wherein the computer program instructions further include:
program code to compare qualities associated with first and second entity/resource associations; and
program code to make a determination regarding the first and second entity/resource associations based on the qualities. 11. The apparatus as described in claim 10 wherein the determination is that one of the respective first and second entity/resource associations is not reliable. 12. The apparatus as described in claim 8 wherein the activity is an authentication activity and the set of relative qualities are one of: a strong authentication, a loose binding, and a loose association. 13. The apparatus as described in claim 8 wherein the quality is designated as one of: an enumerated value, and a numerical value. 14. The apparatus as described in claim 8 wherein the entity/resource association is recorded together with the quality in a log file. 15. A computer program product in a non-transitory computer readable medium to categorize activity in a data processing system, the computer program product holding computer program instructions, comprising:
program code to monitor an interaction between an entity and a resource to define an entity/resource association; program code to associate a quality to the entity/resource association, the quality being one of a set of relative qualities, and wherein the quality associated is dependent on a characteristic of the interaction; and program code to record the entity/resource association together with the quality. 16. The computer program product as described in claim 15 wherein the computer program instructions further include program code to define or obtain the set of relative qualities prior to monitoring the interaction. 17. The computer program product as described in claim 15 wherein the computer program instructions further include:
program code to compare qualities associated with first and second entity/resource associations; and
program code to make a determination regarding the first and second entity/resource associations based on the qualities. 18. The computer program product as described in claim 17 wherein the determination is that one of the respective first and second entity/resource associations is not reliable. 19. The computer program product as described in claim 15 wherein the activity is an authentication activity and the set of relative qualities are one of: a strong authentication, a loose binding, and a loose association. 20. The computer program product as described in claim 15 wherein the quality is designated as one of: an enumerated value, and a numerical value. | A data model extends or supplements an entity/resource association to include a “quality” of that association, where the quality is defined by an ordered set of relative values/characteristics. In an example scenario, an entity/resource association is augmented to include a quality characteristic that is defined by a tuple that is preferably an ordered set of relative values. The number of values and their designations in the data model will depend on nature of the underlying entity/resource association. When entity/resource associations are annotated to include relative quality values in this manner, much more useful comparisons of apparently similar entity/resource associations may be carried out.1. A method of categorizing activity in a computing system, comprising:
monitoring an interaction between an entity and a resource to define an entity/resource association; associating a quality to the entity/resource association, the quality being one of a set of relative qualities, and wherein the quality associated is dependent on a characteristic of the interaction; and recording the entity/resource association together with the quality; wherein at least one of the monitoring, associating and recording steps is carried out in software executing in a hardware element. 2. The method as described in claim 1 further including defining or obtaining the set of relative qualities prior to the monitoring. 3. The method as described in claim 1 further including:
comparing qualities associated with first and second entity/resource associations; and
making a determination regarding the first and second entity/resource associations based on the qualities. 4. The method as described in claim 3 wherein the determination is that one of the respective first and second entity/resource associations is not reliable. 5. The method as described in claim 1 wherein the activity is an authentication activity and the set of relative qualities are one of: a strong authentication, a loose binding, and a loose association. 6. The method as described in claim 1 wherein the quality is designated as one of: an enumerated value, and a numerical value. 7. The method as described in claim 1 wherein the entity/resource association is recorded together with the quality in a log file. 8. Apparatus, comprising:
a processor; computer memory holding computer program instructions that when executed by the processor categorize activity in a computing system, the computer program instructions comprising:
program code to monitor an interaction between an entity and a resource to define an entity/resource association;
program code to associate a quality to the entity/resource association, the quality being one of a set of relative qualities, and wherein the quality associated is dependent on a characteristic of the interaction; and
program code to record the entity/resource association together with the quality. 9. The apparatus as described in claim 8 wherein the computer program instructions further include program code to define or obtain the set of relative qualities prior to monitoring the interaction. 10. The apparatus as described in claim 8 wherein the computer program instructions further include:
program code to compare qualities associated with first and second entity/resource associations; and
program code to make a determination regarding the first and second entity/resource associations based on the qualities. 11. The apparatus as described in claim 10 wherein the determination is that one of the respective first and second entity/resource associations is not reliable. 12. The apparatus as described in claim 8 wherein the activity is an authentication activity and the set of relative qualities are one of: a strong authentication, a loose binding, and a loose association. 13. The apparatus as described in claim 8 wherein the quality is designated as one of: an enumerated value, and a numerical value. 14. The apparatus as described in claim 8 wherein the entity/resource association is recorded together with the quality in a log file. 15. A computer program product in a non-transitory computer readable medium to categorize activity in a data processing system, the computer program product holding computer program instructions, comprising:
program code to monitor an interaction between an entity and a resource to define an entity/resource association; program code to associate a quality to the entity/resource association, the quality being one of a set of relative qualities, and wherein the quality associated is dependent on a characteristic of the interaction; and program code to record the entity/resource association together with the quality. 16. The computer program product as described in claim 15 wherein the computer program instructions further include program code to define or obtain the set of relative qualities prior to monitoring the interaction. 17. The computer program product as described in claim 15 wherein the computer program instructions further include:
program code to compare qualities associated with first and second entity/resource associations; and
program code to make a determination regarding the first and second entity/resource associations based on the qualities. 18. The computer program product as described in claim 17 wherein the determination is that one of the respective first and second entity/resource associations is not reliable. 19. The computer program product as described in claim 15 wherein the activity is an authentication activity and the set of relative qualities are one of: a strong authentication, a loose binding, and a loose association. 20. The computer program product as described in claim 15 wherein the quality is designated as one of: an enumerated value, and a numerical value. | 2,100 |
5,184 | 14,959,938 | 2,164 | The deep application crawling technique described herein crawls one or more applications, commonly referred to as “apps”, in order to extract information inside of them. This can involve crawling and extracting static data that are embedded within apps or resource files that are associated with the apps. The technique can also crawl and extract dynamic data that apps download from the Internet or display to the user on demand, in order to extract data. This extracted static and/or data can then be used by another application or an engine to perform various functions. For example, the technique can use the extracted data to provide search results in response to a user query entered into a search engine. Alternately, the extracted static and/or dynamic data can be used by an advertisement engine to select application-specific advertisements. Or the data can be used by a recommendation engine to make recommendations for goods/services. | 1. A computing system comprising:
at least one processor; and memory that comprises instructions that, when executed by the at least one processor, cause the at least one processor to perform acts comprising:
responsive to receipt of a query from a mobile computing device, executing a search over indexed data for content related to the query, the indexed data comprises data extracted from an application that is available for download from a marketplace of applications; and
based upon the search, providing search results to the mobile computing device, the search results comprise at least one of:
the data extracted from the application; or
an option to download the application from the marketplace. 2. The computing system of claim 1, wherein the application is a mobile application that is configured for installment on the mobile computing device. 3. The computing system of claim 2, wherein the application is a location-based application that is configured to present location-specific information on a display of the mobile computing device. 4. The computing system of claim 1, wherein the search results further comprise a link to a web page. 5. The computing system of claim 1, wherein the data extracted from the application comprises data extracted from binary code of the application. 6. The computing system of claim 5, wherein the data extracted from the binary code of the application comprises hyperlinks. 7. The computing system of claim 1, wherein the data extracted from the application comprises data retrieved by the application from a web page. 8. The computing system of claim 1, the data extracted from the application, when included in the search results, is indicated as corresponding to the application. 9. The computing system of claim 1, the option to download the application from the marketplace includes a request to purchase the application from the marketplace. 10. The computing system of claim 1, the query is registered with the computing system as an alert request, and wherein the at least one processor periodically executes the search over the indexed data based upon the query being registered with the computing system as an alert request. 11. A method executed by at least one computer processor, the method comprising:
in response to receipt of a query from a mobile computing device, executing a search over indexed data, the indexed data comprises data extracted from within an application, the application is configured to be executed on the mobile computing device, the application available for download from a marketplace of applications, wherein the data extracted from within the application is identified during the search as being relevant to the query; and transmitting search results to the mobile computing device based upon the search, the search results transmitted for display on the mobile computing device, the search results comprise a selectable option to download the application from the marketplace of applications. 12. The method of claim 11, the search results further comprise the data extracted from within the application. 13. The method of claim 12, the data extracted from within the application, when included in the search results, comprises an indicator that the data extracted from within the application corresponds to the application. 14. The method of claim 11, the marketplace of applications comprises a plurality of applications that are configured to be installed and executed on the mobile computing device. 15. The method of claim 14, the mobile computing device being a mobile telephone. 16. The method of claim 11, further comprising:
identifying an advertisement based upon the data extracted from within the application; and causing the advertisement to be presented with the search results on the mobile computing device. 17. The method of claim 11, the data extracted from within the application being data extracted from at least one of binary code of the application or source code of the application. 18. The method of claim 11, the data extracted from within the application being data extracted from a resource file of the application. 19. Computer-readable memory comprising instructions that, when executed by a processor, cause the processor to perform acts comprising:
searching over indexed data based upon a query received from a mobile computing device, the indexed data comprises data extracted from a mobile application that is available for download and installment from an application marketplace, the application marketplace comprises a plurality of mobile applications that are available for download and installment on the mobile computing device; determining that the data extracted from the mobile application is relevant to the query; and transmitting search results to the mobile computing device responsive to determining that the data extracted from the mobile application is relevant to the query, the search results comprise an option to download the mobile application from the application marketplace. 20. The computer-readable memory of claim 19, the search results further comprise the data extracted from the mobile application. | The deep application crawling technique described herein crawls one or more applications, commonly referred to as “apps”, in order to extract information inside of them. This can involve crawling and extracting static data that are embedded within apps or resource files that are associated with the apps. The technique can also crawl and extract dynamic data that apps download from the Internet or display to the user on demand, in order to extract data. This extracted static and/or data can then be used by another application or an engine to perform various functions. For example, the technique can use the extracted data to provide search results in response to a user query entered into a search engine. Alternately, the extracted static and/or dynamic data can be used by an advertisement engine to select application-specific advertisements. Or the data can be used by a recommendation engine to make recommendations for goods/services.1. A computing system comprising:
at least one processor; and memory that comprises instructions that, when executed by the at least one processor, cause the at least one processor to perform acts comprising:
responsive to receipt of a query from a mobile computing device, executing a search over indexed data for content related to the query, the indexed data comprises data extracted from an application that is available for download from a marketplace of applications; and
based upon the search, providing search results to the mobile computing device, the search results comprise at least one of:
the data extracted from the application; or
an option to download the application from the marketplace. 2. The computing system of claim 1, wherein the application is a mobile application that is configured for installment on the mobile computing device. 3. The computing system of claim 2, wherein the application is a location-based application that is configured to present location-specific information on a display of the mobile computing device. 4. The computing system of claim 1, wherein the search results further comprise a link to a web page. 5. The computing system of claim 1, wherein the data extracted from the application comprises data extracted from binary code of the application. 6. The computing system of claim 5, wherein the data extracted from the binary code of the application comprises hyperlinks. 7. The computing system of claim 1, wherein the data extracted from the application comprises data retrieved by the application from a web page. 8. The computing system of claim 1, the data extracted from the application, when included in the search results, is indicated as corresponding to the application. 9. The computing system of claim 1, the option to download the application from the marketplace includes a request to purchase the application from the marketplace. 10. The computing system of claim 1, the query is registered with the computing system as an alert request, and wherein the at least one processor periodically executes the search over the indexed data based upon the query being registered with the computing system as an alert request. 11. A method executed by at least one computer processor, the method comprising:
in response to receipt of a query from a mobile computing device, executing a search over indexed data, the indexed data comprises data extracted from within an application, the application is configured to be executed on the mobile computing device, the application available for download from a marketplace of applications, wherein the data extracted from within the application is identified during the search as being relevant to the query; and transmitting search results to the mobile computing device based upon the search, the search results transmitted for display on the mobile computing device, the search results comprise a selectable option to download the application from the marketplace of applications. 12. The method of claim 11, the search results further comprise the data extracted from within the application. 13. The method of claim 12, the data extracted from within the application, when included in the search results, comprises an indicator that the data extracted from within the application corresponds to the application. 14. The method of claim 11, the marketplace of applications comprises a plurality of applications that are configured to be installed and executed on the mobile computing device. 15. The method of claim 14, the mobile computing device being a mobile telephone. 16. The method of claim 11, further comprising:
identifying an advertisement based upon the data extracted from within the application; and causing the advertisement to be presented with the search results on the mobile computing device. 17. The method of claim 11, the data extracted from within the application being data extracted from at least one of binary code of the application or source code of the application. 18. The method of claim 11, the data extracted from within the application being data extracted from a resource file of the application. 19. Computer-readable memory comprising instructions that, when executed by a processor, cause the processor to perform acts comprising:
searching over indexed data based upon a query received from a mobile computing device, the indexed data comprises data extracted from a mobile application that is available for download and installment from an application marketplace, the application marketplace comprises a plurality of mobile applications that are available for download and installment on the mobile computing device; determining that the data extracted from the mobile application is relevant to the query; and transmitting search results to the mobile computing device responsive to determining that the data extracted from the mobile application is relevant to the query, the search results comprise an option to download the mobile application from the application marketplace. 20. The computer-readable memory of claim 19, the search results further comprise the data extracted from the mobile application. | 2,100 |
5,185 | 14,752,319 | 2,174 | A touchscreen device is configured to display a number of user interface elements in accordance with a menu hierarchy. Upon receipt of a predetermined touchscreen gesture (e.g., the circular motion of a manipulator) the menu hierarchy is bypassed and the user is given immediate control over a selected function, for example, a tuning function such as audio volume, screen contrast, and the like. | 1. A cockpit control device comprising:
a touchscreen device having a plurality of user interface elements displayed thereon, including at least one user interface control configured to react to a touch event occurring within a region occupied by the at least one user interface control; and wherein the touchscreen device is configured, upon receipt of a predetermined touchscreen gesture, to temporarily ignore the at least one user interface control and provide immediate access to a tuning function such that a value of the tuning function is modified based on the predetermined touchscreen gesture. 2. The cockpit control device of claim 1, wherein the tuning function includes a volume of an audio signal provided to an individual within a cockpit. 3. The cockpit control device of claim 2, wherein the volume of an audio signal provided to an individual within a cockpit comprises a headset volume. 4. The cockpit control device of claim 1, wherein the tuning function includes a visual characteristic of the touchscreen device. 5. The cockpit control device of claim 4, wherein the visual characteristic of the touchscreen device includes the brightness of the touchscreen. 6. The cockpit control device of claim 4, wherein the visual characteristic of the touchscreen device includes a contrast of the touchscreen. 7. The cockpit control device of claim 1, wherein:
the user interface elements are displayed in accordance with a menu hierarchy; the menu hierarchy includes a user interface element corresponding to the tuning function; and modifying the value of the tuning function bypasses the menu hierarchy. 8. The cockpit control device of claim 1, wherein the touchscreen device is further configured to temporarily display a graphical depiction of the value of the tuning function during the predetermined touchscreen gesture. 9. The cockpit control device of claim 8, wherein the tuning function comprises a headset volume for an audio signal provided to an individual within a cockpit, and wherein the graphical depiction of the value of the tuning function comprises a graphic that expands in size as the volume is increased. 10. The cockpit control device of claim 1, wherein the plurality of user interface elements displayed include navigation icons. 11. A cockpit control device comprising:
a touchscreen display configured to display navigational data to a pilot and to receive touch events from the pilot; a processor coupled to the touchscreen display, the processor configured to:
instruct the touchscreen display to display a plurality of user interface elements;
receive a signal associated with the touch event;
enter a first mode, the first mode including providing a signal responsive to the touch event when the touch event is associated with one or more of the user interface elements;
determine whether the touch event corresponds to a predetermined touchscreen gesture; and
switch from the first mode to a second mode when the touch event corresponds to the predetermined touchscreen gesture, the second mode including providing, for a duration of the touch event, a signal indicative of a value of a tuning function not associated with the plurality of user interface elements. 12. The cockpit control device of claim 11, wherein the plurality of user interface elements displayed include navigation icons. 13. The cockpit control device of claim 11, wherein the tuning function is a volume level of an audio signal configured to be provided to the pilot. 14. The cockpit control device of claim 11, wherein the tuning function is a visual characteristic of the touchscreen display visible to the pilot. 15. The cockpit control device of claim 11, wherein the predetermined touchscreen gesture includes a circular motion, wherein the circular motion starts from an initial position on the touchscreen display that is not associated with the user interface elements, and wherein the value of the tuning function is proportional to an arc subtended by the circular motion with respect to the initial position. 16. The cockpit control device of claim 11, further including temporarily displaying a graphical depiction of the value of the tuning function during the predetermined touchscreen gesture. 17. A cockpit control device comprising:
a touchscreen display configured to display to a pilot in a cockpit and to receive touch events from the pilot; a processor coupled to the touchscreen display, the processor configured to:
instruct the touchscreen display to display a plurality of navigation icons relating to an aircraft that includes the cockpit;
while in a first mode, provide a first signal responsive to detecting touch events, with the first signal associated with the navigation icons;
switch from the first mode to a second mode responsive to detecting a predetermined touchscreen gesture; and
while in the second mode, provide a second signal responsive to detecting touch events, with the second signal associated with changing a volume level in the cockpit. 18. The cockpit control device of claim 17, wherein the processor is further configured to, while in the second mode, temporarily display a graphical depiction of the volume level responsive to detecting touch events. 19. The cockpit control device of claim 18, wherein the graphical depiction of the volume level expands in size as the volume is increased. 20. The cockpit control device of claim 17, wherein the predetermined touchscreen gesture includes a circular motion, wherein the circular motion starts from an initial position on the touchscreen display, and wherein a value of the volume level is proportional to an arc subtended by the circular motion with respect to the initial position. | A touchscreen device is configured to display a number of user interface elements in accordance with a menu hierarchy. Upon receipt of a predetermined touchscreen gesture (e.g., the circular motion of a manipulator) the menu hierarchy is bypassed and the user is given immediate control over a selected function, for example, a tuning function such as audio volume, screen contrast, and the like.1. A cockpit control device comprising:
a touchscreen device having a plurality of user interface elements displayed thereon, including at least one user interface control configured to react to a touch event occurring within a region occupied by the at least one user interface control; and wherein the touchscreen device is configured, upon receipt of a predetermined touchscreen gesture, to temporarily ignore the at least one user interface control and provide immediate access to a tuning function such that a value of the tuning function is modified based on the predetermined touchscreen gesture. 2. The cockpit control device of claim 1, wherein the tuning function includes a volume of an audio signal provided to an individual within a cockpit. 3. The cockpit control device of claim 2, wherein the volume of an audio signal provided to an individual within a cockpit comprises a headset volume. 4. The cockpit control device of claim 1, wherein the tuning function includes a visual characteristic of the touchscreen device. 5. The cockpit control device of claim 4, wherein the visual characteristic of the touchscreen device includes the brightness of the touchscreen. 6. The cockpit control device of claim 4, wherein the visual characteristic of the touchscreen device includes a contrast of the touchscreen. 7. The cockpit control device of claim 1, wherein:
the user interface elements are displayed in accordance with a menu hierarchy; the menu hierarchy includes a user interface element corresponding to the tuning function; and modifying the value of the tuning function bypasses the menu hierarchy. 8. The cockpit control device of claim 1, wherein the touchscreen device is further configured to temporarily display a graphical depiction of the value of the tuning function during the predetermined touchscreen gesture. 9. The cockpit control device of claim 8, wherein the tuning function comprises a headset volume for an audio signal provided to an individual within a cockpit, and wherein the graphical depiction of the value of the tuning function comprises a graphic that expands in size as the volume is increased. 10. The cockpit control device of claim 1, wherein the plurality of user interface elements displayed include navigation icons. 11. A cockpit control device comprising:
a touchscreen display configured to display navigational data to a pilot and to receive touch events from the pilot; a processor coupled to the touchscreen display, the processor configured to:
instruct the touchscreen display to display a plurality of user interface elements;
receive a signal associated with the touch event;
enter a first mode, the first mode including providing a signal responsive to the touch event when the touch event is associated with one or more of the user interface elements;
determine whether the touch event corresponds to a predetermined touchscreen gesture; and
switch from the first mode to a second mode when the touch event corresponds to the predetermined touchscreen gesture, the second mode including providing, for a duration of the touch event, a signal indicative of a value of a tuning function not associated with the plurality of user interface elements. 12. The cockpit control device of claim 11, wherein the plurality of user interface elements displayed include navigation icons. 13. The cockpit control device of claim 11, wherein the tuning function is a volume level of an audio signal configured to be provided to the pilot. 14. The cockpit control device of claim 11, wherein the tuning function is a visual characteristic of the touchscreen display visible to the pilot. 15. The cockpit control device of claim 11, wherein the predetermined touchscreen gesture includes a circular motion, wherein the circular motion starts from an initial position on the touchscreen display that is not associated with the user interface elements, and wherein the value of the tuning function is proportional to an arc subtended by the circular motion with respect to the initial position. 16. The cockpit control device of claim 11, further including temporarily displaying a graphical depiction of the value of the tuning function during the predetermined touchscreen gesture. 17. A cockpit control device comprising:
a touchscreen display configured to display to a pilot in a cockpit and to receive touch events from the pilot; a processor coupled to the touchscreen display, the processor configured to:
instruct the touchscreen display to display a plurality of navigation icons relating to an aircraft that includes the cockpit;
while in a first mode, provide a first signal responsive to detecting touch events, with the first signal associated with the navigation icons;
switch from the first mode to a second mode responsive to detecting a predetermined touchscreen gesture; and
while in the second mode, provide a second signal responsive to detecting touch events, with the second signal associated with changing a volume level in the cockpit. 18. The cockpit control device of claim 17, wherein the processor is further configured to, while in the second mode, temporarily display a graphical depiction of the volume level responsive to detecting touch events. 19. The cockpit control device of claim 18, wherein the graphical depiction of the volume level expands in size as the volume is increased. 20. The cockpit control device of claim 17, wherein the predetermined touchscreen gesture includes a circular motion, wherein the circular motion starts from an initial position on the touchscreen display, and wherein a value of the volume level is proportional to an arc subtended by the circular motion with respect to the initial position. | 2,100 |
5,186 | 14,747,750 | 2,194 | A data access request for data that is provided from a data provider corresponding to an external data source. The data access request is transformed into a call supported by the external computing system. Data that is responsive to the call is received in a form provided by the external computing system, and the data is transformed into a form expected by the native system. The transformed data is returned to the requestor through the API. | 1. A computing system, comprising:
a native data provider that exposes an application programming interface (API) to provide native data to a set of upper level computing elements; and an external system data provider that exposes the API to provide external data, from an external computing system, to the upper level computing elements, the external system data provider converting a data access call to an external call to the external computing system and transforming the external data to provide the external data to the upper level computing elements through the API, in a native form that is a same form as the native data provided by the native data provider. 2. The computing system of claim 1 wherein the external system data provider comprises:
a request transformation component that transforms the data access call to a call consistent with an external API exposed by an external data provider that is native to the external computing system; and
an external system accessing component that executes the call against the external API. 3. The computing system of claim 2 wherein the external data is received by the external system data provider in an external form provided by the external computing system and wherein the external system data provider comprises:
a data transformation component that transforms the external data from the external form to the native form. 4. The computing system of claim 3 wherein the data access call comprises a call to save data to the external computing system and wherein the data transformation component transforms data to be saved to the external computing system from the native form to the external form. 5. The computing system of claim 4 wherein the request transformation component transforms the data access call to a call consistent with the external API to save the data to the external computing system. 6. The computing system of claim 3 and further comprising:
a synchronization system that receives the external data through the API, in the native form and in an external schema, and synchronizes it with corresponding native data in a native schema. 7. The computing system of claim 4 and further comprising:
a data accessing system that accesses the native data and the external data through the API, from the native data provider and the external system data provider, and provides it to the upper level computing elements. 8. The computing system of claim 7 wherein the data accessing system comprises:
a data source identifier that identifies a data provider that is a target of the data access call. 9. The computing system of claim 8 wherein the data accessing system comprises:
a data source accessing component that executes the data access call against the data provider identified as the target of the data access call. 10. A computer implemented method, comprising:
exposing an application programming interface (API) on a native data provider to provide native data to a set of upper level computing elements; exposing the API on an external system data provider to provide external data, from an external computing system, to the set of upper level computing elements; receiving a data access call through the API exposed by the external system data provider; converting the data access call to an external call to an external computing system; receiving external data in response to the external call; transforming the external data to a native form that is a same form as the native data provided by the native data provider; and providing the external data, in the native form, to the upper level computing elements through the API. 11. The computer implemented method of claim 10 wherein converting the data access call to an external call comprises:
transforming the data access call to a call consistent with an external API exposed by an external data provider that is native to the external computing system. 12. The computer implemented method of claim 11 wherein the external data is received in an external form provided by the external computing system and wherein transforming the external data to a native form comprises:
transforming the external data from the external form to the native form. 13. The computer implemented method of claim 11 and further comprising:
receiving a data access call from an upper level computing element to save data to the external computing system; and
transforming data to be saved to the external computing system from the native form to the external form. 14. The computer implemented method of claim 12 wherein one of the upper level computing elements comprises a synchronization system and further comprising:
receiving the external data through the API, in the native form according to an external schema, at the synchronization system; and
synchronizing the external data with corresponding native data in a native schema. 15. The computer implemented method of claim 12 and further comprising:
identifying a data provider that is a target of the data access call; and
executing the data access call against the data provider identified as the target of the data access call. 16. A computing system, comprising:
a native data provider that exposes a native application programming interface (API) to provide native data to a set of upper level computing elements; and an external system data provider that exposes the native API to provide external data to the set of upper level computing elements, the external system data provider comprising:
a request transformation component that transforms a data access call from a given one of the set of upper level computing elements to a call consistent with an external API exposed by an external data provider that is native to an external computing system;
an external system accessing component that executes the transformed data access call against the external API and receives the external data in an external form provided by the external computing system; and
a data transformation component that transforms the external data from the external form to the native form and provides it through the native API to the given upper level computing element. 17. The computing system of claim 16 wherein a second data access call comprises a call to save data to the external computing system and wherein the data transformation component transforms data to be saved to the external computing system from the native form to the external form. 18. The computing system of claim 17 wherein the request transformation component transforms the second data access call to a call consistent with the external API to save the data, that is transformed to the external form, to the external computing system. 19. The computing system of claim 16 and further comprising:
a synchronization system that receives the external data through the native API, in the native form and according to an external schema, and synchronizes it with corresponding native data through the native data provider according to a native schema. 20. The computing system of claim 16 and further comprising:
a data accessing system that accesses the native data and the external data through the native API, from the native data provider and the external system data provider, respectively, and provides it to the given upper level computing element, the data accessing system comprising:
a data source identifier that identifies a data provider that is a target of the data access call; and
a data source accessing component that executes the data access call against the data provider identified as the target of the data access call. | A data access request for data that is provided from a data provider corresponding to an external data source. The data access request is transformed into a call supported by the external computing system. Data that is responsive to the call is received in a form provided by the external computing system, and the data is transformed into a form expected by the native system. The transformed data is returned to the requestor through the API.1. A computing system, comprising:
a native data provider that exposes an application programming interface (API) to provide native data to a set of upper level computing elements; and an external system data provider that exposes the API to provide external data, from an external computing system, to the upper level computing elements, the external system data provider converting a data access call to an external call to the external computing system and transforming the external data to provide the external data to the upper level computing elements through the API, in a native form that is a same form as the native data provided by the native data provider. 2. The computing system of claim 1 wherein the external system data provider comprises:
a request transformation component that transforms the data access call to a call consistent with an external API exposed by an external data provider that is native to the external computing system; and
an external system accessing component that executes the call against the external API. 3. The computing system of claim 2 wherein the external data is received by the external system data provider in an external form provided by the external computing system and wherein the external system data provider comprises:
a data transformation component that transforms the external data from the external form to the native form. 4. The computing system of claim 3 wherein the data access call comprises a call to save data to the external computing system and wherein the data transformation component transforms data to be saved to the external computing system from the native form to the external form. 5. The computing system of claim 4 wherein the request transformation component transforms the data access call to a call consistent with the external API to save the data to the external computing system. 6. The computing system of claim 3 and further comprising:
a synchronization system that receives the external data through the API, in the native form and in an external schema, and synchronizes it with corresponding native data in a native schema. 7. The computing system of claim 4 and further comprising:
a data accessing system that accesses the native data and the external data through the API, from the native data provider and the external system data provider, and provides it to the upper level computing elements. 8. The computing system of claim 7 wherein the data accessing system comprises:
a data source identifier that identifies a data provider that is a target of the data access call. 9. The computing system of claim 8 wherein the data accessing system comprises:
a data source accessing component that executes the data access call against the data provider identified as the target of the data access call. 10. A computer implemented method, comprising:
exposing an application programming interface (API) on a native data provider to provide native data to a set of upper level computing elements; exposing the API on an external system data provider to provide external data, from an external computing system, to the set of upper level computing elements; receiving a data access call through the API exposed by the external system data provider; converting the data access call to an external call to an external computing system; receiving external data in response to the external call; transforming the external data to a native form that is a same form as the native data provided by the native data provider; and providing the external data, in the native form, to the upper level computing elements through the API. 11. The computer implemented method of claim 10 wherein converting the data access call to an external call comprises:
transforming the data access call to a call consistent with an external API exposed by an external data provider that is native to the external computing system. 12. The computer implemented method of claim 11 wherein the external data is received in an external form provided by the external computing system and wherein transforming the external data to a native form comprises:
transforming the external data from the external form to the native form. 13. The computer implemented method of claim 11 and further comprising:
receiving a data access call from an upper level computing element to save data to the external computing system; and
transforming data to be saved to the external computing system from the native form to the external form. 14. The computer implemented method of claim 12 wherein one of the upper level computing elements comprises a synchronization system and further comprising:
receiving the external data through the API, in the native form according to an external schema, at the synchronization system; and
synchronizing the external data with corresponding native data in a native schema. 15. The computer implemented method of claim 12 and further comprising:
identifying a data provider that is a target of the data access call; and
executing the data access call against the data provider identified as the target of the data access call. 16. A computing system, comprising:
a native data provider that exposes a native application programming interface (API) to provide native data to a set of upper level computing elements; and an external system data provider that exposes the native API to provide external data to the set of upper level computing elements, the external system data provider comprising:
a request transformation component that transforms a data access call from a given one of the set of upper level computing elements to a call consistent with an external API exposed by an external data provider that is native to an external computing system;
an external system accessing component that executes the transformed data access call against the external API and receives the external data in an external form provided by the external computing system; and
a data transformation component that transforms the external data from the external form to the native form and provides it through the native API to the given upper level computing element. 17. The computing system of claim 16 wherein a second data access call comprises a call to save data to the external computing system and wherein the data transformation component transforms data to be saved to the external computing system from the native form to the external form. 18. The computing system of claim 17 wherein the request transformation component transforms the second data access call to a call consistent with the external API to save the data, that is transformed to the external form, to the external computing system. 19. The computing system of claim 16 and further comprising:
a synchronization system that receives the external data through the native API, in the native form and according to an external schema, and synchronizes it with corresponding native data through the native data provider according to a native schema. 20. The computing system of claim 16 and further comprising:
a data accessing system that accesses the native data and the external data through the native API, from the native data provider and the external system data provider, respectively, and provides it to the given upper level computing element, the data accessing system comprising:
a data source identifier that identifies a data provider that is a target of the data access call; and
a data source accessing component that executes the data access call against the data provider identified as the target of the data access call. | 2,100 |
5,187 | 15,152,781 | 2,125 | Processing circuitry includes execute circuitry for executing micro-operations in response to instructions fetched from a data store. Control circuitry is provided to determine, based on availability of at least one processing resource, how many micro-operations are to be executed by the execute circuitry in response to a given set of one or more instructions fetched from the data store. | 1. Processing circuitry comprising:
execute circuitry to execute micro-operations in response to instructions fetched from a data store; and control circuitry to determine, in dependence on availability of at least one processing resource, how many micro-operations are to be executed by the execute circuitry in response to a given set of one or more instructions fetched from the data store. 2. The processing circuitry according to claim 1, wherein the given set of one or more instructions is for triggering the execute circuitry to execute a plurality of processing steps; and
the control circuitry is configured to determine, in dependence on said availability of said at least one processing resource, whether to control the execute circuitry to execute a compound micro-operation corresponding to at least two of said plurality of processing steps, or individual micro-operations each corresponding to one of said at least two of said plurality of processing steps. 3. The processing circuitry according to claim 1, wherein said at least one processing resource comprises at least one operand required for processing of said given set of one or more instructions. 4. The processing circuitry according to claim 1, wherein the given set of one or more instructions is for triggering the execute circuitry to perform at least a first processing step requiring a first operand set comprising one or more operands and a second processing step requiring a second operand set comprising one or more operands. 5. The processing circuitry according to claim 4, wherein said control circuitry is configured to determine how many micro-operations are to be executed in dependence on availability of the second operand set at the time the first operand set becomes available. 6. The processing circuitry according to claim 4, wherein in response to determining that the second operand set would be available at the time the first operand set becomes available, the control circuitry is configured to control the execute circuitry to execute a compound micro-operation corresponding to both the first and second processing steps. 7. The processing circuitry according to claim 4, wherein in response to determining that the second operand set would be unavailable at the time the first operand set becomes available, the control circuitry is configured to control the execute circuitry to execute individual micro-operations corresponding to the first and second processing steps. 8. The processing circuitry according to claim 1, wherein said at least one processing resource comprises at least one hardware resource of said processing circuitry. 9. The processing circuitry according to claim 1, wherein the given set of one or more instructions is for triggering the execute circuitry to perform at least a first processing step and a second processing step; and
said at least one processing resource comprises a selected hardware resource supporting execution of a compound micro-operation corresponding to both the first and second processing steps. 10. The processing circuitry according to claim 9, wherein in response to determining availability of said selected hardware resource, the control circuitry is configured to control the execute circuitry to execute the compound micro-operation; and
in response to determining unavailability of said selected hardware resource, the control circuitry is configured to control the execute circuitry to execute individual micro-operations corresponding to said first and second processing steps. 11. The processing circuitry according to claim 1, wherein said availability comprises a current availability of said at least one processing resource. 12. The processing circuitry according to claim 1, wherein said availability comprises an expected future availability of said at least one processing resource. 13. The processing circuitry according to claim 1, wherein the control circuitry comprises decode circuitry to decode the instructions fetched from the data store to generate micro-operations to be executed by the execute circuitry. 14. The processing circuitry according to claim 1, wherein the control circuitry comprises issue circuitry to issue micro-operations for execution by the execute circuitry. 15. The processing circuitry according to claim 14, wherein the issue circuitry comprises an issue queue to queue micro-operations awaiting issue. 16. The processing circuitry according to claim 15, wherein the issue circuitry is configured to determine, in dependence on said availability of said at least one processing resource, whether to split a single micro-operation queued in the issue queue into multiple micro-operations to be issued separately to the execute circuitry. 17. The processing circuitry according to claim 16, wherein on issuing a first of said multiple micro-operations to the execute circuitry, the issue circuitry is configured to update an entry of the issue queue corresponding to said single micro-operation to indicate another of said multiple micro-operations. 18. The processing circuitry according to claim 15, wherein the issue circuitry is configured to determine, in dependence on said availability of said at least one processing resource, whether to merge a plurality of micro-operations queued in the issue queue to form a compound micro-operation to be issued to the execute circuitry. 19. The processing circuitry according to claim 1, wherein the processing circuitry supports out-of-order execution. 20. An electronic apparatus comprising the processing circuitry according to claim 1. 21. A method comprising:
fetching a set of one or more instructions from a data store; in dependence on availability of at least one processing resource, determining how many micro-operations are to be executed in response to said set of one or more instructions; and executing the micro-operations using execute circuitry. | Processing circuitry includes execute circuitry for executing micro-operations in response to instructions fetched from a data store. Control circuitry is provided to determine, based on availability of at least one processing resource, how many micro-operations are to be executed by the execute circuitry in response to a given set of one or more instructions fetched from the data store.1. Processing circuitry comprising:
execute circuitry to execute micro-operations in response to instructions fetched from a data store; and control circuitry to determine, in dependence on availability of at least one processing resource, how many micro-operations are to be executed by the execute circuitry in response to a given set of one or more instructions fetched from the data store. 2. The processing circuitry according to claim 1, wherein the given set of one or more instructions is for triggering the execute circuitry to execute a plurality of processing steps; and
the control circuitry is configured to determine, in dependence on said availability of said at least one processing resource, whether to control the execute circuitry to execute a compound micro-operation corresponding to at least two of said plurality of processing steps, or individual micro-operations each corresponding to one of said at least two of said plurality of processing steps. 3. The processing circuitry according to claim 1, wherein said at least one processing resource comprises at least one operand required for processing of said given set of one or more instructions. 4. The processing circuitry according to claim 1, wherein the given set of one or more instructions is for triggering the execute circuitry to perform at least a first processing step requiring a first operand set comprising one or more operands and a second processing step requiring a second operand set comprising one or more operands. 5. The processing circuitry according to claim 4, wherein said control circuitry is configured to determine how many micro-operations are to be executed in dependence on availability of the second operand set at the time the first operand set becomes available. 6. The processing circuitry according to claim 4, wherein in response to determining that the second operand set would be available at the time the first operand set becomes available, the control circuitry is configured to control the execute circuitry to execute a compound micro-operation corresponding to both the first and second processing steps. 7. The processing circuitry according to claim 4, wherein in response to determining that the second operand set would be unavailable at the time the first operand set becomes available, the control circuitry is configured to control the execute circuitry to execute individual micro-operations corresponding to the first and second processing steps. 8. The processing circuitry according to claim 1, wherein said at least one processing resource comprises at least one hardware resource of said processing circuitry. 9. The processing circuitry according to claim 1, wherein the given set of one or more instructions is for triggering the execute circuitry to perform at least a first processing step and a second processing step; and
said at least one processing resource comprises a selected hardware resource supporting execution of a compound micro-operation corresponding to both the first and second processing steps. 10. The processing circuitry according to claim 9, wherein in response to determining availability of said selected hardware resource, the control circuitry is configured to control the execute circuitry to execute the compound micro-operation; and
in response to determining unavailability of said selected hardware resource, the control circuitry is configured to control the execute circuitry to execute individual micro-operations corresponding to said first and second processing steps. 11. The processing circuitry according to claim 1, wherein said availability comprises a current availability of said at least one processing resource. 12. The processing circuitry according to claim 1, wherein said availability comprises an expected future availability of said at least one processing resource. 13. The processing circuitry according to claim 1, wherein the control circuitry comprises decode circuitry to decode the instructions fetched from the data store to generate micro-operations to be executed by the execute circuitry. 14. The processing circuitry according to claim 1, wherein the control circuitry comprises issue circuitry to issue micro-operations for execution by the execute circuitry. 15. The processing circuitry according to claim 14, wherein the issue circuitry comprises an issue queue to queue micro-operations awaiting issue. 16. The processing circuitry according to claim 15, wherein the issue circuitry is configured to determine, in dependence on said availability of said at least one processing resource, whether to split a single micro-operation queued in the issue queue into multiple micro-operations to be issued separately to the execute circuitry. 17. The processing circuitry according to claim 16, wherein on issuing a first of said multiple micro-operations to the execute circuitry, the issue circuitry is configured to update an entry of the issue queue corresponding to said single micro-operation to indicate another of said multiple micro-operations. 18. The processing circuitry according to claim 15, wherein the issue circuitry is configured to determine, in dependence on said availability of said at least one processing resource, whether to merge a plurality of micro-operations queued in the issue queue to form a compound micro-operation to be issued to the execute circuitry. 19. The processing circuitry according to claim 1, wherein the processing circuitry supports out-of-order execution. 20. An electronic apparatus comprising the processing circuitry according to claim 1. 21. A method comprising:
fetching a set of one or more instructions from a data store; in dependence on availability of at least one processing resource, determining how many micro-operations are to be executed in response to said set of one or more instructions; and executing the micro-operations using execute circuitry. | 2,100 |
5,188 | 14,876,186 | 2,193 | The present disclosure relates to the visualization of complex information using a set of navigable landmasses. A method for generating a visualization of a programming code base using a set of navigable landmasses in accordance with an embodiment of the present disclosure includes: representing each of a plurality of different code components using a respective landmass; adjusting a size of each landmass based on a number of lines of code in the code component corresponding to the landmass; and displaying the landmasses. | 1. A method for generating a visualization of a programming code base using a set of navigable landmasses, the method comprising:
representing each of a plurality of different code components using a respective landmass; adjusting a size of each landmass based on a number of lines of code in the code component corresponding to the landmass; connecting a plurality of the landmasses using a number of interconnections, wherein the number of interconnections between each of the plurality of landmasses reflects a level of interconnectivity between the corresponding code components of the interconnected landmasses, and wherein a higher number of interconnections indicates a higher level of connectivity between the interconnected landmasses than a lower number of interconnections; and displaying the landmasses and the interconnections between the landmasses, wherein each landmass includes other landmasses displayed within each respective landmass, and wherein a size of each of the other landmasses displayed within each respective landmass is adjusted based on a number of lines of code in the code component corresponding to each of the other landmass. 2. The method of claim 1, further comprising:
dynamically varying a displayed characteristic of an interconnection based on thread level activity between the code components of the interconnected landmasses. 3. The method of claim 2, wherein the displayed characteristic is selected from the group consisting of a color, a thickness, a darkness, and a type of line. 4. The method of claim 1, further comprising:
adjusting a displayed characteristic of a landmass based on a code modification change rate of the corresponding code component. 5. The method of claim 4, wherein the characteristic is selected from the group consisting of a depth of color and a height,
wherein, in the case that the characteristic includes the depth of color, the depth of color of the landmass is greater for the landmass than for another landmass having a lesser code modification change rate, and wherein, in the case that the characteristic includes the height, the height of the landmass is greater for the landmass than for another landmass having a lesser code modification change rate. 6. The method of claim 1, wherein the other landmasses displayed within each respective landmass are displayed as being contained within a boundary of the respective landmass. 7. A system for generating a visualization of a programming code base using a set of navigable landmasses, the system including a computer system having a processing unit and a memory, the computing system executing computer program code which, upon execution, causes the computing system to perform actions comprising:
representing each of a plurality of different code components using a respective landmass; adjusting a size of each landmass based on a number of lines of code in the code component corresponding to the landmass; connecting a plurality of the landmasses using a number of interconnections, wherein the number of interconnections between each of the plurality of landmasses reflects a level of interconnectivity between the corresponding code components of the interconnected landmasses, and wherein a higher number of interconnections indicates a higher level of connectivity between the interconnected landmasses than a lower number of interconnections; and displaying the landmasses and the interconnections between the landmasses, wherein each landmass includes other landmasses displayed within each respective landmass, and wherein a size of each of the other landmasses displayed within each respective landmass is adjusted based on a number of lines of code in the code component corresponding to each of the other landmass. 8. The system of claim 7, wherein the computer system performs actions further comprising:
dynamically varying a displayed characteristic of an interconnection based on thread level activity between the code components of the interconnected landmasses. 9. The system of claim 8, wherein the displayed characteristic is selected from the group consisting of a color, thickness, darkness, and type of line,
wherein, in the case that the characteristic includes the depth of color, the depth of color of the landmass is greater for the landmass than for another landmass having a lesser code modification change rate, and wherein, in the case that the characteristic includes the height, the height of the landmass is greater for the landmass than for another landmass having a lesser code modification change rate. 10. The system of claim 7, wherein the computer system performs actions further comprising:
adjusting a displayed characteristic of a landmass based on a code modification change rate of the corresponding code component. 11. The system of claim 10, wherein the displayed characteristic is selected from the group consisting of: a depth of color and a height. 12. The system of claim 7, wherein the other landmasses displayed within each respective landmass are displayed as being contained within a boundary of the respective landmass. 13. A computer program product stored on a non-transitory computer readable medium, which when executed, generates a visualization of a programming code base using a set of navigable landmasses, the computer readable medium comprising program code for:
representing each of a plurality of different code components using a respective landmass; adjusting a size of each landmass based on a number of lines of code in the code component corresponding to the landmass; connecting a plurality of the landmasses using a number of interconnections, wherein the number of interconnections reflects a level of interconnectivity between the corresponding code components of the interconnected landmasses, and wherein a higher number of interconnections indicates a higher level of connectivity between the interconnected landmasses than a lower number of interconnections; and displaying the landmasses and the interconnections between the landmasses,
wherein each landmass includes other landmasses displayed within each respective landmass, and
wherein a size of each of the other landmasses displayed within each respective landmass is adjusted based on a number of lines of code in the code component corresponding to each of the other landmass. 14. The computer program product of claim 13, wherein the other landmasses displayed within each respective landmass are displayed as being contained within a boundary of the respective landmass. | The present disclosure relates to the visualization of complex information using a set of navigable landmasses. A method for generating a visualization of a programming code base using a set of navigable landmasses in accordance with an embodiment of the present disclosure includes: representing each of a plurality of different code components using a respective landmass; adjusting a size of each landmass based on a number of lines of code in the code component corresponding to the landmass; and displaying the landmasses.1. A method for generating a visualization of a programming code base using a set of navigable landmasses, the method comprising:
representing each of a plurality of different code components using a respective landmass; adjusting a size of each landmass based on a number of lines of code in the code component corresponding to the landmass; connecting a plurality of the landmasses using a number of interconnections, wherein the number of interconnections between each of the plurality of landmasses reflects a level of interconnectivity between the corresponding code components of the interconnected landmasses, and wherein a higher number of interconnections indicates a higher level of connectivity between the interconnected landmasses than a lower number of interconnections; and displaying the landmasses and the interconnections between the landmasses, wherein each landmass includes other landmasses displayed within each respective landmass, and wherein a size of each of the other landmasses displayed within each respective landmass is adjusted based on a number of lines of code in the code component corresponding to each of the other landmass. 2. The method of claim 1, further comprising:
dynamically varying a displayed characteristic of an interconnection based on thread level activity between the code components of the interconnected landmasses. 3. The method of claim 2, wherein the displayed characteristic is selected from the group consisting of a color, a thickness, a darkness, and a type of line. 4. The method of claim 1, further comprising:
adjusting a displayed characteristic of a landmass based on a code modification change rate of the corresponding code component. 5. The method of claim 4, wherein the characteristic is selected from the group consisting of a depth of color and a height,
wherein, in the case that the characteristic includes the depth of color, the depth of color of the landmass is greater for the landmass than for another landmass having a lesser code modification change rate, and wherein, in the case that the characteristic includes the height, the height of the landmass is greater for the landmass than for another landmass having a lesser code modification change rate. 6. The method of claim 1, wherein the other landmasses displayed within each respective landmass are displayed as being contained within a boundary of the respective landmass. 7. A system for generating a visualization of a programming code base using a set of navigable landmasses, the system including a computer system having a processing unit and a memory, the computing system executing computer program code which, upon execution, causes the computing system to perform actions comprising:
representing each of a plurality of different code components using a respective landmass; adjusting a size of each landmass based on a number of lines of code in the code component corresponding to the landmass; connecting a plurality of the landmasses using a number of interconnections, wherein the number of interconnections between each of the plurality of landmasses reflects a level of interconnectivity between the corresponding code components of the interconnected landmasses, and wherein a higher number of interconnections indicates a higher level of connectivity between the interconnected landmasses than a lower number of interconnections; and displaying the landmasses and the interconnections between the landmasses, wherein each landmass includes other landmasses displayed within each respective landmass, and wherein a size of each of the other landmasses displayed within each respective landmass is adjusted based on a number of lines of code in the code component corresponding to each of the other landmass. 8. The system of claim 7, wherein the computer system performs actions further comprising:
dynamically varying a displayed characteristic of an interconnection based on thread level activity between the code components of the interconnected landmasses. 9. The system of claim 8, wherein the displayed characteristic is selected from the group consisting of a color, thickness, darkness, and type of line,
wherein, in the case that the characteristic includes the depth of color, the depth of color of the landmass is greater for the landmass than for another landmass having a lesser code modification change rate, and wherein, in the case that the characteristic includes the height, the height of the landmass is greater for the landmass than for another landmass having a lesser code modification change rate. 10. The system of claim 7, wherein the computer system performs actions further comprising:
adjusting a displayed characteristic of a landmass based on a code modification change rate of the corresponding code component. 11. The system of claim 10, wherein the displayed characteristic is selected from the group consisting of: a depth of color and a height. 12. The system of claim 7, wherein the other landmasses displayed within each respective landmass are displayed as being contained within a boundary of the respective landmass. 13. A computer program product stored on a non-transitory computer readable medium, which when executed, generates a visualization of a programming code base using a set of navigable landmasses, the computer readable medium comprising program code for:
representing each of a plurality of different code components using a respective landmass; adjusting a size of each landmass based on a number of lines of code in the code component corresponding to the landmass; connecting a plurality of the landmasses using a number of interconnections, wherein the number of interconnections reflects a level of interconnectivity between the corresponding code components of the interconnected landmasses, and wherein a higher number of interconnections indicates a higher level of connectivity between the interconnected landmasses than a lower number of interconnections; and displaying the landmasses and the interconnections between the landmasses,
wherein each landmass includes other landmasses displayed within each respective landmass, and
wherein a size of each of the other landmasses displayed within each respective landmass is adjusted based on a number of lines of code in the code component corresponding to each of the other landmass. 14. The computer program product of claim 13, wherein the other landmasses displayed within each respective landmass are displayed as being contained within a boundary of the respective landmass. | 2,100 |
5,189 | 15,123,113 | 2,176 | The invention relates to a device and a method for controlling a display device such that a section of an information element presented on the display device, where a first edge is not presented, a first edge section is presented that comprises the first edge of the information element as well as the region of the information element that is adjacent to the first edge, having the step of executing a translation of the presented section of the information element in a first direction according a to control motion executed by a user and triggering a first control signal for the translation in a second direction, wherein the first control signal is supplied to a control device, characterized by the steps such that a second control signal is generated and supplied to the control device as soon as the control motion has reached the second edge of the display device having been reached by the motion in the second direction, jumping to present the first edge section of the information element on the display device reached by the motion in the first direction. | 1. A method for controlling a display device wherein, of a section of an information element presented on a display device, a first edge is not presented, and a first edge section is presented that comprises the first edge of the information element as well as the region of the information element that is adjacent to the first edge, comprising:
executing a translation of the presented section of the information element in a first direction to a second direction according to a control motion executed by a user and triggering a first control signal for the translation, wherein the first control signal is supplied to a control device, generating a second control signal; supplying the second control signal to the control device as soon as the control motion has reached the second edge of the display device, having been reached through the motion in the second direction, and the control device, after receiving the first and the second control signal, jumping to present the first edge section of the information element on the display device reached by the motion in the first direction. 2. The method of claim 1, wherein the edge of the display device is a strip with a pre-specified width. 3. The method of claim 1, wherein the translation progresses proportionally to the control motion until the control motion reaches the second edge of the display device. 4. The method of claim 1, wherein the control device presents the first edge section, wherein the first edge of the information element is located adjacent to the first edge of the display device. 5. The method of claim 1, wherein the first direction is at least essentially anti-parallel to the second direction. 6. The method of claim 1, wherein the speed of the control motion is measured in close proximity to the edge of the display device and wherein the edge of the display device is considered as having been reached if the speed exceeds a pre-specified value. 7. The method of claim 1, wherein a touchscreen is the display device and wherein a swiping motion is performed as the control motion using at least one of a finger, a thumb, and a pointer device. 8. A computer program product for a control device on a piece of information technology equipment, that, when executed, performs the method of claim 1. 9. A data carrier comprising a computer program product according to claim 8. 10. A piece of information technology equipment, comprising
a display device, and a control device for controlling the display device, wherein the control device is capable of controlling the display device according to the method of claim 1. 11. The piece of information technology equipment of claim 10,
wherein the display device includes a touchscreen. 12. The piece of information technology equipment of claim 10,
wherein the display device comprises an edge that is defined as a strip with a pre-specified width. 13. (canceled) | The invention relates to a device and a method for controlling a display device such that a section of an information element presented on the display device, where a first edge is not presented, a first edge section is presented that comprises the first edge of the information element as well as the region of the information element that is adjacent to the first edge, having the step of executing a translation of the presented section of the information element in a first direction according a to control motion executed by a user and triggering a first control signal for the translation in a second direction, wherein the first control signal is supplied to a control device, characterized by the steps such that a second control signal is generated and supplied to the control device as soon as the control motion has reached the second edge of the display device having been reached by the motion in the second direction, jumping to present the first edge section of the information element on the display device reached by the motion in the first direction.1. A method for controlling a display device wherein, of a section of an information element presented on a display device, a first edge is not presented, and a first edge section is presented that comprises the first edge of the information element as well as the region of the information element that is adjacent to the first edge, comprising:
executing a translation of the presented section of the information element in a first direction to a second direction according to a control motion executed by a user and triggering a first control signal for the translation, wherein the first control signal is supplied to a control device, generating a second control signal; supplying the second control signal to the control device as soon as the control motion has reached the second edge of the display device, having been reached through the motion in the second direction, and the control device, after receiving the first and the second control signal, jumping to present the first edge section of the information element on the display device reached by the motion in the first direction. 2. The method of claim 1, wherein the edge of the display device is a strip with a pre-specified width. 3. The method of claim 1, wherein the translation progresses proportionally to the control motion until the control motion reaches the second edge of the display device. 4. The method of claim 1, wherein the control device presents the first edge section, wherein the first edge of the information element is located adjacent to the first edge of the display device. 5. The method of claim 1, wherein the first direction is at least essentially anti-parallel to the second direction. 6. The method of claim 1, wherein the speed of the control motion is measured in close proximity to the edge of the display device and wherein the edge of the display device is considered as having been reached if the speed exceeds a pre-specified value. 7. The method of claim 1, wherein a touchscreen is the display device and wherein a swiping motion is performed as the control motion using at least one of a finger, a thumb, and a pointer device. 8. A computer program product for a control device on a piece of information technology equipment, that, when executed, performs the method of claim 1. 9. A data carrier comprising a computer program product according to claim 8. 10. A piece of information technology equipment, comprising
a display device, and a control device for controlling the display device, wherein the control device is capable of controlling the display device according to the method of claim 1. 11. The piece of information technology equipment of claim 10,
wherein the display device includes a touchscreen. 12. The piece of information technology equipment of claim 10,
wherein the display device comprises an edge that is defined as a strip with a pre-specified width. 13. (canceled) | 2,100 |
5,190 | 14,297,810 | 2,176 | A user interaction input is detected, indicating that a user is interacting with structured data. The user interaction input is identified as a pattern for which a summary view is to be generated. The summary view of the structured data is generated, based upon the detected pattern, and is displayed to the user. | 1. A computer-implemented method, comprising:
displaying data, from a document, in a structure on a user interface display; identifying that the data comprises data items with commonality; receiving a set of user interactions with the user interface display; detecting that the user interactions are indicative of a pattern; automatically displaying a summary data view showing summary data calculated based on the data and based on the detected pattern; and automatically displaying an insertion user input mechanism that is actuated to insert the summary view into the document. 2. The computer-implemented method of claim 1, and further comprising:
receiving user actuation of the insertion user input mechanism; and automatically inserting the summary view into the document in response to the user actuation of the insertion user input mechanism. 3. The computer-implemented method of claim 1 wherein receiving the set of user interactions comprises:
receiving the set of user interactions with the structure. 4. The computer-implemented method of claim 1 wherein receiving the set of user interactions comprises:
receiving the set of user interactions with one or more of the data items. 5. The computer-implemented method of claim 1 wherein detecting a pattern comprises:
identifying that the set of user interactions comprise interactions with the data items that have commonality. 6. The computer-implemented method of claim 5 wherein identifying that the set of user interactions comprise interactions with the data items that have commonality, comprises:
identifying that the set of user interactions comprise hovering a cursor over the data items that have commonality. 7. The computer-implemented method of claim 5 wherein identifying that the set of user interactions comprise interactions with the data items that have commonality, comprises:
identifying that the set of user interactions comprise selecting data items that have commonality. 8. The computer-implemented method of claim 5 wherein displaying data in a structure comprises displaying the data as data items in rows and columns, and wherein identifying that the set of user interactions comprise selecting data items that have commonality comprises:
identifying that the set of user interactions comprise selecting data items in rows or columns that have commonality with other rows or columns, respectively. 9. The computer-implemented method of claim 5 wherein displaying data in a structure comprises displaying the data as data items in rows and columns, and wherein identifying that the set of user interactions comprise selecting data items that have commonality comprises:
identifying a sort user input sorting on a row or a column to obtain sorted data; and
identifying user selection of a range of data items, that have a common attribute, from the sorted data. 10. The computer-implemented method of claim 1 and further comprising:
generating a plurality of different summary views; and
displaying a user selection mechanism for selection of one of the plurality of different summary views. 11. The computer-implemented method of claim 1 wherein automatically displaying a summary view comprises:
automatically displaying a pivot table for the data items. 12. A computer system, comprising:
a user interface system that displays data in a structure on a user interface display; a pattern detector that detects that user interactions with the user interface display are indicative of a pattern; a summary calculation component that, in response to the pattern detector detecting that the user interactions are indicative of a pattern, automatically calculates summary data based on the data, the user interface system displaying a summary view indicative of the summary data; and a computer processor that is a functional part of the computer system and is activated by the user interface system, the pattern detector and the summary calculation component to facilitate displaying, detecting and calculating. 13. The computer system of claim 12 and further comprising:
a summary data structure generator that automatically generates a summary data structure to display the summary data in the summary view. 14. The computer system of claim 13 wherein the summary data structure generator automatically generates the summary data structure as a pivot table. 15. The computer system of claim 13 wherein the summary data structure generator automatically generates the summary data structure as a chart. 16. The computer system of claim 13 wherein the summary data structure generator automatically generates the summary data structure as a graph. 17. The computer system of claim 12 wherein the pattern detector detects that user interactions with the user interface display are indicative of a pattern by detecting that the user interactions are interacting with data items, that have at least partial commonality, in the structure. 18. The computer system of claim 12 wherein the pattern detector detects that user interactions with the user interface display are indicative of a pattern by detecting that the user interactions are interacting with data items that have repeating values in the structure. 19. A computer readable storage medium that stores computer executable instructions which, when executed by a computer, cause the computer to perform a method, comprising:
displaying data in a structure on a user interface display; receiving a set of user interactions with the user interface display; detecting a pattern indicated by the user interactions being with data items that have commonality; and automatically displaying a summary data view showing summary data calculated based on the data and based on the detected pattern. 20. The computer readable storage medium of claim 19 wherein displaying data in a structure comprises displaying the data as data items in rows and columns, and wherein detecting a pattern comprises:
identifying a sort user input sorting on a row or a column to obtain sorted data; and
identifying user selection of a range of data items, that have a common attribute, from the sorted data. | A user interaction input is detected, indicating that a user is interacting with structured data. The user interaction input is identified as a pattern for which a summary view is to be generated. The summary view of the structured data is generated, based upon the detected pattern, and is displayed to the user.1. A computer-implemented method, comprising:
displaying data, from a document, in a structure on a user interface display; identifying that the data comprises data items with commonality; receiving a set of user interactions with the user interface display; detecting that the user interactions are indicative of a pattern; automatically displaying a summary data view showing summary data calculated based on the data and based on the detected pattern; and automatically displaying an insertion user input mechanism that is actuated to insert the summary view into the document. 2. The computer-implemented method of claim 1, and further comprising:
receiving user actuation of the insertion user input mechanism; and automatically inserting the summary view into the document in response to the user actuation of the insertion user input mechanism. 3. The computer-implemented method of claim 1 wherein receiving the set of user interactions comprises:
receiving the set of user interactions with the structure. 4. The computer-implemented method of claim 1 wherein receiving the set of user interactions comprises:
receiving the set of user interactions with one or more of the data items. 5. The computer-implemented method of claim 1 wherein detecting a pattern comprises:
identifying that the set of user interactions comprise interactions with the data items that have commonality. 6. The computer-implemented method of claim 5 wherein identifying that the set of user interactions comprise interactions with the data items that have commonality, comprises:
identifying that the set of user interactions comprise hovering a cursor over the data items that have commonality. 7. The computer-implemented method of claim 5 wherein identifying that the set of user interactions comprise interactions with the data items that have commonality, comprises:
identifying that the set of user interactions comprise selecting data items that have commonality. 8. The computer-implemented method of claim 5 wherein displaying data in a structure comprises displaying the data as data items in rows and columns, and wherein identifying that the set of user interactions comprise selecting data items that have commonality comprises:
identifying that the set of user interactions comprise selecting data items in rows or columns that have commonality with other rows or columns, respectively. 9. The computer-implemented method of claim 5 wherein displaying data in a structure comprises displaying the data as data items in rows and columns, and wherein identifying that the set of user interactions comprise selecting data items that have commonality comprises:
identifying a sort user input sorting on a row or a column to obtain sorted data; and
identifying user selection of a range of data items, that have a common attribute, from the sorted data. 10. The computer-implemented method of claim 1 and further comprising:
generating a plurality of different summary views; and
displaying a user selection mechanism for selection of one of the plurality of different summary views. 11. The computer-implemented method of claim 1 wherein automatically displaying a summary view comprises:
automatically displaying a pivot table for the data items. 12. A computer system, comprising:
a user interface system that displays data in a structure on a user interface display; a pattern detector that detects that user interactions with the user interface display are indicative of a pattern; a summary calculation component that, in response to the pattern detector detecting that the user interactions are indicative of a pattern, automatically calculates summary data based on the data, the user interface system displaying a summary view indicative of the summary data; and a computer processor that is a functional part of the computer system and is activated by the user interface system, the pattern detector and the summary calculation component to facilitate displaying, detecting and calculating. 13. The computer system of claim 12 and further comprising:
a summary data structure generator that automatically generates a summary data structure to display the summary data in the summary view. 14. The computer system of claim 13 wherein the summary data structure generator automatically generates the summary data structure as a pivot table. 15. The computer system of claim 13 wherein the summary data structure generator automatically generates the summary data structure as a chart. 16. The computer system of claim 13 wherein the summary data structure generator automatically generates the summary data structure as a graph. 17. The computer system of claim 12 wherein the pattern detector detects that user interactions with the user interface display are indicative of a pattern by detecting that the user interactions are interacting with data items, that have at least partial commonality, in the structure. 18. The computer system of claim 12 wherein the pattern detector detects that user interactions with the user interface display are indicative of a pattern by detecting that the user interactions are interacting with data items that have repeating values in the structure. 19. A computer readable storage medium that stores computer executable instructions which, when executed by a computer, cause the computer to perform a method, comprising:
displaying data in a structure on a user interface display; receiving a set of user interactions with the user interface display; detecting a pattern indicated by the user interactions being with data items that have commonality; and automatically displaying a summary data view showing summary data calculated based on the data and based on the detected pattern. 20. The computer readable storage medium of claim 19 wherein displaying data in a structure comprises displaying the data as data items in rows and columns, and wherein detecting a pattern comprises:
identifying a sort user input sorting on a row or a column to obtain sorted data; and
identifying user selection of a range of data items, that have a common attribute, from the sorted data. | 2,100 |
5,191 | 14,331,991 | 2,182 | At least one processor may receive components of a vector, wherein each of the components of the vector comprises at least an exponent. The at least one processor may further determine a maximum exponent out of respective exponents of the components of the vector, and may determine a scaling value based at least in part on the maximum exponent. An arithmetic logic unit of the at least one processor may scale the vector, by subtracting the scaling value from each of the respective exponents of the components of the vector. | 1. A method for scaling a vector, the method comprising:
receiving, by at least one processor, components of a vector, wherein each of the components of the vector comprises at least an exponent; determining, by the at least one processor, a maximum exponent out of respective exponents of the components of the vector; determining a scaling value based at least in part on the maximum exponent; and scaling, by an arithmetic logic unit (ALU) of the at least one processor, the vector by subtracting the scaling value from each of the respective exponents of the components of the vector. 2. The method of claim 1, wherein each of the components of the vector comprises a floating point number, and wherein the floating point number is represented as a sign bit, a significand, and the exponent. 3. The method of claim 1, wherein:
the vector comprises a three-dimensional vector; and the components of the vector comprise an x-component, a y-component, and a z-component. 4. The method of claim 3, wherein scaling the vector further comprises:
scaling, by the ALU, the x-component of the vector by subtracting the scaling value from a first exponent of the x-component of the vector in a first clock cycle; scaling, by the ALU, the y-component of the vector by subtracting the scaling value from a second exponent of the y-component of the vector in a second clock cycle; and scaling, by the ALU, the z-component of the vector by subtracting the scaling value from a third exponent of the z-component of the vector in a third clock cycle. 5. The method of claim 4, further comprising:
outputting the scaled x-component, the scaled y-component, and the scaled z-component into consecutive storage locations in memory. 6. The method of claim 1, wherein the ALU comprises a hardware digital circuit. 7. The method of claim 1, wherein determining a scaling value based at least in part on the maximum exponent comprises:
determining the scaling value to be the maximum exponent. 8. The method of claim 1, wherein determining a scaling value based at least in part on the maximum exponent comprises:
determining the scaling value based at least in part on the maximum exponent and a maximum representative exponent. 9. An apparatus for scaling a vector, the apparatus comprising:
a memory configured to store components of a vector, wherein each of the components of the vector comprises at least an exponent; at least one processor configured to:
determine a maximum exponent out of respective exponents of the components of the vector, and
determine a scaling value based at least in part on the maximum exponent; and
an arithmetic logic unit (ALU) configured to scale the vector by subtracting the scaling value from each of the respective exponents of the components of the vector. 10. The apparatus of claim 9, wherein each of the components of the vector comprises a floating point number, and wherein the floating point number is represented as a sign bit, a significand, and the exponent. 11. The apparatus of claim 9, wherein:
the vector comprises a three-dimensional vector; and the components of the vector comprise an x-component, a y-component, and a z-component. 12. The apparatus of claim 11, wherein the ALU is configured to:
scale the x-component of the vector by subtracting the scaling value from a first exponent of the x-component of the vector in a first clock cycle; scale the y-component of the vector by subtracting the scaling value from a second exponent of the y-component of the vector in a second clock cycle; and scale the z-component of the vector by subtracting the scaling value from a third exponent of the z-component of the vector in a third clock cycle. 13. The apparatus of claim 12, wherein the ALU is configured to:
output the scaled x-component, the scaled y-component, and the scaled z-component into consecutive storage locations in the memory. 14. The apparatus of claim 9, wherein the ALU comprises a hardware digital circuit. 15. The apparatus of claim 9, wherein the at least one processor is configured to:
determine the scaling value to be the maximum exponent. 16. The apparatus of claim 9, wherein the at least one processor is configured to:
determine the scaling value based at least in part on the maximum exponent and a maximum representative exponent. 17. An apparatus for scaling a vector, the apparatus comprising:
means for receiving components of a vector, wherein each of the components of the vector comprises at least an exponent; means for determining a maximum exponent out of respective exponents of the components of the vector; means for determining a scaling value based at least in part on the maximum exponent; and means for scaling the vector by subtracting the scaling value from each of the respective exponents of the components of the vector. 18. The apparatus of claim 17, wherein each of the components of the vector comprises a floating point number, and wherein the floating point number is represented as a sign bit, a significand, and the exponent. 19. The apparatus of claim 18, wherein:
the vector comprises a three-dimensional vector; and the components of the vector comprise an x-component, a y-component, and a z-component. 20. The apparatus of claim 19, wherein the means for scaling the vector further comprises:
means for scaling the x-component of the vector by subtracting the scaling value from a first exponent of the x-component of the vector in a first clock cycle; means for scaling the y-component of the vector by subtracting the scaling value from a second exponent of the y-component of the vector in a second clock cycle; and means for scaling the z-component of the vector by subtracting the scaling value from a third exponent of the z-component of the vector in a third clock cycle. 21. The apparatus of claim 20, wherein the means for scaling the vector further comprises:
means for outputting the scaled x-component, the scaled y-component, and the scaled z-component into consecutive storage locations in memory. 22. The apparatus of claim 17, wherein the means for determining a scaling value based at least in part on the maximum exponent comprises:
means for determining the scaling value to be the maximum exponent. 23. The apparatus of claim 17, wherein the means for determining a scaling value based at least in part on the maximum exponent comprises:
means for determining the scaling value based at least in part on the maximum exponent and a maximum representative exponent. 24. A computer-readable storage medium storing instructions that, when executed, cause one or more programmable processors to:
receive components of a vector, wherein each of the components of the vector comprises at least an exponent; determine a maximum exponent out of respective exponents of the components of the vector; determine a scaling value based at least in part on the maximum exponent; and scale the vector by subtracting the scaling value from each of the respective exponents of the components of the vector. 25. The computer-readable storage medium of claim 24, wherein each of the components of the vector comprises a floating point number, and wherein the floating point number is represented as a sign bit, a significand, and the exponent. 26. The computer-readable storage medium of claim 24, wherein:
the vector comprises a three-dimensional vector; and the components of the vector comprise an x-component, a y-component, and a z-component. 27. The computer-readable storage medium of claim 26, wherein the instructions further cause the one or more programmable processors to:
scale the x-component of the vector by subtracting the scaling value from a first exponent of the x-component of the vector in a first clock cycle; scale the y-component of the vector by subtracting the scaling value from a second exponent of the y-component of the vector in a second clock cycle; and scale the z-component of the vector by subtracting the scaling value from a third exponent of the z-component of the vector in a third clock cycle. 28. The computer-readable storage medium of claim 27, wherein the instructions further cause the one or more programmable processors to:
output the scaled x-component, the scaled y-component, and the scaled z-component into consecutive storage locations in memory. 29. The computer-readable storage medium of claim 24, wherein the instructions further cause the one or more programmable processors to:
determine the scaling value to be the maximum exponent. 30. The computer-readable storage medium of claim 24, wherein the instructions further cause the one or more programmable processors to:
determine the scaling value based at least in part on the maximum exponent and a maximum representative exponent. | At least one processor may receive components of a vector, wherein each of the components of the vector comprises at least an exponent. The at least one processor may further determine a maximum exponent out of respective exponents of the components of the vector, and may determine a scaling value based at least in part on the maximum exponent. An arithmetic logic unit of the at least one processor may scale the vector, by subtracting the scaling value from each of the respective exponents of the components of the vector.1. A method for scaling a vector, the method comprising:
receiving, by at least one processor, components of a vector, wherein each of the components of the vector comprises at least an exponent; determining, by the at least one processor, a maximum exponent out of respective exponents of the components of the vector; determining a scaling value based at least in part on the maximum exponent; and scaling, by an arithmetic logic unit (ALU) of the at least one processor, the vector by subtracting the scaling value from each of the respective exponents of the components of the vector. 2. The method of claim 1, wherein each of the components of the vector comprises a floating point number, and wherein the floating point number is represented as a sign bit, a significand, and the exponent. 3. The method of claim 1, wherein:
the vector comprises a three-dimensional vector; and the components of the vector comprise an x-component, a y-component, and a z-component. 4. The method of claim 3, wherein scaling the vector further comprises:
scaling, by the ALU, the x-component of the vector by subtracting the scaling value from a first exponent of the x-component of the vector in a first clock cycle; scaling, by the ALU, the y-component of the vector by subtracting the scaling value from a second exponent of the y-component of the vector in a second clock cycle; and scaling, by the ALU, the z-component of the vector by subtracting the scaling value from a third exponent of the z-component of the vector in a third clock cycle. 5. The method of claim 4, further comprising:
outputting the scaled x-component, the scaled y-component, and the scaled z-component into consecutive storage locations in memory. 6. The method of claim 1, wherein the ALU comprises a hardware digital circuit. 7. The method of claim 1, wherein determining a scaling value based at least in part on the maximum exponent comprises:
determining the scaling value to be the maximum exponent. 8. The method of claim 1, wherein determining a scaling value based at least in part on the maximum exponent comprises:
determining the scaling value based at least in part on the maximum exponent and a maximum representative exponent. 9. An apparatus for scaling a vector, the apparatus comprising:
a memory configured to store components of a vector, wherein each of the components of the vector comprises at least an exponent; at least one processor configured to:
determine a maximum exponent out of respective exponents of the components of the vector, and
determine a scaling value based at least in part on the maximum exponent; and
an arithmetic logic unit (ALU) configured to scale the vector by subtracting the scaling value from each of the respective exponents of the components of the vector. 10. The apparatus of claim 9, wherein each of the components of the vector comprises a floating point number, and wherein the floating point number is represented as a sign bit, a significand, and the exponent. 11. The apparatus of claim 9, wherein:
the vector comprises a three-dimensional vector; and the components of the vector comprise an x-component, a y-component, and a z-component. 12. The apparatus of claim 11, wherein the ALU is configured to:
scale the x-component of the vector by subtracting the scaling value from a first exponent of the x-component of the vector in a first clock cycle; scale the y-component of the vector by subtracting the scaling value from a second exponent of the y-component of the vector in a second clock cycle; and scale the z-component of the vector by subtracting the scaling value from a third exponent of the z-component of the vector in a third clock cycle. 13. The apparatus of claim 12, wherein the ALU is configured to:
output the scaled x-component, the scaled y-component, and the scaled z-component into consecutive storage locations in the memory. 14. The apparatus of claim 9, wherein the ALU comprises a hardware digital circuit. 15. The apparatus of claim 9, wherein the at least one processor is configured to:
determine the scaling value to be the maximum exponent. 16. The apparatus of claim 9, wherein the at least one processor is configured to:
determine the scaling value based at least in part on the maximum exponent and a maximum representative exponent. 17. An apparatus for scaling a vector, the apparatus comprising:
means for receiving components of a vector, wherein each of the components of the vector comprises at least an exponent; means for determining a maximum exponent out of respective exponents of the components of the vector; means for determining a scaling value based at least in part on the maximum exponent; and means for scaling the vector by subtracting the scaling value from each of the respective exponents of the components of the vector. 18. The apparatus of claim 17, wherein each of the components of the vector comprises a floating point number, and wherein the floating point number is represented as a sign bit, a significand, and the exponent. 19. The apparatus of claim 18, wherein:
the vector comprises a three-dimensional vector; and the components of the vector comprise an x-component, a y-component, and a z-component. 20. The apparatus of claim 19, wherein the means for scaling the vector further comprises:
means for scaling the x-component of the vector by subtracting the scaling value from a first exponent of the x-component of the vector in a first clock cycle; means for scaling the y-component of the vector by subtracting the scaling value from a second exponent of the y-component of the vector in a second clock cycle; and means for scaling the z-component of the vector by subtracting the scaling value from a third exponent of the z-component of the vector in a third clock cycle. 21. The apparatus of claim 20, wherein the means for scaling the vector further comprises:
means for outputting the scaled x-component, the scaled y-component, and the scaled z-component into consecutive storage locations in memory. 22. The apparatus of claim 17, wherein the means for determining a scaling value based at least in part on the maximum exponent comprises:
means for determining the scaling value to be the maximum exponent. 23. The apparatus of claim 17, wherein the means for determining a scaling value based at least in part on the maximum exponent comprises:
means for determining the scaling value based at least in part on the maximum exponent and a maximum representative exponent. 24. A computer-readable storage medium storing instructions that, when executed, cause one or more programmable processors to:
receive components of a vector, wherein each of the components of the vector comprises at least an exponent; determine a maximum exponent out of respective exponents of the components of the vector; determine a scaling value based at least in part on the maximum exponent; and scale the vector by subtracting the scaling value from each of the respective exponents of the components of the vector. 25. The computer-readable storage medium of claim 24, wherein each of the components of the vector comprises a floating point number, and wherein the floating point number is represented as a sign bit, a significand, and the exponent. 26. The computer-readable storage medium of claim 24, wherein:
the vector comprises a three-dimensional vector; and the components of the vector comprise an x-component, a y-component, and a z-component. 27. The computer-readable storage medium of claim 26, wherein the instructions further cause the one or more programmable processors to:
scale the x-component of the vector by subtracting the scaling value from a first exponent of the x-component of the vector in a first clock cycle; scale the y-component of the vector by subtracting the scaling value from a second exponent of the y-component of the vector in a second clock cycle; and scale the z-component of the vector by subtracting the scaling value from a third exponent of the z-component of the vector in a third clock cycle. 28. The computer-readable storage medium of claim 27, wherein the instructions further cause the one or more programmable processors to:
output the scaled x-component, the scaled y-component, and the scaled z-component into consecutive storage locations in memory. 29. The computer-readable storage medium of claim 24, wherein the instructions further cause the one or more programmable processors to:
determine the scaling value to be the maximum exponent. 30. The computer-readable storage medium of claim 24, wherein the instructions further cause the one or more programmable processors to:
determine the scaling value based at least in part on the maximum exponent and a maximum representative exponent. | 2,100 |
5,192 | 14,296,450 | 2,166 | Optimistic concurrency is effectuated to manage constraints in a synchronization environment at multiple computing device endpoints in a consistent fashion without utilizing concentrated centralized constraint logic. Implemented data synchronization constraints that identify false violation scenarios may be automatically resolved without user intervention by using an etag system directed by a master component to assist computing device endpoints to maintain data synchronization among them. Data entries defining each file hierarchy component to be synched are generated and shared with the master component and each computing device endpoint in a synchronization environment. Individual computing device endpoints can use the data entries generated locally with those generated by other computing device endpoints to locally resolve identified false violation scenarios. | 1. A method performed on at least one computing device of a cloud computing environment, the method comprising:
first receiving, by the cloud computing environment, a first request to synchronize first data on a first device to the cloud computing environment, the first request associated with a first etag; sending, by the cloud computing environment to the first device, an indication that the first request is denied; sending, by the cloud computing environment to the first device, an updated etag; second receiving, by the cloud computing environment from the first device, a second request to synchronize the first data on the first device to the cloud computing environment, the second request associated with the updated etag value; and accepting, in response to the second request being associated with the updated etag, by the cloud computing environment as uploaded from the first device, at least a portion of the first data. 2. The method of claim 1 where the first data comprises a file. 3. The method of claim 1 further comprising: refusing, in response to the second request not being associated with the updated etag, by the cloud computing environment from the first device, uploading of the at least a portion of the first data. 4. The method of claim 1 further comprising: forth receiving, by the cloud computing environment from a second device, a synchronization event request associated with another etag. 5. The method of claim 4 further comprising: downloading, by the cloud computing environment to the second device in response to the forth receiving and in response to the another etag corresponding to the updated etag, the uploaded at least a portion of the data. 6. The method of claim 4 further comprising: refusing, by the cloud computing environment in response to the forth receiving and in response to the another etag not corresponding to the updated etag, the synchronization event request from the second device. 7. The method of claim 1 further comprising: issuing, by the cloud computing environment in response to receiving a conflict data entry, a conflict resolution request to the first device and the second device. 8. A system comprising at least one computing device and at least one program that are together configured for performing actions, the system being at least part of a cloud computing environment, the actions comprising:
first receiving, by the cloud computing environment, a first request to synchronize first data on a first device to the cloud computing environment, the first request associated with a first etag; sending, by the cloud computing environment to the first device, an indication that the first request is denied; sending, by the cloud computing environment to the first device, an updated etag; second receiving, by the cloud computing environment from the first device, a second request to synchronize the first data on the first device to the cloud computing environment, the second request associated with the updated etag value; and accepting, in response to the second request being associated with the updated etag, by the cloud computing environment as uploaded from the first device, at least a portion of the first data. 9. The system of claim 8 where the first data comprises a file. 10. The system of claim 8, the actions further comprising: refusing, in response to the second request not being associated with the updated etag, by the cloud computing environment from the first device, uploading of the at least a portion of the first data. 11. The system of claim 8, the actions further comprising: forth receiving, by the cloud computing environment from a second device, a synchronization event request associated with another etag. 12. The system of claim 11, the actions further comprising: downloading, by the cloud computing environment to the second device in response to the forth receiving and in response to the another etag corresponding to the updated etag, the uploaded at least a portion of the data. 13. The system of claim 11, the actions further comprising: refusing, by the cloud computing environment in response to the forth receiving and in response to the another etag not corresponding to the updated etag, the synchronization event request from the second device. 14. The system of claim 8, the actions further comprising: issuing, by the cloud computing environment in response to receiving a conflict data entry, a conflict resolution request to the first device and the second device. 15. At least one storage device storing instructions that, when executed by at least one computing device, cause the at least one computing device to perform actions, the at least one computing device being at least part of a cloud computing environment, the actions comprising:
first receiving, by the cloud computing environment, a first request to synchronize first data on a first device to the cloud computing environment, the first request associated with a first etag; sending, by the cloud computing environment to the first device, an indication that the first request is denied; sending, by the cloud computing environment to the first device, an updated etag; second receiving, by the cloud computing environment from the first device, a second request to synchronize the first data on the first device to the cloud computing environment, the second request associated with the updated etag value; and accepting, in response to the second request being associated with the updated etag, by the cloud computing environment as uploaded from the first device, at least a portion of the first data. 16. The at least one storage device of claim 15, the actions further comprising: refusing, in response to the second request not being associated with the updated etag, by the cloud computing environment from the first device, uploading of the at least a portion of the first data. 17. The at least one storage device of claim 15, the actions further comprising: forth receiving, by the cloud computing environment from a second device, a synchronization event request associated with another etag. 18. The at least one storage device of claim 17, the actions further comprising: downloading, by the cloud computing environment to the second device in response to the forth receiving and in response to the another etag corresponding to the updated etag, the uploaded at least a portion of the data. 19. The at least one storage device of claim 17, the actions further comprising: refusing, by the cloud computing environment in response to the forth receiving and in response to the another etag not corresponding to the updated etag, the synchronization event request from the second device. 20. The at least one storage device of claim 15, the actions further comprising: issuing, by the cloud computing environment in response to receiving a conflict data entry, a conflict resolution request to the first device and the second device. | Optimistic concurrency is effectuated to manage constraints in a synchronization environment at multiple computing device endpoints in a consistent fashion without utilizing concentrated centralized constraint logic. Implemented data synchronization constraints that identify false violation scenarios may be automatically resolved without user intervention by using an etag system directed by a master component to assist computing device endpoints to maintain data synchronization among them. Data entries defining each file hierarchy component to be synched are generated and shared with the master component and each computing device endpoint in a synchronization environment. Individual computing device endpoints can use the data entries generated locally with those generated by other computing device endpoints to locally resolve identified false violation scenarios.1. A method performed on at least one computing device of a cloud computing environment, the method comprising:
first receiving, by the cloud computing environment, a first request to synchronize first data on a first device to the cloud computing environment, the first request associated with a first etag; sending, by the cloud computing environment to the first device, an indication that the first request is denied; sending, by the cloud computing environment to the first device, an updated etag; second receiving, by the cloud computing environment from the first device, a second request to synchronize the first data on the first device to the cloud computing environment, the second request associated with the updated etag value; and accepting, in response to the second request being associated with the updated etag, by the cloud computing environment as uploaded from the first device, at least a portion of the first data. 2. The method of claim 1 where the first data comprises a file. 3. The method of claim 1 further comprising: refusing, in response to the second request not being associated with the updated etag, by the cloud computing environment from the first device, uploading of the at least a portion of the first data. 4. The method of claim 1 further comprising: forth receiving, by the cloud computing environment from a second device, a synchronization event request associated with another etag. 5. The method of claim 4 further comprising: downloading, by the cloud computing environment to the second device in response to the forth receiving and in response to the another etag corresponding to the updated etag, the uploaded at least a portion of the data. 6. The method of claim 4 further comprising: refusing, by the cloud computing environment in response to the forth receiving and in response to the another etag not corresponding to the updated etag, the synchronization event request from the second device. 7. The method of claim 1 further comprising: issuing, by the cloud computing environment in response to receiving a conflict data entry, a conflict resolution request to the first device and the second device. 8. A system comprising at least one computing device and at least one program that are together configured for performing actions, the system being at least part of a cloud computing environment, the actions comprising:
first receiving, by the cloud computing environment, a first request to synchronize first data on a first device to the cloud computing environment, the first request associated with a first etag; sending, by the cloud computing environment to the first device, an indication that the first request is denied; sending, by the cloud computing environment to the first device, an updated etag; second receiving, by the cloud computing environment from the first device, a second request to synchronize the first data on the first device to the cloud computing environment, the second request associated with the updated etag value; and accepting, in response to the second request being associated with the updated etag, by the cloud computing environment as uploaded from the first device, at least a portion of the first data. 9. The system of claim 8 where the first data comprises a file. 10. The system of claim 8, the actions further comprising: refusing, in response to the second request not being associated with the updated etag, by the cloud computing environment from the first device, uploading of the at least a portion of the first data. 11. The system of claim 8, the actions further comprising: forth receiving, by the cloud computing environment from a second device, a synchronization event request associated with another etag. 12. The system of claim 11, the actions further comprising: downloading, by the cloud computing environment to the second device in response to the forth receiving and in response to the another etag corresponding to the updated etag, the uploaded at least a portion of the data. 13. The system of claim 11, the actions further comprising: refusing, by the cloud computing environment in response to the forth receiving and in response to the another etag not corresponding to the updated etag, the synchronization event request from the second device. 14. The system of claim 8, the actions further comprising: issuing, by the cloud computing environment in response to receiving a conflict data entry, a conflict resolution request to the first device and the second device. 15. At least one storage device storing instructions that, when executed by at least one computing device, cause the at least one computing device to perform actions, the at least one computing device being at least part of a cloud computing environment, the actions comprising:
first receiving, by the cloud computing environment, a first request to synchronize first data on a first device to the cloud computing environment, the first request associated with a first etag; sending, by the cloud computing environment to the first device, an indication that the first request is denied; sending, by the cloud computing environment to the first device, an updated etag; second receiving, by the cloud computing environment from the first device, a second request to synchronize the first data on the first device to the cloud computing environment, the second request associated with the updated etag value; and accepting, in response to the second request being associated with the updated etag, by the cloud computing environment as uploaded from the first device, at least a portion of the first data. 16. The at least one storage device of claim 15, the actions further comprising: refusing, in response to the second request not being associated with the updated etag, by the cloud computing environment from the first device, uploading of the at least a portion of the first data. 17. The at least one storage device of claim 15, the actions further comprising: forth receiving, by the cloud computing environment from a second device, a synchronization event request associated with another etag. 18. The at least one storage device of claim 17, the actions further comprising: downloading, by the cloud computing environment to the second device in response to the forth receiving and in response to the another etag corresponding to the updated etag, the uploaded at least a portion of the data. 19. The at least one storage device of claim 17, the actions further comprising: refusing, by the cloud computing environment in response to the forth receiving and in response to the another etag not corresponding to the updated etag, the synchronization event request from the second device. 20. The at least one storage device of claim 15, the actions further comprising: issuing, by the cloud computing environment in response to receiving a conflict data entry, a conflict resolution request to the first device and the second device. | 2,100 |
5,193 | 13,617,829 | 2,156 | Information is automatically identified and shared between individuals who wish to become socially or professionally “connected.” An electronic communication is sent from one person to another including a request or invitation to be personally connected. If the request is accepted by the other person, a computer network is automatically accessed without further user intervention to search of one or more electronic databases to locate information related to the persons. If such information is found during the search, it is provided to the persons wishing to be connected. The initial request to become connected may be sent through an electronic mail message, through physical contact between two smartphones or other portable electronic devices, or through a wireless electronic network communication. The method may include searching multiple Internet websites or electronic databases, including social or professional media Internet websites, to locate the information to be shared. | 1. A method of connecting people, comprising the steps of:
sending an electronic communication from one person to another containing a request to be personally connected as friends or colleagues; if the request is accepted by the other person, automatically accessing a computer network to search of one or more electronic databases to locate information related to the persons; and, if information is found during the search, providing the information to the persons. 2. The method of claim 1, wherein the request is sent through an electronic mail message. 3. The method of claim 1, wherein the request is sent through contact between two smartphones or other portable electronic devices. 4. The method of claim 1, wherein the request is sent through a wireless electronic network communication. 5. The method of claim 1, wherein a person may be an organization or other entity. 6. The method of claim 1, including the step of searching a social or professional media Internet website to locate the information. 7. The method of claim 1, including the step of searching multiple Internet websites or electronic databases to locate the information. 8. The method of claim 1, wherein the information related to the persons includes information common to, shared by, or linking the two persons. 9. The method of claim 1, including the step of searching one or more contact lists maintained by the persons to locate common contacts. 10. The method of claim 1, including the step of locating and providing biological, health, financial, personal, educational or demographic information to the persons. 11. The method of claim 1, including the step of providing user controls enabling the persons to limit the type of databases to be searched or the information to be shared. 12. The method of claim 1, including the step of automatically sending a message to the persons or to a third party indicating that the connection has been made. 13. The method of claim 1, including the step of automatically sending a message to the persons or to a third party including information regarding a time or place associated with the connection. 14. The method of claim 1, including the step of locating and providing the persons with digital images of each other. 15. The method of claim 1, including the steps of:
locating information regarding the movements or travels of the persons; and informing the persons if or when they have been to the same geographic region, business establishment, or event. 16. The method of claim 1, including the steps of:
locating information regarding the movements or travels of the persons using global positioning system (GPS) data; and informing the persons if or when they have been in the same geographic region, business establishment, or event. 17. The method of claim 1, including the steps of:
determining if the persons are physically near one another; and informing the persons if they are in close proximity. 18. The method of claim 1, including the steps of:
determining if the persons are physically near one another using electronic proximity sensing techniques; and informing the persons if they are in close proximity. 19. The method of claim 1, including the steps of:
determining if the persons are physically near one another using global positioning system (GPS) data; and informing the persons if they are in close proximity. | Information is automatically identified and shared between individuals who wish to become socially or professionally “connected.” An electronic communication is sent from one person to another including a request or invitation to be personally connected. If the request is accepted by the other person, a computer network is automatically accessed without further user intervention to search of one or more electronic databases to locate information related to the persons. If such information is found during the search, it is provided to the persons wishing to be connected. The initial request to become connected may be sent through an electronic mail message, through physical contact between two smartphones or other portable electronic devices, or through a wireless electronic network communication. The method may include searching multiple Internet websites or electronic databases, including social or professional media Internet websites, to locate the information to be shared.1. A method of connecting people, comprising the steps of:
sending an electronic communication from one person to another containing a request to be personally connected as friends or colleagues; if the request is accepted by the other person, automatically accessing a computer network to search of one or more electronic databases to locate information related to the persons; and, if information is found during the search, providing the information to the persons. 2. The method of claim 1, wherein the request is sent through an electronic mail message. 3. The method of claim 1, wherein the request is sent through contact between two smartphones or other portable electronic devices. 4. The method of claim 1, wherein the request is sent through a wireless electronic network communication. 5. The method of claim 1, wherein a person may be an organization or other entity. 6. The method of claim 1, including the step of searching a social or professional media Internet website to locate the information. 7. The method of claim 1, including the step of searching multiple Internet websites or electronic databases to locate the information. 8. The method of claim 1, wherein the information related to the persons includes information common to, shared by, or linking the two persons. 9. The method of claim 1, including the step of searching one or more contact lists maintained by the persons to locate common contacts. 10. The method of claim 1, including the step of locating and providing biological, health, financial, personal, educational or demographic information to the persons. 11. The method of claim 1, including the step of providing user controls enabling the persons to limit the type of databases to be searched or the information to be shared. 12. The method of claim 1, including the step of automatically sending a message to the persons or to a third party indicating that the connection has been made. 13. The method of claim 1, including the step of automatically sending a message to the persons or to a third party including information regarding a time or place associated with the connection. 14. The method of claim 1, including the step of locating and providing the persons with digital images of each other. 15. The method of claim 1, including the steps of:
locating information regarding the movements or travels of the persons; and informing the persons if or when they have been to the same geographic region, business establishment, or event. 16. The method of claim 1, including the steps of:
locating information regarding the movements or travels of the persons using global positioning system (GPS) data; and informing the persons if or when they have been in the same geographic region, business establishment, or event. 17. The method of claim 1, including the steps of:
determining if the persons are physically near one another; and informing the persons if they are in close proximity. 18. The method of claim 1, including the steps of:
determining if the persons are physically near one another using electronic proximity sensing techniques; and informing the persons if they are in close proximity. 19. The method of claim 1, including the steps of:
determining if the persons are physically near one another using global positioning system (GPS) data; and informing the persons if they are in close proximity. | 2,100 |
5,194 | 13,595,213 | 2,143 | A set of elements, such as, for example, a path, a directory list, a playlist, and a listing of information associated with a file or a song, may be truncated so that a partial set may be generated and displayed. The truncation may be performed in an intelligent manner to produce a meaningful truncated portion. Such a partial set may be beneficial when the space allotted for display of the set is small to begin with or is reduced. In one implementation, a display size of a set is compared with a size of a display area. A data element is selected based on the comparison, and a display space size is determined for the selected data element. A truncated, yet meaningful, portion is determined for the selected data element, the portion fitting within the display space size. | 1. A method comprising:
receiving a path that includes two or more path elements; selecting a path element based on relative importance of the path elements, wherein the selected path element includes a string of characters; and determining a truncated portion for the selected path element to display when displaying the path, wherein the truncated portion includes less than all the characters included in the string. 2. The method of claim 1 further comprising receiving information describing a size of an area in which the path is to be displayed, the received information indicating that the area is sized such that not all of the two or more path elements can be displayed completely within the area. 3. The method of claim 2 further comprising determining a display size of the path. 4. The method of claim 2 further comprising:
determining a part of the path to display, the part including the truncated portion of each of the selected path elements; and
displaying the part of the path in the area. 5. The method of claim 1 wherein determining a truncated portion comprises reducing a textual portion of the selected data element by a predetermined percentage. 6. The method of claim 5 further comprising providing an indication in the truncated portion indicating that the selected path element has been truncated. 7. The method of claim 5 further comprising:
selecting a second path element based on relative importance of the path elements; and
determining a truncated, yet meaningful portion for the second selected path element by reducing a textual portion of the selected data element by the predetermined percentage. 8. The method of claim 1 wherein the relative importance is based on a position of the path element in the path. 9. The method of claim 1 wherein selecting a path element comprises selecting an interior path element because of a relatively lower importance of the interior path element as compared to a non-interior path element. 10. The method of claim 9 further comprising:
selecting a root path element after truncating the interior path element; and
truncating the root path element. 11. The method of claim 10 further comprising:
selecting a parent path element after truncating the root path element; and
truncating the parent path element. 12-21. (canceled) 22. A computer-readable medium storing instructions executable by a processor to perform operations comprising:
receiving a path that includes two or more path elements; selecting a path element based on relative importance of the path elements, wherein the selected path element includes a string of characters; and determining a truncated portion for the selected path element to display when displaying the path, wherein the truncated portion includes less than all the characters included in the string. 23. The medium of claim 22, the operations further comprising receiving information describing a size of an area in which the path is to be displayed, the received information indicating that the area is sized such that not all of the two or more path elements can be displayed completely within the area. 24. The medium of claim 22, the operations further comprising determining a display size of the path. 25. The medium of claim 22, the operations further comprising:
determining a part of the path to display, the part including the truncated portion of each of the selected path elements; and displaying the part of the path in the area. 26. The medium of claim 22, wherein determining a truncated portion comprises reducing a textual portion of the selected data element by a predetermined percentage, and wherein the operations further comprise providing an indication in the truncated portion indicating that the selected path element has been truncated. 27. The medium of claim 26, the operations further comprising:
selecting a second path element based on relative importance of the path elements; and determining a truncated, yet meaningful portion for the second selected path element by reducing a textual portion of the selected data element by the predetermined percentage. 28. The medium of claim 27, wherein the relative importance is based on a position of the path element in the path. 29. A system comprising:
a processor; and a computer-readable medium storing instructions executable by the processor to perform operations comprising:
receiving a set that includes two or more data elements;
selecting a first data element from the two or more data elements, the first data element including a first string of characters and having a first size;
selecting a second data element from the two or more data elements, the second data element including a second string of characters and having a second size;
determining a truncated first size that is based on a percentage of the first size;
determining a truncated second size that is based on the percentage of the second size;
determining a truncated portion of the first data element having a size such that the truncated portion of the first data element is displayable in the truncated first size, wherein the truncated portion of the first data element includes less than all the characters in the first string; and
determining a truncated portion of the second data element having a size such that the truncated portion of the second data element is displayable in the truncated second size, wherein the truncated portion of the second data element includes less than all the characters in the second string. 30. The system of claim 29, wherein selecting a path element comprises selecting an interior path element because of a relatively lower importance of the interior path element as compared to a non-interior path element. 31. The system of claim 30, the operations further comprising:
selecting a root path element after truncating the interior path element; truncating the root path element; selecting a parent path element after truncating the root path element; and truncating the parent path element. | A set of elements, such as, for example, a path, a directory list, a playlist, and a listing of information associated with a file or a song, may be truncated so that a partial set may be generated and displayed. The truncation may be performed in an intelligent manner to produce a meaningful truncated portion. Such a partial set may be beneficial when the space allotted for display of the set is small to begin with or is reduced. In one implementation, a display size of a set is compared with a size of a display area. A data element is selected based on the comparison, and a display space size is determined for the selected data element. A truncated, yet meaningful, portion is determined for the selected data element, the portion fitting within the display space size.1. A method comprising:
receiving a path that includes two or more path elements; selecting a path element based on relative importance of the path elements, wherein the selected path element includes a string of characters; and determining a truncated portion for the selected path element to display when displaying the path, wherein the truncated portion includes less than all the characters included in the string. 2. The method of claim 1 further comprising receiving information describing a size of an area in which the path is to be displayed, the received information indicating that the area is sized such that not all of the two or more path elements can be displayed completely within the area. 3. The method of claim 2 further comprising determining a display size of the path. 4. The method of claim 2 further comprising:
determining a part of the path to display, the part including the truncated portion of each of the selected path elements; and
displaying the part of the path in the area. 5. The method of claim 1 wherein determining a truncated portion comprises reducing a textual portion of the selected data element by a predetermined percentage. 6. The method of claim 5 further comprising providing an indication in the truncated portion indicating that the selected path element has been truncated. 7. The method of claim 5 further comprising:
selecting a second path element based on relative importance of the path elements; and
determining a truncated, yet meaningful portion for the second selected path element by reducing a textual portion of the selected data element by the predetermined percentage. 8. The method of claim 1 wherein the relative importance is based on a position of the path element in the path. 9. The method of claim 1 wherein selecting a path element comprises selecting an interior path element because of a relatively lower importance of the interior path element as compared to a non-interior path element. 10. The method of claim 9 further comprising:
selecting a root path element after truncating the interior path element; and
truncating the root path element. 11. The method of claim 10 further comprising:
selecting a parent path element after truncating the root path element; and
truncating the parent path element. 12-21. (canceled) 22. A computer-readable medium storing instructions executable by a processor to perform operations comprising:
receiving a path that includes two or more path elements; selecting a path element based on relative importance of the path elements, wherein the selected path element includes a string of characters; and determining a truncated portion for the selected path element to display when displaying the path, wherein the truncated portion includes less than all the characters included in the string. 23. The medium of claim 22, the operations further comprising receiving information describing a size of an area in which the path is to be displayed, the received information indicating that the area is sized such that not all of the two or more path elements can be displayed completely within the area. 24. The medium of claim 22, the operations further comprising determining a display size of the path. 25. The medium of claim 22, the operations further comprising:
determining a part of the path to display, the part including the truncated portion of each of the selected path elements; and displaying the part of the path in the area. 26. The medium of claim 22, wherein determining a truncated portion comprises reducing a textual portion of the selected data element by a predetermined percentage, and wherein the operations further comprise providing an indication in the truncated portion indicating that the selected path element has been truncated. 27. The medium of claim 26, the operations further comprising:
selecting a second path element based on relative importance of the path elements; and determining a truncated, yet meaningful portion for the second selected path element by reducing a textual portion of the selected data element by the predetermined percentage. 28. The medium of claim 27, wherein the relative importance is based on a position of the path element in the path. 29. A system comprising:
a processor; and a computer-readable medium storing instructions executable by the processor to perform operations comprising:
receiving a set that includes two or more data elements;
selecting a first data element from the two or more data elements, the first data element including a first string of characters and having a first size;
selecting a second data element from the two or more data elements, the second data element including a second string of characters and having a second size;
determining a truncated first size that is based on a percentage of the first size;
determining a truncated second size that is based on the percentage of the second size;
determining a truncated portion of the first data element having a size such that the truncated portion of the first data element is displayable in the truncated first size, wherein the truncated portion of the first data element includes less than all the characters in the first string; and
determining a truncated portion of the second data element having a size such that the truncated portion of the second data element is displayable in the truncated second size, wherein the truncated portion of the second data element includes less than all the characters in the second string. 30. The system of claim 29, wherein selecting a path element comprises selecting an interior path element because of a relatively lower importance of the interior path element as compared to a non-interior path element. 31. The system of claim 30, the operations further comprising:
selecting a root path element after truncating the interior path element; truncating the root path element; selecting a parent path element after truncating the root path element; and truncating the parent path element. | 2,100 |
5,195 | 14,827,150 | 2,112 | A method of encoding includes receiving input systematic data including an input group (x z (n)) of Z systematic bits. The method includes generating an LDPC base code using the input group (x z (n)). The LDPC base code is characterized by a row weight (Wr), a column weight (Wc), and a first level lifting factor (Z). The method includes transforming the LDPC base code into a Trellis-based Quasi-Cyclic LDPC (TQC-LDPC) convolutional code. The method includes generating a Parallel Concatenated TQC-LDPC convolutional code in a form of an H-matrix including a systematic submatrix (H sys ) of the input systematic data and a parity check submatrix (H par ) of parity check bits, wherein the H par includes a column of Z-group parity bits. The method includes concatenating the H par with each column of systematic bits, wherein the H par includes J parity bits per systematic bit. | 1. A method of encoding, the method comprising:
receiving input systematic data including an input group (xz(n)) of Z systematic bits. generating a Low Density Parity Check (LDPC) base code using the input group (xz(n)), wherein the LDPC base code is characterized by a row weight (Wr), a column weight (Wc), and a first level lifting factor (Z). transforming the LDPC base code into a Trellis-based Quasi-Cyclic LDPC (TQC-LDPC) convolutional code; generating, by Trellis-based Quasi-Cyclic LDPC Recursive Systematic Convolutional (QC-RSC) encoder processing circuitry using the TQC-LDPC convolutional code, a Parallel Concatenated Trellis-based Quasi-Cyclic LDPC (PC-LDPC) convolutional code in a form of an H-matrix including a systematic submatrix (Hsys) of the input systematic data and a parity check submatrix (Hpar) of parity check bits, wherein the Hpar includes a column of Z-group parity bits; concatenating the Hpar with each column of systematic bits, wherein the Hpar includes J parity bits per systematic bit. 2. The method of claim 1, wherein the LDPC base code is a Spatially-Coupled LDPC (SC-LDPC) base code. 3. The method of claim 1, wherein the column of parity bits includes multiple rows of parity bits, yielding a rate less than one-half (R<½). 4. The method of claim 1, wherein a rate of the TQC-LDPC Convolutional code is increased by a puncturing operation. 5. The method of claim 1, wherein each QC-RSC includes J Z-RSC encoders, and each Z-RSC encoder includes Z identical RSC encoders, wherein each RSC encoder encodes a one of the Z input bits it at a time. 6. The method of claim 1, further comprising reducing periodicity and bit error rate (BER) of the code by increasing a size (B) of the a systematic submatrix (Hsys). 7. The method of claim 1, further comprises applying a second level of Zp cyclic shifts to the H-matrix according to a Dual-Step QC Shift method, wherein Zp represents a second level lifting factor over the lifting factor Z, and wherein N represents a base-family code length. 8. The method of claim 1, further comprising modifying quasi-cyclic values of a Trellis-based Quasi-Cyclic LDPC (TQC-LDPC) convolutional code to increase bit error rate performance of a decoder that receives the PC-LDPC convolutional code. 9. The method of claim 1, further comprising:
selecting a reference row in which all shift entries denote a unity matrix; shifting each other row in the TQC-LDPC convolutional code relative to the reference row. 10. An encoder comprising:
Trellis-based Quasi-Cyclic LDPC Recursive Systematic Convolutional (QC-RSC) encoder processing circuitry configured to:
receive input systematic data including an input group (xz(n)) of Z systematic bits.
generate a Low Density Parity Check (LDPC) base code using the input group (xz(n)), wherein the LDPC base code is characterized by a row weight (Wr), a column weight (Wc), and a first level lifting factor (Z);
transform the LDPC base code into a Trellis-based Quasi-Cyclic LDPC (TQC-LDPC) convolutional code.
generate a Parallel Concatenated Trellis-based Quasi-Cyclic LDPC (PC-LDPC) convolutional code in a form of an H-matrix including a systematic submatrix (Hsys) of the input systematic data and a parity check submatrix (Hpar) of parity check bits, wherein the Hpar , includes a column of Z-group parity bits;
concatenate the Hpar with each column of systematic bits, wherein the Hpar includes J parity bits per systematic bit. 11. The encoder of claim 10, wherein the LDPC base code is a Spatially-Coupled LDPC (SC-LDPC) base code. 12. The encoder of claim 10, wherein the column of parity bits includes multiple rows of parity bits, yielding a rate less than one-half (R<½). 13. The encoder of claim 10, wherein the QC-RSC encoder processing circuitry is further configured to: increase a rate of the TQC-LDPC Convolutional code by performing a puncturing operation. 14. The encoder of claim 10, wherein each QC-RSC includes J Z-RSC encoders, and each Z-RSC encoder includes Z identical RSC encoders, wherein each RSC encoder encodes a one of the Z input bits it at a time. 15. The encoder of claim 10, wherein the QC-RSC encoder processing circuitry is further configured to: reduce periodicity and bit error rate (BER) of the code by increasing a size (B) of the a systematic submatrix (Hsys). 16. The encoder of claim 10, wherein the QC-RSC encoder processing circuitry is further configured to: apply a second level of Zp cyclic shifts to the H-matrix according to a Dual-Step QC Shift encoder, wherein Zp represents a second level lifting factor over the lifting factor Z, and wherein N represents a base-family code length. 17. The encoder of claim 10, wherein the QC-RSC encoder processing circuitry is further configured to: modify quasi-cyclic values of a Trellis-based Quasi-Cyclic LDPC (TQC-LDPC) convolutional code to increase bit error rate performance of a decoder that receives the PC-LDPC convolutional code. 18. The encoder of claim 10, wherein the QC-RSC encoder processing circuitry is further configured to:
select a reference row in which all shift entries denote a unity matrix; shift each other row in the TQC-LDPC convolutional code relative to the reference row. 19. A decoder comprising:
Trellis-based Quasi-Cyclic Low Density Parity Check (TQC-LDPC) Maximum A posteriori Probability (MAP) decoder processing circuitry configured to:
receive a Parallel Concatenated Trellis-based Quasi-Cyclic LDPC (PC-LDPC) convolutional code in a form of an H-matrix including a systematic submatrix (Hsys) of the input systematic data and a parity check submatrix (Hpar) of parity check bits, wherein the PC-LDPC convolutional code is characterized by a lifting factor (Z), the Hpar includes a column of Z-group parity bits concatenated with each column of systematic bits, and the Hpar includes J parity bits per systematic bit;
decode the PC-LDPC convolutional code into and a group (xz(n)) of Z systematic bits by, for each Z-row of the PC-LDPC convolutional code:
determining, from the PC-LDPC convolutional code, a specific quasi-cyclical domain of the Z-row that is different from any other quasi-cyclical domain of another Z-row of the PC-LDPC convolutional code,
quasi-cyclically shifting the bits of the Z-row by the specific quasi-cyclical domain;
performing Z parallel MAP decoding processes on the shifted bits of the Z-row, and
unshifting the parallel decoded bits of the Z-row by the specific quasi-cyclical domain, yielding the group (xz(n)) of Z systematic bits. 20. The decoder of claim 19, wherein the TQC-LDPC MAP decoder processing circuitry is further configured to: omit quasi-cyclically shifting the bits of a first Z-row based on a determination that the first Z-row is all cyclical shifts of zero. 21. The decoder of claim 19, wherein decoding the PC-LDPC convolutional code into and a group (xz(n)) of Z systematic bits comprises applying a MAX* Log MAP decoding algorithm. 22. The decoder of claim 19, wherein decoding the PC-LDPC convolutional code into and a group (xz(n)) of Z systematic bits comprises applying a MAX Log MAP decoding algorithm. | A method of encoding includes receiving input systematic data including an input group (x z (n)) of Z systematic bits. The method includes generating an LDPC base code using the input group (x z (n)). The LDPC base code is characterized by a row weight (Wr), a column weight (Wc), and a first level lifting factor (Z). The method includes transforming the LDPC base code into a Trellis-based Quasi-Cyclic LDPC (TQC-LDPC) convolutional code. The method includes generating a Parallel Concatenated TQC-LDPC convolutional code in a form of an H-matrix including a systematic submatrix (H sys ) of the input systematic data and a parity check submatrix (H par ) of parity check bits, wherein the H par includes a column of Z-group parity bits. The method includes concatenating the H par with each column of systematic bits, wherein the H par includes J parity bits per systematic bit.1. A method of encoding, the method comprising:
receiving input systematic data including an input group (xz(n)) of Z systematic bits. generating a Low Density Parity Check (LDPC) base code using the input group (xz(n)), wherein the LDPC base code is characterized by a row weight (Wr), a column weight (Wc), and a first level lifting factor (Z). transforming the LDPC base code into a Trellis-based Quasi-Cyclic LDPC (TQC-LDPC) convolutional code; generating, by Trellis-based Quasi-Cyclic LDPC Recursive Systematic Convolutional (QC-RSC) encoder processing circuitry using the TQC-LDPC convolutional code, a Parallel Concatenated Trellis-based Quasi-Cyclic LDPC (PC-LDPC) convolutional code in a form of an H-matrix including a systematic submatrix (Hsys) of the input systematic data and a parity check submatrix (Hpar) of parity check bits, wherein the Hpar includes a column of Z-group parity bits; concatenating the Hpar with each column of systematic bits, wherein the Hpar includes J parity bits per systematic bit. 2. The method of claim 1, wherein the LDPC base code is a Spatially-Coupled LDPC (SC-LDPC) base code. 3. The method of claim 1, wherein the column of parity bits includes multiple rows of parity bits, yielding a rate less than one-half (R<½). 4. The method of claim 1, wherein a rate of the TQC-LDPC Convolutional code is increased by a puncturing operation. 5. The method of claim 1, wherein each QC-RSC includes J Z-RSC encoders, and each Z-RSC encoder includes Z identical RSC encoders, wherein each RSC encoder encodes a one of the Z input bits it at a time. 6. The method of claim 1, further comprising reducing periodicity and bit error rate (BER) of the code by increasing a size (B) of the a systematic submatrix (Hsys). 7. The method of claim 1, further comprises applying a second level of Zp cyclic shifts to the H-matrix according to a Dual-Step QC Shift method, wherein Zp represents a second level lifting factor over the lifting factor Z, and wherein N represents a base-family code length. 8. The method of claim 1, further comprising modifying quasi-cyclic values of a Trellis-based Quasi-Cyclic LDPC (TQC-LDPC) convolutional code to increase bit error rate performance of a decoder that receives the PC-LDPC convolutional code. 9. The method of claim 1, further comprising:
selecting a reference row in which all shift entries denote a unity matrix; shifting each other row in the TQC-LDPC convolutional code relative to the reference row. 10. An encoder comprising:
Trellis-based Quasi-Cyclic LDPC Recursive Systematic Convolutional (QC-RSC) encoder processing circuitry configured to:
receive input systematic data including an input group (xz(n)) of Z systematic bits.
generate a Low Density Parity Check (LDPC) base code using the input group (xz(n)), wherein the LDPC base code is characterized by a row weight (Wr), a column weight (Wc), and a first level lifting factor (Z);
transform the LDPC base code into a Trellis-based Quasi-Cyclic LDPC (TQC-LDPC) convolutional code.
generate a Parallel Concatenated Trellis-based Quasi-Cyclic LDPC (PC-LDPC) convolutional code in a form of an H-matrix including a systematic submatrix (Hsys) of the input systematic data and a parity check submatrix (Hpar) of parity check bits, wherein the Hpar , includes a column of Z-group parity bits;
concatenate the Hpar with each column of systematic bits, wherein the Hpar includes J parity bits per systematic bit. 11. The encoder of claim 10, wherein the LDPC base code is a Spatially-Coupled LDPC (SC-LDPC) base code. 12. The encoder of claim 10, wherein the column of parity bits includes multiple rows of parity bits, yielding a rate less than one-half (R<½). 13. The encoder of claim 10, wherein the QC-RSC encoder processing circuitry is further configured to: increase a rate of the TQC-LDPC Convolutional code by performing a puncturing operation. 14. The encoder of claim 10, wherein each QC-RSC includes J Z-RSC encoders, and each Z-RSC encoder includes Z identical RSC encoders, wherein each RSC encoder encodes a one of the Z input bits it at a time. 15. The encoder of claim 10, wherein the QC-RSC encoder processing circuitry is further configured to: reduce periodicity and bit error rate (BER) of the code by increasing a size (B) of the a systematic submatrix (Hsys). 16. The encoder of claim 10, wherein the QC-RSC encoder processing circuitry is further configured to: apply a second level of Zp cyclic shifts to the H-matrix according to a Dual-Step QC Shift encoder, wherein Zp represents a second level lifting factor over the lifting factor Z, and wherein N represents a base-family code length. 17. The encoder of claim 10, wherein the QC-RSC encoder processing circuitry is further configured to: modify quasi-cyclic values of a Trellis-based Quasi-Cyclic LDPC (TQC-LDPC) convolutional code to increase bit error rate performance of a decoder that receives the PC-LDPC convolutional code. 18. The encoder of claim 10, wherein the QC-RSC encoder processing circuitry is further configured to:
select a reference row in which all shift entries denote a unity matrix; shift each other row in the TQC-LDPC convolutional code relative to the reference row. 19. A decoder comprising:
Trellis-based Quasi-Cyclic Low Density Parity Check (TQC-LDPC) Maximum A posteriori Probability (MAP) decoder processing circuitry configured to:
receive a Parallel Concatenated Trellis-based Quasi-Cyclic LDPC (PC-LDPC) convolutional code in a form of an H-matrix including a systematic submatrix (Hsys) of the input systematic data and a parity check submatrix (Hpar) of parity check bits, wherein the PC-LDPC convolutional code is characterized by a lifting factor (Z), the Hpar includes a column of Z-group parity bits concatenated with each column of systematic bits, and the Hpar includes J parity bits per systematic bit;
decode the PC-LDPC convolutional code into and a group (xz(n)) of Z systematic bits by, for each Z-row of the PC-LDPC convolutional code:
determining, from the PC-LDPC convolutional code, a specific quasi-cyclical domain of the Z-row that is different from any other quasi-cyclical domain of another Z-row of the PC-LDPC convolutional code,
quasi-cyclically shifting the bits of the Z-row by the specific quasi-cyclical domain;
performing Z parallel MAP decoding processes on the shifted bits of the Z-row, and
unshifting the parallel decoded bits of the Z-row by the specific quasi-cyclical domain, yielding the group (xz(n)) of Z systematic bits. 20. The decoder of claim 19, wherein the TQC-LDPC MAP decoder processing circuitry is further configured to: omit quasi-cyclically shifting the bits of a first Z-row based on a determination that the first Z-row is all cyclical shifts of zero. 21. The decoder of claim 19, wherein decoding the PC-LDPC convolutional code into and a group (xz(n)) of Z systematic bits comprises applying a MAX* Log MAP decoding algorithm. 22. The decoder of claim 19, wherein decoding the PC-LDPC convolutional code into and a group (xz(n)) of Z systematic bits comprises applying a MAX Log MAP decoding algorithm. | 2,100 |
5,196 | 13,670,392 | 2,153 | According to one aspect of the present disclosure a system and technique for verifying data structure consistency across computing environments is disclosed. The system includes: a processor and a compatibility tool. The compatibility tool is executable by the processor to: generate a first signature for a data structure corresponding to a first computing environment; and generate a second signature for the data structure corresponding to a second computing environment. The processor is operable to compare the first and second signatures and, responsive to a disparity between the first and second signatures, indicate a change to the data structure between the first and second computing environments. | 1-6. (canceled) 7. A system, comprising:
a processor; and a compatibility tool executable by the processor to:
compute and generate a first signature from a data structure corresponding to a first computing environment; and
compute and generate a second signature from the data structure corresponding to a second computing environment; and
compare the first and second signatures and, responsive to a disparity between the first and second signatures, indicate an inconsistency of the data structure between the first and second computing environments. 8. The system of claim 7, wherein the compatibility tool is executable to:
expand the data structure to identify nested data structure elements; and generate the first and second signatures based on the expanded data structure. 9. The system of claim 7, further comprising a compiler operable to generate debug data from compiling the data structure, and wherein the compatibility tool is operable to generate the first and second signatures based on the debug data. 10. The system of claim 7, further comprising a compiler operable to generate debug data from compiling the data structure, and wherein the compatibility tool is operable to:
output an expanded data structure based on the debug data; and generate the first and second signatures based on the expanded data structure. 11. The system of claim 7, further comprising a compiler operable to generate debug data from compiling the data structure, and wherein the compatibility tool is operable to:
identify each data structure element from the debug data; responsive to identifying that an identified data structure element includes a nested data structure element, expand the nested data structure element; output an expanded data structure including the identified data structure elements and expanded nested data structure elements; and generate the first and second signatures based on the expanded data structure. 12. The system of claim 7, wherein the first computing environment comprises a first version of an operating system, and wherein the second computing environment comprises a second version of the operating system, and wherein the first and second signatures are compared to identify a disparity of the data structure between the first and second versions of the operating system. 13. A computer program product for verifying data structure consistency across computing environments, the computer program product comprising:
a computer readable storage medium having computer readable program code embodied therewith, the computer readable program code comprising computer readable program code configured to:
compute and generate a first signature from a data structure corresponding to a first computing environment;
compute and generate a second signature from the data structure corresponding to a second computing environment;
compare the first and second signatures; and
responsive to a disparity between the first and second signatures, indicate an inconsistency of the data structure between the first and second computing environments. 14. The computer program product of claim 13, wherein the computer readable program code is configured to:
generate debug data from compiling the data structure; and generate the first and second signatures based on the debug data. 15. The computer program product of claim 13, wherein the computer readable program code is configured to:
generate debug data from compiling the data structure; output an expanded data structure based on the debug data; and generate the first and second signatures based on the expanded data structure. 16. The computer program product of claim 13, wherein the computer readable program code is configured to:
generate debug data from compiling the data structure. identify each data structure element from the debug data; responsive to identifying that an identified data structure element includes a nested data structure element, expand the nested data structure element; output an expanded data structure including the identified data structure elements and expanded nested data structure elements; and generate the first and second signatures based on the expanded data structure. 17. The computer program product of claim 13, wherein the computer readable program code is configured to:
generate the first signature corresponding to the data structure in the first computing environment associated with a first version of an operating system; generate the second signature corresponding to the data structure in the second computing environment associated with a second version of the operating system; and compare the first and second signatures to identify a disparity of the data structure between the first and second versions of the operating system. 18-23. (canceled) | According to one aspect of the present disclosure a system and technique for verifying data structure consistency across computing environments is disclosed. The system includes: a processor and a compatibility tool. The compatibility tool is executable by the processor to: generate a first signature for a data structure corresponding to a first computing environment; and generate a second signature for the data structure corresponding to a second computing environment. The processor is operable to compare the first and second signatures and, responsive to a disparity between the first and second signatures, indicate a change to the data structure between the first and second computing environments.1-6. (canceled) 7. A system, comprising:
a processor; and a compatibility tool executable by the processor to:
compute and generate a first signature from a data structure corresponding to a first computing environment; and
compute and generate a second signature from the data structure corresponding to a second computing environment; and
compare the first and second signatures and, responsive to a disparity between the first and second signatures, indicate an inconsistency of the data structure between the first and second computing environments. 8. The system of claim 7, wherein the compatibility tool is executable to:
expand the data structure to identify nested data structure elements; and generate the first and second signatures based on the expanded data structure. 9. The system of claim 7, further comprising a compiler operable to generate debug data from compiling the data structure, and wherein the compatibility tool is operable to generate the first and second signatures based on the debug data. 10. The system of claim 7, further comprising a compiler operable to generate debug data from compiling the data structure, and wherein the compatibility tool is operable to:
output an expanded data structure based on the debug data; and generate the first and second signatures based on the expanded data structure. 11. The system of claim 7, further comprising a compiler operable to generate debug data from compiling the data structure, and wherein the compatibility tool is operable to:
identify each data structure element from the debug data; responsive to identifying that an identified data structure element includes a nested data structure element, expand the nested data structure element; output an expanded data structure including the identified data structure elements and expanded nested data structure elements; and generate the first and second signatures based on the expanded data structure. 12. The system of claim 7, wherein the first computing environment comprises a first version of an operating system, and wherein the second computing environment comprises a second version of the operating system, and wherein the first and second signatures are compared to identify a disparity of the data structure between the first and second versions of the operating system. 13. A computer program product for verifying data structure consistency across computing environments, the computer program product comprising:
a computer readable storage medium having computer readable program code embodied therewith, the computer readable program code comprising computer readable program code configured to:
compute and generate a first signature from a data structure corresponding to a first computing environment;
compute and generate a second signature from the data structure corresponding to a second computing environment;
compare the first and second signatures; and
responsive to a disparity between the first and second signatures, indicate an inconsistency of the data structure between the first and second computing environments. 14. The computer program product of claim 13, wherein the computer readable program code is configured to:
generate debug data from compiling the data structure; and generate the first and second signatures based on the debug data. 15. The computer program product of claim 13, wherein the computer readable program code is configured to:
generate debug data from compiling the data structure; output an expanded data structure based on the debug data; and generate the first and second signatures based on the expanded data structure. 16. The computer program product of claim 13, wherein the computer readable program code is configured to:
generate debug data from compiling the data structure. identify each data structure element from the debug data; responsive to identifying that an identified data structure element includes a nested data structure element, expand the nested data structure element; output an expanded data structure including the identified data structure elements and expanded nested data structure elements; and generate the first and second signatures based on the expanded data structure. 17. The computer program product of claim 13, wherein the computer readable program code is configured to:
generate the first signature corresponding to the data structure in the first computing environment associated with a first version of an operating system; generate the second signature corresponding to the data structure in the second computing environment associated with a second version of the operating system; and compare the first and second signatures to identify a disparity of the data structure between the first and second versions of the operating system. 18-23. (canceled) | 2,100 |
5,197 | 12,564,486 | 2,152 | This invention discloses the concept of a dynamic metasystem managing a dynamic system, achieved through the use of, and an environment (i.e., tools and ontologies) supporting dynamic artifacts. A system for generating a dynamic information system comprises a persistent dynamic repository of data and an integration metasystem. The repository forms an asymmetric navigational database, and the database includes an ontology model. The ontology model has an abstract model framework that supports creation and use of multi-dimensional and asymmetric abstract models of data, and views which define the content and form of presentation of that data using a computer. The integration metasystem includes components that describe components of shared infrastructure and services of an enterprise architecture, and a dynamic information system software tool generating artifacts representing information and views that define the presentation of data. The artifacts are provided to the ontology model, and have interfaces to the abstract model framework that permit creation, reading and modification of the contents of the asymmetric navigational database. | 1. A method for making a change to information system formed as a deployed information system and a deployed metasystem comprising:
(a) defining changes through interaction of an integration metasystem and an integration system; (b) passing said defined changes from said integration metasystem to said deployed metasystem; and (c) effecting said change by said deployed metasystem acting on said deployed information system in accordance with said defined changes to change elements of said deployed information system. 2. A persistent dynamic data repository including an ontology model, said ontology model having an abstract model framework that supports creation and use of multi-dimensional and asymmetric abstract models and an abstract model of views which define the content and form of presentation of information using a computer. 3. A dynamic information system software tool generating artifacts representing information and views that define the presentation of data, including:
interfaces to a persistent dynamic repository that permit creation, reading and modification of the contents of the asymmetric navigational database within said repository; an ontology engine that creates, reads and modifies the content of an ontology model within said database; a component to separate data representing information from views of said data; a component to define and use multiple views of said data; and a component to create and modify said data through use of multiple views. 4. A computer program product comprising a computer usable medium having computer program code for making a change to information system formed as a deployed information system and a deployed metasystem, said computer program including:
computer usable code for defining changes through interaction of an integration metasystem and an integration system computer usable code for passing said defined changes from said integration metasystem to said deployed metasystem; and computer usable code for effecting said change by said deployed metasystem acting on said deployed information system in accordance with said defined changes to change elements of said deployed information system. | This invention discloses the concept of a dynamic metasystem managing a dynamic system, achieved through the use of, and an environment (i.e., tools and ontologies) supporting dynamic artifacts. A system for generating a dynamic information system comprises a persistent dynamic repository of data and an integration metasystem. The repository forms an asymmetric navigational database, and the database includes an ontology model. The ontology model has an abstract model framework that supports creation and use of multi-dimensional and asymmetric abstract models of data, and views which define the content and form of presentation of that data using a computer. The integration metasystem includes components that describe components of shared infrastructure and services of an enterprise architecture, and a dynamic information system software tool generating artifacts representing information and views that define the presentation of data. The artifacts are provided to the ontology model, and have interfaces to the abstract model framework that permit creation, reading and modification of the contents of the asymmetric navigational database.1. A method for making a change to information system formed as a deployed information system and a deployed metasystem comprising:
(a) defining changes through interaction of an integration metasystem and an integration system; (b) passing said defined changes from said integration metasystem to said deployed metasystem; and (c) effecting said change by said deployed metasystem acting on said deployed information system in accordance with said defined changes to change elements of said deployed information system. 2. A persistent dynamic data repository including an ontology model, said ontology model having an abstract model framework that supports creation and use of multi-dimensional and asymmetric abstract models and an abstract model of views which define the content and form of presentation of information using a computer. 3. A dynamic information system software tool generating artifacts representing information and views that define the presentation of data, including:
interfaces to a persistent dynamic repository that permit creation, reading and modification of the contents of the asymmetric navigational database within said repository; an ontology engine that creates, reads and modifies the content of an ontology model within said database; a component to separate data representing information from views of said data; a component to define and use multiple views of said data; and a component to create and modify said data through use of multiple views. 4. A computer program product comprising a computer usable medium having computer program code for making a change to information system formed as a deployed information system and a deployed metasystem, said computer program including:
computer usable code for defining changes through interaction of an integration metasystem and an integration system computer usable code for passing said defined changes from said integration metasystem to said deployed metasystem; and computer usable code for effecting said change by said deployed metasystem acting on said deployed information system in accordance with said defined changes to change elements of said deployed information system. | 2,100 |
5,198 | 14,022,537 | 2,164 | A mechanism is provided for file handling in a hierarchical storage system. A user virtual file system scans, reads and analyses data or user behavior to create or modify at least one rule or metadata. The user virtual file system identifies logical or temporal relationships of files based on the at least one rule or the metadata. The user virtual file system groups identified related files in the at least one container. The user virtual file system moves the at least one container to different tiers of storage based on the at least one rule or the metadata. | 1. A method for file handling in a hierarchical storage system comprising:
implementing a user virtual file system for each a plurality of users, the user virtual file system comprising a user interface, a set of data containers, and a control unit, wherein the user virtual file system scans, reads, and analyses data or user behavior to create or modify at least one rule or metadata; identifying logical or temporal relationships of files based on the at least one rule or the metadata; grouping identified related files in at least one container; and moving the at least one container to different tiers of storage based on the at least one rule or the metadata. 2. The method according to claim 1, wherein the files the at least one rule or the metadata are logically connected. 3. The method according to claim 1, wherein the at least one rule or the metadata comprise at least one of the following information: access pattern of files in sequence by same users or across users, files in a shared folder, files belonging to a same user, links between files, defined maximum size of container, plurality of related files of the at least one container not used for a certain time range, or system status. 4. The method according to claim 3, wherein the system status comprises at least one of the following information: user disconnection from a file share comprising the at least one container, user virtual file system is offline, user access to at least one related file of the at least one container, user connection to a file share comprising the at least one container, or the user virtual file system goes online. 5. The method according to claim 3, wherein the access pattern is defined by a time range and a number of accesses during the time range. 6. The method according to claim 1, further comprising:
analyzing and predicting individual user behavior and the system status; wherein the at least one container of corresponding grouped files is moved entirely to a primary tier of storage if oncoming usage of the grouped files within a certain time range is predicted. 7. A system for file handling in a hierarchical storage system, the system comprising:
a processor; and a memory coupled to the processor, wherein the memory comprises instructions which, when executed by the processor, cause the processor to: implement a user virtual file system for each a plurality of users, the user virtual file system comprising a user interface, a set of data containers, and a control unit, wherein the user virtual file system scans, reads, and analyses data or user behavior to create or modify at least one rule or metadata; identify logical or temporal relationships of files based on the at least one rule or the metadata; group identified related files in at least one container; and move the at least one container to different tiers of storage based on the at least one rule or the metadata. 8. The system according to claim 7, wherein the memory comprises instructions which, when executed by the processor, cause the processor to:
store user input as the metadata or the at least one rule; and generate the metadata automatically by monitoring user action and scanning file. 9. The system according to claim 7, wherein the memory comprises instructions which, when executed by the processor, cause the processor to:
build a communication network between different user virtual file systems and an operating system. 10. The system according to claim 7, wherein the memory comprises instructions which, when executed by the processor, cause the processor to:
analyze and predict individual user behavior, data moving operations, and system status. 11. The system according to claim 10, wherein the memory comprises instructions which, when executed by the processor, cause the processor to:
analyze the data or the user behavior; create the at least one container; and virtualize a physical file layout. 12. The system according to 7, wherein the memory comprises instructions which, when executed by the processor, cause the processor to:
manage the at least one container of one particular user to communicate with other user virtual file systems or the operating system in order to move the at least one container to an appropriate tier of storage. 13. The system according to claim 12, wherein the memory comprises instructions which, when executed by the processor, cause the processor to:
move the at least one container of corresponding grouped files entirely to a primary tier of storage if the optimizer unit predicts oncoming usage of the grouped files within a certain time range. 14. (canceled) 15. A computer program product comprising a computer readable storage medium having a computer readable program stored therein, wherein the computer readable program, when executed on a computing device, causes the computing device to:
implement a user virtual file system for each of a plurality of users, the user virtual file system comprising a user interface, a set of data containers, and a control unit, wherein the user virtual file system scans, reads, and analyses data or user behavior to create or modify at least one rule or metadata; identify logical or temporal relationships of files based on the at least one rule or the metadata; group identified related files in at least one container; and move the at least one container to different tiers of storage based on the at least one rule or the metadata. 16. The computer program product according to claim 15, wherein the files and the at least one rule or the metadata are logically connected. 17. The computer program product according to claim 15, wherein the at least one rule or the metadata comprise at least one of the following information: access pattern of files in sequence by same users or across users, files in a shared folder, files belonging to a same user, links between files, defined maximum size of container, plurality of related files of the at least one container not used for a certain time range, or system status. 18. The computer program product according to claim 17, wherein the system status comprises at least one of the following information: user disconnection from a file share comprising the at least one container, user virtual file system is offline, user access to at least one related file of the at least one container, user connection to a file share comprising the at least one container, or the user virtual file system goes online. 19. The computer program product according to claim 17, wherein the access pattern is defined by a time range and a number of accesses during the time range. 20. The computer program product according to claim 15, wherein the computer readable program further causes the computing device to:
analyze and predict individual user behavior and the system status; wherein the at least one container of corresponding grouped files is moved entirely to a primary tier of storage if oncoming usage of the grouped files within a certain time range is predicted. | A mechanism is provided for file handling in a hierarchical storage system. A user virtual file system scans, reads and analyses data or user behavior to create or modify at least one rule or metadata. The user virtual file system identifies logical or temporal relationships of files based on the at least one rule or the metadata. The user virtual file system groups identified related files in the at least one container. The user virtual file system moves the at least one container to different tiers of storage based on the at least one rule or the metadata.1. A method for file handling in a hierarchical storage system comprising:
implementing a user virtual file system for each a plurality of users, the user virtual file system comprising a user interface, a set of data containers, and a control unit, wherein the user virtual file system scans, reads, and analyses data or user behavior to create or modify at least one rule or metadata; identifying logical or temporal relationships of files based on the at least one rule or the metadata; grouping identified related files in at least one container; and moving the at least one container to different tiers of storage based on the at least one rule or the metadata. 2. The method according to claim 1, wherein the files the at least one rule or the metadata are logically connected. 3. The method according to claim 1, wherein the at least one rule or the metadata comprise at least one of the following information: access pattern of files in sequence by same users or across users, files in a shared folder, files belonging to a same user, links between files, defined maximum size of container, plurality of related files of the at least one container not used for a certain time range, or system status. 4. The method according to claim 3, wherein the system status comprises at least one of the following information: user disconnection from a file share comprising the at least one container, user virtual file system is offline, user access to at least one related file of the at least one container, user connection to a file share comprising the at least one container, or the user virtual file system goes online. 5. The method according to claim 3, wherein the access pattern is defined by a time range and a number of accesses during the time range. 6. The method according to claim 1, further comprising:
analyzing and predicting individual user behavior and the system status; wherein the at least one container of corresponding grouped files is moved entirely to a primary tier of storage if oncoming usage of the grouped files within a certain time range is predicted. 7. A system for file handling in a hierarchical storage system, the system comprising:
a processor; and a memory coupled to the processor, wherein the memory comprises instructions which, when executed by the processor, cause the processor to: implement a user virtual file system for each a plurality of users, the user virtual file system comprising a user interface, a set of data containers, and a control unit, wherein the user virtual file system scans, reads, and analyses data or user behavior to create or modify at least one rule or metadata; identify logical or temporal relationships of files based on the at least one rule or the metadata; group identified related files in at least one container; and move the at least one container to different tiers of storage based on the at least one rule or the metadata. 8. The system according to claim 7, wherein the memory comprises instructions which, when executed by the processor, cause the processor to:
store user input as the metadata or the at least one rule; and generate the metadata automatically by monitoring user action and scanning file. 9. The system according to claim 7, wherein the memory comprises instructions which, when executed by the processor, cause the processor to:
build a communication network between different user virtual file systems and an operating system. 10. The system according to claim 7, wherein the memory comprises instructions which, when executed by the processor, cause the processor to:
analyze and predict individual user behavior, data moving operations, and system status. 11. The system according to claim 10, wherein the memory comprises instructions which, when executed by the processor, cause the processor to:
analyze the data or the user behavior; create the at least one container; and virtualize a physical file layout. 12. The system according to 7, wherein the memory comprises instructions which, when executed by the processor, cause the processor to:
manage the at least one container of one particular user to communicate with other user virtual file systems or the operating system in order to move the at least one container to an appropriate tier of storage. 13. The system according to claim 12, wherein the memory comprises instructions which, when executed by the processor, cause the processor to:
move the at least one container of corresponding grouped files entirely to a primary tier of storage if the optimizer unit predicts oncoming usage of the grouped files within a certain time range. 14. (canceled) 15. A computer program product comprising a computer readable storage medium having a computer readable program stored therein, wherein the computer readable program, when executed on a computing device, causes the computing device to:
implement a user virtual file system for each of a plurality of users, the user virtual file system comprising a user interface, a set of data containers, and a control unit, wherein the user virtual file system scans, reads, and analyses data or user behavior to create or modify at least one rule or metadata; identify logical or temporal relationships of files based on the at least one rule or the metadata; group identified related files in at least one container; and move the at least one container to different tiers of storage based on the at least one rule or the metadata. 16. The computer program product according to claim 15, wherein the files and the at least one rule or the metadata are logically connected. 17. The computer program product according to claim 15, wherein the at least one rule or the metadata comprise at least one of the following information: access pattern of files in sequence by same users or across users, files in a shared folder, files belonging to a same user, links between files, defined maximum size of container, plurality of related files of the at least one container not used for a certain time range, or system status. 18. The computer program product according to claim 17, wherein the system status comprises at least one of the following information: user disconnection from a file share comprising the at least one container, user virtual file system is offline, user access to at least one related file of the at least one container, user connection to a file share comprising the at least one container, or the user virtual file system goes online. 19. The computer program product according to claim 17, wherein the access pattern is defined by a time range and a number of accesses during the time range. 20. The computer program product according to claim 15, wherein the computer readable program further causes the computing device to:
analyze and predict individual user behavior and the system status; wherein the at least one container of corresponding grouped files is moved entirely to a primary tier of storage if oncoming usage of the grouped files within a certain time range is predicted. | 2,100 |
5,199 | 14,091,986 | 2,163 | Disclosed are systems and software that provide a high-performance, extensible file format and web API for remote data access and a visual interface for data viewing, query, and analysis. The described system supports can support storage of raw spectroscopic data such as neural recording data, MSI data, metadata, and derived analyses in a single, self-describing format that may be compatible by a large range of analysis software. | 1. A system configured to present neurosensory and/or spectroscopic data to a user computer, the system comprising:
an interface to a data storage device configured to store neurosensory and/or spectroscopic data, analysis data and associated metadata; a first storage module configured to store the neurosensory and/or the spectroscopic data, analysis data, and the associated metadata as one or more of individual spectrally aligned data chunks, image aligned data chunks, and hybrid data chunks, wherein the stored data chunks comprise sub-blocks of the spectroscopic data; and a user interface module configured to retrieve image slices, spectral data, or arbitrary sub-cubes from the stored data chunks and graphically display the retrieved data and the associated metadata to the user computer. 2. The system of claim 1, wherein the neurosensory and/or the spectroscopic data comprises spectra generated by absorption, emission, energy, frequency, reflectance, resonance, molecular vibration, and/or secondary emission. 3. The system of claim 1, wherein the spectroscopic data comprises mass spectrometry imaging data. 4. The system of claim 1, wherein the neurosensory data comprises neural recordings data. 5. The system of claim 3, wherein the mass spectrometry imaging data comprises single spectrum or multiple spectra at a plurality of positions, the mass spectrometry imaging data further comprising spectra of intact molecules and fragments of molecules. 6. The system of claim 3, wherein the mass spectrometry imaging data comprises mass to charge ratio and ion-mobility data. 7. The system of claim 3, wherein mass spectrometry imaging data comprises 1-dimensional, 2-dimensional, or 3-dimensional spectral imaging data. 8. The system of claim 1, wherein the user interface module is configured to retrieve one or more of the spectrally aligned data chunks, image aligned data chunks, and/or hybrid data chunks independently of each other. 9. The system of claim 3, wherein the user interface module is further configured to receive and process API functions, the API functions including URL patterns for sending one or more of:
a request to retrieve the associated metadata, a request to retrieve information about m/z data, a request to retrieve ion image and/or ion image slices, a request to retrieve one or more m/z spectrum, and a request to retrieve arbitrary sub-cubes of the mass spectrometry imaging data. 10. The system of claim 3, wherein the associated metadata comprises mass spectrometry imaging instrument information, sample information, and/or imaging settings. 11. The system of claim 3, wherein the first storage module is further configured to store the data chunks in a self-describing file format comprising descriptions of hierarchy of the mass spectrometry imaging data and type of the mass spectrometry imaging data. 12. The system of claim 11, wherein the one or more file formats include the HDF5 file format. 13. The system of claim 1, wherein the user interface module comprises an array-based user interface configured to retrieve the neurosensory and/or the spectroscopic data stored in a 3-dimensional cube format and a reduced data format. 14. The system of claim 1, wherein the spectra aligned data chunks are configured to store a single full spectrum or a portion of a spectrum per data chunk. 15. The system of claim 1, wherein the image aligned data chunks are configured to store a single full ion-image or a portion of an ion-image per data chunk. 16. The system of claim 1, wherein the hybrid data chunks are configured to store at least a portion of a spectrum and a portion of an ion-image. 17. The system of claim 1, wherein the first storage module is further configured to compress the neurosensory and/or the spectroscopic data using compression filters. 18. The system of claim 1, further comprising one or more additional storage modules configured to replicate the neurosensory and/or the spectroscopic data and store two or more copies of the spectroscopic data as data chunks. 19. The system of claim 1, wherein the first storage module is configured to store the received the neurosensory and/or the spectroscopic data as a 2-dimensional dataset of spectra and one or more index datasets configured to record relationships between spatial locations and the spectra. 20. The system of claim 1, wherein the system further comprises a data analysis module configured to:
analyze the neurosensory and/or the neurosensory and/or the spectroscopic data; track input parameters and dependencies; and in response to receiving a request from the user computer, retracing the analysis performed on the neurosensory and/or the spectroscopic data for purposes of repeating an analysis. 21. The system of claim 20, wherein the data analysis module is further configured to process the stored data chunks, the processing comprising data reduction, dimension reduction, feature detection, and/or clustering on the stored data chunks. 22. The system of claim 20, wherein the data reduction includes one or more of maximum, minimum, average, standard deviation, and variance. 23. A non-transitory computer-readable storage medium comprising computer-executable instructions that when executed direct a computing system to:
store the neurosensory and/or the spectroscopic data, analysis data, and metadata as one or more of individual spectrally aligned data chunks, image aligned data chunks, and hybrid data chunks, and wherein the stored data chunks comprise sub-blocks of the neurosensory and/or the spectroscopic data; and retrieve image slices, spectra data, or arbitrary sub-cubes from the stored data chunks and graphically display the retrieved data and the metadata to a user computer. 24. The non-transitory computer-readable storage medium of claim 23, wherein the neurosensory and/or the spectroscopic data comprises spectra generated by absorption, emission, energy, frequency, reflectance, resonance, molecular vibration, and/or secondary emission. 25. The non-transitory computer-readable storage medium of claim 23, wherein the spectroscopic data is mass spectral imaging data and in response to receiving instructions from a user computer, retrieving ion image slices, m/z spectra data, or arbitrary sub-cubes from the stored data chunks and graphically displaying the retrieved data and the associated metadata to the user computer. 26. The non-transitory computer-readable storage medium of claim 23, wherein the neurosensory and/or the spectroscopic data is neural recording data and in response to receiving instructions from a user computer, retrieving ion image slices, m/z spectra data, or arbitrary sub-cubes from the stored data chunks and graphically displaying the retrieved data and the associated metadata to the user computer. 27. The non-transitory computer-readable storage medium of claim 25, wherein the mass spectrometry imaging data comprises multiple spectra at a plurality of positions, the mass spectrometry imaging data further comprising spectra of intact molecules and fragments of molecules. 28. The non-transitory computer-readable storage medium of claim 25, wherein the associated metadata includes mass spectrometry imaging instrument information, sample information, and/or imaging settings. 29. The non-transitory computer-readable storage medium of claim 25, wherein the data chunks are further configured to be stored in a self-describing file format, the self-describing file format comprises descriptions of hierarchy of the neurosensory and/or the spectroscopic data and type of the neurosensory and/or the spectroscopic data. 30. A computer-implemented method in a computer having a processor, comprising:
obtaining neurosensory and/or spectroscopic data and associated metadata from an imaging device; storing the neurosensory and/or the spectroscopic data and associated metadata as one or more of individual spectrally aligned data chunks, image aligned data chunks, and hybrid data chunks to a storage, wherein the stored data chunks comprise sub-blocks of the neurosensory and/or the spectroscopic data; retrieving ion image slices, spectra data, or arbitrary sub-cubes from the stored data chunks in response to a user request; and graphically displaying the retrieved the neurosensory and/or the spectroscopic data and metadata to a user's computer. 31. The computer-implemented method of claim 30, wherein obtaining the neurosensory and/or the spectroscopic data comprises obtaining neurosensory and/or spectroscopic data generated by absorption, emission, energy, frequency, reflectance, resonance, molecular vibration, and/or secondary emission. 32. The computer-implemented method of claim 30, wherein obtaining the spectroscopic data comprises obtaining mass spectrometry imaging data from a mass spectrometer. 33. The computer-implemented method of claim 32, wherein obtaining the mass spectrometry imaging data comprises obtaining multiple spectra at a plurality of positions, the mass spectrometry imaging data further comprising spectra of intact molecules and fragments of molecules. 34. The computer-implemented method of claim 30, wherein the neurosensory data comprises neural recordings data. 35. The computer-implemented method of claim 30, wherein storing the neurosensory and/or the spectroscopic data comprises storing the neurosensory and/or the spectroscopic data in data chunks in a self-describing file format, the self-describing file format comprising descriptions of hierarchy of the neurosensory and/or the spectroscopic data and type of the neurosensory and/or the spectroscopic data. 36. The computer-implemented method of claim 30, wherein retrieving spectral data further comprises retrieving one or more of the spectrally aligned data chunks, image aligned data chunks, and/or hybrid data chunks independently. | Disclosed are systems and software that provide a high-performance, extensible file format and web API for remote data access and a visual interface for data viewing, query, and analysis. The described system supports can support storage of raw spectroscopic data such as neural recording data, MSI data, metadata, and derived analyses in a single, self-describing format that may be compatible by a large range of analysis software.1. A system configured to present neurosensory and/or spectroscopic data to a user computer, the system comprising:
an interface to a data storage device configured to store neurosensory and/or spectroscopic data, analysis data and associated metadata; a first storage module configured to store the neurosensory and/or the spectroscopic data, analysis data, and the associated metadata as one or more of individual spectrally aligned data chunks, image aligned data chunks, and hybrid data chunks, wherein the stored data chunks comprise sub-blocks of the spectroscopic data; and a user interface module configured to retrieve image slices, spectral data, or arbitrary sub-cubes from the stored data chunks and graphically display the retrieved data and the associated metadata to the user computer. 2. The system of claim 1, wherein the neurosensory and/or the spectroscopic data comprises spectra generated by absorption, emission, energy, frequency, reflectance, resonance, molecular vibration, and/or secondary emission. 3. The system of claim 1, wherein the spectroscopic data comprises mass spectrometry imaging data. 4. The system of claim 1, wherein the neurosensory data comprises neural recordings data. 5. The system of claim 3, wherein the mass spectrometry imaging data comprises single spectrum or multiple spectra at a plurality of positions, the mass spectrometry imaging data further comprising spectra of intact molecules and fragments of molecules. 6. The system of claim 3, wherein the mass spectrometry imaging data comprises mass to charge ratio and ion-mobility data. 7. The system of claim 3, wherein mass spectrometry imaging data comprises 1-dimensional, 2-dimensional, or 3-dimensional spectral imaging data. 8. The system of claim 1, wherein the user interface module is configured to retrieve one or more of the spectrally aligned data chunks, image aligned data chunks, and/or hybrid data chunks independently of each other. 9. The system of claim 3, wherein the user interface module is further configured to receive and process API functions, the API functions including URL patterns for sending one or more of:
a request to retrieve the associated metadata, a request to retrieve information about m/z data, a request to retrieve ion image and/or ion image slices, a request to retrieve one or more m/z spectrum, and a request to retrieve arbitrary sub-cubes of the mass spectrometry imaging data. 10. The system of claim 3, wherein the associated metadata comprises mass spectrometry imaging instrument information, sample information, and/or imaging settings. 11. The system of claim 3, wherein the first storage module is further configured to store the data chunks in a self-describing file format comprising descriptions of hierarchy of the mass spectrometry imaging data and type of the mass spectrometry imaging data. 12. The system of claim 11, wherein the one or more file formats include the HDF5 file format. 13. The system of claim 1, wherein the user interface module comprises an array-based user interface configured to retrieve the neurosensory and/or the spectroscopic data stored in a 3-dimensional cube format and a reduced data format. 14. The system of claim 1, wherein the spectra aligned data chunks are configured to store a single full spectrum or a portion of a spectrum per data chunk. 15. The system of claim 1, wherein the image aligned data chunks are configured to store a single full ion-image or a portion of an ion-image per data chunk. 16. The system of claim 1, wherein the hybrid data chunks are configured to store at least a portion of a spectrum and a portion of an ion-image. 17. The system of claim 1, wherein the first storage module is further configured to compress the neurosensory and/or the spectroscopic data using compression filters. 18. The system of claim 1, further comprising one or more additional storage modules configured to replicate the neurosensory and/or the spectroscopic data and store two or more copies of the spectroscopic data as data chunks. 19. The system of claim 1, wherein the first storage module is configured to store the received the neurosensory and/or the spectroscopic data as a 2-dimensional dataset of spectra and one or more index datasets configured to record relationships between spatial locations and the spectra. 20. The system of claim 1, wherein the system further comprises a data analysis module configured to:
analyze the neurosensory and/or the neurosensory and/or the spectroscopic data; track input parameters and dependencies; and in response to receiving a request from the user computer, retracing the analysis performed on the neurosensory and/or the spectroscopic data for purposes of repeating an analysis. 21. The system of claim 20, wherein the data analysis module is further configured to process the stored data chunks, the processing comprising data reduction, dimension reduction, feature detection, and/or clustering on the stored data chunks. 22. The system of claim 20, wherein the data reduction includes one or more of maximum, minimum, average, standard deviation, and variance. 23. A non-transitory computer-readable storage medium comprising computer-executable instructions that when executed direct a computing system to:
store the neurosensory and/or the spectroscopic data, analysis data, and metadata as one or more of individual spectrally aligned data chunks, image aligned data chunks, and hybrid data chunks, and wherein the stored data chunks comprise sub-blocks of the neurosensory and/or the spectroscopic data; and retrieve image slices, spectra data, or arbitrary sub-cubes from the stored data chunks and graphically display the retrieved data and the metadata to a user computer. 24. The non-transitory computer-readable storage medium of claim 23, wherein the neurosensory and/or the spectroscopic data comprises spectra generated by absorption, emission, energy, frequency, reflectance, resonance, molecular vibration, and/or secondary emission. 25. The non-transitory computer-readable storage medium of claim 23, wherein the spectroscopic data is mass spectral imaging data and in response to receiving instructions from a user computer, retrieving ion image slices, m/z spectra data, or arbitrary sub-cubes from the stored data chunks and graphically displaying the retrieved data and the associated metadata to the user computer. 26. The non-transitory computer-readable storage medium of claim 23, wherein the neurosensory and/or the spectroscopic data is neural recording data and in response to receiving instructions from a user computer, retrieving ion image slices, m/z spectra data, or arbitrary sub-cubes from the stored data chunks and graphically displaying the retrieved data and the associated metadata to the user computer. 27. The non-transitory computer-readable storage medium of claim 25, wherein the mass spectrometry imaging data comprises multiple spectra at a plurality of positions, the mass spectrometry imaging data further comprising spectra of intact molecules and fragments of molecules. 28. The non-transitory computer-readable storage medium of claim 25, wherein the associated metadata includes mass spectrometry imaging instrument information, sample information, and/or imaging settings. 29. The non-transitory computer-readable storage medium of claim 25, wherein the data chunks are further configured to be stored in a self-describing file format, the self-describing file format comprises descriptions of hierarchy of the neurosensory and/or the spectroscopic data and type of the neurosensory and/or the spectroscopic data. 30. A computer-implemented method in a computer having a processor, comprising:
obtaining neurosensory and/or spectroscopic data and associated metadata from an imaging device; storing the neurosensory and/or the spectroscopic data and associated metadata as one or more of individual spectrally aligned data chunks, image aligned data chunks, and hybrid data chunks to a storage, wherein the stored data chunks comprise sub-blocks of the neurosensory and/or the spectroscopic data; retrieving ion image slices, spectra data, or arbitrary sub-cubes from the stored data chunks in response to a user request; and graphically displaying the retrieved the neurosensory and/or the spectroscopic data and metadata to a user's computer. 31. The computer-implemented method of claim 30, wherein obtaining the neurosensory and/or the spectroscopic data comprises obtaining neurosensory and/or spectroscopic data generated by absorption, emission, energy, frequency, reflectance, resonance, molecular vibration, and/or secondary emission. 32. The computer-implemented method of claim 30, wherein obtaining the spectroscopic data comprises obtaining mass spectrometry imaging data from a mass spectrometer. 33. The computer-implemented method of claim 32, wherein obtaining the mass spectrometry imaging data comprises obtaining multiple spectra at a plurality of positions, the mass spectrometry imaging data further comprising spectra of intact molecules and fragments of molecules. 34. The computer-implemented method of claim 30, wherein the neurosensory data comprises neural recordings data. 35. The computer-implemented method of claim 30, wherein storing the neurosensory and/or the spectroscopic data comprises storing the neurosensory and/or the spectroscopic data in data chunks in a self-describing file format, the self-describing file format comprising descriptions of hierarchy of the neurosensory and/or the spectroscopic data and type of the neurosensory and/or the spectroscopic data. 36. The computer-implemented method of claim 30, wherein retrieving spectral data further comprises retrieving one or more of the spectrally aligned data chunks, image aligned data chunks, and/or hybrid data chunks independently. | 2,100 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.