Unnamed: 0 int64 0 350k | level_0 int64 0 351k | ApplicationNumber int64 9.75M 96.1M | ArtUnit int64 1.6k 3.99k | Abstract stringlengths 1 8.37k | Claims stringlengths 3 292k | abstract-claims stringlengths 68 293k | TechCenter int64 1.6k 3.9k |
|---|---|---|---|---|---|---|---|
5,700 | 5,700 | 15,347,496 | 2,193 | The disclosed embodiments provide a system that modifies execution of a target process in a computer system. During loading of a marker library by a target process, the system modifies import dependency data of the marker library to include an injection library as a dependency of a marker library. After the modified import dependency data is used to load the injection library into the target process by the operating system or loader, the system executes the injection library prior to execution of the marker library to revert the import dependency data to an original state and modify execution of the target process. | 1. A method, comprising:
during loading of a marker library by a target process in a computer system, modifying import dependency data of the marker library to include an injection library as a dependency of the marker library; and after the modified import dependency data is used to load the injection library into the target process, executing the injection library prior to execution of the marker library to:
revert the import dependency data to an original state; and
modify execution of the target process. 2. The method of claim 1, further comprising:
detecting loading of the marker library by the target process prior to modifying the import dependency data of the marker library. 3. The method of claim 2, wherein loading of the marker library is detected by a kernel-mode injection driver in the computer system. 4. The method of claim 1, further comprising:
prior to modifying the import dependency data of the marker library, selecting the injection library for injection into the target process based on an environment of the target process. 5. The method of claim 4, wherein the environment is at least one of:
a processor architecture; and a runtime version. 6. The method of claim 1, wherein modifying the import dependency data of the marker library to include the injection library as the dependency of the marker library comprises:
replacing an original dependency of the marker library in the import dependency data with the dependency on the injection library. 7. The method of claim 6, wherein reverting the import dependency data to the original state comprises:
writing the original dependency back into the import dependency data prior to execution of the marker library. 8. The method of claim 1, wherein modifying the import dependency data of the marker library to include the injection library as the dependency of the marker library comprises:
modifying an import table in the import dependency data of the marker library to include the injection library. 9. The method of claim 1, wherein modifying the import dependency data of the marker library to include the injection library as the dependency of the marker library comprises:
modifying a private copy of the import dependency data for the target process to include the injection library. 10. The method of claim 1, wherein the execution of the target process is modified using at least one of:
the injection library; and an additional library loaded by the injection library. 11. The method of claim 1, wherein modifying execution of the target process comprises at least one of:
profiling the target process; modifying an environment of the target process; and modifying a behavior of the target process. 12. The method of claim 1, wherein the target process executes within a Windows operating system on the computer system. 13. An apparatus, comprising:
one or more processors; and memory storing instructions that, when executed by the one or more processors, cause the apparatus to:
during loading of a marker library by a target process, modify import dependency data of the marker library to include an injection library as a dependency of a marker library; and
after the modified import dependency data is used to load the injection library into the target process, executing the injection library prior to execution of the marker library to:
revert the import dependency data to an original state; and
modify execution of the target process. 14. The apparatus of claim 13, wherein the memory further stores instructions that, when executed by the one or more processors, cause the apparatus to:
detect loading of the marker library by the target process prior to modifying the import dependency data of the marker library. 15. The apparatus of claim 13, wherein the memory further stores instructions that, when executed by the one or more processors, cause the apparatus to:
prior to modifying the import dependency data of the marker library, select the injection library for injection into the target process based on a processor architecture of the target process. 16. The apparatus of claim 13, wherein modifying the import dependency data of the marker library to include the injection library as the dependency of the marker library comprises at least one of:
replacing an original dependency of the marker library in the import dependency data with the dependency on the injection library; modifying an import table in the import dependency data of the marker library to include the injection library; and modifying a private copy of the import dependency data for the target process to include the injection library. 17. The apparatus of claim 13, wherein the execution of the target process is modified using at least one of:
the injection library; and an additional library loaded by the injection library. 18. The apparatus of claim 13, wherein modifying execution of the target process comprises at least one of:
profiling the target process; modifying an environment of the target process; and modifying a behavior of the target process. 19. A non-transitory computer-readable storage medium storing instructions that when executed by a computer cause the computer to perform a method, the method comprising:
during loading of a marker library by a target process in a computer system, modifying import dependency data of the marker library to include an injection library as a dependency of the marker library; and after the modified import dependency data is used to load the injection library into the target process, executing the injection library prior to execution of the marker library to:
revert the import dependency data to an original state; and
modify execution of the target process. 20. The non-transitory computer-readable medium of claim 19, wherein modifying the import dependency data of the marker library to include the injection library as the dependency of the marker library comprises at least one of:
replacing an original dependency of the marker library in the import dependency data with the dependency on the injection library; modifying an import table in the import dependency data of the marker library to include the injection library; and modifying a private copy of the import dependency data for the target process to include the injection library. | The disclosed embodiments provide a system that modifies execution of a target process in a computer system. During loading of a marker library by a target process, the system modifies import dependency data of the marker library to include an injection library as a dependency of a marker library. After the modified import dependency data is used to load the injection library into the target process by the operating system or loader, the system executes the injection library prior to execution of the marker library to revert the import dependency data to an original state and modify execution of the target process.1. A method, comprising:
during loading of a marker library by a target process in a computer system, modifying import dependency data of the marker library to include an injection library as a dependency of the marker library; and after the modified import dependency data is used to load the injection library into the target process, executing the injection library prior to execution of the marker library to:
revert the import dependency data to an original state; and
modify execution of the target process. 2. The method of claim 1, further comprising:
detecting loading of the marker library by the target process prior to modifying the import dependency data of the marker library. 3. The method of claim 2, wherein loading of the marker library is detected by a kernel-mode injection driver in the computer system. 4. The method of claim 1, further comprising:
prior to modifying the import dependency data of the marker library, selecting the injection library for injection into the target process based on an environment of the target process. 5. The method of claim 4, wherein the environment is at least one of:
a processor architecture; and a runtime version. 6. The method of claim 1, wherein modifying the import dependency data of the marker library to include the injection library as the dependency of the marker library comprises:
replacing an original dependency of the marker library in the import dependency data with the dependency on the injection library. 7. The method of claim 6, wherein reverting the import dependency data to the original state comprises:
writing the original dependency back into the import dependency data prior to execution of the marker library. 8. The method of claim 1, wherein modifying the import dependency data of the marker library to include the injection library as the dependency of the marker library comprises:
modifying an import table in the import dependency data of the marker library to include the injection library. 9. The method of claim 1, wherein modifying the import dependency data of the marker library to include the injection library as the dependency of the marker library comprises:
modifying a private copy of the import dependency data for the target process to include the injection library. 10. The method of claim 1, wherein the execution of the target process is modified using at least one of:
the injection library; and an additional library loaded by the injection library. 11. The method of claim 1, wherein modifying execution of the target process comprises at least one of:
profiling the target process; modifying an environment of the target process; and modifying a behavior of the target process. 12. The method of claim 1, wherein the target process executes within a Windows operating system on the computer system. 13. An apparatus, comprising:
one or more processors; and memory storing instructions that, when executed by the one or more processors, cause the apparatus to:
during loading of a marker library by a target process, modify import dependency data of the marker library to include an injection library as a dependency of a marker library; and
after the modified import dependency data is used to load the injection library into the target process, executing the injection library prior to execution of the marker library to:
revert the import dependency data to an original state; and
modify execution of the target process. 14. The apparatus of claim 13, wherein the memory further stores instructions that, when executed by the one or more processors, cause the apparatus to:
detect loading of the marker library by the target process prior to modifying the import dependency data of the marker library. 15. The apparatus of claim 13, wherein the memory further stores instructions that, when executed by the one or more processors, cause the apparatus to:
prior to modifying the import dependency data of the marker library, select the injection library for injection into the target process based on a processor architecture of the target process. 16. The apparatus of claim 13, wherein modifying the import dependency data of the marker library to include the injection library as the dependency of the marker library comprises at least one of:
replacing an original dependency of the marker library in the import dependency data with the dependency on the injection library; modifying an import table in the import dependency data of the marker library to include the injection library; and modifying a private copy of the import dependency data for the target process to include the injection library. 17. The apparatus of claim 13, wherein the execution of the target process is modified using at least one of:
the injection library; and an additional library loaded by the injection library. 18. The apparatus of claim 13, wherein modifying execution of the target process comprises at least one of:
profiling the target process; modifying an environment of the target process; and modifying a behavior of the target process. 19. A non-transitory computer-readable storage medium storing instructions that when executed by a computer cause the computer to perform a method, the method comprising:
during loading of a marker library by a target process in a computer system, modifying import dependency data of the marker library to include an injection library as a dependency of the marker library; and after the modified import dependency data is used to load the injection library into the target process, executing the injection library prior to execution of the marker library to:
revert the import dependency data to an original state; and
modify execution of the target process. 20. The non-transitory computer-readable medium of claim 19, wherein modifying the import dependency data of the marker library to include the injection library as the dependency of the marker library comprises at least one of:
replacing an original dependency of the marker library in the import dependency data with the dependency on the injection library; modifying an import table in the import dependency data of the marker library to include the injection library; and modifying a private copy of the import dependency data for the target process to include the injection library. | 2,100 |
5,701 | 5,701 | 14,292,705 | 2,195 | Techniques for access control of a data processing system are described. In one embodiment, in response to a request from an application for accessing a resource of a data processing system, it is determined a first class of resources the requested resource belongs. A second class of resources the application is entitled to access is determined based on a resource entitlement encoded within the application and authorized by a predetermined authority. The application is allowed to access the resource if the first class and the second class of resources are matched. The application is denied from accessing the resource if the first class and the second class are not matched, regardless an operating privilege level of the application. | 1. A computer-implemented method, comprising:
in response to a request from an application for accessing a resource of a data processing system, determining a first class of resources the requested resource belongs; determining a second class of resources the application is entitled to access based on a resource entitlement encoded within the application and authorized by a predetermined authority; allowing the application to access the resource if the first class and the second class of resources are matched; and denying the application from accessing the resource if the first class and the second class are not matched, regardless an operating privilege level of the application. 2. The method of claim 1, wherein determining a first class of resources the requested resource belongs comprises:
accessing an access control list (ACL) to locate an entry associated with the requested resource; and obtaining a first restricted resource class (RRC) identifier from the entry, the first RRC identifier identifying the first class of resources in which the requested resource is a member. 3. The method of claim 2, wherein determining a second class of resources the application is entitled comprises obtaining a second RRC identifier from the resource entitlement of the application, and wherein the application is allowed to access the requested resource if the first and second RRC identifiers are matched. 4. The method of claim 2, wherein the ACL is centrally maintained by a security manager of the operating system. 5. The method of claim 1, wherein determining a first class of resources the requested resource belongs comprises:
accessing metadata of the requested resource that is stored as part of one or more attributes of the requested resource; and obtaining a first restricted resource class (RRC) identifier from the metadata, the first RRC identifier identifying the first class of resources in which the requested resource is a member. 6. The method of claim 5, comprising matching the first RRC identifier with a second RRC identifier obtained from the resource entitlement of the application, wherein the application is entitled to access the requested resource if the first and second RRC identifiers are matched. 7. The method of claim 5, further comprising:
determining whether the first RRC identifier matches a predetermined RRC identifier; and allowing the application to access the resource even if the second RRC identifier does not match the first RRC identifier. 8. The method of claim 1, wherein the requested resource is a file system resource of the data processing system representing at least one of a file and a directory of one or more files. 9. The method of claim 1, wherein the requested resource is a device driver of a peripheral device of the data processing system. 10. The method of claim 1, wherein the requested resource is attaching to a second application and controlling the second application. 11. A non-transitory machine-readable medium having instructions stored therein, which when executed by a processor, cause the processor to perform a method, the method comprising:
in response to a request from an application for accessing a resource of a data processing system, determining a first class of resources the requested resource belongs; determining a second class of resources the application is entitled to access based on a resource entitlement encoded within the application and authorized by a predetermined authority; allowing the application to access the resource if the first class and the second class of resources are matched; and denying the application from accessing the resource if the first class and the second class are not matched, regardless an operating privilege level of the application. 12. The non-transitory machine-readable medium of claim 11, wherein determining a first class of resources the requested resource belongs comprises:
accessing an access control list (ACL) to locate an entry associated with the requested resource; and obtaining a first restricted resource class (RRC) identifier from the entry, the first RRC identifier identifying the first class of resources in which the requested resource is a member. 13. The non-transitory machine-readable medium of claim 12, wherein determining a second class of resources the application is entitled comprises obtaining a second RRC identifier from the resource entitlement of the application, and wherein the application is allowed to access the requested resource if the first and second RRC identifiers are matched. 14. The non-transitory machine-readable medium of claim 12, wherein the ACL is centrally maintained by a security manager of the operating system. 15. The non-transitory machine-readable medium of claim 11, wherein determining a first class of resources the requested resource belongs comprises:
accessing metadata of the requested resource that is stored as part of one or more attributes of the requested resource; and obtaining a first restricted resource class (RRC) identifier from the metadata, the first RRC identifier identifying the first class of resources in which the requested resource is a member. 16. The non-transitory machine-readable medium of claim 15, wherein the method further comprises matching the first RRC identifier with a second RRC identifier obtained from the resource entitlement of the application, wherein the application is entitled to access the requested resource if the first and second RRC identifiers are matched. 17. A data processing system, comprising:
a processor; and a memory coupled to the processor for storing instructions, which when executed from the memory, cause the processor to
in response to a request from an application for accessing a resource of a data processing system, determine a first class of resources the requested resource belongs,
determine a second class of resources the application is entitled to access based on a resource entitlement encoded within the application and authorized by a predetermined authority,
allow the application to access the resource if the first class and the second class of resources are matched, and
deny the application from accessing the resource if the first class and the second class are not matched, regardless an operating privilege level of the application. 18. The system of claim 17, wherein determining a first class of resources the requested resource belongs comprises:
accessing an access control list (ACL) to locate an entry associated with the requested resource; and obtaining a first restricted resource class (RRC) identifier from the entry, the first RRC identifier identifying the first class of resources in which the requested resource is a member. 19. The system of claim 18, wherein determining a second class of resources the application is entitled comprises obtaining a second RRC identifier from the resource entitlement of the application, and wherein the application is allowed to access the requested resource if the first and second RRC identifiers are matched. 20. The system of claim 18, wherein the ACL is centrally maintained by a security manager of the operating system. 21. The system of claim 17, wherein determining a first class of resources the requested resource belongs comprises:
accessing metadata of the requested resource that is stored as part of one or more attributes of the requested resource; and obtaining a first restricted resource class (RRC) identifier from the metadata, the first RRC identifier identifying the first class of resources in which the requested resource is a member. 22. The system of claim 21, wherein the method further comprises matching the first RRC identifier with a second RRC identifier obtained from the resource entitlement of the application, wherein the application is entitled to access the requested resource if the first and second RRC identifiers are matched. 23. A computer-implemented method, comprising:
receiving a request from a first application to attach to a second application and to control the second application; accessing an access control list (ACL) to determine whether the second application is associated with a restricted resource class (RRC) based on an RRC identifier associated with the second application; denying the request if the second application belongs to the restricted resource class; if the second application does not belong to a restricted resource class, examining a resource entitlement encoded within the second application to determine whether the first application is allowed to attach to the second application; and allowing the first application to attach to the second application if the resource entitlement of the second application specifically indicates that the first application can attach to the second application. 24. The method of claim 23, wherein the resource entitlement of the second application identifies the first application. 25. The method of claim 23, wherein the first application is to debug the second application through attachment. 26. A computer-implemented method, comprising:
receiving a request from an application for accessing a kernel component of a kernel of an operating system of a data processing system; accessing an access control list (ACL) to determine a class of resources that is associated with the kernel component to be accessed based on a first resource class identifier associated with the kernel component; determining a second resource class identifier encoded within the application and signed by a predetermined authority, the second resource class identifier identifying a class of resources that the application is entitled to access; and allowing the application to access the kernel component if the first resource class identifier matches the second resource identifier. 27. The method of claim 26, wherein the kernel component is a device driver for accessing a peripheral device of the data processing system. 28. The method of claim 26, wherein the request for accessing a kernel component is to launch a kernel extension within the kernel of the operating system. | Techniques for access control of a data processing system are described. In one embodiment, in response to a request from an application for accessing a resource of a data processing system, it is determined a first class of resources the requested resource belongs. A second class of resources the application is entitled to access is determined based on a resource entitlement encoded within the application and authorized by a predetermined authority. The application is allowed to access the resource if the first class and the second class of resources are matched. The application is denied from accessing the resource if the first class and the second class are not matched, regardless an operating privilege level of the application.1. A computer-implemented method, comprising:
in response to a request from an application for accessing a resource of a data processing system, determining a first class of resources the requested resource belongs; determining a second class of resources the application is entitled to access based on a resource entitlement encoded within the application and authorized by a predetermined authority; allowing the application to access the resource if the first class and the second class of resources are matched; and denying the application from accessing the resource if the first class and the second class are not matched, regardless an operating privilege level of the application. 2. The method of claim 1, wherein determining a first class of resources the requested resource belongs comprises:
accessing an access control list (ACL) to locate an entry associated with the requested resource; and obtaining a first restricted resource class (RRC) identifier from the entry, the first RRC identifier identifying the first class of resources in which the requested resource is a member. 3. The method of claim 2, wherein determining a second class of resources the application is entitled comprises obtaining a second RRC identifier from the resource entitlement of the application, and wherein the application is allowed to access the requested resource if the first and second RRC identifiers are matched. 4. The method of claim 2, wherein the ACL is centrally maintained by a security manager of the operating system. 5. The method of claim 1, wherein determining a first class of resources the requested resource belongs comprises:
accessing metadata of the requested resource that is stored as part of one or more attributes of the requested resource; and obtaining a first restricted resource class (RRC) identifier from the metadata, the first RRC identifier identifying the first class of resources in which the requested resource is a member. 6. The method of claim 5, comprising matching the first RRC identifier with a second RRC identifier obtained from the resource entitlement of the application, wherein the application is entitled to access the requested resource if the first and second RRC identifiers are matched. 7. The method of claim 5, further comprising:
determining whether the first RRC identifier matches a predetermined RRC identifier; and allowing the application to access the resource even if the second RRC identifier does not match the first RRC identifier. 8. The method of claim 1, wherein the requested resource is a file system resource of the data processing system representing at least one of a file and a directory of one or more files. 9. The method of claim 1, wherein the requested resource is a device driver of a peripheral device of the data processing system. 10. The method of claim 1, wherein the requested resource is attaching to a second application and controlling the second application. 11. A non-transitory machine-readable medium having instructions stored therein, which when executed by a processor, cause the processor to perform a method, the method comprising:
in response to a request from an application for accessing a resource of a data processing system, determining a first class of resources the requested resource belongs; determining a second class of resources the application is entitled to access based on a resource entitlement encoded within the application and authorized by a predetermined authority; allowing the application to access the resource if the first class and the second class of resources are matched; and denying the application from accessing the resource if the first class and the second class are not matched, regardless an operating privilege level of the application. 12. The non-transitory machine-readable medium of claim 11, wherein determining a first class of resources the requested resource belongs comprises:
accessing an access control list (ACL) to locate an entry associated with the requested resource; and obtaining a first restricted resource class (RRC) identifier from the entry, the first RRC identifier identifying the first class of resources in which the requested resource is a member. 13. The non-transitory machine-readable medium of claim 12, wherein determining a second class of resources the application is entitled comprises obtaining a second RRC identifier from the resource entitlement of the application, and wherein the application is allowed to access the requested resource if the first and second RRC identifiers are matched. 14. The non-transitory machine-readable medium of claim 12, wherein the ACL is centrally maintained by a security manager of the operating system. 15. The non-transitory machine-readable medium of claim 11, wherein determining a first class of resources the requested resource belongs comprises:
accessing metadata of the requested resource that is stored as part of one or more attributes of the requested resource; and obtaining a first restricted resource class (RRC) identifier from the metadata, the first RRC identifier identifying the first class of resources in which the requested resource is a member. 16. The non-transitory machine-readable medium of claim 15, wherein the method further comprises matching the first RRC identifier with a second RRC identifier obtained from the resource entitlement of the application, wherein the application is entitled to access the requested resource if the first and second RRC identifiers are matched. 17. A data processing system, comprising:
a processor; and a memory coupled to the processor for storing instructions, which when executed from the memory, cause the processor to
in response to a request from an application for accessing a resource of a data processing system, determine a first class of resources the requested resource belongs,
determine a second class of resources the application is entitled to access based on a resource entitlement encoded within the application and authorized by a predetermined authority,
allow the application to access the resource if the first class and the second class of resources are matched, and
deny the application from accessing the resource if the first class and the second class are not matched, regardless an operating privilege level of the application. 18. The system of claim 17, wherein determining a first class of resources the requested resource belongs comprises:
accessing an access control list (ACL) to locate an entry associated with the requested resource; and obtaining a first restricted resource class (RRC) identifier from the entry, the first RRC identifier identifying the first class of resources in which the requested resource is a member. 19. The system of claim 18, wherein determining a second class of resources the application is entitled comprises obtaining a second RRC identifier from the resource entitlement of the application, and wherein the application is allowed to access the requested resource if the first and second RRC identifiers are matched. 20. The system of claim 18, wherein the ACL is centrally maintained by a security manager of the operating system. 21. The system of claim 17, wherein determining a first class of resources the requested resource belongs comprises:
accessing metadata of the requested resource that is stored as part of one or more attributes of the requested resource; and obtaining a first restricted resource class (RRC) identifier from the metadata, the first RRC identifier identifying the first class of resources in which the requested resource is a member. 22. The system of claim 21, wherein the method further comprises matching the first RRC identifier with a second RRC identifier obtained from the resource entitlement of the application, wherein the application is entitled to access the requested resource if the first and second RRC identifiers are matched. 23. A computer-implemented method, comprising:
receiving a request from a first application to attach to a second application and to control the second application; accessing an access control list (ACL) to determine whether the second application is associated with a restricted resource class (RRC) based on an RRC identifier associated with the second application; denying the request if the second application belongs to the restricted resource class; if the second application does not belong to a restricted resource class, examining a resource entitlement encoded within the second application to determine whether the first application is allowed to attach to the second application; and allowing the first application to attach to the second application if the resource entitlement of the second application specifically indicates that the first application can attach to the second application. 24. The method of claim 23, wherein the resource entitlement of the second application identifies the first application. 25. The method of claim 23, wherein the first application is to debug the second application through attachment. 26. A computer-implemented method, comprising:
receiving a request from an application for accessing a kernel component of a kernel of an operating system of a data processing system; accessing an access control list (ACL) to determine a class of resources that is associated with the kernel component to be accessed based on a first resource class identifier associated with the kernel component; determining a second resource class identifier encoded within the application and signed by a predetermined authority, the second resource class identifier identifying a class of resources that the application is entitled to access; and allowing the application to access the kernel component if the first resource class identifier matches the second resource identifier. 27. The method of claim 26, wherein the kernel component is a device driver for accessing a peripheral device of the data processing system. 28. The method of claim 26, wherein the request for accessing a kernel component is to launch a kernel extension within the kernel of the operating system. | 2,100 |
5,702 | 5,702 | 14,638,960 | 2,143 | When a multimedia conference between multiple users at multiple locations is established, a first cursor controlled by a first user in a first location is provided. A first event associated with the multimedia conference is detected. In response to detecting the first event associated with the multimedia conference, control of cursors in the multimedia conference can be handled in various ways to enhance the multimedia conference. For example, control of the first cursor can be switched from the first user to a second user at a second location, a second cursor can be provided to the multimedia conference that is controlled by the second user, or control of the first cursor can be merged so that the first cursor can be controlled by both the first user and the second user. This allows for enhanced control of the cursor in the multimedia conference that more closely resembles an in-person conference. | 1. A method comprising:
providing, in a multimedia conference, a first cursor controlled by a first user, the first user being in a first location, wherein the multimedia conference comprises a plurality of users at a plurality of locations; detecting a first event associated with the multimedia conference; and in response to detecting the first event associated with the multimedia conference, enabling at least one of:
switching control of the first cursor from the first user to a second user, the second user being in a second location;
providing a second cursor in the multimedia conference controlled by the second user; and
merging control of the first cursor with inputs received from the first user and the second user. 2. The method of claim 1, wherein the first event is at least one of:
the second user speaking in the multimedia conference; the second user speaking using a different communication endpoint than is used for a multimedia portion of the multimedia conference; the second user selecting a menu or button; a percentage of time that the second user is speaking the multimedia conference; the second user speaking the most in a defined period of time; a voice command; one or more Dual Tone Multi-Frequency (DTMF) tones; an agenda for the multimedia conference; an agenda for a slide presentation in the multimedia conference; an agenda that defines a lecture period and group discussion in the multimedia conference; a gesture; the second user looking at a specific area of a presented document; the second user pointing to the specific area of the presented document; a stress level or mood of the second user; presence of the second user being on camera; a command from the first user; and a sound level of the second user. 3. The method of claim 1, further comprising:
detecting a second event associated with the multimedia conference; in response to detecting the second event, enabling at least one of:
switching control of the first cursor from the second user to the first user;
removing control of the second cursor by the second user; and
unmerging control of the first cursor. 4. The method of claim 3, wherein the second event is at least one of:
the second user walking out of a conference room or office; the second user walking away from the multimedia conference; the second user not paying attention to the multimedia conference; the first user speaking in the multimedia conference; the first user selecting a menu or button; a percentage of time that the first user is speaking the multimedia conference; a voice command; one or more Dual Tone Multi-Frequency (DTMF) tones; an agenda for the multimedia conference; an agenda for a slide presentation in the multimedia conference; an agenda that defines a lecture period and group discussion in the multimedia conference; a gesture; the first user looking at a specific area of a presented document; the first user pointing to the specific area of the presented document; a stress level or mood of the first user; presence of the first user being off camera; a command from the first user; and a sound level of the first user. 5. The method of claim 1, wherein the plurality of users comprises at least a third user and further comprising:
establishing a sidebar communication between the first user and the second user; detecting a second event associated with the conference, wherein the second event is for the first user and/or the second user to privately control the first cursor and/or the second cursor; and in response detecting the second event, only displaying the first cursor and/or the second cursor to the first user and the second user. 6. The method of claim 1, wherein the cursor is an annotator. 7. The method of claim 6, further comprising detecting a second event associated with the conference, wherein the second event is a command to erase all annotations associated with the first cursor and/or the second cursor. 8. The method of claim 1, wherein the response to detecting the first event is to switch control of the first cursor from the first user to the second user, wherein the first event is the second user speaking in the multimedia conference, and further comprising associating a time period for the second user to control the first cursor after the second user stops speaking. 9. The method of claim 1, wherein the response to detecting the first event is to provide the second cursor. 10. The method of claim 9, wherein the first cursor has an identifier that identifies the first user and the second cursor has an identifier that identifies the second user. 11. The method of claim 1, wherein the response to detecting the first event is to merge control of the first cursor with the first user and the second user. 12. The method of claim 1 further comprising:
recording the multimedia conference, wherein recording the multimedia conference comprises recording control of the first and/or second cursors and individual users associated with controlling the first and/or second cursors. 13. A system comprising:
a conferencing application configured to provide, in a multimedia conference, a first cursor controlled by a first user, the first user being in a first location, wherein the multimedia conference comprises a plurality of users at a plurality of locations, and detect a first event associated with the multimedia conference; and in response to detecting the first event associated with the multimedia conference, a cursor control module configured to at least one of:
switch control of the first cursor from the first user to a second user, the second user being in a second location;
provide a second cursor in the multimedia conference controlled by the second user; and
merge control of the first cursor with inputs received from the first user and the second user. 14. The system of claim 13, wherein the first event is at least one of:
the second user speaking in the multimedia conference; the second user speaking using a different communication endpoint than is used for a multimedia portion of the multimedia conference; the second user selecting a menu or button; a percentage of time that the second user is speaking the multimedia conference; the second user speaking the most in a defined period of time; a voice command; one or more Dual Tone Multi-Frequency (DTMF) tones; an agenda for the multimedia conference; an agenda for a slide presentation in the multimedia conference; an agenda that defines a lecture period and group discussion in the multimedia conference; a gesture; the second user looking at a specific area of a presented document; the second user pointing to the specific area of the presented document; a stress level or mood of the second user; presence of the second user being on camera; a command from the first user; and a sound level of the second user. 15. The system of claim 13, wherein:
the conferencing application is further configured to detect a second event associated with the multimedia conference; and in response to detecting the second event, the cursor control module is further configured to do at least one of:
switch control of the first cursor from the second user to the first user;
remove control of the second cursor by the second user; and
unmerge control of the first cursor. 16. The system of claim 15, wherein the second event is at least one of:
the second user walking out of a conference room or office; the second user walking away from the multimedia conference; the second user not paying attention to the multimedia conference; the first user speaking in the multimedia conference; the first user selecting a menu or button; a percentage of time that the first user is speaking the multimedia conference; a voice command; one or more Dual Tone Multi-Frequency (DTMF) tones; an agenda for the multimedia conference; an agenda for a slide presentation in the multimedia conference; an agenda that defines a lecture period and group discussion in the multimedia conference; a gesture; the first user looking at a specific area of a presented document; the first user pointing to the specific area of the presented document; a stress level or mood of the first user; presence of the first user being off camera; a command from the first user; and a sound level of the first user. 17. The system of claim 13, wherein the plurality of users comprises at least a third user and further comprising:
a mixer configured to establish a sidebar communication between the first user and the second user; the conferencing application further configured to detect a second event associated with the conference, wherein the second event is for the first user and/or the second user to privately control the first cursor and/or the second cursor; and in response detecting the second event, the cursor control module is further configured to only display the first cursor and/or the second cursor to the first user and the second user. 18. The system of claim 13, wherein the response to detecting the first event is to switch control of the first cursor from the first user to the second user, wherein the first event is the second user speaking in the multimedia conference, and wherein the cursor control module is further configured to associate a time period for the second user to control the first cursor after the second user stops speaking. 19. The system of claim 13, wherein the response to detecting the first event is to provide the second cursor. 20. A non-transitory computer readable medium having stored thereon instructions that, when executed, cause a processor to perform a method, the instructions comprising:
instructions to provide, in a multimedia conference, a first cursor controlled by a first user, the first user being in a first location, wherein the multimedia conference comprises a plurality of users at a plurality of locations; instructions to detect a first event associated with the multimedia conference; and in response to detecting the first event associated with the multimedia conference, instructions to at least one of:
switch control of the first cursor from the first user to a second user, the second user being in a second location;
provide a second cursor in the multimedia conference controlled by the second user; and
merge control of the first cursor with inputs received from the first user and the second user. | When a multimedia conference between multiple users at multiple locations is established, a first cursor controlled by a first user in a first location is provided. A first event associated with the multimedia conference is detected. In response to detecting the first event associated with the multimedia conference, control of cursors in the multimedia conference can be handled in various ways to enhance the multimedia conference. For example, control of the first cursor can be switched from the first user to a second user at a second location, a second cursor can be provided to the multimedia conference that is controlled by the second user, or control of the first cursor can be merged so that the first cursor can be controlled by both the first user and the second user. This allows for enhanced control of the cursor in the multimedia conference that more closely resembles an in-person conference.1. A method comprising:
providing, in a multimedia conference, a first cursor controlled by a first user, the first user being in a first location, wherein the multimedia conference comprises a plurality of users at a plurality of locations; detecting a first event associated with the multimedia conference; and in response to detecting the first event associated with the multimedia conference, enabling at least one of:
switching control of the first cursor from the first user to a second user, the second user being in a second location;
providing a second cursor in the multimedia conference controlled by the second user; and
merging control of the first cursor with inputs received from the first user and the second user. 2. The method of claim 1, wherein the first event is at least one of:
the second user speaking in the multimedia conference; the second user speaking using a different communication endpoint than is used for a multimedia portion of the multimedia conference; the second user selecting a menu or button; a percentage of time that the second user is speaking the multimedia conference; the second user speaking the most in a defined period of time; a voice command; one or more Dual Tone Multi-Frequency (DTMF) tones; an agenda for the multimedia conference; an agenda for a slide presentation in the multimedia conference; an agenda that defines a lecture period and group discussion in the multimedia conference; a gesture; the second user looking at a specific area of a presented document; the second user pointing to the specific area of the presented document; a stress level or mood of the second user; presence of the second user being on camera; a command from the first user; and a sound level of the second user. 3. The method of claim 1, further comprising:
detecting a second event associated with the multimedia conference; in response to detecting the second event, enabling at least one of:
switching control of the first cursor from the second user to the first user;
removing control of the second cursor by the second user; and
unmerging control of the first cursor. 4. The method of claim 3, wherein the second event is at least one of:
the second user walking out of a conference room or office; the second user walking away from the multimedia conference; the second user not paying attention to the multimedia conference; the first user speaking in the multimedia conference; the first user selecting a menu or button; a percentage of time that the first user is speaking the multimedia conference; a voice command; one or more Dual Tone Multi-Frequency (DTMF) tones; an agenda for the multimedia conference; an agenda for a slide presentation in the multimedia conference; an agenda that defines a lecture period and group discussion in the multimedia conference; a gesture; the first user looking at a specific area of a presented document; the first user pointing to the specific area of the presented document; a stress level or mood of the first user; presence of the first user being off camera; a command from the first user; and a sound level of the first user. 5. The method of claim 1, wherein the plurality of users comprises at least a third user and further comprising:
establishing a sidebar communication between the first user and the second user; detecting a second event associated with the conference, wherein the second event is for the first user and/or the second user to privately control the first cursor and/or the second cursor; and in response detecting the second event, only displaying the first cursor and/or the second cursor to the first user and the second user. 6. The method of claim 1, wherein the cursor is an annotator. 7. The method of claim 6, further comprising detecting a second event associated with the conference, wherein the second event is a command to erase all annotations associated with the first cursor and/or the second cursor. 8. The method of claim 1, wherein the response to detecting the first event is to switch control of the first cursor from the first user to the second user, wherein the first event is the second user speaking in the multimedia conference, and further comprising associating a time period for the second user to control the first cursor after the second user stops speaking. 9. The method of claim 1, wherein the response to detecting the first event is to provide the second cursor. 10. The method of claim 9, wherein the first cursor has an identifier that identifies the first user and the second cursor has an identifier that identifies the second user. 11. The method of claim 1, wherein the response to detecting the first event is to merge control of the first cursor with the first user and the second user. 12. The method of claim 1 further comprising:
recording the multimedia conference, wherein recording the multimedia conference comprises recording control of the first and/or second cursors and individual users associated with controlling the first and/or second cursors. 13. A system comprising:
a conferencing application configured to provide, in a multimedia conference, a first cursor controlled by a first user, the first user being in a first location, wherein the multimedia conference comprises a plurality of users at a plurality of locations, and detect a first event associated with the multimedia conference; and in response to detecting the first event associated with the multimedia conference, a cursor control module configured to at least one of:
switch control of the first cursor from the first user to a second user, the second user being in a second location;
provide a second cursor in the multimedia conference controlled by the second user; and
merge control of the first cursor with inputs received from the first user and the second user. 14. The system of claim 13, wherein the first event is at least one of:
the second user speaking in the multimedia conference; the second user speaking using a different communication endpoint than is used for a multimedia portion of the multimedia conference; the second user selecting a menu or button; a percentage of time that the second user is speaking the multimedia conference; the second user speaking the most in a defined period of time; a voice command; one or more Dual Tone Multi-Frequency (DTMF) tones; an agenda for the multimedia conference; an agenda for a slide presentation in the multimedia conference; an agenda that defines a lecture period and group discussion in the multimedia conference; a gesture; the second user looking at a specific area of a presented document; the second user pointing to the specific area of the presented document; a stress level or mood of the second user; presence of the second user being on camera; a command from the first user; and a sound level of the second user. 15. The system of claim 13, wherein:
the conferencing application is further configured to detect a second event associated with the multimedia conference; and in response to detecting the second event, the cursor control module is further configured to do at least one of:
switch control of the first cursor from the second user to the first user;
remove control of the second cursor by the second user; and
unmerge control of the first cursor. 16. The system of claim 15, wherein the second event is at least one of:
the second user walking out of a conference room or office; the second user walking away from the multimedia conference; the second user not paying attention to the multimedia conference; the first user speaking in the multimedia conference; the first user selecting a menu or button; a percentage of time that the first user is speaking the multimedia conference; a voice command; one or more Dual Tone Multi-Frequency (DTMF) tones; an agenda for the multimedia conference; an agenda for a slide presentation in the multimedia conference; an agenda that defines a lecture period and group discussion in the multimedia conference; a gesture; the first user looking at a specific area of a presented document; the first user pointing to the specific area of the presented document; a stress level or mood of the first user; presence of the first user being off camera; a command from the first user; and a sound level of the first user. 17. The system of claim 13, wherein the plurality of users comprises at least a third user and further comprising:
a mixer configured to establish a sidebar communication between the first user and the second user; the conferencing application further configured to detect a second event associated with the conference, wherein the second event is for the first user and/or the second user to privately control the first cursor and/or the second cursor; and in response detecting the second event, the cursor control module is further configured to only display the first cursor and/or the second cursor to the first user and the second user. 18. The system of claim 13, wherein the response to detecting the first event is to switch control of the first cursor from the first user to the second user, wherein the first event is the second user speaking in the multimedia conference, and wherein the cursor control module is further configured to associate a time period for the second user to control the first cursor after the second user stops speaking. 19. The system of claim 13, wherein the response to detecting the first event is to provide the second cursor. 20. A non-transitory computer readable medium having stored thereon instructions that, when executed, cause a processor to perform a method, the instructions comprising:
instructions to provide, in a multimedia conference, a first cursor controlled by a first user, the first user being in a first location, wherein the multimedia conference comprises a plurality of users at a plurality of locations; instructions to detect a first event associated with the multimedia conference; and in response to detecting the first event associated with the multimedia conference, instructions to at least one of:
switch control of the first cursor from the first user to a second user, the second user being in a second location;
provide a second cursor in the multimedia conference controlled by the second user; and
merge control of the first cursor with inputs received from the first user and the second user. | 2,100 |
5,703 | 5,703 | 15,393,504 | 2,179 | The present application provides a monitored apparatus of a remote touch sensitive monitoring system. The monitored apparatus includes a touch screen, a touch sensitive module coupling to the touch screen, a network module, and a processing module coupling to the touch sensitive module and the network module. The processing module is configured to execute a program for receiving touch sensitive information of the touch screen calculated by the touch sensitive module and transmitting the touch sensitive information to a monitoring apparatus of the remote touch sensitive monitoring system. | 1. A monitored apparatus of a remote touch sensitive monitoring system, the monitored apparatus comprising:
a touch screen; a touch sensitive module, configured to couple to the touch screen; a network module; and a processing module, configured to couple to the touch sensitive module and the network module, wherein the processing module is configured to execute a program for receiving touch sensitive information of the touch screen calculated by the touch sensitive module and transmitting the touch sensitive information through the network module to a monitoring apparatus of the remote touch sensitive monitoring system. 2. The monitored apparatus of claim 1, wherein the program executed by the processing module is further used to receive a setting parameter of the touch sensitive module and transmit the touch sensitive information through the network module to the monitoring apparatus. 3. The monitored apparatus of claim 2, wherein the program executed by the processing module is further used to receive the setting parameter of the monitoring apparatus through the network module and command the touch sensitive module to use the setting parameter to get the touch sensitive information of the touch screen. 4. A controlling method of a monitored apparatus, the controlling method comprising:
receiving touch sensitive information of a touch screen calculated by a touch sensitive module of the monitored apparatus; and transmitting the touch sensitive information through a network module of the monitored apparatus to a monitoring apparatus of a remote touch sensitive monitoring system. 5. The controlling method of claim 4, further comprising:
receiving a setting parameter of the touch sensitive module and transmitting the touch sensitive information through the network module to the monitoring apparatus. 6. The controlling method of claim 5, further comprising:
receiving the setting parameter of the monitoring apparatus through the network module and commanding the touch sensitive module to use the setting parameter to get the touch sensitive information of the touch screen. 7. A monitoring apparatus of a remote touch sensitive monitoring system, the monitoring apparatus configured to execute a monitoring application program for receiving touch sensitive information of a monitored apparatus of the remote touch sensitive monitoring system and displaying the touch sensitive information on a screen of the monitoring apparatus. 8. The monitoring apparatus of claim 7, wherein the monitoring application program is further used to receive a setting parameter of a touch sensitive module of the monitored apparatus and display the setting parameter on the screen. 9. The monitoring apparatus of claim 7, wherein the monitoring application program is further used to receive a setting command about the setting parameter and transmit the setting parameter to the monitored apparatus. 10. A controlling method of a monitoring apparatus, the controlling method comprising:
receiving touch sensitive information of a monitored apparatus of a remote touch sensitive monitoring system; and displaying the touch sensitive information on a screen of the monitoring apparatus. 11. The controlling method of claim 10, further comprising:
receiving a setting parameter of a touch sensitive module of the monitored apparatus and displaying the setting parameter on the screen. 12. The controlling method of claim 11, further comprising:
receiving a setting command about the setting parameter and transmitting the setting parameter to the monitored apparatus. 13. A remote touch sensitive monitoring system, comprising:
a monitored apparatus, comprising:
a touch screen;
a touch sensitive module, configured to couple the touch screen;
a network module; and
a processing module, configured to couple to the touch sensitive module and the network module, wherein the processing module is configured to execute a program for receiving touch sensitive information of the touch screen calculated by the touch sensitive module and transmitting the touch sensitive information through the network module to a monitoring apparatus; and
the monitoring apparatus, configured to execute a monitoring application program for receiving the touch sensitive information of the monitored apparatus and displaying the touch sensitive information on a screen of the monitoring apparatus. | The present application provides a monitored apparatus of a remote touch sensitive monitoring system. The monitored apparatus includes a touch screen, a touch sensitive module coupling to the touch screen, a network module, and a processing module coupling to the touch sensitive module and the network module. The processing module is configured to execute a program for receiving touch sensitive information of the touch screen calculated by the touch sensitive module and transmitting the touch sensitive information to a monitoring apparatus of the remote touch sensitive monitoring system.1. A monitored apparatus of a remote touch sensitive monitoring system, the monitored apparatus comprising:
a touch screen; a touch sensitive module, configured to couple to the touch screen; a network module; and a processing module, configured to couple to the touch sensitive module and the network module, wherein the processing module is configured to execute a program for receiving touch sensitive information of the touch screen calculated by the touch sensitive module and transmitting the touch sensitive information through the network module to a monitoring apparatus of the remote touch sensitive monitoring system. 2. The monitored apparatus of claim 1, wherein the program executed by the processing module is further used to receive a setting parameter of the touch sensitive module and transmit the touch sensitive information through the network module to the monitoring apparatus. 3. The monitored apparatus of claim 2, wherein the program executed by the processing module is further used to receive the setting parameter of the monitoring apparatus through the network module and command the touch sensitive module to use the setting parameter to get the touch sensitive information of the touch screen. 4. A controlling method of a monitored apparatus, the controlling method comprising:
receiving touch sensitive information of a touch screen calculated by a touch sensitive module of the monitored apparatus; and transmitting the touch sensitive information through a network module of the monitored apparatus to a monitoring apparatus of a remote touch sensitive monitoring system. 5. The controlling method of claim 4, further comprising:
receiving a setting parameter of the touch sensitive module and transmitting the touch sensitive information through the network module to the monitoring apparatus. 6. The controlling method of claim 5, further comprising:
receiving the setting parameter of the monitoring apparatus through the network module and commanding the touch sensitive module to use the setting parameter to get the touch sensitive information of the touch screen. 7. A monitoring apparatus of a remote touch sensitive monitoring system, the monitoring apparatus configured to execute a monitoring application program for receiving touch sensitive information of a monitored apparatus of the remote touch sensitive monitoring system and displaying the touch sensitive information on a screen of the monitoring apparatus. 8. The monitoring apparatus of claim 7, wherein the monitoring application program is further used to receive a setting parameter of a touch sensitive module of the monitored apparatus and display the setting parameter on the screen. 9. The monitoring apparatus of claim 7, wherein the monitoring application program is further used to receive a setting command about the setting parameter and transmit the setting parameter to the monitored apparatus. 10. A controlling method of a monitoring apparatus, the controlling method comprising:
receiving touch sensitive information of a monitored apparatus of a remote touch sensitive monitoring system; and displaying the touch sensitive information on a screen of the monitoring apparatus. 11. The controlling method of claim 10, further comprising:
receiving a setting parameter of a touch sensitive module of the monitored apparatus and displaying the setting parameter on the screen. 12. The controlling method of claim 11, further comprising:
receiving a setting command about the setting parameter and transmitting the setting parameter to the monitored apparatus. 13. A remote touch sensitive monitoring system, comprising:
a monitored apparatus, comprising:
a touch screen;
a touch sensitive module, configured to couple the touch screen;
a network module; and
a processing module, configured to couple to the touch sensitive module and the network module, wherein the processing module is configured to execute a program for receiving touch sensitive information of the touch screen calculated by the touch sensitive module and transmitting the touch sensitive information through the network module to a monitoring apparatus; and
the monitoring apparatus, configured to execute a monitoring application program for receiving the touch sensitive information of the monitored apparatus and displaying the touch sensitive information on a screen of the monitoring apparatus. | 2,100 |
5,704 | 5,704 | 14,959,722 | 2,154 | A method for performing analysis may use a minimal set of indices for an input query including identifying the input query including primitive searches that are accelerated using indices, computing a minimal set of indices for the input query using an optimal, polynomial-time algorithm, and performing relational data analysis using the minimal set of indices for input queries. | 1. A method for performing analysis using a minimal set of indices for an input query comprising:
identifying the input query comprising a plurality of primitive searches that are accelerated using indices; computing a minimal set of indices for the input query using an optimal, polynomial-time algorithm; and performing relational data analysis using the minimal set of indices for input queries. 2. The method of claim 1, wherein computing the minimal set of indices for the input query comprises:
constructing a bi-partite graph comprising a first and a second vertex set, wherein the first and second vertex set are a set of searches in both partitions of the bi-partite graph; identifying an edge set as a strict subset relation between at least two searches of the set of searches showing up in the first and second vertex set of the bi-partite graph; computing a matching set comprising at most one edge in a matching set for each vertex within the bi-partite graph; and traversing the matching set to find one or more chains and convert the one or more chains to lexicographical orders. 3. The method of claim 1, wherein the plurality of primitive searches comprises, as a search predicate, a conjunction of equalities over attributes. 4. The method of claim 1, further comprising:
constructing value queries and equi-joins using the plurality of primitive searches. 5. The method of claim 1, wherein the relational data analysis is performed on an in-memory Datalog machine. 6. A system for performing analysis using a minimal set of indices for an input query comprising:
a data repository storing software code; a computer processor communicatively connected to the data repository and configured to execute instructions to:
identify the input query comprising a plurality of primitive searches that are accelerated using indices;
compute a minimal set of indices for the input query using an optimal, polynomial-time algorithm; and
perform relational data analysis using the minimal set of indices for input queries. 7. The system of claim 6, wherein the processor is further configured to execute instructions to compute the minimal set of indices for the input query by:
constructing a bi-partite graph comprising a first and a second vertex set, wherein the first and second vertex set are a set of searches in both partitions of the bi-partite graph; identifying an edge set as a strict subset relation between at least two searches of the set of searches showing up in the first and second vertex set of the bi-partite graph; computing a matching set comprising at most one edge in a matching set for each vertex within the bi-partite graph; and traversing the matching set to find one or more chains and convert the one or more chains to lexicographical orders. 8. The system of claim 6, wherein the plurality of primitive searches comprises, as a search predicate, a conjunction of equalities over attributes. 9. The system of claim 6, wherein the processor is further configured to execute instructions to construct value queries and equi-joins using the plurality of primitive searches. 10. The system of claim 6, further comprising:
an in-memory Datalog machine to perform the relational data analysis. 11. A non-transitory computer readable medium comprising instructions that, when executed by a computer processor, perform a method for performing analysis using a minimal set of indices for an input query comprising:
identifying the input query comprising a plurality of primitive searches that are accelerated using indices; computing a minimal set of indices for the input query using an optimal, polynomial-time algorithm; and performing relational data analysis using the minimal set of indices for input queries. 12. The non-transitory computer readable memory of claim 11, wherein the computer processor is further configured to execute instructions to compute the minimal set of indices for the input query by:
constructing a bi-partite graph comprising a first and a second vertex set, wherein the first and second vertex set are a set of searches in both partitions of the bi-partite graph; identifying an edge set as a strict subset relation between at least two searches of the set of searches showing up in the first and second vertex set of the bi-partite graph; computing a matching set comprising at most one edge in a matching set for each vertex within the bi-partite graph; and traversing the matching set to find one or more chains and convert the one or more chains to lexicographical orders. 13. The non-transitory computer readable medium of claim 11, wherein the plurality of primitive searches comprises, as a search predicate, a conjunction of equalities over attributes. 14. The non-transitory computer readable medium of claim 11, further comprising instructions that, when executed by a computer processor, perform the method for performing analysis using a minimal set of indices for an input query comprising:
constructing value queries and equi-joins using the plurality of primitive searches. 15. The non-transitory computer readable medium of claim 11, wherein the relational data analysis is performed on an in-memory Datalog machine. | A method for performing analysis may use a minimal set of indices for an input query including identifying the input query including primitive searches that are accelerated using indices, computing a minimal set of indices for the input query using an optimal, polynomial-time algorithm, and performing relational data analysis using the minimal set of indices for input queries.1. A method for performing analysis using a minimal set of indices for an input query comprising:
identifying the input query comprising a plurality of primitive searches that are accelerated using indices; computing a minimal set of indices for the input query using an optimal, polynomial-time algorithm; and performing relational data analysis using the minimal set of indices for input queries. 2. The method of claim 1, wherein computing the minimal set of indices for the input query comprises:
constructing a bi-partite graph comprising a first and a second vertex set, wherein the first and second vertex set are a set of searches in both partitions of the bi-partite graph; identifying an edge set as a strict subset relation between at least two searches of the set of searches showing up in the first and second vertex set of the bi-partite graph; computing a matching set comprising at most one edge in a matching set for each vertex within the bi-partite graph; and traversing the matching set to find one or more chains and convert the one or more chains to lexicographical orders. 3. The method of claim 1, wherein the plurality of primitive searches comprises, as a search predicate, a conjunction of equalities over attributes. 4. The method of claim 1, further comprising:
constructing value queries and equi-joins using the plurality of primitive searches. 5. The method of claim 1, wherein the relational data analysis is performed on an in-memory Datalog machine. 6. A system for performing analysis using a minimal set of indices for an input query comprising:
a data repository storing software code; a computer processor communicatively connected to the data repository and configured to execute instructions to:
identify the input query comprising a plurality of primitive searches that are accelerated using indices;
compute a minimal set of indices for the input query using an optimal, polynomial-time algorithm; and
perform relational data analysis using the minimal set of indices for input queries. 7. The system of claim 6, wherein the processor is further configured to execute instructions to compute the minimal set of indices for the input query by:
constructing a bi-partite graph comprising a first and a second vertex set, wherein the first and second vertex set are a set of searches in both partitions of the bi-partite graph; identifying an edge set as a strict subset relation between at least two searches of the set of searches showing up in the first and second vertex set of the bi-partite graph; computing a matching set comprising at most one edge in a matching set for each vertex within the bi-partite graph; and traversing the matching set to find one or more chains and convert the one or more chains to lexicographical orders. 8. The system of claim 6, wherein the plurality of primitive searches comprises, as a search predicate, a conjunction of equalities over attributes. 9. The system of claim 6, wherein the processor is further configured to execute instructions to construct value queries and equi-joins using the plurality of primitive searches. 10. The system of claim 6, further comprising:
an in-memory Datalog machine to perform the relational data analysis. 11. A non-transitory computer readable medium comprising instructions that, when executed by a computer processor, perform a method for performing analysis using a minimal set of indices for an input query comprising:
identifying the input query comprising a plurality of primitive searches that are accelerated using indices; computing a minimal set of indices for the input query using an optimal, polynomial-time algorithm; and performing relational data analysis using the minimal set of indices for input queries. 12. The non-transitory computer readable memory of claim 11, wherein the computer processor is further configured to execute instructions to compute the minimal set of indices for the input query by:
constructing a bi-partite graph comprising a first and a second vertex set, wherein the first and second vertex set are a set of searches in both partitions of the bi-partite graph; identifying an edge set as a strict subset relation between at least two searches of the set of searches showing up in the first and second vertex set of the bi-partite graph; computing a matching set comprising at most one edge in a matching set for each vertex within the bi-partite graph; and traversing the matching set to find one or more chains and convert the one or more chains to lexicographical orders. 13. The non-transitory computer readable medium of claim 11, wherein the plurality of primitive searches comprises, as a search predicate, a conjunction of equalities over attributes. 14. The non-transitory computer readable medium of claim 11, further comprising instructions that, when executed by a computer processor, perform the method for performing analysis using a minimal set of indices for an input query comprising:
constructing value queries and equi-joins using the plurality of primitive searches. 15. The non-transitory computer readable medium of claim 11, wherein the relational data analysis is performed on an in-memory Datalog machine. | 2,100 |
5,705 | 5,705 | 14,953,998 | 2,196 | An ability to monitor the performance of a threaded application is provided. A thread that is executing is detected, wherein the thread is spawned by a threaded application. A thread class of the thread is determined. A performance metric of the thread is measured. A trend that describes a consumption of the performance metric as a function of percent execution time is interpolated. In response to determining that a threshold associated with the performance metric is exceeded based on a comparison of the trend to a trend template that is associated with the performance metric, an alert is issued. The alert identifies the thread as an abnormally executed thread in order to trigger a corrective action that improves a performance of a computing device that is configured to execute the threaded application. | 1. A method comprising:
detecting, by one or more computer processors, a thread that is executing, wherein the thread is spawned by a threaded application; determining, by one or more computer processors, a thread class of the thread; measuring, by one or more computer processors, a performance metric of the thread based on the thread class; interpolating, by one or more computer processors, a trend that describes a consumption of the performance metric as a function of percent execution time; and in response to determining, by one or more computer processors, that a threshold associated with the performance metric is exceeded based on a comparison of the trend to a trend template that is associated with the performance metric, issuing, by one or more computer processors, an alert identifying the thread as an abnormally executed thread in order to trigger a corrective action that improves a performance of a computing device that is configured to execute the threaded application. 2. The method of claim 1, wherein the trend template is a predefined template and the threshold is a predefined threshold. 3. The method of claim 1, wherein the trend template and the threshold are based on measurements of the performance metric in connection with one or more previously executed threads of the thread class. 4. The method of claim 1, wherein the threshold represent a distance between a function that describes the trend and function that describes the trend template. 5. The method of claim 1, wherein the performance metric is a measure of one of processor consumption, memory consumption, and bandwidth consumption. 6. The method of claim 1, wherein the trend that describes the consumption of the performance metric as a function of percent execution time is interpolated via polynomial interpolation to produce an interpolated function. 7. The method of claim 6, wherein the interpolated function is one of a sixth-degree polynomial, a seventh-degree polynomial, and an eighth-degree polynomial. 8. The method of claim 6, further comprising:
compensating, by one or more computer processors, for at least one of background resource consumption and a size of an input by eliminating a constant from the interpolated function. 9. A method comprising:
detecting, by one or more computer processors, a thread that is executing, wherein the thread is spawned by a threaded application; determining, by one or more computer processors, a thread class of the thread; measuring, by one or more computer processors, a plurality of performance metrics of the thread based on the thread class; for each performance metric, interpolating, by one or more computer processors, a respective trend that describes a consumption of a respective performance metric as a function of percent execution time; for each performance metric, comparing, by one or more computer processors, the respective trend to a respective trend template; generating, by one or more computer processors, a composite value based on a plurality of trends and a plurality of trend templates; and in response to determining, by one or more computer processors, that the composite value exceeds every composite threshold value of a plurality of composite threshold values, issuing, by one or more computer processors, an alert identifying the thread as an abnormally executed thread in order to trigger a corrective action that improves a performance a computing device that is configured to execute the threaded application. 10. The method of claim 9, wherein the thread class is associated with a plurality of thread profiles, and each thread profile is associated with a respective composite threshold value of the plurality of composite threshold values. 11. The method of claim 9, wherein each composite threshold value of the plurality of composite threshold values is a sum of constituent threshold values, each constituent threshold value representing a respective threshold distance between a baseline trend and a respective, theoretical trend that represents abnormal performance metric consumption. 12. The method of claim 9, wherein each composite threshold value of the plurality of composite threshold values is an average of constituent threshold values, each constituent threshold value representing a respective threshold distance between a baseline trend and a respective, theoretical trend that represents abnormal performance metric consumption. 13. A method comprising:
detecting, by one or more computer processors, a thread that is executing; determining, by one or more computer processors, a thread class of the thread; measuring, by one or more computer processors, a plurality of performance metrics of the thread based on the thread class; for a first performance metric, calculating, by one or more computer processors, an interpolated trend that describes a consumption of the first performance metric as a function of percent execution time; in response to determining, by one or more computer processors, that a first trend template that is associated with the first performance metric is invalid, modifying, by one or more computer processors, the first trend template based on the interpolated trend, wherein the first trend template is one of a plurality of trend templates that includes a second trend template, and wherein the second trend template is associated with a second performance metric of the plurality of performance metrics; and in response to determining, by one or more computer processors, that each template of the plurality of trend templates is valid, modifying, by one or more computer processors, a composite threshold value based on the plurality of trends and the plurality of trend templates, wherein the composite threshold value is associated with the thread class. 14. The method of claim 13, wherein the first trend template is invalid when the first trend template is based on a count of previously executed threads that is less than a threshold count of previously executed threads. 15. The method of claim 13, wherein the first trend template is invalid when a statistical measure of first template exceeds a threshold value of the statistical measure, wherein the statistical measure is selected from a group of statistical measures consisting of an average, a variance, a standard deviation, and a coefficient of determination. 16. A computer program product for comprising:
a computer readable storage medium and program instructions stored on the computer readable storage medium, the program instructions comprising:
program instructions to detect a thread that is executing, wherein the thread is spawned by a threaded application;
program instructions to determine a thread class of the thread;
program instructions to measure a performance metric of the thread based on the thread class;
program instructions to interpolate a trend that describes a consumption of the performance metric as a function of percent execution time; and
program instructions to, in response to determining that a threshold associated with the performance metric is exceeded based on a comparison of the trend to a trend template that is associated with the performance metric, issue an alert identifying the thread as an abnormally executed thread in order to trigger a corrective action that improves a performance of a computing device that is configured to execute the threaded application. 17. The computer program product of claim 16, wherein the trend template is a predefined template and the threshold is a predefined threshold. 18. The computer program product of claim 16, wherein the trend template and the threshold are based on measurements of the performance metric in connection with one or more previously executed threads of the thread class. 19. The computer program product of claim 16, wherein the trend that describes the consumption of the performance metric as a function of percent execution time is interpolated via polynomial interpolation to produce an interpolated function that is one of a sixth-degree polynomial, a seventh-degree polynomial, and an eighth-degree polynomial. 20. The computer program product of claim 19, the program instructions further comprising:
program instructions to compensate for at least one of background resource consumption and a size of an input by eliminating a constant from the interpolated function. 21. A computer system comprising:
one or more computer processors; one or more computer readable storage media; program instructions stored on the one or more computer readable storage media for execution by at least one of the one or more processors, the program instructions comprising:
program instructions to detect a thread that is executing, wherein the thread is spawned by a threaded application;
program instructions to determine a thread class of the thread;
program instructions to measure a performance metric of the thread based on the thread class;
program instructions to interpolate a trend that describes a consumption of the performance metric as a function of percent execution time; and
program instructions to, in response to determining that a threshold associated with the performance metric is exceeded based on a comparison of the trend to a trend template that is associated with the performance metric, issue an alert identifying the thread as an abnormally executed thread in order to trigger a corrective action that improves a performance of the one or more computer processors, wherein the one or more computer processors are configured to execute the threaded application. 22. The computer system of claim 21, wherein the trend template is a predefined template and the threshold is a predefined threshold. 23. The computer system of claim 21, wherein the trend template and the threshold are based on measurements of the performance metric in connection with one or more previously executed threads of the thread class. 24. The computer system of claim 21, wherein the trend that describes the consumption of the performance metric as a function of percent execution time is interpolated via polynomial interpolation to produce an interpolated function that is one of a sixth-degree polynomial, a seventh-degree polynomial, and an eighth-degree polynomial. 25. The computer system of claim 24, the program instructions further comprising:
program instructions to compensate for at least one of background resource consumption and a size of an input by eliminating a constant from the interpolated function. | An ability to monitor the performance of a threaded application is provided. A thread that is executing is detected, wherein the thread is spawned by a threaded application. A thread class of the thread is determined. A performance metric of the thread is measured. A trend that describes a consumption of the performance metric as a function of percent execution time is interpolated. In response to determining that a threshold associated with the performance metric is exceeded based on a comparison of the trend to a trend template that is associated with the performance metric, an alert is issued. The alert identifies the thread as an abnormally executed thread in order to trigger a corrective action that improves a performance of a computing device that is configured to execute the threaded application.1. A method comprising:
detecting, by one or more computer processors, a thread that is executing, wherein the thread is spawned by a threaded application; determining, by one or more computer processors, a thread class of the thread; measuring, by one or more computer processors, a performance metric of the thread based on the thread class; interpolating, by one or more computer processors, a trend that describes a consumption of the performance metric as a function of percent execution time; and in response to determining, by one or more computer processors, that a threshold associated with the performance metric is exceeded based on a comparison of the trend to a trend template that is associated with the performance metric, issuing, by one or more computer processors, an alert identifying the thread as an abnormally executed thread in order to trigger a corrective action that improves a performance of a computing device that is configured to execute the threaded application. 2. The method of claim 1, wherein the trend template is a predefined template and the threshold is a predefined threshold. 3. The method of claim 1, wherein the trend template and the threshold are based on measurements of the performance metric in connection with one or more previously executed threads of the thread class. 4. The method of claim 1, wherein the threshold represent a distance between a function that describes the trend and function that describes the trend template. 5. The method of claim 1, wherein the performance metric is a measure of one of processor consumption, memory consumption, and bandwidth consumption. 6. The method of claim 1, wherein the trend that describes the consumption of the performance metric as a function of percent execution time is interpolated via polynomial interpolation to produce an interpolated function. 7. The method of claim 6, wherein the interpolated function is one of a sixth-degree polynomial, a seventh-degree polynomial, and an eighth-degree polynomial. 8. The method of claim 6, further comprising:
compensating, by one or more computer processors, for at least one of background resource consumption and a size of an input by eliminating a constant from the interpolated function. 9. A method comprising:
detecting, by one or more computer processors, a thread that is executing, wherein the thread is spawned by a threaded application; determining, by one or more computer processors, a thread class of the thread; measuring, by one or more computer processors, a plurality of performance metrics of the thread based on the thread class; for each performance metric, interpolating, by one or more computer processors, a respective trend that describes a consumption of a respective performance metric as a function of percent execution time; for each performance metric, comparing, by one or more computer processors, the respective trend to a respective trend template; generating, by one or more computer processors, a composite value based on a plurality of trends and a plurality of trend templates; and in response to determining, by one or more computer processors, that the composite value exceeds every composite threshold value of a plurality of composite threshold values, issuing, by one or more computer processors, an alert identifying the thread as an abnormally executed thread in order to trigger a corrective action that improves a performance a computing device that is configured to execute the threaded application. 10. The method of claim 9, wherein the thread class is associated with a plurality of thread profiles, and each thread profile is associated with a respective composite threshold value of the plurality of composite threshold values. 11. The method of claim 9, wherein each composite threshold value of the plurality of composite threshold values is a sum of constituent threshold values, each constituent threshold value representing a respective threshold distance between a baseline trend and a respective, theoretical trend that represents abnormal performance metric consumption. 12. The method of claim 9, wherein each composite threshold value of the plurality of composite threshold values is an average of constituent threshold values, each constituent threshold value representing a respective threshold distance between a baseline trend and a respective, theoretical trend that represents abnormal performance metric consumption. 13. A method comprising:
detecting, by one or more computer processors, a thread that is executing; determining, by one or more computer processors, a thread class of the thread; measuring, by one or more computer processors, a plurality of performance metrics of the thread based on the thread class; for a first performance metric, calculating, by one or more computer processors, an interpolated trend that describes a consumption of the first performance metric as a function of percent execution time; in response to determining, by one or more computer processors, that a first trend template that is associated with the first performance metric is invalid, modifying, by one or more computer processors, the first trend template based on the interpolated trend, wherein the first trend template is one of a plurality of trend templates that includes a second trend template, and wherein the second trend template is associated with a second performance metric of the plurality of performance metrics; and in response to determining, by one or more computer processors, that each template of the plurality of trend templates is valid, modifying, by one or more computer processors, a composite threshold value based on the plurality of trends and the plurality of trend templates, wherein the composite threshold value is associated with the thread class. 14. The method of claim 13, wherein the first trend template is invalid when the first trend template is based on a count of previously executed threads that is less than a threshold count of previously executed threads. 15. The method of claim 13, wherein the first trend template is invalid when a statistical measure of first template exceeds a threshold value of the statistical measure, wherein the statistical measure is selected from a group of statistical measures consisting of an average, a variance, a standard deviation, and a coefficient of determination. 16. A computer program product for comprising:
a computer readable storage medium and program instructions stored on the computer readable storage medium, the program instructions comprising:
program instructions to detect a thread that is executing, wherein the thread is spawned by a threaded application;
program instructions to determine a thread class of the thread;
program instructions to measure a performance metric of the thread based on the thread class;
program instructions to interpolate a trend that describes a consumption of the performance metric as a function of percent execution time; and
program instructions to, in response to determining that a threshold associated with the performance metric is exceeded based on a comparison of the trend to a trend template that is associated with the performance metric, issue an alert identifying the thread as an abnormally executed thread in order to trigger a corrective action that improves a performance of a computing device that is configured to execute the threaded application. 17. The computer program product of claim 16, wherein the trend template is a predefined template and the threshold is a predefined threshold. 18. The computer program product of claim 16, wherein the trend template and the threshold are based on measurements of the performance metric in connection with one or more previously executed threads of the thread class. 19. The computer program product of claim 16, wherein the trend that describes the consumption of the performance metric as a function of percent execution time is interpolated via polynomial interpolation to produce an interpolated function that is one of a sixth-degree polynomial, a seventh-degree polynomial, and an eighth-degree polynomial. 20. The computer program product of claim 19, the program instructions further comprising:
program instructions to compensate for at least one of background resource consumption and a size of an input by eliminating a constant from the interpolated function. 21. A computer system comprising:
one or more computer processors; one or more computer readable storage media; program instructions stored on the one or more computer readable storage media for execution by at least one of the one or more processors, the program instructions comprising:
program instructions to detect a thread that is executing, wherein the thread is spawned by a threaded application;
program instructions to determine a thread class of the thread;
program instructions to measure a performance metric of the thread based on the thread class;
program instructions to interpolate a trend that describes a consumption of the performance metric as a function of percent execution time; and
program instructions to, in response to determining that a threshold associated with the performance metric is exceeded based on a comparison of the trend to a trend template that is associated with the performance metric, issue an alert identifying the thread as an abnormally executed thread in order to trigger a corrective action that improves a performance of the one or more computer processors, wherein the one or more computer processors are configured to execute the threaded application. 22. The computer system of claim 21, wherein the trend template is a predefined template and the threshold is a predefined threshold. 23. The computer system of claim 21, wherein the trend template and the threshold are based on measurements of the performance metric in connection with one or more previously executed threads of the thread class. 24. The computer system of claim 21, wherein the trend that describes the consumption of the performance metric as a function of percent execution time is interpolated via polynomial interpolation to produce an interpolated function that is one of a sixth-degree polynomial, a seventh-degree polynomial, and an eighth-degree polynomial. 25. The computer system of claim 24, the program instructions further comprising:
program instructions to compensate for at least one of background resource consumption and a size of an input by eliminating a constant from the interpolated function. | 2,100 |
5,706 | 5,706 | 14,294,729 | 2,144 | A portable device having a touch display is disclosed. A full screen having multiple graphical objects is initially presented on the touch display of the portable device. The touch display includes a comfortable operation area that is within the reach of a thumb of a hand holding the portable device, an inoperable area that is beyond the reach of the thumb of the hand holding the portable device, and a difficult operation area that is located between the comfortable operation area and the hand holding the portable device. In response to a request for a screen shifting operation, the full screen is shifted in a direction of a palm of the hand holding the portable device to present a portion of the full screen on the touch display. After receiving and confirming a user input from the touch screen, the full screen presentation is restored on the touch display. | 1. A method comprising:
presenting on a touch display of a portable device a full screen having a plurality of graphical objects, wherein said touch display includes a comfortable operation area that is within the reach of a thumb of a hand holding said portable device, an inoperable area that is beyond the reach of said thumb of said hand holding said portable device, and a difficult operation area located between said comfortable operation area and said hand holding said portable device; in response to a request for a screen shifting operation, shifting said full screen in a direction of a palm of said hand to present on said touch display a portion of said full screen; and after receiving and confirming a user input from said touch display, restoring the presentation of said full screen on said touch display. 2. The method of claim 1, wherein said request is generated by an operation performed within said comfortable operation area. 3. The method of claim 1, further comprising:
defining a reference position on said touch display; and determining a direction of shifting said full screen based on coordinates of said reference position and coordinates of a pressed position of said request. 4. The method of claim 3, wherein said direction of shifting said full screen is a direction of a straight line connecting between said coordinates of said reference position and said coordinates of said pressed position. 5. The method of claim 4, further comprising in response to a request for a change of said pressed position, determining a new direction of shifting said full screen based on coordinates of said changed pressed position and said coordinates of said reference position. 6. The method of claim 3, wherein said shifting includes determining coordinates of said full screen on said touch display according to a magnitude of a pressing force. 7. A computer readable device having a computer program product for controlling a touch display, said computer readable device comprising:
program code for presenting on a touch display of a portable device a full screen having a plurality of graphical objects, wherein said touch display includes a comfortable operation area that is within the reach of a thumb of a hand holding said portable device, an inoperable area that is beyond the reach of said thumb of said hand holding said portable device, and a difficult operation area located between said comfortable operation area and said hand holding said portable device; program code for, in response to a request for a screen shifting operation, shifting said full screen in a direction of a palm of said hand to present on said touch display a portion of said full screen; and program code for, after receiving and confirming a user input from said touch display, restoring the presentation of said full screen on said touch display. 8. The computer readable device of claim 7, wherein said request is generated by an operation performed within said comfortable operation area. 9. The computer readable device of claim 7, further comprising:
program code for defining a reference position on said touch display; and program code for determining a direction of shifting said full screen based on coordinates of said reference position and coordinates of a pressed position of said request. 10. The computer readable device of claim 9, wherein said direction of shifting said full screen is a direction of a straight line connecting between said coordinates of said reference position and said coordinates of said pressed position. 11. The computer readable device of claim 10, further comprising program code for, in response to a request for a change of said pressed position, determining a new direction of shifting said full screen based on coordinates of said changed pressed position and said coordinates of said reference position. 12. The computer readable device of claim 9, wherein program code for said shifting includes program code for determining coordinates of said full screen on said touch display according to a magnitude of a pressing force. 13. A portable device comprising:
a processor; a touch display, coupled to said processor, for displaying a full screen having a plurality of graphical objects, wherein said touch display includes a comfortable operation area that is within the reach of a thumb of a hand holding said portable device, an inoperable area that is beyond the reach of said thumb of said hand holding said portable device, and a difficult operation area located between said comfortable operation area and said hand holding said portable device; and a touch panel controller, coupled to said touch display, for
shifting said full screen in a direction of a palm of said hand to present a portion of said full screen on said touch display, in response to a request for a screen shifting operation; and
restoring a presentation of said full screen on said touch display after receiving and confirming a user input from said touch display. | A portable device having a touch display is disclosed. A full screen having multiple graphical objects is initially presented on the touch display of the portable device. The touch display includes a comfortable operation area that is within the reach of a thumb of a hand holding the portable device, an inoperable area that is beyond the reach of the thumb of the hand holding the portable device, and a difficult operation area that is located between the comfortable operation area and the hand holding the portable device. In response to a request for a screen shifting operation, the full screen is shifted in a direction of a palm of the hand holding the portable device to present a portion of the full screen on the touch display. After receiving and confirming a user input from the touch screen, the full screen presentation is restored on the touch display.1. A method comprising:
presenting on a touch display of a portable device a full screen having a plurality of graphical objects, wherein said touch display includes a comfortable operation area that is within the reach of a thumb of a hand holding said portable device, an inoperable area that is beyond the reach of said thumb of said hand holding said portable device, and a difficult operation area located between said comfortable operation area and said hand holding said portable device; in response to a request for a screen shifting operation, shifting said full screen in a direction of a palm of said hand to present on said touch display a portion of said full screen; and after receiving and confirming a user input from said touch display, restoring the presentation of said full screen on said touch display. 2. The method of claim 1, wherein said request is generated by an operation performed within said comfortable operation area. 3. The method of claim 1, further comprising:
defining a reference position on said touch display; and determining a direction of shifting said full screen based on coordinates of said reference position and coordinates of a pressed position of said request. 4. The method of claim 3, wherein said direction of shifting said full screen is a direction of a straight line connecting between said coordinates of said reference position and said coordinates of said pressed position. 5. The method of claim 4, further comprising in response to a request for a change of said pressed position, determining a new direction of shifting said full screen based on coordinates of said changed pressed position and said coordinates of said reference position. 6. The method of claim 3, wherein said shifting includes determining coordinates of said full screen on said touch display according to a magnitude of a pressing force. 7. A computer readable device having a computer program product for controlling a touch display, said computer readable device comprising:
program code for presenting on a touch display of a portable device a full screen having a plurality of graphical objects, wherein said touch display includes a comfortable operation area that is within the reach of a thumb of a hand holding said portable device, an inoperable area that is beyond the reach of said thumb of said hand holding said portable device, and a difficult operation area located between said comfortable operation area and said hand holding said portable device; program code for, in response to a request for a screen shifting operation, shifting said full screen in a direction of a palm of said hand to present on said touch display a portion of said full screen; and program code for, after receiving and confirming a user input from said touch display, restoring the presentation of said full screen on said touch display. 8. The computer readable device of claim 7, wherein said request is generated by an operation performed within said comfortable operation area. 9. The computer readable device of claim 7, further comprising:
program code for defining a reference position on said touch display; and program code for determining a direction of shifting said full screen based on coordinates of said reference position and coordinates of a pressed position of said request. 10. The computer readable device of claim 9, wherein said direction of shifting said full screen is a direction of a straight line connecting between said coordinates of said reference position and said coordinates of said pressed position. 11. The computer readable device of claim 10, further comprising program code for, in response to a request for a change of said pressed position, determining a new direction of shifting said full screen based on coordinates of said changed pressed position and said coordinates of said reference position. 12. The computer readable device of claim 9, wherein program code for said shifting includes program code for determining coordinates of said full screen on said touch display according to a magnitude of a pressing force. 13. A portable device comprising:
a processor; a touch display, coupled to said processor, for displaying a full screen having a plurality of graphical objects, wherein said touch display includes a comfortable operation area that is within the reach of a thumb of a hand holding said portable device, an inoperable area that is beyond the reach of said thumb of said hand holding said portable device, and a difficult operation area located between said comfortable operation area and said hand holding said portable device; and a touch panel controller, coupled to said touch display, for
shifting said full screen in a direction of a palm of said hand to present a portion of said full screen on said touch display, in response to a request for a screen shifting operation; and
restoring a presentation of said full screen on said touch display after receiving and confirming a user input from said touch display. | 2,100 |
5,707 | 5,707 | 14,262,542 | 2,174 | An improved application sharing system and method are described wherein a display of shared information is constructed such that application artifacts that are of no use to the viewer are not displayed to the viewer. In this way, a greatest possible portion of a viewing area can be used to display document content rather than such artifacts. In an embodiment, the functionality of reducing the display in this manner is engageable and disengageble by a viewing user. In a further embodiment of the invention, the functionality of reducing the display is automatically engaged and disengaged based on actions of a sharing user with respect to the shared information. | 1-20. (canceled) 21. A method for displaying a representation of a shared window on a viewing display of a viewing computing device, the method comprising:
receiving an entirety of the shared window wherein the shared window is a window of an application, the shared window having both a document content area and an application artifact area; identifying, by a sharing process executing at the viewing computing device, the document content area of the shared window and the application artifact area of the shared window; and displaying, on the viewing display, the document content area of the shared window while omitting from the display the application artifact area of the shared window,
wherein:
the application artifact area comprises at least one graphical object actuatable to affect the operation of the application
the shared window is associated with an application running on a sharing computing device,
the sharing computing device comprises a sharer display upon which is displayed the shared window, and
the sharing computing device is communicably linked to the viewing computing device. 22. The method of claim 21, wherein the application is user alterable to enter a mode of operation wherein the application artifact area of the shared window is represented on the viewing display. 23. The method of claim 21, wherein identifying the document content area of the shared window further comprises associating a parent window class of the shared window with a sub-window class associated with a sub-window within the shared window containing the document content area. 24. The method of claim 21, wherein the viewing computing device is communicably linked to the sharing computing device via a network comprising a local area network. 25. The method of claim 21, wherein the viewing computing device is communicably linked to the sharing computing device via a network comprising a wide area network. 26. The method of claim 21, wherein the viewing computing device is communicably linked to the sharing computing device using the Internet. 27. The method of claim 21, further comprising:
receiving an indication that control of the application running on the sharing computing device has been relinquished by a user of the sharing computing device and is ceded to a user of the viewing computing device; and automatically switching a mode of the viewing display whereby the application artifact area of the shared window is represented on the viewing display. 28. The method of claim 21, further comprising:
identifying a menu that intersects both the artifacts area and the document area; and in response to identifying the menu, modifying the viewing display to show the artifacts area. 29. A computer readable memory storing instructions configured to, in response to being executed by a computing device, cause the computing device to perform operations for displaying a representation of a shared window on a viewing display of a viewing computing device, the operations comprising:
receiving an entirety of the shared window wherein the shared window is a window of an application, the shared window having both a document content area and an application artifact area; identifying, by a sharing process executing at the viewing computing device, the document content area of the shared window and the application artifact area of the shared window; and displaying, on the viewing display, the document content area of the shared window while omitting from the display the application artifact area of the shared window,
wherein:
the application artifact area comprises at least one graphical object actuatable to affect the operation of the application
the shared window is associated with an application running on a sharing computing device,
the sharing computing device comprises a sharer display upon which is displayed the shared window, and
the sharing computing device is communicably linked to the viewing computing device. 30. The computer readable memory of claim 29, wherein the application is user alterable to enter a mode of operation wherein the application artifact area of the shared window is represented on the viewing display. 31. The computer readable memory of claim 29, wherein identifying the document content area of the shared window further comprises associating a parent window class of the shared window with a sub-window class associated with a sub-window within the shared window containing the document content area. 32. The computer readable memory of claim 29, wherein the viewing computing device is communicably linked to the sharing computing device via a network comprising a local area network. 33. The computer readable memory of claim 29, wherein the viewing computing device is communicably linked to the sharing computing device using the Internet. 34. The computer readable memory of claim 29, wherein the operations further comprise:
receiving an indication that control of the application running on the sharing computing device has been relinquished by a user of the sharing computing device and is ceded to a user of the viewing computing device; and automatically switching a mode of the viewing display whereby the application artifact area of the shared window is represented on the viewing display. 35. The computer readable memory of claim 29, wherein the operations further comprise:
identifying a menu that intersects both the artifacts area and the document area; and in response to identifying the menu, modifying the viewing display to show the artifacts area. 36. A system for displaying a representation of a shared window on a viewing computing device, the system comprising:
a transceiver configured to receive an entirety of the shared window wherein the shared window is a window of an application, the shared window having both a document content area and an application artifact area; a window analyzer configured to identify, by a sharing process executing at the viewing computing device, the document content area of the shared window and the application artifact area of the shared window; and a viewing display configured to display the document content area of the shared window while omitting from the display the application artifact area of the shared window,
wherein:
the application artifact area comprises at least one graphical object actuatable to affect the operation of the application
the shared window is associated with an application running on a sharing computing device,
the sharing computing device comprises a sharer display upon which is displayed the shared window, and
the sharing computing device is communicably linked to the viewing computing device. 37. The system of claim 36, wherein the application is user alterable to enter a mode of operation wherein the application artifact area of the shared window is represented on the viewing display. 38. The system of claim 36, wherein identifying the document content area of the shared window further comprises associating a parent window class of the shared window with a sub-window class associated with a sub-window within the shared window containing the document content area. 39. The system of claim 36, wherein
the transceiver is further configured to receive an indication that control of the application running on the sharing computing device has been relinquished by a user of the sharing computing device and is ceded to a user of the viewing computing device; and the viewing display is configured to automatically switch to a mode of operation of whereby the application artifact area of the shared window is represented on the viewing display. 40. The system of claim 36, wherein:
the window analyzer is further configured to identify a menu that intersects both the artifacts area and the document area; and a viewing display is further configured to, in response to the window analyzer identifying the menu, modify the viewing display to show the artifacts area. | An improved application sharing system and method are described wherein a display of shared information is constructed such that application artifacts that are of no use to the viewer are not displayed to the viewer. In this way, a greatest possible portion of a viewing area can be used to display document content rather than such artifacts. In an embodiment, the functionality of reducing the display in this manner is engageable and disengageble by a viewing user. In a further embodiment of the invention, the functionality of reducing the display is automatically engaged and disengaged based on actions of a sharing user with respect to the shared information.1-20. (canceled) 21. A method for displaying a representation of a shared window on a viewing display of a viewing computing device, the method comprising:
receiving an entirety of the shared window wherein the shared window is a window of an application, the shared window having both a document content area and an application artifact area; identifying, by a sharing process executing at the viewing computing device, the document content area of the shared window and the application artifact area of the shared window; and displaying, on the viewing display, the document content area of the shared window while omitting from the display the application artifact area of the shared window,
wherein:
the application artifact area comprises at least one graphical object actuatable to affect the operation of the application
the shared window is associated with an application running on a sharing computing device,
the sharing computing device comprises a sharer display upon which is displayed the shared window, and
the sharing computing device is communicably linked to the viewing computing device. 22. The method of claim 21, wherein the application is user alterable to enter a mode of operation wherein the application artifact area of the shared window is represented on the viewing display. 23. The method of claim 21, wherein identifying the document content area of the shared window further comprises associating a parent window class of the shared window with a sub-window class associated with a sub-window within the shared window containing the document content area. 24. The method of claim 21, wherein the viewing computing device is communicably linked to the sharing computing device via a network comprising a local area network. 25. The method of claim 21, wherein the viewing computing device is communicably linked to the sharing computing device via a network comprising a wide area network. 26. The method of claim 21, wherein the viewing computing device is communicably linked to the sharing computing device using the Internet. 27. The method of claim 21, further comprising:
receiving an indication that control of the application running on the sharing computing device has been relinquished by a user of the sharing computing device and is ceded to a user of the viewing computing device; and automatically switching a mode of the viewing display whereby the application artifact area of the shared window is represented on the viewing display. 28. The method of claim 21, further comprising:
identifying a menu that intersects both the artifacts area and the document area; and in response to identifying the menu, modifying the viewing display to show the artifacts area. 29. A computer readable memory storing instructions configured to, in response to being executed by a computing device, cause the computing device to perform operations for displaying a representation of a shared window on a viewing display of a viewing computing device, the operations comprising:
receiving an entirety of the shared window wherein the shared window is a window of an application, the shared window having both a document content area and an application artifact area; identifying, by a sharing process executing at the viewing computing device, the document content area of the shared window and the application artifact area of the shared window; and displaying, on the viewing display, the document content area of the shared window while omitting from the display the application artifact area of the shared window,
wherein:
the application artifact area comprises at least one graphical object actuatable to affect the operation of the application
the shared window is associated with an application running on a sharing computing device,
the sharing computing device comprises a sharer display upon which is displayed the shared window, and
the sharing computing device is communicably linked to the viewing computing device. 30. The computer readable memory of claim 29, wherein the application is user alterable to enter a mode of operation wherein the application artifact area of the shared window is represented on the viewing display. 31. The computer readable memory of claim 29, wherein identifying the document content area of the shared window further comprises associating a parent window class of the shared window with a sub-window class associated with a sub-window within the shared window containing the document content area. 32. The computer readable memory of claim 29, wherein the viewing computing device is communicably linked to the sharing computing device via a network comprising a local area network. 33. The computer readable memory of claim 29, wherein the viewing computing device is communicably linked to the sharing computing device using the Internet. 34. The computer readable memory of claim 29, wherein the operations further comprise:
receiving an indication that control of the application running on the sharing computing device has been relinquished by a user of the sharing computing device and is ceded to a user of the viewing computing device; and automatically switching a mode of the viewing display whereby the application artifact area of the shared window is represented on the viewing display. 35. The computer readable memory of claim 29, wherein the operations further comprise:
identifying a menu that intersects both the artifacts area and the document area; and in response to identifying the menu, modifying the viewing display to show the artifacts area. 36. A system for displaying a representation of a shared window on a viewing computing device, the system comprising:
a transceiver configured to receive an entirety of the shared window wherein the shared window is a window of an application, the shared window having both a document content area and an application artifact area; a window analyzer configured to identify, by a sharing process executing at the viewing computing device, the document content area of the shared window and the application artifact area of the shared window; and a viewing display configured to display the document content area of the shared window while omitting from the display the application artifact area of the shared window,
wherein:
the application artifact area comprises at least one graphical object actuatable to affect the operation of the application
the shared window is associated with an application running on a sharing computing device,
the sharing computing device comprises a sharer display upon which is displayed the shared window, and
the sharing computing device is communicably linked to the viewing computing device. 37. The system of claim 36, wherein the application is user alterable to enter a mode of operation wherein the application artifact area of the shared window is represented on the viewing display. 38. The system of claim 36, wherein identifying the document content area of the shared window further comprises associating a parent window class of the shared window with a sub-window class associated with a sub-window within the shared window containing the document content area. 39. The system of claim 36, wherein
the transceiver is further configured to receive an indication that control of the application running on the sharing computing device has been relinquished by a user of the sharing computing device and is ceded to a user of the viewing computing device; and the viewing display is configured to automatically switch to a mode of operation of whereby the application artifact area of the shared window is represented on the viewing display. 40. The system of claim 36, wherein:
the window analyzer is further configured to identify a menu that intersects both the artifacts area and the document area; and a viewing display is further configured to, in response to the window analyzer identifying the menu, modify the viewing display to show the artifacts area. | 2,100 |
5,708 | 5,708 | 15,019,069 | 2,135 | A memory management unit comprises an interface for receiving an address translation request from a device, the address translation request specifying a virtual request to be translated. Translation circuitry translates the virtual address into an intermediate address different from a physical address directly specifying a memory location. The interface provides an address translation response specifying the intermediate address to the device in response to the address translation request. This improves security by avoiding exposure of physical addresses to the device. | 1. A memory management unit comprising:
an interface configured to receive an address translation request from a device, the address translation request specifying a virtual address to be translated; and translation circuitry configured to translate the virtual address specified by the address translation request into an intermediate address different from a physical address directly specifying a memory location; wherein the interface is configured to provide an address translation response comprising the intermediate address to the device in response to the address translation request. 2. The memory management unit according to claim 1, wherein in response to a translated access request received by the interface from the device, the translated access request specifying the intermediate address, the translation circuitry is configured to translate the intermediate address into a corresponding physical address. 3. The memory management unit according to claim 1, wherein in response to a non-translated access request received by the interface from the device, the non-translated access request specifying a virtual address, the translation circuitry is configured to translate the virtual address into a corresponding physical address. 4. The memory management unit according to claim 3, wherein in response to the non-translated access request, the translation circuitry is configured to perform a first translation to translate the virtual address into a corresponding intermediate address, and to perform a second translation to translate the intermediate address into said corresponding physical address. 5. The memory management unit according to claim 4, wherein the translation circuitry is configured to perform the first translation based on first control data set under control of a first control program executed by a processing unit, and to perform the second translation based on second control data set under control of a second control program executed by the processing unit. 6. The memory management unit according to claim 1, comprising control circuitry configured to control processing of a memory access using the physical address obtained by the translation circuitry. 7. The memory management unit according to claim 1, wherein in a first address translation mode, in response to the address translation request the translation circuitry is configured to translate the virtual address into the intermediate address and the interface is configured to provide the address translation response specifying the intermediate address; and
in a second address translation mode, in response to the address translation request the translation circuitry is configured to translate the virtual address into the physical address and the interface is configured to provide the address translation response specifying the physical address. 8. The memory management unit according to claim 7, wherein the translation circuitry is configured to select whether to use the first address translation mode or the second address translation mode in dependence on control information accessible to the translation circuitry. 9. The memory management unit according to claim 8, wherein the control information specifies, separately for each of a plurality of devices or contexts, whether to use the first address translation mode or the second address translation mode for requests received from that device or context. 10. The memory management unit according to claim 1, wherein in the first address translation mode, in response to a translated access request received by the interface, the translation circuitry is configured to translate an intermediate address specified by the translated access request into a corresponding physical address to be used for a memory access; and
in the second address translation mode, in response to a translated access request received by the interface, the memory management unit is configured to provide the physical address specified by the translated access request to be used for a memory access. 11. The memory management unit according to claim 10, wherein the memory management unit has a plurality of operating modes including:
a performance mode in which, in response to a translated access request received by the interface, the memory management unit is configured to allow a memory access to proceed using an address specified by the translated access request without checking whether to use the first address translation mode or the second address translation mode; and a safety mode in which, in response to a translated access request received by the interface, the translation circuitry is configured to check whether to use the first address translation mode or the second address translation mode for the translated access request before allowing any memory access to proceed in response to the translated access request. 12. The memory management unit according to claim 11, wherein the memory management unit is configured to prohibit use of the first address translation mode when the memory management unit is in the performance mode. 13. The memory management unit according to claim 1, comprising a control storage element configured to store control information indicating whether the memory management unit is in the performance mode or the safety mode. 14. A data processing apparatus comprising a memory management unit according to claim 1. 15. A memory management unit comprising:
means for receiving an address translation request from a device, the address translation request specifying a virtual address to be translated; means for translating the virtual address specified by the address translation request into an intermediate address different from a physical address directly specifying a memory location; and means for providing an address translation response comprising the intermediate address to the device in response to the address translation request. 16. A method comprising:
receiving an address translation request from a device, the address translation request specifying a virtual address to be translated; translating the virtual address specified by the address translation request into an intermediate address different from a physical address directly specifying a memory location; and providing an address translation response to the device, the address translation response comprising the intermediate address. | A memory management unit comprises an interface for receiving an address translation request from a device, the address translation request specifying a virtual request to be translated. Translation circuitry translates the virtual address into an intermediate address different from a physical address directly specifying a memory location. The interface provides an address translation response specifying the intermediate address to the device in response to the address translation request. This improves security by avoiding exposure of physical addresses to the device.1. A memory management unit comprising:
an interface configured to receive an address translation request from a device, the address translation request specifying a virtual address to be translated; and translation circuitry configured to translate the virtual address specified by the address translation request into an intermediate address different from a physical address directly specifying a memory location; wherein the interface is configured to provide an address translation response comprising the intermediate address to the device in response to the address translation request. 2. The memory management unit according to claim 1, wherein in response to a translated access request received by the interface from the device, the translated access request specifying the intermediate address, the translation circuitry is configured to translate the intermediate address into a corresponding physical address. 3. The memory management unit according to claim 1, wherein in response to a non-translated access request received by the interface from the device, the non-translated access request specifying a virtual address, the translation circuitry is configured to translate the virtual address into a corresponding physical address. 4. The memory management unit according to claim 3, wherein in response to the non-translated access request, the translation circuitry is configured to perform a first translation to translate the virtual address into a corresponding intermediate address, and to perform a second translation to translate the intermediate address into said corresponding physical address. 5. The memory management unit according to claim 4, wherein the translation circuitry is configured to perform the first translation based on first control data set under control of a first control program executed by a processing unit, and to perform the second translation based on second control data set under control of a second control program executed by the processing unit. 6. The memory management unit according to claim 1, comprising control circuitry configured to control processing of a memory access using the physical address obtained by the translation circuitry. 7. The memory management unit according to claim 1, wherein in a first address translation mode, in response to the address translation request the translation circuitry is configured to translate the virtual address into the intermediate address and the interface is configured to provide the address translation response specifying the intermediate address; and
in a second address translation mode, in response to the address translation request the translation circuitry is configured to translate the virtual address into the physical address and the interface is configured to provide the address translation response specifying the physical address. 8. The memory management unit according to claim 7, wherein the translation circuitry is configured to select whether to use the first address translation mode or the second address translation mode in dependence on control information accessible to the translation circuitry. 9. The memory management unit according to claim 8, wherein the control information specifies, separately for each of a plurality of devices or contexts, whether to use the first address translation mode or the second address translation mode for requests received from that device or context. 10. The memory management unit according to claim 1, wherein in the first address translation mode, in response to a translated access request received by the interface, the translation circuitry is configured to translate an intermediate address specified by the translated access request into a corresponding physical address to be used for a memory access; and
in the second address translation mode, in response to a translated access request received by the interface, the memory management unit is configured to provide the physical address specified by the translated access request to be used for a memory access. 11. The memory management unit according to claim 10, wherein the memory management unit has a plurality of operating modes including:
a performance mode in which, in response to a translated access request received by the interface, the memory management unit is configured to allow a memory access to proceed using an address specified by the translated access request without checking whether to use the first address translation mode or the second address translation mode; and a safety mode in which, in response to a translated access request received by the interface, the translation circuitry is configured to check whether to use the first address translation mode or the second address translation mode for the translated access request before allowing any memory access to proceed in response to the translated access request. 12. The memory management unit according to claim 11, wherein the memory management unit is configured to prohibit use of the first address translation mode when the memory management unit is in the performance mode. 13. The memory management unit according to claim 1, comprising a control storage element configured to store control information indicating whether the memory management unit is in the performance mode or the safety mode. 14. A data processing apparatus comprising a memory management unit according to claim 1. 15. A memory management unit comprising:
means for receiving an address translation request from a device, the address translation request specifying a virtual address to be translated; means for translating the virtual address specified by the address translation request into an intermediate address different from a physical address directly specifying a memory location; and means for providing an address translation response comprising the intermediate address to the device in response to the address translation request. 16. A method comprising:
receiving an address translation request from a device, the address translation request specifying a virtual address to be translated; translating the virtual address specified by the address translation request into an intermediate address different from a physical address directly specifying a memory location; and providing an address translation response to the device, the address translation response comprising the intermediate address. | 2,100 |
5,709 | 5,709 | 14,846,859 | 2,153 | A method for accessing a block level volume by a file level client, the method may include receiving, by a network attached storage (NAS) interface of a storage system, a file level command that is associated with a virtual pathname that is indicative that the file level command is aimed to a given block level volume and not to a file of a file system; translating, by the storage system, the file level command to a block level command for accessing the given block level volume; accessing, by the storage system, the given block level volume to provide a block level response; converting, by the storage system, the block level response to a file level response; and sending to the file level client the file level response | 1. A method for accessing a block level volume by a file level client, the method comprises:
receiving, by a network attached storage (NAS) interface of a storage system, a file level command that is associated with a virtual pathname that is indicative that the file level command is aimed to a given block level volume and not to a file of a file system; translating, by the storage system, the file level command to a block level command for accessing the given block level volume; accessing, by the storage system, the given block level volume to provide a block level response; converting, by the storage system, the block level response to a file level response; and sending to the file level client the file level response. 2. The method according to claim 1 wherein at least a portion of the block level volume was written in a response to a reception of a block level write command received via a storage access network (SAN) interface of the storage system. 3. The method according to claim 1 comprising receiving via a storage access network (SAN) interface of the storage system a block level command from a block level client for accessing the given block level volume; accessing, by the storage system, the given block level volume to provide a block level response; and sending to the block level client the block level response. 4. The method according to claim 1 wherein the receiving of the file level command is followed by forwarding the file level command to a translator of the storage system for translating the file level command to the block level command for accessing the given block level volume. 5. The method according to claim 1 wherein the receiving of the file level command is preceded by performing a loopback mount command for mounting the file. 6. The method according to claim 1 wherein the translating of the file level command to the block level command comprises accessing a lookup table for providing, in response to the virtual pathname, a volume identifier of the block level volume. 7. The method according to claim 1 wherein the translating of the file level command to the block level command comprises applying a predefined function for providing, in response to the virtual pathname, a volume identifier of the block level volume. 8. The method according to claim 1 comprising receiving, by the translator, translation information for translating virtual pathnames to block level volumes. 9. A non-transitory computer readable medium that stores instructions that once executed by a storage system cause the storage system to:
receive a file level command that was sent through a network attached storage (NAS) interface of the storage system and is associated with a virtual pathname that is indicative that the file level command is aimed to a given block level volume and not to a file of a file system; translate the file level command to a block level command for accessing the given block level volume; access the given block level volume to provide a block level response; convert the block level response to a file level response; and send to the file level client the file level response. 10. The non-transitory computer readable medium according to claim 9 wherein at least a portion of the block level volume was written in a response to a reception of a block level write command received via a storage access network (SAN) interface of the storage system. 11. The non-transitory computer readable medium according to claim 9 that stores instructions for:
receiving via a storage access network (SAN) interface of the storage system a block level command from a block level client for accessing the given block level volume;
accessing, by the storage system, the given block level volume to provide a block level response; and
sending to the block level client the block level response. 12. The non-transitory computer readable medium according to claim 9 wherein the receiving of the file level command is followed by forwarding the file level command to a translator of the storage system for translating the file level command to the block level command for accessing the given block level volume. 13. The non-transitory computer readable medium according to claim 9 wherein the receiving of the file level command is preceded by performing a loopback mount command for mounting the file. 14. The non-transitory computer readable medium according to claim 9 wherein the translating of the file level command to the block level command comprises accessing a lookup table for providing, in response to the virtual pathname, a volume identifier of the block level volume. 15. The non-transitory computer readable medium according to claim 9 wherein the translating of the file level command to the block level command comprises applying a predefined function for providing, in response to the virtual pathname, a volume identifier of the block level volume. 16. The non-transitory computer readable medium according to claim 9 that stores instructions for receiving by the translator translation information for translating virtual pathnames to block level volumes. 17. A storage system that comprises a network attached storage (NAS) interface, a translator and storage units that store multiple block level volumes;
wherein the NAS interface is configured to receive a file level command that is associated with a virtual pathname that is indicative that the file level command is aimed to a given block level volume and not to a file of a file system; wherein the translator is configured to translate the file level command to a block level command for accessing the given block level volume, to access the given block level volume, to receive a block level response and to convert the block level response to a file level response; and wherein the NAS interface is configured to send to the file level client the file level response. 18. The storage system according to claim 17 further comprising a storage access network (SAN) interface; wherein at least a portion of the block level volume was written in a response to a reception of a block level write command received via the SAN interface. 19. The storage system according to claim 17 further comprising a storage access network (SAN) interface; wherein the SAN interface is configured to receive a block level command from a block level client for accessing the given block level volume; wherein the controller is configured to access the given block level volume to provide a block level response; and wherein the SAN interface is configured to send to the block level client the block level response. 20. The storage system according to claim 17 wherein the SAN interface is configured to forward the file level command to the translator. 21. The storage system according to claim 17 wherein the translator is configured to access a lookup table for providing, in response to the virtual pathname, a volume identifier of the block level volume. 22. The storage system according to claim 17 wherein the translator is configured to translate the file level command to the block level command by applying a predefined function for providing, in response to the virtual pathname, a volume identifier of the block level volume. 23. The storage system according to claim 17 wherein the translator is configured to receive translation information for translating virtual pathnames to block level volumes. | A method for accessing a block level volume by a file level client, the method may include receiving, by a network attached storage (NAS) interface of a storage system, a file level command that is associated with a virtual pathname that is indicative that the file level command is aimed to a given block level volume and not to a file of a file system; translating, by the storage system, the file level command to a block level command for accessing the given block level volume; accessing, by the storage system, the given block level volume to provide a block level response; converting, by the storage system, the block level response to a file level response; and sending to the file level client the file level response1. A method for accessing a block level volume by a file level client, the method comprises:
receiving, by a network attached storage (NAS) interface of a storage system, a file level command that is associated with a virtual pathname that is indicative that the file level command is aimed to a given block level volume and not to a file of a file system; translating, by the storage system, the file level command to a block level command for accessing the given block level volume; accessing, by the storage system, the given block level volume to provide a block level response; converting, by the storage system, the block level response to a file level response; and sending to the file level client the file level response. 2. The method according to claim 1 wherein at least a portion of the block level volume was written in a response to a reception of a block level write command received via a storage access network (SAN) interface of the storage system. 3. The method according to claim 1 comprising receiving via a storage access network (SAN) interface of the storage system a block level command from a block level client for accessing the given block level volume; accessing, by the storage system, the given block level volume to provide a block level response; and sending to the block level client the block level response. 4. The method according to claim 1 wherein the receiving of the file level command is followed by forwarding the file level command to a translator of the storage system for translating the file level command to the block level command for accessing the given block level volume. 5. The method according to claim 1 wherein the receiving of the file level command is preceded by performing a loopback mount command for mounting the file. 6. The method according to claim 1 wherein the translating of the file level command to the block level command comprises accessing a lookup table for providing, in response to the virtual pathname, a volume identifier of the block level volume. 7. The method according to claim 1 wherein the translating of the file level command to the block level command comprises applying a predefined function for providing, in response to the virtual pathname, a volume identifier of the block level volume. 8. The method according to claim 1 comprising receiving, by the translator, translation information for translating virtual pathnames to block level volumes. 9. A non-transitory computer readable medium that stores instructions that once executed by a storage system cause the storage system to:
receive a file level command that was sent through a network attached storage (NAS) interface of the storage system and is associated with a virtual pathname that is indicative that the file level command is aimed to a given block level volume and not to a file of a file system; translate the file level command to a block level command for accessing the given block level volume; access the given block level volume to provide a block level response; convert the block level response to a file level response; and send to the file level client the file level response. 10. The non-transitory computer readable medium according to claim 9 wherein at least a portion of the block level volume was written in a response to a reception of a block level write command received via a storage access network (SAN) interface of the storage system. 11. The non-transitory computer readable medium according to claim 9 that stores instructions for:
receiving via a storage access network (SAN) interface of the storage system a block level command from a block level client for accessing the given block level volume;
accessing, by the storage system, the given block level volume to provide a block level response; and
sending to the block level client the block level response. 12. The non-transitory computer readable medium according to claim 9 wherein the receiving of the file level command is followed by forwarding the file level command to a translator of the storage system for translating the file level command to the block level command for accessing the given block level volume. 13. The non-transitory computer readable medium according to claim 9 wherein the receiving of the file level command is preceded by performing a loopback mount command for mounting the file. 14. The non-transitory computer readable medium according to claim 9 wherein the translating of the file level command to the block level command comprises accessing a lookup table for providing, in response to the virtual pathname, a volume identifier of the block level volume. 15. The non-transitory computer readable medium according to claim 9 wherein the translating of the file level command to the block level command comprises applying a predefined function for providing, in response to the virtual pathname, a volume identifier of the block level volume. 16. The non-transitory computer readable medium according to claim 9 that stores instructions for receiving by the translator translation information for translating virtual pathnames to block level volumes. 17. A storage system that comprises a network attached storage (NAS) interface, a translator and storage units that store multiple block level volumes;
wherein the NAS interface is configured to receive a file level command that is associated with a virtual pathname that is indicative that the file level command is aimed to a given block level volume and not to a file of a file system; wherein the translator is configured to translate the file level command to a block level command for accessing the given block level volume, to access the given block level volume, to receive a block level response and to convert the block level response to a file level response; and wherein the NAS interface is configured to send to the file level client the file level response. 18. The storage system according to claim 17 further comprising a storage access network (SAN) interface; wherein at least a portion of the block level volume was written in a response to a reception of a block level write command received via the SAN interface. 19. The storage system according to claim 17 further comprising a storage access network (SAN) interface; wherein the SAN interface is configured to receive a block level command from a block level client for accessing the given block level volume; wherein the controller is configured to access the given block level volume to provide a block level response; and wherein the SAN interface is configured to send to the block level client the block level response. 20. The storage system according to claim 17 wherein the SAN interface is configured to forward the file level command to the translator. 21. The storage system according to claim 17 wherein the translator is configured to access a lookup table for providing, in response to the virtual pathname, a volume identifier of the block level volume. 22. The storage system according to claim 17 wherein the translator is configured to translate the file level command to the block level command by applying a predefined function for providing, in response to the virtual pathname, a volume identifier of the block level volume. 23. The storage system according to claim 17 wherein the translator is configured to receive translation information for translating virtual pathnames to block level volumes. | 2,100 |
5,710 | 5,710 | 14,676,466 | 2,117 | A system and method of conditioning air within a multi-zone system using a controller in communication with at least one sensor located within at least one of a plurality of zones, the method comprising the steps of: operating the at least one sensor to measure at least one environmental condition within at least one of the plurality of zones, identifying which, if any, of the plurality of zones is occupied, determining whether a demand condition exists within at least one occupied zone, calculating the difference between an actual environmental condition and a desired environmental condition within the plurality of zones to create a zone demand value if a demand condition exists in two or more occupied zones, and determining whether a cumulative zone demand value is equal to a zone balance point value. | 1. An HVAC control system comprising:
a plurality of sensors, each of the plurality of sensors capable of sensing at least one environmental condition in an associated HVAC zone; and a controller, configured to receive sensed environmental conditions from the plurality of sensors; and further configured to control an HVAC unit associated with at least two HVAC zones based on the sensed environmental signals from those at least two HVAC zones. 2. The HVAC control system of claim 1, wherein the HVAC unit is a single HVAC unit. 3. The HVAC control system of claim 1, wherein the controller is configured to control a heating unit and a cooling unit associated with the at least two HVAC zones. 4. The HVAC control system of claim 1, wherein the controller is configured to control the HVAC unit further based on a user customizable control algorithm. 5. A method of conditioning air within a multi-zone system using a controller in communication with at least one sensor located within at least one of a plurality of zones, the method comprising the steps of:
operating the at least one sensor to measure at least one environmental condition within at least one of the plurality of zones; identifying which, if any, of the plurality of zones is occupied; determining whether a demand condition exists within at least one occupied zone; calculating the difference between an actual environmental condition and a desired environmental condition within the plurality of zones to create a zone demand value if a demand condition exists in two or more occupied zones; and determining whether a cumulative zone demand value is equal to a zone balance point value. 6. The method of claim 5, wherein the zone balance point value is adjustable. 7. The method of claim 6, wherein the zone balance point comprises a temperature. 8. The method of claim 7, wherein the zone balance point comprises a value between approximately −3°-+3° F. 9. The method of claim 5, wherein the cumulative zone demand value is equal to the sum of each zone demand value. 10. The method of claim 5, further comprising operating at least one HVAC component to condition air if it determined that the cumulative zone demand value is not equal to the zone balance point value. 11. The method of claim 10, wherein operating the at least one HVAC component to condition air comprises operating in a mode selected from the group consisting of: heating and cooling. 12. The method of claim 5, further comprising stopping operation of the at least one HVAC component to condition air if it is determined that the cumulative zone demand value is equal to the zone balance point value. 13. The method of claim 5, further comprising operating at least one HVAC component in a continuous fan mode if it is determined that the cumulative zone demand value is equal to the zone balance point value. 14. The method of claim 5 further comprising determining whether an over-condition limit has been reached within at least one of the plurality of zones. 15. The method of claim 14, further comprising operating the at least one HVAC component in a continuous fan mode if it is determined that the over-condition limit has been reached within at least one of the plurality of zones. 16. A method of conditioning air within a multi-zone system using a controller in communication with at least one sensor located within at least one of a plurality of zones, the method comprising the steps of:
operating the at least one of the sensors to measure at least one environmental condition within at least one of the plurality of zones; identifying which, if any, of the plurality of zones is occupied; determining whether a demand condition exists within at least one occupied zone; operating a least one HVAC component to condition air if the demand condition exists in one occupied zone; determining whether the demand condition has been satisfied; and determining whether an over-condition limit has been reached within at least one of the plurality of zones. 17. The method of claim 16, wherein operating the at least one HVAC component to condition air comprises operating in a mode selected from the group consisting of: heating and cooling. 18. The method of claim 16, further comprising stopping operation of the at least one HVAC component to condition air if it is determined that the demand condition has been satisfied. 19. The method of claim 16, further comprising operating the at least one HVAC component in a continuous fan mode if it is determined that the over-condition limit has been reached within at least one of the plurality of zones. 20. An HVAC system configured to condition air within a multi-zone system, the HVAC system comprising:
at least one HVAC component; at least one controller in communication with the at least one HVAC component; and at least one sensor located within at least one of a plurality of zones, wherein the at least one sensor is in communication with the controller; wherein the at least one sensor is configured to measure at least one environmental condition within at least one of the plurality of zones. wherein the controller is configured to receive the at least one environmental condition from the at least one sensor, identify which, if any, of the plurality of zones is occupied, determine whether a demand condition exists within at least one occupied zone, calculate the difference between an actual environmental condition and a desired environmental condition within the plurality of zones to create a zone demand value if a demand condition exists in two or more occupied zones, and determine whether a cumulative zone demand value is equal to a zone balance point value. 21. The HVAC system of claim 20, wherein the zone balance point value is adjustable. 22. The HVAC system of claim 21, wherein the zone balance point comprises a temperature. 23. The HVAC system of claim 22, wherein the zone balance point comprises a value between approximately −3° to +3° F. 24. The HVAC system of claim 20, wherein the cumulative zone demand value is equal to the sum of each zone demand value. 25. The HVAC system of claim 20, wherein the controller is further configured to command the at least one HVAC component to condition air if it determined that the cumulative zone demand value is not equal to the zone balance point value. 26. The HVAC system of claim 25, wherein the at least one HVAC component operates to condition air by operating in a mode selected from the group consisting of: heating and cooling. 27. The HVAC system of claim 20, wherein the controller is further configured to stop operation of the at least one HVAC component to condition air if it is determined that the cumulative zone demand value is equal to the zone balance point value. 28. The HVAC system of claim 20, wherein the controller is further configured to command the at least one HVAC component to operate in a continuous fan mode if it is determined that the cumulative zone demand value is equal to the zone balance point value. 29. The HVAC system of claim 20, wherein the controller is further configured to operate the a least one HVAC component to condition air if a demand condition exists in one occupied zone, determine whether the demand condition has been satisfied within the one occupied zone, and determine whether an over-condition limit has been reached within at least one of the plurality of zones. 30. The HVAC system of claim 29, wherein the at least one HVAC component operates to condition air by operating in a mode selected from the group consisting of: heating and cooling. 31. The HVAC system of claim 29, wherein the controller is further configured to command the at least one HVAC component to stop operating to condition air if it is determined that the demand condition has been satisfied. 32. The HVAC system of claim 29, wherein the controller is further configured to command the at least one HVAC component to operate in a continuous fan mode if it is determined that the over-condition limit has been reached within at least one of the plurality of zones designated. | A system and method of conditioning air within a multi-zone system using a controller in communication with at least one sensor located within at least one of a plurality of zones, the method comprising the steps of: operating the at least one sensor to measure at least one environmental condition within at least one of the plurality of zones, identifying which, if any, of the plurality of zones is occupied, determining whether a demand condition exists within at least one occupied zone, calculating the difference between an actual environmental condition and a desired environmental condition within the plurality of zones to create a zone demand value if a demand condition exists in two or more occupied zones, and determining whether a cumulative zone demand value is equal to a zone balance point value.1. An HVAC control system comprising:
a plurality of sensors, each of the plurality of sensors capable of sensing at least one environmental condition in an associated HVAC zone; and a controller, configured to receive sensed environmental conditions from the plurality of sensors; and further configured to control an HVAC unit associated with at least two HVAC zones based on the sensed environmental signals from those at least two HVAC zones. 2. The HVAC control system of claim 1, wherein the HVAC unit is a single HVAC unit. 3. The HVAC control system of claim 1, wherein the controller is configured to control a heating unit and a cooling unit associated with the at least two HVAC zones. 4. The HVAC control system of claim 1, wherein the controller is configured to control the HVAC unit further based on a user customizable control algorithm. 5. A method of conditioning air within a multi-zone system using a controller in communication with at least one sensor located within at least one of a plurality of zones, the method comprising the steps of:
operating the at least one sensor to measure at least one environmental condition within at least one of the plurality of zones; identifying which, if any, of the plurality of zones is occupied; determining whether a demand condition exists within at least one occupied zone; calculating the difference between an actual environmental condition and a desired environmental condition within the plurality of zones to create a zone demand value if a demand condition exists in two or more occupied zones; and determining whether a cumulative zone demand value is equal to a zone balance point value. 6. The method of claim 5, wherein the zone balance point value is adjustable. 7. The method of claim 6, wherein the zone balance point comprises a temperature. 8. The method of claim 7, wherein the zone balance point comprises a value between approximately −3°-+3° F. 9. The method of claim 5, wherein the cumulative zone demand value is equal to the sum of each zone demand value. 10. The method of claim 5, further comprising operating at least one HVAC component to condition air if it determined that the cumulative zone demand value is not equal to the zone balance point value. 11. The method of claim 10, wherein operating the at least one HVAC component to condition air comprises operating in a mode selected from the group consisting of: heating and cooling. 12. The method of claim 5, further comprising stopping operation of the at least one HVAC component to condition air if it is determined that the cumulative zone demand value is equal to the zone balance point value. 13. The method of claim 5, further comprising operating at least one HVAC component in a continuous fan mode if it is determined that the cumulative zone demand value is equal to the zone balance point value. 14. The method of claim 5 further comprising determining whether an over-condition limit has been reached within at least one of the plurality of zones. 15. The method of claim 14, further comprising operating the at least one HVAC component in a continuous fan mode if it is determined that the over-condition limit has been reached within at least one of the plurality of zones. 16. A method of conditioning air within a multi-zone system using a controller in communication with at least one sensor located within at least one of a plurality of zones, the method comprising the steps of:
operating the at least one of the sensors to measure at least one environmental condition within at least one of the plurality of zones; identifying which, if any, of the plurality of zones is occupied; determining whether a demand condition exists within at least one occupied zone; operating a least one HVAC component to condition air if the demand condition exists in one occupied zone; determining whether the demand condition has been satisfied; and determining whether an over-condition limit has been reached within at least one of the plurality of zones. 17. The method of claim 16, wherein operating the at least one HVAC component to condition air comprises operating in a mode selected from the group consisting of: heating and cooling. 18. The method of claim 16, further comprising stopping operation of the at least one HVAC component to condition air if it is determined that the demand condition has been satisfied. 19. The method of claim 16, further comprising operating the at least one HVAC component in a continuous fan mode if it is determined that the over-condition limit has been reached within at least one of the plurality of zones. 20. An HVAC system configured to condition air within a multi-zone system, the HVAC system comprising:
at least one HVAC component; at least one controller in communication with the at least one HVAC component; and at least one sensor located within at least one of a plurality of zones, wherein the at least one sensor is in communication with the controller; wherein the at least one sensor is configured to measure at least one environmental condition within at least one of the plurality of zones. wherein the controller is configured to receive the at least one environmental condition from the at least one sensor, identify which, if any, of the plurality of zones is occupied, determine whether a demand condition exists within at least one occupied zone, calculate the difference between an actual environmental condition and a desired environmental condition within the plurality of zones to create a zone demand value if a demand condition exists in two or more occupied zones, and determine whether a cumulative zone demand value is equal to a zone balance point value. 21. The HVAC system of claim 20, wherein the zone balance point value is adjustable. 22. The HVAC system of claim 21, wherein the zone balance point comprises a temperature. 23. The HVAC system of claim 22, wherein the zone balance point comprises a value between approximately −3° to +3° F. 24. The HVAC system of claim 20, wherein the cumulative zone demand value is equal to the sum of each zone demand value. 25. The HVAC system of claim 20, wherein the controller is further configured to command the at least one HVAC component to condition air if it determined that the cumulative zone demand value is not equal to the zone balance point value. 26. The HVAC system of claim 25, wherein the at least one HVAC component operates to condition air by operating in a mode selected from the group consisting of: heating and cooling. 27. The HVAC system of claim 20, wherein the controller is further configured to stop operation of the at least one HVAC component to condition air if it is determined that the cumulative zone demand value is equal to the zone balance point value. 28. The HVAC system of claim 20, wherein the controller is further configured to command the at least one HVAC component to operate in a continuous fan mode if it is determined that the cumulative zone demand value is equal to the zone balance point value. 29. The HVAC system of claim 20, wherein the controller is further configured to operate the a least one HVAC component to condition air if a demand condition exists in one occupied zone, determine whether the demand condition has been satisfied within the one occupied zone, and determine whether an over-condition limit has been reached within at least one of the plurality of zones. 30. The HVAC system of claim 29, wherein the at least one HVAC component operates to condition air by operating in a mode selected from the group consisting of: heating and cooling. 31. The HVAC system of claim 29, wherein the controller is further configured to command the at least one HVAC component to stop operating to condition air if it is determined that the demand condition has been satisfied. 32. The HVAC system of claim 29, wherein the controller is further configured to command the at least one HVAC component to operate in a continuous fan mode if it is determined that the over-condition limit has been reached within at least one of the plurality of zones designated. | 2,100 |
5,711 | 5,711 | 15,873,089 | 2,182 | In one embodiment, the present invention includes a processor that has an on-die storage such as a static random access memory to store an architectural state of one or more threads that are swapped out of architectural state storage of the processor on entry to a system management mode (SMM). In this way communication of this state information to a system management memory can be avoided, reducing latency associated with entry into SMM. Embodiments may also enable the processor to update a status of executing agents that are either in a long instruction flow or in a system management interrupt (SMI) blocked state, in order to provide an indication to agents inside the SMM. Other embodiments are described and claimed. | 1. A processor comprising:
a plurality of cores formed on a single semiconductor die; decode circuitry of at least one core to decode instructions of one or more threads; execution circuitry of the at least one core to perform out-of-order execution of the instructions of the one or more threads; the execution circuitry to execute system management mode (SMM) handler code from a designated system memory address region to perform system management operations in response to a system management interrupt (SMI); save/restore circuitry to save at least a portion of a first execution state of a first thread to a cache prior to entering the SMM; and the execution circuitry to execute a resume instruction included in the SMM handler code to cause the save/restore circuitry to restore the at least a portion of the first execution state from the cache upon exiting the SMM; wherein the processor does not invalidate the cache responsive to entering or existing the 2. The processor of claim 1 wherein the portion of the first execution state of the first thread is to be saved in cache lines which map to a system management random access memory (SMRAM) address region. 3. The processor of claim 1 wherein the designated system memory address region maps to a system management random access memory (SMRAM). 4. The processor of claim 1 further comprising:
fetch circuitry to fetch the instructions of the one or more threads. 5. The processor of claim 1 further comprising:
an integrated memory controller to couple the plurality of cores to a system memory. 6. The processor of claim 1 further comprising:
a last level cache (LLC) shared by the plurality of cores. 7. A method comprising:
executing, in execution circuitry of a processor, system management mode (SMM) handler code from a designated system memory address region to perform system management operations in response to a system management interrupt (SMI), the processor including a plurality of cores formed on a single semiconductor die; saving, by save/restore circuitry, of the processor, at least a portion of a first execution state of a first thread to a cache of the processor prior to entering the SMM; and executing, in the execution circuitry, a resume instruction included in the SMM handler code to cause the save/restore circuitry to restore the at least a portion of the first execution state from the cache upon exiting the SMM, and not invalidating the cache responsive to entering or exiting the SMM. 8. The method of claim 7 further comprising saving the portion of the first execution state of the first thread in cache lines which map to a system management random access memory (SRAM) address region. 9. The method of claim 7 wherein the designated system memory address region maps to a system management random access memory (SMRAM). 10. The method of claim 7 further comprising fetching, via fetch circuitry of the processor, instructions of one or more threads. 11. The method of claim 7 further comprising coupling, via an integrated memory controller of the processor, the plurality of cores to a system memory. 12. The method of claim 7 further comprising sharing a last level cache (LLC) of the processor by the plurality of cores. 13. At least one computer readable storage medium comprising instructions that when executed enable a system to:
execute, in execution circuitry of a processor, system management mode (SMM) handler code from a designated system memory address region to perform system management operations in response to a system management interrupt (SMI), the processor including a plurality of cores formed on a single semiconductor die; save, by save/restore circuitry, of the processor, at least a portion of a first execution state of a first thread to a cache of the processor prior to entry into the SMM; and execute, in the execution circuitry, a resume instruction included in the SMM handler code to cause the save/restore circuitry to restore the at least a portion of the first execution state from the cache upon exit the SMM, and wherein the cache is not invalidated responsive to entry into or exit from the SMM. 14. The at least one computer readable storage medium of claim 13 further comprising instructions that when executed enable the system to save the portion of the first execution state of the first thread in cache lines which map to a system management random access memory (SRAM) address region. 15. The at least one computer readable storage medium of claim 13 wherein the designated system memory address region is to map to a system management random access memory (SMRAM). 16. The at least one computer readable storage medium of claim 13 further comprising instructions that when executed enable the system to fetch, via fetch circuitry of the processor, instructions of one or more threads. | In one embodiment, the present invention includes a processor that has an on-die storage such as a static random access memory to store an architectural state of one or more threads that are swapped out of architectural state storage of the processor on entry to a system management mode (SMM). In this way communication of this state information to a system management memory can be avoided, reducing latency associated with entry into SMM. Embodiments may also enable the processor to update a status of executing agents that are either in a long instruction flow or in a system management interrupt (SMI) blocked state, in order to provide an indication to agents inside the SMM. Other embodiments are described and claimed.1. A processor comprising:
a plurality of cores formed on a single semiconductor die; decode circuitry of at least one core to decode instructions of one or more threads; execution circuitry of the at least one core to perform out-of-order execution of the instructions of the one or more threads; the execution circuitry to execute system management mode (SMM) handler code from a designated system memory address region to perform system management operations in response to a system management interrupt (SMI); save/restore circuitry to save at least a portion of a first execution state of a first thread to a cache prior to entering the SMM; and the execution circuitry to execute a resume instruction included in the SMM handler code to cause the save/restore circuitry to restore the at least a portion of the first execution state from the cache upon exiting the SMM; wherein the processor does not invalidate the cache responsive to entering or existing the 2. The processor of claim 1 wherein the portion of the first execution state of the first thread is to be saved in cache lines which map to a system management random access memory (SMRAM) address region. 3. The processor of claim 1 wherein the designated system memory address region maps to a system management random access memory (SMRAM). 4. The processor of claim 1 further comprising:
fetch circuitry to fetch the instructions of the one or more threads. 5. The processor of claim 1 further comprising:
an integrated memory controller to couple the plurality of cores to a system memory. 6. The processor of claim 1 further comprising:
a last level cache (LLC) shared by the plurality of cores. 7. A method comprising:
executing, in execution circuitry of a processor, system management mode (SMM) handler code from a designated system memory address region to perform system management operations in response to a system management interrupt (SMI), the processor including a plurality of cores formed on a single semiconductor die; saving, by save/restore circuitry, of the processor, at least a portion of a first execution state of a first thread to a cache of the processor prior to entering the SMM; and executing, in the execution circuitry, a resume instruction included in the SMM handler code to cause the save/restore circuitry to restore the at least a portion of the first execution state from the cache upon exiting the SMM, and not invalidating the cache responsive to entering or exiting the SMM. 8. The method of claim 7 further comprising saving the portion of the first execution state of the first thread in cache lines which map to a system management random access memory (SRAM) address region. 9. The method of claim 7 wherein the designated system memory address region maps to a system management random access memory (SMRAM). 10. The method of claim 7 further comprising fetching, via fetch circuitry of the processor, instructions of one or more threads. 11. The method of claim 7 further comprising coupling, via an integrated memory controller of the processor, the plurality of cores to a system memory. 12. The method of claim 7 further comprising sharing a last level cache (LLC) of the processor by the plurality of cores. 13. At least one computer readable storage medium comprising instructions that when executed enable a system to:
execute, in execution circuitry of a processor, system management mode (SMM) handler code from a designated system memory address region to perform system management operations in response to a system management interrupt (SMI), the processor including a plurality of cores formed on a single semiconductor die; save, by save/restore circuitry, of the processor, at least a portion of a first execution state of a first thread to a cache of the processor prior to entry into the SMM; and execute, in the execution circuitry, a resume instruction included in the SMM handler code to cause the save/restore circuitry to restore the at least a portion of the first execution state from the cache upon exit the SMM, and wherein the cache is not invalidated responsive to entry into or exit from the SMM. 14. The at least one computer readable storage medium of claim 13 further comprising instructions that when executed enable the system to save the portion of the first execution state of the first thread in cache lines which map to a system management random access memory (SRAM) address region. 15. The at least one computer readable storage medium of claim 13 wherein the designated system memory address region is to map to a system management random access memory (SMRAM). 16. The at least one computer readable storage medium of claim 13 further comprising instructions that when executed enable the system to fetch, via fetch circuitry of the processor, instructions of one or more threads. | 2,100 |
5,712 | 5,712 | 14,813,002 | 2,196 | A wearable computing device includes a device body, a band coupled to the device body, and one or more sensors. The device body includes one or more processors, a memory, and a touch-sensitive display. The processors are operable to authenticate, using the one or more sensors, a user of the device, and communicate with one or more target devices in response to successful authentication of the user. The processors can also authenticate the target devices, and control the target devices in response to successful authentication of the target devices. The sensors may include a camera, and to authenticate the user of the device, the processors may send a request to one or more remote devices requesting display of a pairing visual, receive an image from the camera, determine whether the image comprises valid pairing information, and if so, establish a pairing between the device and the remote devices. | 1. An apparatus comprising:
a wearable computing device comprising a device body, a band coupled to the device body, and one or more sensors, wherein the device body comprises one or more processors, a memory, and a touch-sensitive display, and the memory is coupled to the one or more processors and comprises instructions executable by the processors, the processors being operable when executing the instructions to:
authenticate, using the one or more sensors, a user of the device; and
communicate with one or more target devices in response to successful authentication of the user. 2. The apparatus of claim 1, wherein the device body comprises:
a rotatable element about the touch-sensitive display; and the one or more sensors comprise a rotation detector configured to detect rotation of the rotatable element, wherein authentication is successful when a predetermined code is received by the rotation sensor. 3. The apparatus of claim 2, wherein the rotation detector comprises an optical sensor in or on the band. 4. The apparatus of claim 2, wherein:
the touch-sensitive display is substantially circular; and the rotatable element is a substantially circular ring about the touch-sensitive display. 5. The apparatus of claim 1, wherein the one or more sensors comprise a camera, and to authenticate the user of the device, the processors are operable when executing the instructions to:
send a request to one or more remote devices requesting display of a pairing visual; receive an image from the camera; determine whether the image comprises valid pairing information; and establish a pairing between the device and the one or more remote devices when the image comprises valid pairing information. 6. The apparatus of claim 1, wherein the one or more sensors comprise an accelerometer, and to authenticate the user of the device, the processors are operable when executing the instructions to:
send a request to one or more remote devices requesting the devices to generate a vibration pattern; receive acceleration data from the accelerometer; determine whether the acceleration data comprises valid pairing information; and establish a pairing between the device and the one or more remote devices when the acceleration data comprises valid pairing information. 7. The apparatus of claim 1, wherein the one or more sensors comprise a biometric sensor and a Near-Field Communication (NFC) sensor, the processors being further operable when executing the instructions to:
receive a request from the user to make a purchase; scan, using the biometric scanner, the user wearing the device in response to the NFC sensor scanning an NFC tag; receive sensor data generated by the scan from the biometric scanner; determine whether the received sensor data matches a stored imprint associated with the user, wherein the stored imprint is stored in secure storage of the device; and notify an NFC payment processor of payment acceptance when the received sensor data matches the stored imprint. 8. The apparatus of claim 1, wherein the processors are further operable when executing the instructions to:
authenticate the one or more target devices; and control the one or more target devices in response to successful authentication of the one or more target devices. 9. The apparatus of claim 8, wherein the one or more sensors comprise a camera, and to authenticate the one or more target devices, the processors are operable when executing the instructions to:
send a request to the one or more target devices requesting display of a pairing visual; receive an image from the camera; determine whether the image comprises valid pairing information; and establish a pairing between the device and the one or more target devices when the image comprises valid pairing information. 10. A method comprising:
authenticating, using one or more sensors of a wearable computing device, a user of the wearable device; and communicating with one or more target devices in response to successful authentication of the user. 11. The method of claim 10, further comprising:
detecting rotation of a rotatable element about a touch-sensitive display of the wearable computing device, wherein authentication is successful when the rotation corresponds to a predetermined code. 12. The method of claim 10, wherein the one or more sensors comprise a camera, and authenticating the user of the device comprises:
sending a request to one or more remote devices requesting display of a pairing visual; receiving an image from the camera; determining whether the image comprises valid pairing information; and establishing a pairing between the device and the one or more remote devices when the image comprises valid pairing information. 13. The method of claim 10, wherein the one or more sensors comprise an accelerometer, and authenticating the user of the device comprises:
sending a request to one or more remote devices requesting the devices to generate a vibration pattern; receiving acceleration data from the accelerometer; determining whether the acceleration data comprises valid pairing information; and establishing a pairing between the device and the one or more remote devices when the acceleration data comprises valid pairing information. 14. The method of claim 10, wherein the one or more sensors comprise a biometric sensor and a Near-Field Communication (NFC) sensor, the method further comprising:
receiving a request from the user to make a purchase; scanning, using the biometric scanner, the user wearing the device in response to the NFC sensor scanning an NFC tag; receiving sensor data generated by the scan from the biometric scanner; determining whether the received sensor data matches a stored imprint associated with the user, wherein the stored imprint is stored in secure storage of the device; and notifying an NFC payment processor of payment acceptance when the received sensor data matches the stored imprint. 15. The method of claim 10, further comprising:
authenticating the one or more target devices; and controlling the one or more target devices in response to successful authentication of the one or more target devices. 16. The method of claim 15, wherein the one or more sensors comprise a camera, and authenticating the one or more target devices comprises:
sending a request to the one or more target devices requesting display of a pairing visual; receiving an image from the camera; determining whether the image comprises valid pairing information; and establishing a pairing between the device and the one or more target devices when the image comprises valid pairing information. 17. A computer-readable non-transitory storage medium embodying logic that is operable when executed to:
authenticate, using one or more sensors of a wearable computing device, a user of the wearable device, the wearable device comprising the storage medium; and communicate with one or more target devices in response to successful authentication of the user. 18. The medium of claim 17, wherein the one or more sensors comprise a camera, and to authenticate the user of the device, the logic is further operable when executed to:
send a request to one or more remote devices requesting display of a pairing visual; receive an image from the camera; determine whether the image comprises valid pairing information; and establish a pairing between the device and the one or more remote devices when the image comprises valid pairing information. 19. The medium of claim 17, wherein the one or more sensors comprise a biometric sensor and a Near-Field Communication (NFC) sensor, and the logic is further operable when executed to:
receive a request from the user to make a purchase; scan, using the biometric scanner, the user wearing the device in response to the NFC sensor scanning an NFC tag; receive sensor data generated by the scan from the biometric scanner; determine whether the received sensor data matches a stored imprint associated with the user, wherein the stored imprint is stored in secure storage of the device; and notify an NFC payment processor of payment acceptance when the received sensor data matches the stored imprint. 20. The medium of claim 17, wherein the logic is further operable when executed to:
authenticate the one or more target devices; and control the one or more target devices in response to successful authentication of the one or more target devices. | A wearable computing device includes a device body, a band coupled to the device body, and one or more sensors. The device body includes one or more processors, a memory, and a touch-sensitive display. The processors are operable to authenticate, using the one or more sensors, a user of the device, and communicate with one or more target devices in response to successful authentication of the user. The processors can also authenticate the target devices, and control the target devices in response to successful authentication of the target devices. The sensors may include a camera, and to authenticate the user of the device, the processors may send a request to one or more remote devices requesting display of a pairing visual, receive an image from the camera, determine whether the image comprises valid pairing information, and if so, establish a pairing between the device and the remote devices.1. An apparatus comprising:
a wearable computing device comprising a device body, a band coupled to the device body, and one or more sensors, wherein the device body comprises one or more processors, a memory, and a touch-sensitive display, and the memory is coupled to the one or more processors and comprises instructions executable by the processors, the processors being operable when executing the instructions to:
authenticate, using the one or more sensors, a user of the device; and
communicate with one or more target devices in response to successful authentication of the user. 2. The apparatus of claim 1, wherein the device body comprises:
a rotatable element about the touch-sensitive display; and the one or more sensors comprise a rotation detector configured to detect rotation of the rotatable element, wherein authentication is successful when a predetermined code is received by the rotation sensor. 3. The apparatus of claim 2, wherein the rotation detector comprises an optical sensor in or on the band. 4. The apparatus of claim 2, wherein:
the touch-sensitive display is substantially circular; and the rotatable element is a substantially circular ring about the touch-sensitive display. 5. The apparatus of claim 1, wherein the one or more sensors comprise a camera, and to authenticate the user of the device, the processors are operable when executing the instructions to:
send a request to one or more remote devices requesting display of a pairing visual; receive an image from the camera; determine whether the image comprises valid pairing information; and establish a pairing between the device and the one or more remote devices when the image comprises valid pairing information. 6. The apparatus of claim 1, wherein the one or more sensors comprise an accelerometer, and to authenticate the user of the device, the processors are operable when executing the instructions to:
send a request to one or more remote devices requesting the devices to generate a vibration pattern; receive acceleration data from the accelerometer; determine whether the acceleration data comprises valid pairing information; and establish a pairing between the device and the one or more remote devices when the acceleration data comprises valid pairing information. 7. The apparatus of claim 1, wherein the one or more sensors comprise a biometric sensor and a Near-Field Communication (NFC) sensor, the processors being further operable when executing the instructions to:
receive a request from the user to make a purchase; scan, using the biometric scanner, the user wearing the device in response to the NFC sensor scanning an NFC tag; receive sensor data generated by the scan from the biometric scanner; determine whether the received sensor data matches a stored imprint associated with the user, wherein the stored imprint is stored in secure storage of the device; and notify an NFC payment processor of payment acceptance when the received sensor data matches the stored imprint. 8. The apparatus of claim 1, wherein the processors are further operable when executing the instructions to:
authenticate the one or more target devices; and control the one or more target devices in response to successful authentication of the one or more target devices. 9. The apparatus of claim 8, wherein the one or more sensors comprise a camera, and to authenticate the one or more target devices, the processors are operable when executing the instructions to:
send a request to the one or more target devices requesting display of a pairing visual; receive an image from the camera; determine whether the image comprises valid pairing information; and establish a pairing between the device and the one or more target devices when the image comprises valid pairing information. 10. A method comprising:
authenticating, using one or more sensors of a wearable computing device, a user of the wearable device; and communicating with one or more target devices in response to successful authentication of the user. 11. The method of claim 10, further comprising:
detecting rotation of a rotatable element about a touch-sensitive display of the wearable computing device, wherein authentication is successful when the rotation corresponds to a predetermined code. 12. The method of claim 10, wherein the one or more sensors comprise a camera, and authenticating the user of the device comprises:
sending a request to one or more remote devices requesting display of a pairing visual; receiving an image from the camera; determining whether the image comprises valid pairing information; and establishing a pairing between the device and the one or more remote devices when the image comprises valid pairing information. 13. The method of claim 10, wherein the one or more sensors comprise an accelerometer, and authenticating the user of the device comprises:
sending a request to one or more remote devices requesting the devices to generate a vibration pattern; receiving acceleration data from the accelerometer; determining whether the acceleration data comprises valid pairing information; and establishing a pairing between the device and the one or more remote devices when the acceleration data comprises valid pairing information. 14. The method of claim 10, wherein the one or more sensors comprise a biometric sensor and a Near-Field Communication (NFC) sensor, the method further comprising:
receiving a request from the user to make a purchase; scanning, using the biometric scanner, the user wearing the device in response to the NFC sensor scanning an NFC tag; receiving sensor data generated by the scan from the biometric scanner; determining whether the received sensor data matches a stored imprint associated with the user, wherein the stored imprint is stored in secure storage of the device; and notifying an NFC payment processor of payment acceptance when the received sensor data matches the stored imprint. 15. The method of claim 10, further comprising:
authenticating the one or more target devices; and controlling the one or more target devices in response to successful authentication of the one or more target devices. 16. The method of claim 15, wherein the one or more sensors comprise a camera, and authenticating the one or more target devices comprises:
sending a request to the one or more target devices requesting display of a pairing visual; receiving an image from the camera; determining whether the image comprises valid pairing information; and establishing a pairing between the device and the one or more target devices when the image comprises valid pairing information. 17. A computer-readable non-transitory storage medium embodying logic that is operable when executed to:
authenticate, using one or more sensors of a wearable computing device, a user of the wearable device, the wearable device comprising the storage medium; and communicate with one or more target devices in response to successful authentication of the user. 18. The medium of claim 17, wherein the one or more sensors comprise a camera, and to authenticate the user of the device, the logic is further operable when executed to:
send a request to one or more remote devices requesting display of a pairing visual; receive an image from the camera; determine whether the image comprises valid pairing information; and establish a pairing between the device and the one or more remote devices when the image comprises valid pairing information. 19. The medium of claim 17, wherein the one or more sensors comprise a biometric sensor and a Near-Field Communication (NFC) sensor, and the logic is further operable when executed to:
receive a request from the user to make a purchase; scan, using the biometric scanner, the user wearing the device in response to the NFC sensor scanning an NFC tag; receive sensor data generated by the scan from the biometric scanner; determine whether the received sensor data matches a stored imprint associated with the user, wherein the stored imprint is stored in secure storage of the device; and notify an NFC payment processor of payment acceptance when the received sensor data matches the stored imprint. 20. The medium of claim 17, wherein the logic is further operable when executed to:
authenticate the one or more target devices; and control the one or more target devices in response to successful authentication of the one or more target devices. | 2,100 |
5,713 | 5,713 | 15,770,515 | 2,176 | The vocabulary of pertinent terms used to highlight/filter medical records in a text annotation system is continually updated based on user feedback. To maximize the effectiveness of this updating, feed-back is extracted from all users of the system, thereby providing a ‘group-sourced’ vocabulary of pertinent terms. As each user modifies the provided vocabulary of pertinent terms to customize the text annotation system to conform to the user's preferences, the modifications are collected and communicated to the provider of the vocabulary of pertinent terms. The provider of the vocabulary of pertinent terms assimilates the modifications implemented by each user of the word annotation system to determine whether to modify the vocabulary of pertinent terms for subsequent users of the common vocabulary of pertinent terms. | 1. A non-transitory computer readable medium that includes a program that, when executed by a processing system, causes the processing system to:
receive a vocabulary of pertinent terms from a provider that provides the vocabulary to a plurality of practitioners; receive a request from a practitioner for a patient record; process the patient record to identify pertinent terms in the patient record based on the vocabulary of pertinent terms; display the identified pertinent terms in the patient record in a distinctive manner to the practitioner; receive, from the practitioner, a selection of a displayed pertinent term, and an identification of a proposed modification to remove the selected pertinent term from the vocabulary of pertinent terms; communicate the proposed modification of the vocabulary to the provider of the vocabulary; and subsequently receiving an updated vocabulary of pertinent terms from the provider based on the proposed modification of the vocabulary by the practitioner and also based on one or more proposed modifications from the plurality of practitioners to add a new term to the vocabulary of pertinent terms, and one or more proposed modifications to remove an existing term front the vocabulary of pertinent terms. 2. The medium of claim 1, wherein the program causes the processor to:
display one or more non-pertinent terms in the patient's record, receive, from the practitioner, a selection of a displayed non-pertinent term, and an other proposed modification that the selected non-pertinent term in the patient's record should be added to in the vocabulary of pertinent terms, and communicate the other proposed modification to the provider of the vocabulary, 3. (canceled) 4. The medium of claim 1, wherein the program causes the processor to display the identified pertinent terms in a distinctive manner by displaying only the pertinent terms. 5. The medium of claim 4, wherein the program causes the processor to subsequently display an entire content of at least a portion of the patient record when the practitioner indicates selection of a display area containing the pertinent terms. 6. The medium of claim 1, wherein the program causes the processor to display the identified pertinent terms in a distinctive manner by displaying the pertinent terms using a different display format than other terms in the patient record. 7. A non-transitory computer readable medium that includes a program that, when executed by a processing system, causes the processing system to:
provide a vocabulary of pertinent terms to a plurality of text annotation systems; receive proposed modifications to the vocabulary of pertinent terms from two or more of the plurality of text annotation systems, wherein the proposed modifications include modifications that add a term to the vocabulary and modifications that remove a term from the vocabulary; assimilate the proposed modifications to the vocabulary to determine whether an update to the vocabulary of pertinent terms is warranted; updating the vocabulary of pertinent terms when the update is determined to be warranted; and providing the updated vocabulary of pertinent terms to one or more of the plurality of text annotation systems. 8. The medium of claim 7, wherein the program causes the processor to assimilate the modifications by maintaining a count of the modifications that add the term to the vocabulary of pertinent terms and the modifications that remove the term from the vocabulary. 9. The medium of claim 8, wherein the count of modifications is a weighted accumulation, wherein a first weight is applied to each modification that adds the term to the vocabulary and a second weight is applied to each modification that removes the term from the vocabulary. 10. The medium of claim 8, wherein a non-zero threshold is applied to the count of modifications to determine whether an update to the vocabulary is warranted. 11. A network of text annotation systems comprising:
a database that stores a vocabulary of pertinent terms that may be used in a medical record; a plurality of text annotation systems that each:
highlight pertinent terms in a patient's medical record based on the vocabulary of pertinent terms; and
receive proposed modifications to the vocabulary of pertinent terms by a user of the text annotation system;
a crowd-sourced knowledge module that:
provides the vocabulary of pertinent terms at the database to the plurality of text annotation systems;
receives the proposed modifications to the vocabulary of pertinent terms from the plurality of text annotation systems, wherein the proposed modifications include modifications that add a term to the vocabulary and modifications that remove a term from the vocabulary;
assimilates the proposed modifications to the vocabulary to determine whether an update to the vocabulary of pertinent terms is warranted;
updates the vocabulary of pertinent terms when the update is determined to be warranted; and
provides the updated vocabulary of pertinent terms to one or more of the plurality of text annotation systems. 12. The network of claim 11, wherein at least one of the text annotation systems displays one or more non-pertinent terms in the patient's record, and enables a user to select a non-pertinent term so as to indicate that the proposed modification is to add the select non-pertinent term to the vocabulary of pertinent terms. 13. The network of claim 11, wherein at least one of the text annotation systems enables a user to select a displayed pertinent term so as to indicate that the proposed modification is to remove the select pertinent term from the vocabulary of pertinent terms. 14. The network of claim 13, wherein the crowd-sourced knowledge module assimilates the proposed modifications by maintaining a count of the modifications that add a term to the vocabulary of pertinent terms and the modifications that remove the term from the vocabulary. 15. The network of claim 14, wherein the count of modifications is a weighted accumulation, wherein a first weight is applied to each proposed modification that adds the term to the vocabulary and a second weight is applied to each proposed modification that removes the term from the vocabulary. 16. The medium of claim 1, wherein the updated vocabulary of pertinent terms is based on a count of the modifications to add the selected pertinent term to the vocabulary of pertinent terms, and the modifications to remove the selected pertinent term from the vocabulary, 17. The medium of claim 16, wherein the count of modifications is a weighted accumulation, wherein a first weight is applied to each modification to add the selected remove the selected pertinent term from the vocabulary | The vocabulary of pertinent terms used to highlight/filter medical records in a text annotation system is continually updated based on user feedback. To maximize the effectiveness of this updating, feed-back is extracted from all users of the system, thereby providing a ‘group-sourced’ vocabulary of pertinent terms. As each user modifies the provided vocabulary of pertinent terms to customize the text annotation system to conform to the user's preferences, the modifications are collected and communicated to the provider of the vocabulary of pertinent terms. The provider of the vocabulary of pertinent terms assimilates the modifications implemented by each user of the word annotation system to determine whether to modify the vocabulary of pertinent terms for subsequent users of the common vocabulary of pertinent terms.1. A non-transitory computer readable medium that includes a program that, when executed by a processing system, causes the processing system to:
receive a vocabulary of pertinent terms from a provider that provides the vocabulary to a plurality of practitioners; receive a request from a practitioner for a patient record; process the patient record to identify pertinent terms in the patient record based on the vocabulary of pertinent terms; display the identified pertinent terms in the patient record in a distinctive manner to the practitioner; receive, from the practitioner, a selection of a displayed pertinent term, and an identification of a proposed modification to remove the selected pertinent term from the vocabulary of pertinent terms; communicate the proposed modification of the vocabulary to the provider of the vocabulary; and subsequently receiving an updated vocabulary of pertinent terms from the provider based on the proposed modification of the vocabulary by the practitioner and also based on one or more proposed modifications from the plurality of practitioners to add a new term to the vocabulary of pertinent terms, and one or more proposed modifications to remove an existing term front the vocabulary of pertinent terms. 2. The medium of claim 1, wherein the program causes the processor to:
display one or more non-pertinent terms in the patient's record, receive, from the practitioner, a selection of a displayed non-pertinent term, and an other proposed modification that the selected non-pertinent term in the patient's record should be added to in the vocabulary of pertinent terms, and communicate the other proposed modification to the provider of the vocabulary, 3. (canceled) 4. The medium of claim 1, wherein the program causes the processor to display the identified pertinent terms in a distinctive manner by displaying only the pertinent terms. 5. The medium of claim 4, wherein the program causes the processor to subsequently display an entire content of at least a portion of the patient record when the practitioner indicates selection of a display area containing the pertinent terms. 6. The medium of claim 1, wherein the program causes the processor to display the identified pertinent terms in a distinctive manner by displaying the pertinent terms using a different display format than other terms in the patient record. 7. A non-transitory computer readable medium that includes a program that, when executed by a processing system, causes the processing system to:
provide a vocabulary of pertinent terms to a plurality of text annotation systems; receive proposed modifications to the vocabulary of pertinent terms from two or more of the plurality of text annotation systems, wherein the proposed modifications include modifications that add a term to the vocabulary and modifications that remove a term from the vocabulary; assimilate the proposed modifications to the vocabulary to determine whether an update to the vocabulary of pertinent terms is warranted; updating the vocabulary of pertinent terms when the update is determined to be warranted; and providing the updated vocabulary of pertinent terms to one or more of the plurality of text annotation systems. 8. The medium of claim 7, wherein the program causes the processor to assimilate the modifications by maintaining a count of the modifications that add the term to the vocabulary of pertinent terms and the modifications that remove the term from the vocabulary. 9. The medium of claim 8, wherein the count of modifications is a weighted accumulation, wherein a first weight is applied to each modification that adds the term to the vocabulary and a second weight is applied to each modification that removes the term from the vocabulary. 10. The medium of claim 8, wherein a non-zero threshold is applied to the count of modifications to determine whether an update to the vocabulary is warranted. 11. A network of text annotation systems comprising:
a database that stores a vocabulary of pertinent terms that may be used in a medical record; a plurality of text annotation systems that each:
highlight pertinent terms in a patient's medical record based on the vocabulary of pertinent terms; and
receive proposed modifications to the vocabulary of pertinent terms by a user of the text annotation system;
a crowd-sourced knowledge module that:
provides the vocabulary of pertinent terms at the database to the plurality of text annotation systems;
receives the proposed modifications to the vocabulary of pertinent terms from the plurality of text annotation systems, wherein the proposed modifications include modifications that add a term to the vocabulary and modifications that remove a term from the vocabulary;
assimilates the proposed modifications to the vocabulary to determine whether an update to the vocabulary of pertinent terms is warranted;
updates the vocabulary of pertinent terms when the update is determined to be warranted; and
provides the updated vocabulary of pertinent terms to one or more of the plurality of text annotation systems. 12. The network of claim 11, wherein at least one of the text annotation systems displays one or more non-pertinent terms in the patient's record, and enables a user to select a non-pertinent term so as to indicate that the proposed modification is to add the select non-pertinent term to the vocabulary of pertinent terms. 13. The network of claim 11, wherein at least one of the text annotation systems enables a user to select a displayed pertinent term so as to indicate that the proposed modification is to remove the select pertinent term from the vocabulary of pertinent terms. 14. The network of claim 13, wherein the crowd-sourced knowledge module assimilates the proposed modifications by maintaining a count of the modifications that add a term to the vocabulary of pertinent terms and the modifications that remove the term from the vocabulary. 15. The network of claim 14, wherein the count of modifications is a weighted accumulation, wherein a first weight is applied to each proposed modification that adds the term to the vocabulary and a second weight is applied to each proposed modification that removes the term from the vocabulary. 16. The medium of claim 1, wherein the updated vocabulary of pertinent terms is based on a count of the modifications to add the selected pertinent term to the vocabulary of pertinent terms, and the modifications to remove the selected pertinent term from the vocabulary, 17. The medium of claim 16, wherein the count of modifications is a weighted accumulation, wherein a first weight is applied to each modification to add the selected remove the selected pertinent term from the vocabulary | 2,100 |
5,714 | 5,714 | 15,316,665 | 2,199 | The invention relates to a method for operating a control device of a motor vehicle during a park phase, wherein in the method a transmitted ignition-off signal for initiating the park phase is received in the motor vehicle by the control unit and at least one electronic component of the control unit is switched off. The object of the invention is to carry out an update of the operating software of a control unit without an interruption of the operation of the control unit that is disruptive for the user of the motor vehicle. After receiving the ignition-off signal, a processor core and a memory storage unit in the control unit, in which the operating software is stored, continue to operate. The update is then carried out during the park phase by the processor core on the basis of update data. | 1-13. (canceled) 14. A method for operating a control unit of a motor vehicle during a parking phase in which an ignition of the motor vehicle is switched off to disable devices of the motor vehicle, the method comprising:
receiving, by the control unit, an ignition-off signal for initiating the parking phase in the motor vehicle; switching off at least one electronic component of the control unit after receiving the ignition-off signal; operating, in the control unit during the parking phase, a processor core and a memory storage unit, in which is stored operating software provided for the operation of the control unit when the ignition is on, to carry out an update of the operating software via the processor core based on update data; switching off, via an integrated circuit of a System-on-a-Chip, peripherals of the processor core and a memory controller of the memory storage unit not needed for the update as a function of the ignition-off signal; activating a power controller of the control unit to stop the update, wherein the power controller is configured to control the energy usage of the control unit and switch off the processor core and the memory storage unit, wherein the control unit has device electronics which comprise a circuit board on which are arranged electronic components necessary for the operation of the control unit, wherein the device electronics are divided into a first power domain and a second power domain, wherein each of the first and second power domains is linked by a respective electrical supply line via the power controller to a supply connection of the control unit, wherein the processor core and the memory storage unit are assigned to the first power domain and the at least one electronic component is assigned to the second power domain, and wherein upon receiving the ignition-off signal, the second power domain is electrically isolated from the supply connection via the power controller and the first power domain continues to be supplied with voltage. 15. The method of claim 1, wherein operating, in the control unit during the parking phase, the processor core and the memory storage unit further comprises:
operating the processor core and the memory storage using power supplied by a battery of the motor vehicle. 16. The method of claim 1, wherein the processor core and the memory controller of the memory storage unit are implemented via the integrated circuit having a variable clock rate and the clock rate is reduced as a function of the ignition off signal. 17. The method of claim 1, wherein when the ignition is on preceding the parking phase, at least one part of the update data is received over a transmission connection from outside the motor vehicle or from a portable device attached to the control unit and is stored in the memory storage unit. 18. The method of claim 1, wherein at least one part of the update data is read out from a portable storage medium connected to the control unit during the parking phase. 19. The method of claim 1, wherein at least one part of the update data is received from the Internet via a mobile wireless connection and/or a wireless local area network connection during the parking phase. 20. The method of claim 1, wherein a maximum provided time for the update is predetermined by a timer value stored in the control unit and an abort signal for terminating the update is created by a timer in the control unit as a function of the timer value. 21. The method of claim 1, wherein the processor core and the memory storage unit are not operated during the parking phase unless an update command is entered by a user of the motor vehicle into a control panel of the motor vehicle when the ignition is on before the parking phase. 22. The method of claim 1, wherein the control unit is an infotainment system or an instrument cluster. | The invention relates to a method for operating a control device of a motor vehicle during a park phase, wherein in the method a transmitted ignition-off signal for initiating the park phase is received in the motor vehicle by the control unit and at least one electronic component of the control unit is switched off. The object of the invention is to carry out an update of the operating software of a control unit without an interruption of the operation of the control unit that is disruptive for the user of the motor vehicle. After receiving the ignition-off signal, a processor core and a memory storage unit in the control unit, in which the operating software is stored, continue to operate. The update is then carried out during the park phase by the processor core on the basis of update data.1-13. (canceled) 14. A method for operating a control unit of a motor vehicle during a parking phase in which an ignition of the motor vehicle is switched off to disable devices of the motor vehicle, the method comprising:
receiving, by the control unit, an ignition-off signal for initiating the parking phase in the motor vehicle; switching off at least one electronic component of the control unit after receiving the ignition-off signal; operating, in the control unit during the parking phase, a processor core and a memory storage unit, in which is stored operating software provided for the operation of the control unit when the ignition is on, to carry out an update of the operating software via the processor core based on update data; switching off, via an integrated circuit of a System-on-a-Chip, peripherals of the processor core and a memory controller of the memory storage unit not needed for the update as a function of the ignition-off signal; activating a power controller of the control unit to stop the update, wherein the power controller is configured to control the energy usage of the control unit and switch off the processor core and the memory storage unit, wherein the control unit has device electronics which comprise a circuit board on which are arranged electronic components necessary for the operation of the control unit, wherein the device electronics are divided into a first power domain and a second power domain, wherein each of the first and second power domains is linked by a respective electrical supply line via the power controller to a supply connection of the control unit, wherein the processor core and the memory storage unit are assigned to the first power domain and the at least one electronic component is assigned to the second power domain, and wherein upon receiving the ignition-off signal, the second power domain is electrically isolated from the supply connection via the power controller and the first power domain continues to be supplied with voltage. 15. The method of claim 1, wherein operating, in the control unit during the parking phase, the processor core and the memory storage unit further comprises:
operating the processor core and the memory storage using power supplied by a battery of the motor vehicle. 16. The method of claim 1, wherein the processor core and the memory controller of the memory storage unit are implemented via the integrated circuit having a variable clock rate and the clock rate is reduced as a function of the ignition off signal. 17. The method of claim 1, wherein when the ignition is on preceding the parking phase, at least one part of the update data is received over a transmission connection from outside the motor vehicle or from a portable device attached to the control unit and is stored in the memory storage unit. 18. The method of claim 1, wherein at least one part of the update data is read out from a portable storage medium connected to the control unit during the parking phase. 19. The method of claim 1, wherein at least one part of the update data is received from the Internet via a mobile wireless connection and/or a wireless local area network connection during the parking phase. 20. The method of claim 1, wherein a maximum provided time for the update is predetermined by a timer value stored in the control unit and an abort signal for terminating the update is created by a timer in the control unit as a function of the timer value. 21. The method of claim 1, wherein the processor core and the memory storage unit are not operated during the parking phase unless an update command is entered by a user of the motor vehicle into a control panel of the motor vehicle when the ignition is on before the parking phase. 22. The method of claim 1, wherein the control unit is an infotainment system or an instrument cluster. | 2,100 |
5,715 | 5,715 | 16,092,131 | 2,117 | A system ( 10 ) may include sensor equipment ( 30 ) including one or more sensors ( 140, 142 ) disposed on a parcel of land, watering equipment ( 20 ) disposed on the parcel and configured to selectively apply water to the parcel, and a gateway ( 40 ) configured to provide for communication with the sensor equipment ( 30 ) and the watering equipment ( 20 ). The watering equipment ( 20 ) may include a watering pump ( 120 ), the watering pump ( 120 ) being operably coupled to a water source ( 100 ) and a water line ( 110 ) to alternately couple the water source ( 100 ) to and isolate the water source ( 100 ) from the water line ( 110 ), and processing circuitry ( 160 ). The processing circuitry ( 160 ) may be configured to determine an operational mode of the watering pump ( 120 ) and direct the watering pump ( 120 ) to operate in accordance with the operational mode. | 1. A system (10) comprising:
sensor equipment (30) including one or more sensors (140, 142) disposed on a parcel of land; watering equipment (20) disposed on the parcel and configured to selectively apply water to the parcel; a user terminal (50); and a gateway (40) configured to communicate with the sensor equipment (30), the watering equipment (20), and the user terminal (50), characterized in that: the watering equipment (20) includes a watering pump (120), the watering pump (120) being operably coupled to a water source (100) and a water line (110) to alternately couple the water source (100) to and isolate the water source (100) from the water line (110), and the watering pump (120) including
processing circuitry (160) configured to:
determine an operational mode of the watering pump (120); and
direct the watering pump (120) to operate in accordance with the operational mode. 2. The system (10) of any of the preceding claims, wherein the gateway (40) interfaces between a first network comprising at least the watering equipment (20) and the sensor equipment (30) and a second network via which a first user is enabled to wirelessly communicate with the gateway (40) via the user terminal (50). 3. The system of (10) of any of the preceding claims, wherein the operational mode of the watering pump (120) comprises one of an intelligent mode, a scheduled mode, or a manual mode. 4. The system (10) of claim 3, wherein in the intelligent mode, the watering pump (120) operates in response to received sensor data falling within or exceeding a predefined range or threshold. 5. The system (10) of claim 3, wherein in the scheduled mode, the watering pump (120) operates in response to a watering schedule programmed by the first user. 6. The system (10) of claim 3, wherein the user terminal (50) includes an interface (630), and, wherein in the manual mode, the watering pump (120) operates in response to a user selection on the interface (630) that directs the immediate operation of the watering pump (120). 7. The system (10) of any of the preceding claims, wherein the processing circuitry (160) is further configured to determine, based on the first instructions received from the gateway (40), a volume mode of the watering pump (120). 8. The system (10) of claim 7, wherein the volume mode of the watering pump (120) comprises at least one of a micro drip mode, a small amount mode, a conservation mode, an automatic mode, or a garden mode. 9. The system (10) of any of the preceding claims, wherein the processing circuitry (160) is further configured to determine the recommended maintenance interval of the watering pump (120). 10. The system (10) of claim 9, wherein the maintenance interval is based on a predefined time period, water volume, or pump runtime. 11. The system (10) of claim 9, wherein the maintenance interval is a calculated interval based on a last maintenance inputted by the first user. 12. The system (10) of claim 9, wherein the maintenance interval is based on a time interval or water volume inputted by the first user. 13. The system (10) of any of the preceding claims, wherein the processing circuitry (160) is further configured to detect a loss of connectivity to the gateway (40) or the sensor (140, 142) and in response to the detection of the loss of connectivity, employ a last determined operational mode and volume mode. 14. The system (10) of claim 12, wherein if the loss of connectivity to the gateway (40) or the sensor (140) exceeds a predetermined time interval, the processing circuitry (160) is configured to employ a default operational mode and volume mode. 15. The system (10) of any of the preceding claims, wherein the user terminal (50) includes an interface (630) displaying the status of the watering pump (120). 16. The system (10) of any of the preceding claims, wherein the user terminal is configured to provide warnings to the operator based on pump failure, battery status, schedule conflicts, and weather issues. 17. The system (10) of any of the preceding claims, wherein the user terminal (50) includes an interface (630) for delegating operation of the system to a second user selected by the first user. 18. A watering pump (120) operably coupled to a water source (100) and a water line (110) to alternately couple the water source (100) to and isolate the water source (100) from the water line (110), and the watering pump (120) comprising
processing circuitry (160) configured to:
determine an operational mode of the watering pump (120); and
direct the watering pump (120) to operate in accordance with the operational mode. 19. The watering pump (120) of claim 18, wherein the watering pump (120) interfaces with sensor equipment (30) and a user terminal (50) to enable a user to employ an app to control the watering pump (120). 20. The watering pump (120) of claim 19, wherein the operational mode of the watering pump (120) comprises one of an intelligent mode, a scheduled mode, or a manual mode. 21. The watering pump (120) of claim 20, wherein in the intelligent mode, the watering pump (120) operates in response to received sensor data falling within or exceeding a predefined range or threshold. 22. The watering pump (120) of claim 20, wherein in the scheduled mode, the watering pump (120) operates in response to a watering schedule programmed by the user. 23. The watering pump (120) of claim 20, wherein the user terminal (50) includes an interface (630), and, wherein in the manual mode, the watering pump (120) operates in response to a user selection on the interface (630) that directs the immediate operation of the watering pump (120). 24. The watering pump (120) of any of claims 18-23, wherein the processing circuitry (160) is further configured to determine, based on the first instructions received from the gateway (40), a volume mode of the watering pump (120). 25. The watering pump (120) of claim 24, wherein the volume mode of the watering pump (120) comprises at least one of a micro drip mode, a small amount mode, a conservation mode, an automatic mode, or a garden mode. 26. The watering pump (120) of any of claims 18-25, wherein the processing circuitry (160) is further configured to determine the recommended maintenance interval of the watering pump (120). 27. The watering pump (120) of claim 26, wherein the maintenance interval is based on a predefined time period, water volume, or pump runtime. 28. The watering pump (120) of claim 26 wherein the maintenance interval is a calculated interval based on a last maintenance inputted by the user. 29. The watering pump (120) of claim 26 wherein the maintenance interval is based on a time interval or water volume inputted by the user. 30. The watering pump (120) of any of claims 18-29, wherein the processing circuitry (160) is further configured to detect a loss of connectivity to a gateway (40) to a network or a sensor (140, 142) and in response to the detection of the loss of connectivity, employ a last determined operational mode and volume mode. 31. The watering pump (120) of claim 30, wherein if the loss of connectivity to the gateway (40) or the sensor (140, 142) exceeds a predetermined time interval, the processing circuitry (160) is configured to employ a default operational mode and volume mode. 32. The watering pump (120) of any of claims 19-23, wherein the user terminal (50) includes an interface (630) displaying the status of the watering pump (120). 33. The watering pump (120) of claim 32, wherein the user terminal (50) is configured to provide warnings to the user based on pump failure, battery status, schedule conflicts, and weather issues. 34. The watering pump (120) of claim 32, wherein the user terminal (50) includes an interface (630) for delegating operation of the system to a second user selected by the user. | A system ( 10 ) may include sensor equipment ( 30 ) including one or more sensors ( 140, 142 ) disposed on a parcel of land, watering equipment ( 20 ) disposed on the parcel and configured to selectively apply water to the parcel, and a gateway ( 40 ) configured to provide for communication with the sensor equipment ( 30 ) and the watering equipment ( 20 ). The watering equipment ( 20 ) may include a watering pump ( 120 ), the watering pump ( 120 ) being operably coupled to a water source ( 100 ) and a water line ( 110 ) to alternately couple the water source ( 100 ) to and isolate the water source ( 100 ) from the water line ( 110 ), and processing circuitry ( 160 ). The processing circuitry ( 160 ) may be configured to determine an operational mode of the watering pump ( 120 ) and direct the watering pump ( 120 ) to operate in accordance with the operational mode.1. A system (10) comprising:
sensor equipment (30) including one or more sensors (140, 142) disposed on a parcel of land; watering equipment (20) disposed on the parcel and configured to selectively apply water to the parcel; a user terminal (50); and a gateway (40) configured to communicate with the sensor equipment (30), the watering equipment (20), and the user terminal (50), characterized in that: the watering equipment (20) includes a watering pump (120), the watering pump (120) being operably coupled to a water source (100) and a water line (110) to alternately couple the water source (100) to and isolate the water source (100) from the water line (110), and the watering pump (120) including
processing circuitry (160) configured to:
determine an operational mode of the watering pump (120); and
direct the watering pump (120) to operate in accordance with the operational mode. 2. The system (10) of any of the preceding claims, wherein the gateway (40) interfaces between a first network comprising at least the watering equipment (20) and the sensor equipment (30) and a second network via which a first user is enabled to wirelessly communicate with the gateway (40) via the user terminal (50). 3. The system of (10) of any of the preceding claims, wherein the operational mode of the watering pump (120) comprises one of an intelligent mode, a scheduled mode, or a manual mode. 4. The system (10) of claim 3, wherein in the intelligent mode, the watering pump (120) operates in response to received sensor data falling within or exceeding a predefined range or threshold. 5. The system (10) of claim 3, wherein in the scheduled mode, the watering pump (120) operates in response to a watering schedule programmed by the first user. 6. The system (10) of claim 3, wherein the user terminal (50) includes an interface (630), and, wherein in the manual mode, the watering pump (120) operates in response to a user selection on the interface (630) that directs the immediate operation of the watering pump (120). 7. The system (10) of any of the preceding claims, wherein the processing circuitry (160) is further configured to determine, based on the first instructions received from the gateway (40), a volume mode of the watering pump (120). 8. The system (10) of claim 7, wherein the volume mode of the watering pump (120) comprises at least one of a micro drip mode, a small amount mode, a conservation mode, an automatic mode, or a garden mode. 9. The system (10) of any of the preceding claims, wherein the processing circuitry (160) is further configured to determine the recommended maintenance interval of the watering pump (120). 10. The system (10) of claim 9, wherein the maintenance interval is based on a predefined time period, water volume, or pump runtime. 11. The system (10) of claim 9, wherein the maintenance interval is a calculated interval based on a last maintenance inputted by the first user. 12. The system (10) of claim 9, wherein the maintenance interval is based on a time interval or water volume inputted by the first user. 13. The system (10) of any of the preceding claims, wherein the processing circuitry (160) is further configured to detect a loss of connectivity to the gateway (40) or the sensor (140, 142) and in response to the detection of the loss of connectivity, employ a last determined operational mode and volume mode. 14. The system (10) of claim 12, wherein if the loss of connectivity to the gateway (40) or the sensor (140) exceeds a predetermined time interval, the processing circuitry (160) is configured to employ a default operational mode and volume mode. 15. The system (10) of any of the preceding claims, wherein the user terminal (50) includes an interface (630) displaying the status of the watering pump (120). 16. The system (10) of any of the preceding claims, wherein the user terminal is configured to provide warnings to the operator based on pump failure, battery status, schedule conflicts, and weather issues. 17. The system (10) of any of the preceding claims, wherein the user terminal (50) includes an interface (630) for delegating operation of the system to a second user selected by the first user. 18. A watering pump (120) operably coupled to a water source (100) and a water line (110) to alternately couple the water source (100) to and isolate the water source (100) from the water line (110), and the watering pump (120) comprising
processing circuitry (160) configured to:
determine an operational mode of the watering pump (120); and
direct the watering pump (120) to operate in accordance with the operational mode. 19. The watering pump (120) of claim 18, wherein the watering pump (120) interfaces with sensor equipment (30) and a user terminal (50) to enable a user to employ an app to control the watering pump (120). 20. The watering pump (120) of claim 19, wherein the operational mode of the watering pump (120) comprises one of an intelligent mode, a scheduled mode, or a manual mode. 21. The watering pump (120) of claim 20, wherein in the intelligent mode, the watering pump (120) operates in response to received sensor data falling within or exceeding a predefined range or threshold. 22. The watering pump (120) of claim 20, wherein in the scheduled mode, the watering pump (120) operates in response to a watering schedule programmed by the user. 23. The watering pump (120) of claim 20, wherein the user terminal (50) includes an interface (630), and, wherein in the manual mode, the watering pump (120) operates in response to a user selection on the interface (630) that directs the immediate operation of the watering pump (120). 24. The watering pump (120) of any of claims 18-23, wherein the processing circuitry (160) is further configured to determine, based on the first instructions received from the gateway (40), a volume mode of the watering pump (120). 25. The watering pump (120) of claim 24, wherein the volume mode of the watering pump (120) comprises at least one of a micro drip mode, a small amount mode, a conservation mode, an automatic mode, or a garden mode. 26. The watering pump (120) of any of claims 18-25, wherein the processing circuitry (160) is further configured to determine the recommended maintenance interval of the watering pump (120). 27. The watering pump (120) of claim 26, wherein the maintenance interval is based on a predefined time period, water volume, or pump runtime. 28. The watering pump (120) of claim 26 wherein the maintenance interval is a calculated interval based on a last maintenance inputted by the user. 29. The watering pump (120) of claim 26 wherein the maintenance interval is based on a time interval or water volume inputted by the user. 30. The watering pump (120) of any of claims 18-29, wherein the processing circuitry (160) is further configured to detect a loss of connectivity to a gateway (40) to a network or a sensor (140, 142) and in response to the detection of the loss of connectivity, employ a last determined operational mode and volume mode. 31. The watering pump (120) of claim 30, wherein if the loss of connectivity to the gateway (40) or the sensor (140, 142) exceeds a predetermined time interval, the processing circuitry (160) is configured to employ a default operational mode and volume mode. 32. The watering pump (120) of any of claims 19-23, wherein the user terminal (50) includes an interface (630) displaying the status of the watering pump (120). 33. The watering pump (120) of claim 32, wherein the user terminal (50) is configured to provide warnings to the user based on pump failure, battery status, schedule conflicts, and weather issues. 34. The watering pump (120) of claim 32, wherein the user terminal (50) includes an interface (630) for delegating operation of the system to a second user selected by the user. | 2,100 |
5,716 | 5,716 | 15,383,260 | 2,138 | Embodiments are provided for protecting boot block space in a memory device. Such a memory device may include a memory array having a protected portion and a serial interface controller. The memory device may have a register that enables or disables access to the portion when data indicating whether to enable or disable access to the portion is written into the register via a serial data in (SI) input. | 1. A memory device comprising:
a memory array; a serial interface controller configured to interface with a master device; and a register separate from and directly coupled to the serial interface controller, wherein the register is configured to enable or disable access to a portion of the memory array when data indicating whether to enable or disable access to the portion is written into the register via the serial interface controller, wherein the portion of the memory array is configured to store an indication of the data indicating whether to enable or disable access to the portion of the memory array. 2. The memory device of claim 1, wherein the data indicating whether to enable or disable access to the portion is configured to be written into the register via the serial interface controller with a command accompanied by an address identifying the portion, wherein the command, the address, and the data are serially received by the serial interface controller. 3. The memory device of claim 1, wherein the register is configured to enable or disable access to the portion comprises the register being configured to lock or unlock write access to the portion. 4. The memory device of claim 1, wherein the register is configured to enable or disable access to the portion comprises the register being configured to lock or unlock erase access to the portion. 5. The memory device of claim 1, wherein the portion comprises an individual block of the memory array. 6. The memory device of claim 5, wherein the individual block of the memory array comprises a boot block. 7. The memory device of claim 1, wherein the portion comprises an individual page within a particular block of the memory array. 8. The memory device of claim 1, wherein the portion comprises a block region comprising one or more blocks of the memory array. 9. The memory device of claim 8, wherein the block region is user-definable. 10. The memory device of claim 8, wherein the block region comprises an entire boot block space. 11. The memory device of claim 1, wherein the portion comprises a block region comprises a plurality of blocks. 12. The memory device of claim 1, wherein the register comprises a plurality of bits and wherein the portion is associated with a particular bit of the plurality of bits. 13. The memory device of claim 1, wherein the serial interface controller comprises a serial data in (SI) input, a serial data out (SO) output, a serial clock (SCK) input, and a chip select (CS) input. 14. The memory device of claim 1, comprising a cache memory coupled to the controller by way of a first line, wherein the controller is coupled to the memory array by way of a second line and the cache memory is coupled to the memory array by way of a third line. 15. The memory device of claim 1, wherein the controller is configured to translate signals sent to the memory array into command latch enable (CLE), address latch enable (ALE) signal, write enable (WE), and read enable (RE) signals. 16. The memory device of claim 1, wherein the memory device is configured to authenticate the master device for accessing the portion of the memory array responsive to comparing a password entered by the master device to a stored password. 17. The memory device of claim 1, wherein the memory device is configured to authenticate the master device for accessing the memory array responsive to comparing a password entered by the master device to a stored password. 18. The memory device of claim 17, wherein the stored password is stored in the memory array. 19. The memory device of claim 1, wherein the register comprises a boot block access register. 20. A system comprising:
a master device; and a memory device, the memory device comprising:
a memory array;
a serial interface controller configured to interface with the master device;
a register separate from and directly coupled to the serial interface controller and configured to enable or disable access to a portion of the memory array responsive to a command addressing the portion and data indicating whether to enable or disable access to the portion, wherein the data is written into the register via the serial interface controller, wherein the command addressing the portion and the data are serially received from the master device, wherein the portion of the memory array is configured to store an indication of the data indicating whether to enable or disable access to the portion. 21. The memory device of claim 20, wherein the master device comprises programmed control circuitry. 22. The memory device of claim 21, wherein the programmed control circuitry comprises a microcontroller. 23. A system comprising:
a master device; and a plurality of memory devices coupled to the master device, wherein each memory device of the plurality of memory devices comprises:
a memory array;
a serial interface controller configured to interface with the master device;
a register separate from and directly coupled to the serial interface controller and configured to enable or disable access to a portion of the memory array responsive to a command addressing the portion and data indicating whether to enable or disable access to the portion, wherein the data is written into the register via the serial interface controller, wherein the command addressing the portion and the data are serially received from the master device, wherein the portion of the memory array is configured to store an indication of the data indicating whether to enable or disable access to the portion. | Embodiments are provided for protecting boot block space in a memory device. Such a memory device may include a memory array having a protected portion and a serial interface controller. The memory device may have a register that enables or disables access to the portion when data indicating whether to enable or disable access to the portion is written into the register via a serial data in (SI) input.1. A memory device comprising:
a memory array; a serial interface controller configured to interface with a master device; and a register separate from and directly coupled to the serial interface controller, wherein the register is configured to enable or disable access to a portion of the memory array when data indicating whether to enable or disable access to the portion is written into the register via the serial interface controller, wherein the portion of the memory array is configured to store an indication of the data indicating whether to enable or disable access to the portion of the memory array. 2. The memory device of claim 1, wherein the data indicating whether to enable or disable access to the portion is configured to be written into the register via the serial interface controller with a command accompanied by an address identifying the portion, wherein the command, the address, and the data are serially received by the serial interface controller. 3. The memory device of claim 1, wherein the register is configured to enable or disable access to the portion comprises the register being configured to lock or unlock write access to the portion. 4. The memory device of claim 1, wherein the register is configured to enable or disable access to the portion comprises the register being configured to lock or unlock erase access to the portion. 5. The memory device of claim 1, wherein the portion comprises an individual block of the memory array. 6. The memory device of claim 5, wherein the individual block of the memory array comprises a boot block. 7. The memory device of claim 1, wherein the portion comprises an individual page within a particular block of the memory array. 8. The memory device of claim 1, wherein the portion comprises a block region comprising one or more blocks of the memory array. 9. The memory device of claim 8, wherein the block region is user-definable. 10. The memory device of claim 8, wherein the block region comprises an entire boot block space. 11. The memory device of claim 1, wherein the portion comprises a block region comprises a plurality of blocks. 12. The memory device of claim 1, wherein the register comprises a plurality of bits and wherein the portion is associated with a particular bit of the plurality of bits. 13. The memory device of claim 1, wherein the serial interface controller comprises a serial data in (SI) input, a serial data out (SO) output, a serial clock (SCK) input, and a chip select (CS) input. 14. The memory device of claim 1, comprising a cache memory coupled to the controller by way of a first line, wherein the controller is coupled to the memory array by way of a second line and the cache memory is coupled to the memory array by way of a third line. 15. The memory device of claim 1, wherein the controller is configured to translate signals sent to the memory array into command latch enable (CLE), address latch enable (ALE) signal, write enable (WE), and read enable (RE) signals. 16. The memory device of claim 1, wherein the memory device is configured to authenticate the master device for accessing the portion of the memory array responsive to comparing a password entered by the master device to a stored password. 17. The memory device of claim 1, wherein the memory device is configured to authenticate the master device for accessing the memory array responsive to comparing a password entered by the master device to a stored password. 18. The memory device of claim 17, wherein the stored password is stored in the memory array. 19. The memory device of claim 1, wherein the register comprises a boot block access register. 20. A system comprising:
a master device; and a memory device, the memory device comprising:
a memory array;
a serial interface controller configured to interface with the master device;
a register separate from and directly coupled to the serial interface controller and configured to enable or disable access to a portion of the memory array responsive to a command addressing the portion and data indicating whether to enable or disable access to the portion, wherein the data is written into the register via the serial interface controller, wherein the command addressing the portion and the data are serially received from the master device, wherein the portion of the memory array is configured to store an indication of the data indicating whether to enable or disable access to the portion. 21. The memory device of claim 20, wherein the master device comprises programmed control circuitry. 22. The memory device of claim 21, wherein the programmed control circuitry comprises a microcontroller. 23. A system comprising:
a master device; and a plurality of memory devices coupled to the master device, wherein each memory device of the plurality of memory devices comprises:
a memory array;
a serial interface controller configured to interface with the master device;
a register separate from and directly coupled to the serial interface controller and configured to enable or disable access to a portion of the memory array responsive to a command addressing the portion and data indicating whether to enable or disable access to the portion, wherein the data is written into the register via the serial interface controller, wherein the command addressing the portion and the data are serially received from the master device, wherein the portion of the memory array is configured to store an indication of the data indicating whether to enable or disable access to the portion. | 2,100 |
5,717 | 5,717 | 15,102,271 | 2,127 | A method for performing a simulation of a field having a subterranean formation is described. The method includes obtaining phase behavior data of subterranean fluids of the field, generating an equation of state (EOS) model of the fluids based on the phase behavior data, generating a Helmholtz free energy model that reproduces predictions of the EOS model over a pre-determined pressure and temperature range, and performing the simulation of the field using the Helmholtz free energy model. The method may further include reducing the EOS model to a reduced EOS model having a reduced number of components to represent the EOS model over a pre-determined pressure and temperature range, generating the Helmholtz free energy model based on the reduced EOS model, and obtaining and using phase behavior data of injection fluids used. A computer system data. | 1. A method for performing a simulation of a field having a subterranean formation, comprising:
obtaining phase behavior data of subterranean fluids of the field; generating an equation of state (EOS) model of the fluids based on the phase behavior data; generating, by a processor of a computer system, a Helmholtz free energy model that reproduces predictions of the EOS model over a pre-determined pressure and temperature range; and performing, by the processor, the simulation of the field using the Helmholtz free energy model. 2. The method of claim 1, wherein the subterranean fluids comprise injection fluids. 3. The method of claim 1, further comprising:
reducing the EOS model to a reduced EOS model having a reduced number of components to represent the EOS model over a pre-determined pressure and temperature range, and wherein the Helmholtz free energy model is generated based on the reduced EOS model. 4. The method of claim 1, wherein the phase behavior data represents at least one property of the fluids selected from a group consisting of pressure, volume, temperature, fluid-fluid interface phenomenon, fluid-solid interface phenomenon, and rheological property. 5. The method of claim 4, wherein the fluids comprise a multiphase compositional fluid system. 6. A computer system comprising:
a processor and memory; and a reservoir production (RP) tool stored in the memory, executing on the processor, and comprising:
an input module configured to obtain phase behavior data of fluids;
an equation of state (EOS) model generator configured to generate an EOS model of the fluids based on the phase behavior data;
a free energy model generator configured to generate a Helmholtz free energy model that reproduces predictions of the EOS model over a pre-determined temperature and pressure range; and
a simulator configured to perform simulation of the field using the Helmholtz free energy model; and
a repository configured to store the phase behavior data, the EOS model, and the Helmholtz free energy model. 7. The system of claim 6, the EOS model generator further configured to:
reduce the EOS model to a reduced EOS model having a reduced number of components to represent the EOS model over a pre-determined pressure and temperature range, and wherein the Helmholtz free energy model is generated based on the reduced EOS model. 8. The system of claim 6, wherein the phase behavior data represents at least one property of the fluids selected from a group consisting of pressure, volume, temperature, fluid-fluid interface phenomenon, fluid-solid interface phenomenon, and rheological property. 9. The system of claim 6, wherein the fluids comprise a multiphase compositional fluid system. 10. A non-transitory computer-readable medium comprising instructions for performing a simulation of a field having a subterranean formation, the instructions when executed by a computer processor comprising functionality for:
obtaining phase behavior data of subterranean fluids of the field; obtaining phase behavior data of injection fluids used in the field; generating an equation of state (EOS) model of the subterranean and injection fluids based on the phase behavior data; generating a Helmholtz free energy model that reproduces predictions of the EOS model over a pre-determined pressure and temperature range; and performing the simulation of the field using the Helmholtz free energy model. 11. The non-transitory computer readable medium of claim 10, the instructions when executed by the computer processor further comprising functionality for:
reducing the EOS model to a reduced EOS model having a reduced number of components to represent the EOS model over a pre-determined pressure and temperature range, and wherein the Helmholtz free energy model is generated based on the reduced EOS model. 12. The non-transitory computer readable medium of claim 10, wherein the phase behavior data of the subterranean and injection fluids represents at least one property of the fluids selected from a group consisting of pressure, volume, temperature, fluid-fluid interface phenomenon, fluid-solid interface phenomenon, and rheological property. 13. The non-transitory computer readable medium of claim 10, wherein the subterranean and injection fluids comprise a multiphase compositional fluid system. 14. A method for performing a simulation of a field having a subterranean formation, comprising:
obtaining phase behavior data of subterranean fluids of the field; obtaining phase behavior data of injection fluids used in the field; generating, by a processor of a computer system, a Helmholtz free energy model that reproduces the phase behavior data of the fluids of the field over a pre-determined pressure and temperature range; and performing, by the processor, the simulation of the field using the Helmholtz free energy model. 15. The method of claim 14, further comprising:
deriving an equation of state (EOS) model of the subterranean and injection fluids based on the Helmholtz free energy model. 16. The method of claim 14, wherein the phase behavior data of the subterranean and injection fluids represents at least one property of the fluids selected from a group consisting of pressure, volume, temperature, fluid-fluid interface phenomenon, fluid-solid interface phenomenon, and rheological property. 17. The method of claim 14, wherein the subterranean and injection fluids comprise a multiphase compositional fluid system. 18. A computer system comprising:
a processor and memory; and a reservoir production (RP) tool stored in the memory, executing on the processor, and comprising:
an input module configured to obtain phase behavior data of subterranean fluids of a field;
an input module configured to obtain phase behavior data of injection fluids used in the field;
a free energy model generator configured to generate a Helmholtz free energy model that reproduces the phase behavior data of the subterranean and injection fluids over a pre-determined pressure and temperature range; and
a simulator configured to perform a simulation of the field using the Helmholtz free energy model; and
a repository configured to store the phase behavior data and the Helmholtz free energy model. 19. The system of claim 18, wherein the phase behavior data of the subterranean and injection fluids represents at least one property of the fluids selected from a group consisting of pressure, volume, temperature, fluid-fluid interface phenomenon, fluid-solid interface phenomenon, and rheological property. 20. The system of claim 18, wherein the subterranean and injection fluids comprise a multiphase compositional fluid system. 21. A non-transitory computer readable medium comprising instructions for performing a simulation of a field having a subterranean formation, the instructions when executed by a computer processor comprising functionality for:
obtaining phase behavior data of subterranean fluids of the field; obtaining phase behavior data of injection fluids used in the field; generating a Helmholtz free energy model that reproduces the phase behavior data of the subterranean and injection fluids over a pre-determined pressure and temperature range; and performing the simulation of the field using the Helmholtz free energy model. 22. The non-transitory computer readable medium of claim 21, wherein the phase behavior data of the subterranean and injection fluids represents at least one property of the fluids selected from a group consisting of pressure, volume, temperature, fluid-fluid interface phenomenon, fluid-solid interface phenomenon, and rheological property. 23. The non-transitory computer readable medium of claim 21, wherein the subterranean and injection fluids comprise a multiphase compositional fluid system. | A method for performing a simulation of a field having a subterranean formation is described. The method includes obtaining phase behavior data of subterranean fluids of the field, generating an equation of state (EOS) model of the fluids based on the phase behavior data, generating a Helmholtz free energy model that reproduces predictions of the EOS model over a pre-determined pressure and temperature range, and performing the simulation of the field using the Helmholtz free energy model. The method may further include reducing the EOS model to a reduced EOS model having a reduced number of components to represent the EOS model over a pre-determined pressure and temperature range, generating the Helmholtz free energy model based on the reduced EOS model, and obtaining and using phase behavior data of injection fluids used. A computer system data.1. A method for performing a simulation of a field having a subterranean formation, comprising:
obtaining phase behavior data of subterranean fluids of the field; generating an equation of state (EOS) model of the fluids based on the phase behavior data; generating, by a processor of a computer system, a Helmholtz free energy model that reproduces predictions of the EOS model over a pre-determined pressure and temperature range; and performing, by the processor, the simulation of the field using the Helmholtz free energy model. 2. The method of claim 1, wherein the subterranean fluids comprise injection fluids. 3. The method of claim 1, further comprising:
reducing the EOS model to a reduced EOS model having a reduced number of components to represent the EOS model over a pre-determined pressure and temperature range, and wherein the Helmholtz free energy model is generated based on the reduced EOS model. 4. The method of claim 1, wherein the phase behavior data represents at least one property of the fluids selected from a group consisting of pressure, volume, temperature, fluid-fluid interface phenomenon, fluid-solid interface phenomenon, and rheological property. 5. The method of claim 4, wherein the fluids comprise a multiphase compositional fluid system. 6. A computer system comprising:
a processor and memory; and a reservoir production (RP) tool stored in the memory, executing on the processor, and comprising:
an input module configured to obtain phase behavior data of fluids;
an equation of state (EOS) model generator configured to generate an EOS model of the fluids based on the phase behavior data;
a free energy model generator configured to generate a Helmholtz free energy model that reproduces predictions of the EOS model over a pre-determined temperature and pressure range; and
a simulator configured to perform simulation of the field using the Helmholtz free energy model; and
a repository configured to store the phase behavior data, the EOS model, and the Helmholtz free energy model. 7. The system of claim 6, the EOS model generator further configured to:
reduce the EOS model to a reduced EOS model having a reduced number of components to represent the EOS model over a pre-determined pressure and temperature range, and wherein the Helmholtz free energy model is generated based on the reduced EOS model. 8. The system of claim 6, wherein the phase behavior data represents at least one property of the fluids selected from a group consisting of pressure, volume, temperature, fluid-fluid interface phenomenon, fluid-solid interface phenomenon, and rheological property. 9. The system of claim 6, wherein the fluids comprise a multiphase compositional fluid system. 10. A non-transitory computer-readable medium comprising instructions for performing a simulation of a field having a subterranean formation, the instructions when executed by a computer processor comprising functionality for:
obtaining phase behavior data of subterranean fluids of the field; obtaining phase behavior data of injection fluids used in the field; generating an equation of state (EOS) model of the subterranean and injection fluids based on the phase behavior data; generating a Helmholtz free energy model that reproduces predictions of the EOS model over a pre-determined pressure and temperature range; and performing the simulation of the field using the Helmholtz free energy model. 11. The non-transitory computer readable medium of claim 10, the instructions when executed by the computer processor further comprising functionality for:
reducing the EOS model to a reduced EOS model having a reduced number of components to represent the EOS model over a pre-determined pressure and temperature range, and wherein the Helmholtz free energy model is generated based on the reduced EOS model. 12. The non-transitory computer readable medium of claim 10, wherein the phase behavior data of the subterranean and injection fluids represents at least one property of the fluids selected from a group consisting of pressure, volume, temperature, fluid-fluid interface phenomenon, fluid-solid interface phenomenon, and rheological property. 13. The non-transitory computer readable medium of claim 10, wherein the subterranean and injection fluids comprise a multiphase compositional fluid system. 14. A method for performing a simulation of a field having a subterranean formation, comprising:
obtaining phase behavior data of subterranean fluids of the field; obtaining phase behavior data of injection fluids used in the field; generating, by a processor of a computer system, a Helmholtz free energy model that reproduces the phase behavior data of the fluids of the field over a pre-determined pressure and temperature range; and performing, by the processor, the simulation of the field using the Helmholtz free energy model. 15. The method of claim 14, further comprising:
deriving an equation of state (EOS) model of the subterranean and injection fluids based on the Helmholtz free energy model. 16. The method of claim 14, wherein the phase behavior data of the subterranean and injection fluids represents at least one property of the fluids selected from a group consisting of pressure, volume, temperature, fluid-fluid interface phenomenon, fluid-solid interface phenomenon, and rheological property. 17. The method of claim 14, wherein the subterranean and injection fluids comprise a multiphase compositional fluid system. 18. A computer system comprising:
a processor and memory; and a reservoir production (RP) tool stored in the memory, executing on the processor, and comprising:
an input module configured to obtain phase behavior data of subterranean fluids of a field;
an input module configured to obtain phase behavior data of injection fluids used in the field;
a free energy model generator configured to generate a Helmholtz free energy model that reproduces the phase behavior data of the subterranean and injection fluids over a pre-determined pressure and temperature range; and
a simulator configured to perform a simulation of the field using the Helmholtz free energy model; and
a repository configured to store the phase behavior data and the Helmholtz free energy model. 19. The system of claim 18, wherein the phase behavior data of the subterranean and injection fluids represents at least one property of the fluids selected from a group consisting of pressure, volume, temperature, fluid-fluid interface phenomenon, fluid-solid interface phenomenon, and rheological property. 20. The system of claim 18, wherein the subterranean and injection fluids comprise a multiphase compositional fluid system. 21. A non-transitory computer readable medium comprising instructions for performing a simulation of a field having a subterranean formation, the instructions when executed by a computer processor comprising functionality for:
obtaining phase behavior data of subterranean fluids of the field; obtaining phase behavior data of injection fluids used in the field; generating a Helmholtz free energy model that reproduces the phase behavior data of the subterranean and injection fluids over a pre-determined pressure and temperature range; and performing the simulation of the field using the Helmholtz free energy model. 22. The non-transitory computer readable medium of claim 21, wherein the phase behavior data of the subterranean and injection fluids represents at least one property of the fluids selected from a group consisting of pressure, volume, temperature, fluid-fluid interface phenomenon, fluid-solid interface phenomenon, and rheological property. 23. The non-transitory computer readable medium of claim 21, wherein the subterranean and injection fluids comprise a multiphase compositional fluid system. | 2,100 |
5,718 | 5,718 | 13,611,242 | 2,142 | In an image displayed on a display under a normal condition, the locations where items to choose from are located are indicated by icons. When a user touches a contact point, icons located within a predetermined range from the contact point are detected from among the icons. Then the locations of the detected icons are varied such that they are located on a circle, with the circle's center at the contact point, at equal spaces between the detected icons. A pointer graphic that indicates the original position of each icon in the original image is added to each icon. | 1. An information processing apparatus comprising:
an operating information acquiring unit configured to acquire information regarding a specific position, inputted by a user, in a display image and configured to detect in the display image a graphical user interface (GUI) located within a predetermined range from the specific position; a GUI location control unit configured to vary the locations of a plurality of GUIs on the display image, when the plurality of GUIs are detected by the operating information acquiring unit; and an information processing unit configured to perform information processing corresponding to a GUI, according to a user's operation on said GUI whose location has been varied. 2. The information processing apparatus according to claim 1, wherein the operating information acquiring unit detects a GUI whose distance from the specific position is less than a threshold value, and
wherein the GUI location control unit widens a space between the GUIs in a manner such that the plurality of GUIs detected by the operating information acquiring unit are equally spaced on a circle, with the circle's center being at the specific position. 3. The information processing apparatus according to claim 1, wherein the operating information acquiring unit detects the GUI located within the predetermined range from the specific position in a manner such that the distance between each GUI and the specific position is compared with a threshold value set for each of a plurality of GUIs. 4. The information processing apparatus according to claim 1, wherein the operating information acquiring unit detects a GUI located in a region specified as the specific position, and
wherein the GUI location control unit splits the plurality of detected GUIs according to types of GUIs and puts the same type of GUIs in one place, whereby an operation in a unit of type of GUI is accepted. 5. The information processing apparatus according to claim 1, wherein, when a user's input indicates a position, within a predetermined region in an image after varying the locations of the GUIs, which does not include the GUIs of which locations have been varied, the GUI location control unit respectively restores the location of each GUI to an initial position. 6. The information processing apparatus according to claim 1, wherein the GUI location control unit attaches a graphic to each GUI, the graphic indicating an initial position of the each GUI whose location has been varied. 7. A method for processing information, the method comprising:
acquiring information regarding a specific position, inputted by a user, in a display image and detecting in the display image a graphical user interface (GUI) located within a predetermined range from the specific position; and varying the locations of a plurality of GUIs on the display image when the plurality of GUIs are detected, and displaying the GUIs at the varied locations on a display. 8. A computer program embedded in a non-transitory computer-readable medium, the program comprising:
an operating information acquiring module operative to acquire information regarding a specific position, inputted by a user, in a display image and operative to detect in the display image a graphical user interface (GUI) located within a predetermined range from the specific position; and a GUI location control module operative to vary the locations of a plurality of GUIs on the display image when the plurality of GUIs are detected by the operating information acquiring module, and operative to display the GUIs at the varied locations on a display. 9. A non-transitory computer-readable medium encoded with a computer program executable by a computer, the computer program comprising:
an operating information acquiring module operative to acquire information regarding a specific position, inputted by a user, in a display image and detecting in a display image a graphical user interface (GUI) located within a predetermined range from the specific position; and a GUI location control module operative to vary the locations of a plurality of GUIs on the display image when the plurality of GUIs are detected by the operating information acquiring module, and operative to display the GUIs at the varied locations on a display. | In an image displayed on a display under a normal condition, the locations where items to choose from are located are indicated by icons. When a user touches a contact point, icons located within a predetermined range from the contact point are detected from among the icons. Then the locations of the detected icons are varied such that they are located on a circle, with the circle's center at the contact point, at equal spaces between the detected icons. A pointer graphic that indicates the original position of each icon in the original image is added to each icon.1. An information processing apparatus comprising:
an operating information acquiring unit configured to acquire information regarding a specific position, inputted by a user, in a display image and configured to detect in the display image a graphical user interface (GUI) located within a predetermined range from the specific position; a GUI location control unit configured to vary the locations of a plurality of GUIs on the display image, when the plurality of GUIs are detected by the operating information acquiring unit; and an information processing unit configured to perform information processing corresponding to a GUI, according to a user's operation on said GUI whose location has been varied. 2. The information processing apparatus according to claim 1, wherein the operating information acquiring unit detects a GUI whose distance from the specific position is less than a threshold value, and
wherein the GUI location control unit widens a space between the GUIs in a manner such that the plurality of GUIs detected by the operating information acquiring unit are equally spaced on a circle, with the circle's center being at the specific position. 3. The information processing apparatus according to claim 1, wherein the operating information acquiring unit detects the GUI located within the predetermined range from the specific position in a manner such that the distance between each GUI and the specific position is compared with a threshold value set for each of a plurality of GUIs. 4. The information processing apparatus according to claim 1, wherein the operating information acquiring unit detects a GUI located in a region specified as the specific position, and
wherein the GUI location control unit splits the plurality of detected GUIs according to types of GUIs and puts the same type of GUIs in one place, whereby an operation in a unit of type of GUI is accepted. 5. The information processing apparatus according to claim 1, wherein, when a user's input indicates a position, within a predetermined region in an image after varying the locations of the GUIs, which does not include the GUIs of which locations have been varied, the GUI location control unit respectively restores the location of each GUI to an initial position. 6. The information processing apparatus according to claim 1, wherein the GUI location control unit attaches a graphic to each GUI, the graphic indicating an initial position of the each GUI whose location has been varied. 7. A method for processing information, the method comprising:
acquiring information regarding a specific position, inputted by a user, in a display image and detecting in the display image a graphical user interface (GUI) located within a predetermined range from the specific position; and varying the locations of a plurality of GUIs on the display image when the plurality of GUIs are detected, and displaying the GUIs at the varied locations on a display. 8. A computer program embedded in a non-transitory computer-readable medium, the program comprising:
an operating information acquiring module operative to acquire information regarding a specific position, inputted by a user, in a display image and operative to detect in the display image a graphical user interface (GUI) located within a predetermined range from the specific position; and a GUI location control module operative to vary the locations of a plurality of GUIs on the display image when the plurality of GUIs are detected by the operating information acquiring module, and operative to display the GUIs at the varied locations on a display. 9. A non-transitory computer-readable medium encoded with a computer program executable by a computer, the computer program comprising:
an operating information acquiring module operative to acquire information regarding a specific position, inputted by a user, in a display image and detecting in a display image a graphical user interface (GUI) located within a predetermined range from the specific position; and a GUI location control module operative to vary the locations of a plurality of GUIs on the display image when the plurality of GUIs are detected by the operating information acquiring module, and operative to display the GUIs at the varied locations on a display. | 2,100 |
5,719 | 5,719 | 14,533,327 | 2,194 | Systems and methods are provided for creating three dimensional (3D) visualizations of in-process products. One embodiment is an apparatus that includes a controller and an interface. The controller is able to generate a 3D scene depicting ongoing assembly of a product by a machine tool. The scene includes a 3D model of the product and a 3D model of the machine tool, and the 3D models are placed within the scene based on a location of the product and a location of the machine tool. The interface is able to receive an update from the machine tool indicating a 3D placement of a part that has been attached by the machine tool to the product. The controller is also able to acquire a 3D model of the part, to insert the 3D model of the part within the scene based on the 3D placement, and to provide the scene for display to a user. | 1. A system comprising:
a controller configured to generate a three dimensional (3D) scene depicting ongoing assembly of a product by a machine tool, wherein the scene includes a 3D model of the product and a 3D model of the machine tool, and the 3D models are placed within the scene based on a location of the product and a location of the machine tool; and an interface configured to receive an update from the machine tool indicating a 3D placement of a part that has been attached by the machine tool to the product, the controller is configured to acquire a 3D model of the part, to insert the 3D model of the part within the scene based on the 3D placement, and to provide the scene for display to a user. 2. The system of claim 1, wherein:
the 3D placement indicates a position and orientation of the part as attached to the product. 3. The system of claim 2, wherein:
the 3D placement comprises an X value, a Y value, and a Z value representing position, and a θ value, a Φ value, and a Ψ value representing orientation. 4. The system of claim 1, wherein:
the controller is configured to receive updates from multiple machine tools that are assembling the product within an assembly cell, and to insert 3D models for parts within the scene based on the updates from the multiple machine tools. 5. The system of claim 1, wherein:
the controller is configured to determine, based on the update, that a manufacturing fault has been encountered by the machine tool, and to update the scene to represent the manufacturing fault. 6. The system of claim 1, wherein:
the update indicates a second 3D placement describing a movable component of the machine tool, and the controller is configured to update the 3D model of the machine tool based on the second 3D placement. 7. The system of claim 1, wherein:
the controller is configured to transform the 3D placement into a coordinate system used by the scene, and to insert the 3D model of the part at the transformed 3D placement. 8. The system of claim 1, wherein:
the update indicates tolerancing information for the part. 9. The system of claim 8, wherein:
the update indicates tolerancing information for the part, and the controller is configured to determine, based on the tolerancing information, whether the part has been installed in an expected position and orientation, and to report a manufacturing fault to the user if the part has not been installed in the expected position and orientation. 10. A method comprising:
generating a three dimensional (3D) scene depicting ongoing assembly of a product by a machine tool, wherein the scene includes a 3D model of the product and a 3D model of the machine tool, and the 3D models are placed within the scene based on a location of the product and a location of the machine tool; receiving an update from the machine tool indicating a 3D placement of a part that has been attached by the machine tool to the product; acquiring a 3D model of the part; inserting the 3D model of the part within the scene based on the 3D placement of the part; and providing the scene for display to a user. 11. The method of claim 10, wherein:
the 3D placement indicates a position and orientation of the part as attached to the product. 12. The method of claim 11, wherein:
the 3D placement comprises an X value, a Y value, and a Z value representing position, and a θ value, a Φ value, and a Ψ value representing orientation. 13. The method of claim 10, further comprising:
receiving updates from multiple machine tools that are assembling the product within an assembly cell; and inserting 3D models for parts within the scene based on the updates from the multiple machine tools. 14. The method of claim 10, further comprising:
determining, based on the update, that a manufacturing fault has been encountered by the machine tool; and updating the scene to represent the manufacturing fault. 15. The method of claim 10, wherein:
the update indicates a second 3D placement describing a movable component of the machine tool, and the method further comprises: updating the 3D model of the machine tool based on the second 3D placement. 16. The method of claim 10, further comprising:
transforming the 3D placement into a coordinate system used by the scene; and placing the 3D model of the part at the transformed 3D placement. 17. The method of claim 10, wherein:
the update indicates tolerancing information for the part. 18. The method of claim 17, wherein the method further comprises:
determining, based on the tolerancing information, whether the part has been installed in an expected position and orientation; and reporting a manufacturing fault to the user if the part has not been installed in the expected position and orientation. 19. An apparatus comprising:
a machine tool configured to assemble a product by attaching parts to the product, wherein the machine tool comprises:
a controller configured to detect 3D placements of parts that have been attached to the product by the machine tool, and to generate updates that each include a detected 3D placement of a part attached to the product by the machine tool; and
an interface configured to transmit the updates to an external device. 20. The apparatus of claim 19, wherein:
the controller is configured to include tolerancing information in each update indicating a deviation of the part from an expected 3D position and orientation. | Systems and methods are provided for creating three dimensional (3D) visualizations of in-process products. One embodiment is an apparatus that includes a controller and an interface. The controller is able to generate a 3D scene depicting ongoing assembly of a product by a machine tool. The scene includes a 3D model of the product and a 3D model of the machine tool, and the 3D models are placed within the scene based on a location of the product and a location of the machine tool. The interface is able to receive an update from the machine tool indicating a 3D placement of a part that has been attached by the machine tool to the product. The controller is also able to acquire a 3D model of the part, to insert the 3D model of the part within the scene based on the 3D placement, and to provide the scene for display to a user.1. A system comprising:
a controller configured to generate a three dimensional (3D) scene depicting ongoing assembly of a product by a machine tool, wherein the scene includes a 3D model of the product and a 3D model of the machine tool, and the 3D models are placed within the scene based on a location of the product and a location of the machine tool; and an interface configured to receive an update from the machine tool indicating a 3D placement of a part that has been attached by the machine tool to the product, the controller is configured to acquire a 3D model of the part, to insert the 3D model of the part within the scene based on the 3D placement, and to provide the scene for display to a user. 2. The system of claim 1, wherein:
the 3D placement indicates a position and orientation of the part as attached to the product. 3. The system of claim 2, wherein:
the 3D placement comprises an X value, a Y value, and a Z value representing position, and a θ value, a Φ value, and a Ψ value representing orientation. 4. The system of claim 1, wherein:
the controller is configured to receive updates from multiple machine tools that are assembling the product within an assembly cell, and to insert 3D models for parts within the scene based on the updates from the multiple machine tools. 5. The system of claim 1, wherein:
the controller is configured to determine, based on the update, that a manufacturing fault has been encountered by the machine tool, and to update the scene to represent the manufacturing fault. 6. The system of claim 1, wherein:
the update indicates a second 3D placement describing a movable component of the machine tool, and the controller is configured to update the 3D model of the machine tool based on the second 3D placement. 7. The system of claim 1, wherein:
the controller is configured to transform the 3D placement into a coordinate system used by the scene, and to insert the 3D model of the part at the transformed 3D placement. 8. The system of claim 1, wherein:
the update indicates tolerancing information for the part. 9. The system of claim 8, wherein:
the update indicates tolerancing information for the part, and the controller is configured to determine, based on the tolerancing information, whether the part has been installed in an expected position and orientation, and to report a manufacturing fault to the user if the part has not been installed in the expected position and orientation. 10. A method comprising:
generating a three dimensional (3D) scene depicting ongoing assembly of a product by a machine tool, wherein the scene includes a 3D model of the product and a 3D model of the machine tool, and the 3D models are placed within the scene based on a location of the product and a location of the machine tool; receiving an update from the machine tool indicating a 3D placement of a part that has been attached by the machine tool to the product; acquiring a 3D model of the part; inserting the 3D model of the part within the scene based on the 3D placement of the part; and providing the scene for display to a user. 11. The method of claim 10, wherein:
the 3D placement indicates a position and orientation of the part as attached to the product. 12. The method of claim 11, wherein:
the 3D placement comprises an X value, a Y value, and a Z value representing position, and a θ value, a Φ value, and a Ψ value representing orientation. 13. The method of claim 10, further comprising:
receiving updates from multiple machine tools that are assembling the product within an assembly cell; and inserting 3D models for parts within the scene based on the updates from the multiple machine tools. 14. The method of claim 10, further comprising:
determining, based on the update, that a manufacturing fault has been encountered by the machine tool; and updating the scene to represent the manufacturing fault. 15. The method of claim 10, wherein:
the update indicates a second 3D placement describing a movable component of the machine tool, and the method further comprises: updating the 3D model of the machine tool based on the second 3D placement. 16. The method of claim 10, further comprising:
transforming the 3D placement into a coordinate system used by the scene; and placing the 3D model of the part at the transformed 3D placement. 17. The method of claim 10, wherein:
the update indicates tolerancing information for the part. 18. The method of claim 17, wherein the method further comprises:
determining, based on the tolerancing information, whether the part has been installed in an expected position and orientation; and reporting a manufacturing fault to the user if the part has not been installed in the expected position and orientation. 19. An apparatus comprising:
a machine tool configured to assemble a product by attaching parts to the product, wherein the machine tool comprises:
a controller configured to detect 3D placements of parts that have been attached to the product by the machine tool, and to generate updates that each include a detected 3D placement of a part attached to the product by the machine tool; and
an interface configured to transmit the updates to an external device. 20. The apparatus of claim 19, wherein:
the controller is configured to include tolerancing information in each update indicating a deviation of the part from an expected 3D position and orientation. | 2,100 |
5,720 | 5,720 | 14,850,104 | 2,181 | Unified systems and methods for interchip and intrachip node communication are disclosed. In one aspect, a single unified low-speed bus is provided that connects each of the chips within a computing device. The chips couple to the bus through a physical layer interface and associated gateway. The gateway includes memory that stores a status table summarizing statuses for every node in the interface fabric. As nodes experience state changes, the nodes provide updates to associated local gateways. The local gateways then message, using a scout message, remote gateways with information relating to the state changes. When a first node is preparing a signal to a second node, the first node checks the status table at the associated local gateway to determine a current status for the second node. Based on the status of the second node, the first node may send the message or take other appropriate action. | 1. A method for populating a status table for network nodes within a computing device, the method comprising:
activating a first integrated circuit (IC) coupled to a bus; registering first nodes associated with the first IC with a first gateway; populating a first status table at the first gateway with information about the first nodes associated with the first IC; and permitting intrachip communication between the first nodes associated with the first IC based on availability as indicated in the first status table. 2. The method of claim 1, further comprising:
activating a second IC coupled to the bus; registering second nodes associated with the second IC with a second gateway; populating a second status table at the second gateway with information about the second nodes associated with the second IC; requesting, by the second gateway, configuration data from the first gateway; and populating the second status table at the second gateway with the information about the first nodes associated with the first IC based on the information about the first nodes associated with the first IC from the first status table at the first gateway. 3. The method of claim 2, further comprising broadcasting, from the second gateway, across the bus, the information about the second nodes associated with the second IC stored in the second status table. 4. The method of claim 1, further comprising, responsive to a first node changing state, updating the first status table to reflect a changed state for the first node. 5. The method of claim 4, further comprising:
generating a scout message at the first gateway with information related to the changed state for the first node; and sending the scout message from the first gateway to remote gateways communicatively coupled to the bus. 6. The method of claim 5, further comprising:
receiving the scout message at a second gateway; and updating a second status table based on the scout message. 7. The method of claim 1, wherein permitting the intrachip communication between the first nodes associated with the first IC based on the availability as indicated in the first status table comprises:
receiving, at the first gateway, a message request from an initial node within the first IC to a destination node within the first IC; determining if the destination node is available based on the information about the first nodes associated with the first IC in the first status table; and instructing the initial node to send a message associated with the message request if the destination node is available. 8. The method of claim 7, further comprising:
responsive to determining the destination node is not available, determining if the destination node is wakeable; responsive to determining the destination node is wakeable, sending a wake command to the destination node; and instructing the initial node to send the message associated with the message request after waking the destination node. 9. The method of claim 1, further comprising:
receiving a message request from an initial node within the first IC to a destination node at a second IC; determining if the destination node is available based on information about the destination node in the first status table; and instructing the initial node to send a message associated with the message request across the bus if the destination node is available. 10. A method for populating a status table for network nodes within a computing device, the method comprising:
coupling a first integrated circuit (IC) with first nodes to a bus within a computing device; coupling a second IC with second nodes to the bus within the computing device; receiving, from a first gateway associated with the first IC, status and configuration information relating to the first nodes; and populating, with the status and configuration information relating to the first nodes, a status table at a second gateway associated with the second IC. 11. The method of claim 10, further comprising populating the status table at the second gateway with second status and configuration information relating to the second nodes. 12. The method of claim 10, further comprising receiving an update from the first gateway indicating a change in status of one of the first nodes. 13. The method of claim 12, further comprising updating the status table at the second gateway with the update indicating the change in the status of the one of the first nodes. 14. The method of claim 10, further comprising requesting, by the second IC, the status and configuration information relating to the first nodes responsive to the second IC being coupled to the bus. 15. A method for updating a status table for network nodes within a computing device, the method comprising:
at a first gateway in a first integrated circuit (IC), receiving a state change indication from a first node in the first IC; responsive to the state change indication, updating a first status table at the first gateway to reflect a state change of the first node; and generating a scout message to a second gateway in a second IC, wherein the scout message indicates the state change of the first node. 16. A method for updating a status table for network nodes within a computing device, the method comprising:
at a first gateway in a first integrated circuit (IC), receiving a scout message from a second gateway in a second IC, wherein the scout message indicates a state change of a node in the second IC; responsive to the scout message, updating a first status table at the first gateway to reflect the state change of the node. 17. An integrated circuit (IC), comprising:
a node comprising a transmitter and a receiver; and a gateway comprising:
an external interface configured to be coupled to a bus and communicate thereover through a first protocol; and
an internal interface communicatively coupled to the node and configured to communicate therebetween through the first protocol. 18. The IC of claim 17, wherein the node is coupled to the internal interface of the gateway directly. 19. The IC of claim 17, wherein the node is coupled to the internal interface of the gateway through a network on chip (NoC). 20. The IC of claim 17, further comprising a control system configured to control the gateway. 21. The IC of claim 20, wherein the control system is positioned within the gateway. 22. The IC of claim 20, wherein the control system is external to the gateway. 23. The IC of claim 20, further comprising plural nodes coupled to the internal interface of the gateway. 24. The IC of claim 23, wherein the control system is configured to arbitrate between the plural nodes. 25. The IC of claim 20, wherein the control system is configured to execute the first protocol. 26. The IC of claim 17, wherein the node is configured to communicate with a second node within the IC. 27. The IC of claim 17, wherein the node is configured to communicate with a second node outside the IC. 28. The IC of claim 17, wherein the node comprises circuitry configured to operate as at least one of a navigation circuit, a sensor circuit, an Always On Processor (AOP) circuit, an audio circuit, and a modem circuit. 29. An integrated circuit (IC) comprising:
a first node; a second node; a gateway comprising an external interface configured to couple to a bus and operative to control information from the first node and the second node; and common circuitry that communicatively couples the first node and the second node to the gateway. 30. A computing system comprising:
a first integrated circuit (IC) comprising:
a first node comprising a first transmitter and a first receiver;
a first gateway comprising:
a first external interface; and
a first internal interface communicatively coupled to the first node and configured to communicate therebetween through a first protocol;
a second IC comprising:
a second node comprising a second transmitter and a second receiver;
a second gateway comprising:
a second external interface; and
a second internal interface communicatively coupled to the second node and configured to communicate therebetween through the first protocol; and
a bus coupled to the first gateway of the first IC and the second gateway of the second IC and configured to carry signals therebetween using the first protocol. 31. The computing system of claim 30 wherein the computing system is 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 smart phone, a tablet, a phablet, a desktop computer; a personal digital assistant (PDA); a monitor; a computer monitor; a television; a tuner; a radio; a satellite radio; a music player; a digital music player; a portable music player; a digital video player; a video player; a digital video disc (DVD) player; a portable digital video player, and an automobile. 32. An integrated circuit (IC) comprising:
a node; a gateway communicatively coupled to the node, the gateway comprising:
an interface configured to be coupled to a bus; and
a look-up table configured to store data relating to availability of nodes associated with the bus; and
a control system operatively coupled to the node and the gateway, the control system configured to:
receive a status update relating to a state of the node; and
send information relating to the state of the node to other gateways associated with the bus to promote reliability between node-to-node communication. 33. The IC of claim 32, further comprising a plurality of nodes communicatively coupled to the gateway. 34. The IC of claim 32, wherein the control system is positioned within the gateway. 35. The IC of claim 32, wherein the control system is positioned outside the gateway. 36. The IC of claim 32, wherein the control system is further configured to:
receive a message request from the node; compare a destination identifier from the message request to the look-up table; and determine availability of a receiving node based on the data in the look-up table. 37. The IC of claim 36, wherein the control system is further configured to preclude transmission of a message from the node if the control system determines the receiving node is not available based on the data in the look-up table. 38. The IC of claim 32, wherein the control system is further configured to:
receive a message request from the node; determine if the message request requires reliability; and if the message request does not require reliability, instruct the node to send a message associated with the message request to a second node. 39. The IC of claim 36, wherein the control system is further configured to:
determine a wake on command capability of the receiving node; and send a wake command to the receiving node. 40. The IC of claim 36, wherein the control system configured to determine the availability of the receiving node determines availability of a receiving node within the IC. 41. The IC of claim 36, wherein the control system configured to determine the availability of the receiving node determines availability of a receiving node positioned outside the IC. 42. The IC of claim 32, wherein the control system is further configured to receive a remote status update relating to a state of a second node positioned outside the IC. 43. A method for facilitating node-to-node communication, comprising:
receiving a status update from a local node at a gateway; and broadcasting the status update to remote gateways. 44. The method of claim 43, wherein broadcasting the status update comprises informing the remote gateways the local node is unavailable. 45. The method of claim 43, wherein broadcasting the status update comprises informing the remote gateways the local node is asleep. 46. The method of claim 45, wherein informing the remote gateways the local node is asleep further comprises informing the remote gateways the local node is wakeable on command. 47. The method of claim 43, further comprising receiving a second status update from a remote gateway. 48. The method of claim 47, further comprising updating a look-up table with the second status update. 49. The method of claim 47, further comprising receiving a message request from the local node. 50. The method of claim 49, further comprising precluding sending a message from the local node if the second status update indicates that a destination node associated with the message request was unavailable. 51. A method of forcing a system reset, comprising:
during an arbitration phase, asserting from a gateway a most urgent priority value to win arbitration; after winning the arbitration, sending no data from the gateway to force a bus timeout; and responsive to the bus timeout, initiating a system reset. 52. The method of claim 51, further comprising:
detecting an error between a node state and information in a status table at the gateway; and responsive to detecting the error, determining the system reset is needed. 53. The method of claim 51, wherein asserting the most urgent priority value comprises asserting all logical ones. 54. The method of claim 51, wherein asserting the most urgent priority value comprises asserting all logical zeros. 55. The method of claim 51, further comprising sending no clock signal from the gateway after winning the arbitration. 56. The method of claim 51, wherein asserting from the gateway the most urgent priority value to win the arbitration comprises asserting the most urgent priority value concurrently from multiple gateways. 57. The method of claim 51, further comprising running a timer to allow slow gateways to detect the bus timeout before initiating the system reset. 58. An integrated circuit (IC) comprising:
a gateway comprising:
a bus interface configured to couple to a bus; and
a control system configured to:
during an arbitration phase, assert a most urgent priority value on the bus to win arbitration;
after winning the arbitration, send no data on the bus to force a bus timeout; and
responsive to the bus timeout, initiate a system reset. | Unified systems and methods for interchip and intrachip node communication are disclosed. In one aspect, a single unified low-speed bus is provided that connects each of the chips within a computing device. The chips couple to the bus through a physical layer interface and associated gateway. The gateway includes memory that stores a status table summarizing statuses for every node in the interface fabric. As nodes experience state changes, the nodes provide updates to associated local gateways. The local gateways then message, using a scout message, remote gateways with information relating to the state changes. When a first node is preparing a signal to a second node, the first node checks the status table at the associated local gateway to determine a current status for the second node. Based on the status of the second node, the first node may send the message or take other appropriate action.1. A method for populating a status table for network nodes within a computing device, the method comprising:
activating a first integrated circuit (IC) coupled to a bus; registering first nodes associated with the first IC with a first gateway; populating a first status table at the first gateway with information about the first nodes associated with the first IC; and permitting intrachip communication between the first nodes associated with the first IC based on availability as indicated in the first status table. 2. The method of claim 1, further comprising:
activating a second IC coupled to the bus; registering second nodes associated with the second IC with a second gateway; populating a second status table at the second gateway with information about the second nodes associated with the second IC; requesting, by the second gateway, configuration data from the first gateway; and populating the second status table at the second gateway with the information about the first nodes associated with the first IC based on the information about the first nodes associated with the first IC from the first status table at the first gateway. 3. The method of claim 2, further comprising broadcasting, from the second gateway, across the bus, the information about the second nodes associated with the second IC stored in the second status table. 4. The method of claim 1, further comprising, responsive to a first node changing state, updating the first status table to reflect a changed state for the first node. 5. The method of claim 4, further comprising:
generating a scout message at the first gateway with information related to the changed state for the first node; and sending the scout message from the first gateway to remote gateways communicatively coupled to the bus. 6. The method of claim 5, further comprising:
receiving the scout message at a second gateway; and updating a second status table based on the scout message. 7. The method of claim 1, wherein permitting the intrachip communication between the first nodes associated with the first IC based on the availability as indicated in the first status table comprises:
receiving, at the first gateway, a message request from an initial node within the first IC to a destination node within the first IC; determining if the destination node is available based on the information about the first nodes associated with the first IC in the first status table; and instructing the initial node to send a message associated with the message request if the destination node is available. 8. The method of claim 7, further comprising:
responsive to determining the destination node is not available, determining if the destination node is wakeable; responsive to determining the destination node is wakeable, sending a wake command to the destination node; and instructing the initial node to send the message associated with the message request after waking the destination node. 9. The method of claim 1, further comprising:
receiving a message request from an initial node within the first IC to a destination node at a second IC; determining if the destination node is available based on information about the destination node in the first status table; and instructing the initial node to send a message associated with the message request across the bus if the destination node is available. 10. A method for populating a status table for network nodes within a computing device, the method comprising:
coupling a first integrated circuit (IC) with first nodes to a bus within a computing device; coupling a second IC with second nodes to the bus within the computing device; receiving, from a first gateway associated with the first IC, status and configuration information relating to the first nodes; and populating, with the status and configuration information relating to the first nodes, a status table at a second gateway associated with the second IC. 11. The method of claim 10, further comprising populating the status table at the second gateway with second status and configuration information relating to the second nodes. 12. The method of claim 10, further comprising receiving an update from the first gateway indicating a change in status of one of the first nodes. 13. The method of claim 12, further comprising updating the status table at the second gateway with the update indicating the change in the status of the one of the first nodes. 14. The method of claim 10, further comprising requesting, by the second IC, the status and configuration information relating to the first nodes responsive to the second IC being coupled to the bus. 15. A method for updating a status table for network nodes within a computing device, the method comprising:
at a first gateway in a first integrated circuit (IC), receiving a state change indication from a first node in the first IC; responsive to the state change indication, updating a first status table at the first gateway to reflect a state change of the first node; and generating a scout message to a second gateway in a second IC, wherein the scout message indicates the state change of the first node. 16. A method for updating a status table for network nodes within a computing device, the method comprising:
at a first gateway in a first integrated circuit (IC), receiving a scout message from a second gateway in a second IC, wherein the scout message indicates a state change of a node in the second IC; responsive to the scout message, updating a first status table at the first gateway to reflect the state change of the node. 17. An integrated circuit (IC), comprising:
a node comprising a transmitter and a receiver; and a gateway comprising:
an external interface configured to be coupled to a bus and communicate thereover through a first protocol; and
an internal interface communicatively coupled to the node and configured to communicate therebetween through the first protocol. 18. The IC of claim 17, wherein the node is coupled to the internal interface of the gateway directly. 19. The IC of claim 17, wherein the node is coupled to the internal interface of the gateway through a network on chip (NoC). 20. The IC of claim 17, further comprising a control system configured to control the gateway. 21. The IC of claim 20, wherein the control system is positioned within the gateway. 22. The IC of claim 20, wherein the control system is external to the gateway. 23. The IC of claim 20, further comprising plural nodes coupled to the internal interface of the gateway. 24. The IC of claim 23, wherein the control system is configured to arbitrate between the plural nodes. 25. The IC of claim 20, wherein the control system is configured to execute the first protocol. 26. The IC of claim 17, wherein the node is configured to communicate with a second node within the IC. 27. The IC of claim 17, wherein the node is configured to communicate with a second node outside the IC. 28. The IC of claim 17, wherein the node comprises circuitry configured to operate as at least one of a navigation circuit, a sensor circuit, an Always On Processor (AOP) circuit, an audio circuit, and a modem circuit. 29. An integrated circuit (IC) comprising:
a first node; a second node; a gateway comprising an external interface configured to couple to a bus and operative to control information from the first node and the second node; and common circuitry that communicatively couples the first node and the second node to the gateway. 30. A computing system comprising:
a first integrated circuit (IC) comprising:
a first node comprising a first transmitter and a first receiver;
a first gateway comprising:
a first external interface; and
a first internal interface communicatively coupled to the first node and configured to communicate therebetween through a first protocol;
a second IC comprising:
a second node comprising a second transmitter and a second receiver;
a second gateway comprising:
a second external interface; and
a second internal interface communicatively coupled to the second node and configured to communicate therebetween through the first protocol; and
a bus coupled to the first gateway of the first IC and the second gateway of the second IC and configured to carry signals therebetween using the first protocol. 31. The computing system of claim 30 wherein the computing system is 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 smart phone, a tablet, a phablet, a desktop computer; a personal digital assistant (PDA); a monitor; a computer monitor; a television; a tuner; a radio; a satellite radio; a music player; a digital music player; a portable music player; a digital video player; a video player; a digital video disc (DVD) player; a portable digital video player, and an automobile. 32. An integrated circuit (IC) comprising:
a node; a gateway communicatively coupled to the node, the gateway comprising:
an interface configured to be coupled to a bus; and
a look-up table configured to store data relating to availability of nodes associated with the bus; and
a control system operatively coupled to the node and the gateway, the control system configured to:
receive a status update relating to a state of the node; and
send information relating to the state of the node to other gateways associated with the bus to promote reliability between node-to-node communication. 33. The IC of claim 32, further comprising a plurality of nodes communicatively coupled to the gateway. 34. The IC of claim 32, wherein the control system is positioned within the gateway. 35. The IC of claim 32, wherein the control system is positioned outside the gateway. 36. The IC of claim 32, wherein the control system is further configured to:
receive a message request from the node; compare a destination identifier from the message request to the look-up table; and determine availability of a receiving node based on the data in the look-up table. 37. The IC of claim 36, wherein the control system is further configured to preclude transmission of a message from the node if the control system determines the receiving node is not available based on the data in the look-up table. 38. The IC of claim 32, wherein the control system is further configured to:
receive a message request from the node; determine if the message request requires reliability; and if the message request does not require reliability, instruct the node to send a message associated with the message request to a second node. 39. The IC of claim 36, wherein the control system is further configured to:
determine a wake on command capability of the receiving node; and send a wake command to the receiving node. 40. The IC of claim 36, wherein the control system configured to determine the availability of the receiving node determines availability of a receiving node within the IC. 41. The IC of claim 36, wherein the control system configured to determine the availability of the receiving node determines availability of a receiving node positioned outside the IC. 42. The IC of claim 32, wherein the control system is further configured to receive a remote status update relating to a state of a second node positioned outside the IC. 43. A method for facilitating node-to-node communication, comprising:
receiving a status update from a local node at a gateway; and broadcasting the status update to remote gateways. 44. The method of claim 43, wherein broadcasting the status update comprises informing the remote gateways the local node is unavailable. 45. The method of claim 43, wherein broadcasting the status update comprises informing the remote gateways the local node is asleep. 46. The method of claim 45, wherein informing the remote gateways the local node is asleep further comprises informing the remote gateways the local node is wakeable on command. 47. The method of claim 43, further comprising receiving a second status update from a remote gateway. 48. The method of claim 47, further comprising updating a look-up table with the second status update. 49. The method of claim 47, further comprising receiving a message request from the local node. 50. The method of claim 49, further comprising precluding sending a message from the local node if the second status update indicates that a destination node associated with the message request was unavailable. 51. A method of forcing a system reset, comprising:
during an arbitration phase, asserting from a gateway a most urgent priority value to win arbitration; after winning the arbitration, sending no data from the gateway to force a bus timeout; and responsive to the bus timeout, initiating a system reset. 52. The method of claim 51, further comprising:
detecting an error between a node state and information in a status table at the gateway; and responsive to detecting the error, determining the system reset is needed. 53. The method of claim 51, wherein asserting the most urgent priority value comprises asserting all logical ones. 54. The method of claim 51, wherein asserting the most urgent priority value comprises asserting all logical zeros. 55. The method of claim 51, further comprising sending no clock signal from the gateway after winning the arbitration. 56. The method of claim 51, wherein asserting from the gateway the most urgent priority value to win the arbitration comprises asserting the most urgent priority value concurrently from multiple gateways. 57. The method of claim 51, further comprising running a timer to allow slow gateways to detect the bus timeout before initiating the system reset. 58. An integrated circuit (IC) comprising:
a gateway comprising:
a bus interface configured to couple to a bus; and
a control system configured to:
during an arbitration phase, assert a most urgent priority value on the bus to win arbitration;
after winning the arbitration, send no data on the bus to force a bus timeout; and
responsive to the bus timeout, initiate a system reset. | 2,100 |
5,721 | 5,721 | 15,609,651 | 2,133 | A hybrid storage device with three-level memory mapping is provided. An illustrative device comprises a primary storage device comprising a plurality of primary sub-blocks; a cache memory device comprising a plurality of cache sub-blocks implemented as a cache for the primary storage device; and a controller configured to map at least one portion of one or more primary sub-blocks of the primary storage device stored in the cache to a physical location in the cache memory device using at least one table identifying portions of the primary storage device that are cached in one or more of the cache sub-blocks of the cache memory device, wherein a size of the at least one table is independent of a capacity of the primary storage device. | 1. A hybrid storage device, comprising:
a primary storage device comprising a plurality of primary sub-blocks; a cache memory device comprising a plurality of cache sub-blocks implemented as a cache for the primary storage device; and a controller configured to map at least one portion of one or more primary sub-blocks of the primary storage device stored in the cache to a physical location in the cache memory device using at least one hybrid storage mapping table identifying portions of the primary storage device that are cached in one or more physical locations of the cache sub-blocks of the cache memory device, wherein a size of the at least one hybrid storage mapping table is independent of a capacity of the primary storage device of the hybrid storage device. 2. The device of claim 1, wherein the at least one hybrid storage mapping table is implemented as a content addressable memory where an address of an entry identifies one of the cache sub-blocks of the cache memory device and where a content of an entry identifies at least portions of the one or more primary sub-blocks of the primary storage device stored in corresponding cache sub-blocks of the cache memory device. 3. The device of claim 1, wherein the cache memory device comprises a solid-state drive (SSD) and wherein the primary storage device comprises one or more of a hard disk drive (HDD) and another solid-state drive. 4. The device of claim 1, wherein, in response to a write request comprising a logical block address in a logical block address space and respective data to be written to the primary storage device, determining a physical location in the primary storage device to store the respective data of the write request; adding an entry in one or more tables comprising a logical block address field set to the respective logical block address of the write request and a respective physical location field set to the determined physical location; and updating one of a plurality of cache-level map pages in a two-level map according to the respective logical block address of the write request with the determined physical location, wherein the two-level map is formed by each of the plurality of cache-level map pages being associated with a respective one of a plurality of primary-level map entries. 5. The device of claim 4, further comprising a primary storage device-to-cache memory device mapper identifying where a given portion of the primary storage device is stored within one or more cache sub-blocks of the cache memory device, and wherein the primary storage device-to-cache memory device mapper provides an index into the two-level map. 6. The device of claim 4, wherein the at least one hybrid storage mapping table and the two-level map comprise a three-level map. 7. The device of claim 4, wherein the two-level map is accessed to identify where a given portion of the primary storage device is stored within one or more cache sub-blocks of the cache memory device when the at least one hybrid storage mapping table indicates that the given portion of the primary storage device is stored in the cache memory device. 8. The device of claim 4, wherein the two-level map is recovered using data in the cache memory device and wherein the at least one hybrid storage mapping table is regenerated to obtain the mapping of the at least one portion of the one or more primary sub-blocks of the primary storage device stored in the cache to the physical location in the cache memory device. 9. The device of claim 1, wherein the at least one hybrid storage mapping table further comprises a timestamp indicating when each cache sub-block was last accessed, and wherein a least recently used cache sub-block is evicted when the cache memory device reaches a predefined capacity threshold. 10. The device of claim 1, wherein data within the primary storage device is promoted to the cache in the cache memory device based on an access frequency of the data. 11. The device of claim 10, wherein an amount of the data from the primary storage device that is promoted to the cache in the cache memory device is configurable. 12. The device of claim 10, wherein a plurality of portions of a plurality of random primary sub-blocks from the primary storage device are promoted to one cache sub-block in the cache memory device is configurable. 13. A method, comprising:
obtaining at least one hybrid storage mapping table identifying portions of a primary storage device that are cached in one or more physical locations of a cache sub-blocks of a cache memory device, wherein the primary storage device and the cache memory device are part of a hybrid storage device; mapping at least one portion of one or more primary sub-blocks of the primary storage device comprising a plurality of primary sub-blocks that are stored in the cache memory device comprising a plurality of cache sub-blocks implemented as a cache for the primary storage device to a physical location in the cache memory device using the at least one hybrid storage mapping table, wherein a size of the at least one hybrid storage mapping table is independent of a capacity of the primary storage device of the hybrid storage device. 14. The method of claim 13, wherein the at least one hybrid storage mapping table is implemented as a content addressable memory where an address of an entry identifies one of the cache sub-blocks of the cache memory device and where a content of an entry identifies at least portions of the one or more primary sub-blocks of the primary storage device stored in corresponding cache sub-blocks of the cache memory device. 15. The method of claim 13, wherein the at least one hybrid storage mapping table further comprises a timestamp indicating when each cache sub-block was last accessed, and wherein a least recently used cache sub-block is evicted when the cache memory device reaches a predefined capacity threshold. 16. The method of claim 13, wherein data within the primary storage device is promoted to the cache in the cache memory device based on an access frequency of the data. 17. A controller system, comprising:
a controller configured to map at least one portion of one or more primary sub-blocks of a primary storage device comprising a plurality of primary sub-blocks that are stored in a cache memory device comprising a plurality of cache sub-blocks implemented as a cache for the primary storage device to a physical location in the cache memory device using at least one hybrid storage mapping table identifying portions of the primary storage device that are cached in one or more physical locations of the cache sub-blocks of the cache memory device, wherein a size of the at least one hybrid storage mapping table is independent of a capacity of the primary storage device, wherein the primary storage device and the cache memory device are part of a hybrid storage device. 18. The controller system of claim 17, wherein the at least one hybrid storage mapping table is implemented as a content addressable memory where an address of an entry identifies one of the cache sub-blocks of the cache memory device and where a content of an entry identifies at least portions of the one or more primary sub-blocks of the primary storage device stored in corresponding cache sub-blocks of the cache memory device. 19. The controller system of claim 17, wherein the at least one hybrid storage mapping table further comprises a timestamp indicating when each cache sub-block was last accessed, and wherein a least recently used cache sub-block is evicted when the cache memory device reaches a predefined capacity threshold. 20. The controller system of claim 17, wherein data within the primary storage device is promoted to the cache in the cache memory device based on an access frequency of the data. | A hybrid storage device with three-level memory mapping is provided. An illustrative device comprises a primary storage device comprising a plurality of primary sub-blocks; a cache memory device comprising a plurality of cache sub-blocks implemented as a cache for the primary storage device; and a controller configured to map at least one portion of one or more primary sub-blocks of the primary storage device stored in the cache to a physical location in the cache memory device using at least one table identifying portions of the primary storage device that are cached in one or more of the cache sub-blocks of the cache memory device, wherein a size of the at least one table is independent of a capacity of the primary storage device.1. A hybrid storage device, comprising:
a primary storage device comprising a plurality of primary sub-blocks; a cache memory device comprising a plurality of cache sub-blocks implemented as a cache for the primary storage device; and a controller configured to map at least one portion of one or more primary sub-blocks of the primary storage device stored in the cache to a physical location in the cache memory device using at least one hybrid storage mapping table identifying portions of the primary storage device that are cached in one or more physical locations of the cache sub-blocks of the cache memory device, wherein a size of the at least one hybrid storage mapping table is independent of a capacity of the primary storage device of the hybrid storage device. 2. The device of claim 1, wherein the at least one hybrid storage mapping table is implemented as a content addressable memory where an address of an entry identifies one of the cache sub-blocks of the cache memory device and where a content of an entry identifies at least portions of the one or more primary sub-blocks of the primary storage device stored in corresponding cache sub-blocks of the cache memory device. 3. The device of claim 1, wherein the cache memory device comprises a solid-state drive (SSD) and wherein the primary storage device comprises one or more of a hard disk drive (HDD) and another solid-state drive. 4. The device of claim 1, wherein, in response to a write request comprising a logical block address in a logical block address space and respective data to be written to the primary storage device, determining a physical location in the primary storage device to store the respective data of the write request; adding an entry in one or more tables comprising a logical block address field set to the respective logical block address of the write request and a respective physical location field set to the determined physical location; and updating one of a plurality of cache-level map pages in a two-level map according to the respective logical block address of the write request with the determined physical location, wherein the two-level map is formed by each of the plurality of cache-level map pages being associated with a respective one of a plurality of primary-level map entries. 5. The device of claim 4, further comprising a primary storage device-to-cache memory device mapper identifying where a given portion of the primary storage device is stored within one or more cache sub-blocks of the cache memory device, and wherein the primary storage device-to-cache memory device mapper provides an index into the two-level map. 6. The device of claim 4, wherein the at least one hybrid storage mapping table and the two-level map comprise a three-level map. 7. The device of claim 4, wherein the two-level map is accessed to identify where a given portion of the primary storage device is stored within one or more cache sub-blocks of the cache memory device when the at least one hybrid storage mapping table indicates that the given portion of the primary storage device is stored in the cache memory device. 8. The device of claim 4, wherein the two-level map is recovered using data in the cache memory device and wherein the at least one hybrid storage mapping table is regenerated to obtain the mapping of the at least one portion of the one or more primary sub-blocks of the primary storage device stored in the cache to the physical location in the cache memory device. 9. The device of claim 1, wherein the at least one hybrid storage mapping table further comprises a timestamp indicating when each cache sub-block was last accessed, and wherein a least recently used cache sub-block is evicted when the cache memory device reaches a predefined capacity threshold. 10. The device of claim 1, wherein data within the primary storage device is promoted to the cache in the cache memory device based on an access frequency of the data. 11. The device of claim 10, wherein an amount of the data from the primary storage device that is promoted to the cache in the cache memory device is configurable. 12. The device of claim 10, wherein a plurality of portions of a plurality of random primary sub-blocks from the primary storage device are promoted to one cache sub-block in the cache memory device is configurable. 13. A method, comprising:
obtaining at least one hybrid storage mapping table identifying portions of a primary storage device that are cached in one or more physical locations of a cache sub-blocks of a cache memory device, wherein the primary storage device and the cache memory device are part of a hybrid storage device; mapping at least one portion of one or more primary sub-blocks of the primary storage device comprising a plurality of primary sub-blocks that are stored in the cache memory device comprising a plurality of cache sub-blocks implemented as a cache for the primary storage device to a physical location in the cache memory device using the at least one hybrid storage mapping table, wherein a size of the at least one hybrid storage mapping table is independent of a capacity of the primary storage device of the hybrid storage device. 14. The method of claim 13, wherein the at least one hybrid storage mapping table is implemented as a content addressable memory where an address of an entry identifies one of the cache sub-blocks of the cache memory device and where a content of an entry identifies at least portions of the one or more primary sub-blocks of the primary storage device stored in corresponding cache sub-blocks of the cache memory device. 15. The method of claim 13, wherein the at least one hybrid storage mapping table further comprises a timestamp indicating when each cache sub-block was last accessed, and wherein a least recently used cache sub-block is evicted when the cache memory device reaches a predefined capacity threshold. 16. The method of claim 13, wherein data within the primary storage device is promoted to the cache in the cache memory device based on an access frequency of the data. 17. A controller system, comprising:
a controller configured to map at least one portion of one or more primary sub-blocks of a primary storage device comprising a plurality of primary sub-blocks that are stored in a cache memory device comprising a plurality of cache sub-blocks implemented as a cache for the primary storage device to a physical location in the cache memory device using at least one hybrid storage mapping table identifying portions of the primary storage device that are cached in one or more physical locations of the cache sub-blocks of the cache memory device, wherein a size of the at least one hybrid storage mapping table is independent of a capacity of the primary storage device, wherein the primary storage device and the cache memory device are part of a hybrid storage device. 18. The controller system of claim 17, wherein the at least one hybrid storage mapping table is implemented as a content addressable memory where an address of an entry identifies one of the cache sub-blocks of the cache memory device and where a content of an entry identifies at least portions of the one or more primary sub-blocks of the primary storage device stored in corresponding cache sub-blocks of the cache memory device. 19. The controller system of claim 17, wherein the at least one hybrid storage mapping table further comprises a timestamp indicating when each cache sub-block was last accessed, and wherein a least recently used cache sub-block is evicted when the cache memory device reaches a predefined capacity threshold. 20. The controller system of claim 17, wherein data within the primary storage device is promoted to the cache in the cache memory device based on an access frequency of the data. | 2,100 |
5,722 | 5,722 | 15,146,971 | 2,162 | A method for generating a universal distributed data storage includes: receiving a plurality of data values; generating a key for each of the plurality of data values, wherein the respective key is generated via application of a hashing algorithm to the associated data value; storing, in a database, each of the plurality of data values and the associated generated key as a plurality of key-value pairs; receiving a plurality of additional key-value pairs, wherein each value of the plurality of additional key-value pairs is not included in the plurality of data values; and storing, in the database, each of the plurality of additional key-value pairs, wherein each key included in the plurality of additional key-value pairs is generated via application of the hashing algorithm to the associated value and is not included in the keys generated for each of the plurality of data values. | 1. A method for generating a universal distributed data storage, comprising:
receiving, by a receiving device of a processing server, a data signal superimposed with a plurality of data values; generating, by a hashing module of the processing server, a key for each of the plurality of data values, wherein the respective key is generated via application of a hashing algorithm to the associated data value; executing, by a querying module of the processing server, a first query on a database of the processing server to store each of the plurality of data values and the associated generated key as a plurality of key-value pairs; receiving, by the receiving device of the processing server, a data signal superimposed with a plurality of additional key-value pairs, wherein each value of the plurality of additional key-value pairs is not included in the plurality of data values; and executing, by the querying module of the processing server, a second query on the database of the processing server to store each of the plurality of additional key-value pairs, wherein each key included in the plurality of additional key-value pairs is generated via application of the hashing algorithm to the associated value and is not included in the keys generated for each of the plurality of data values. 2. The method of claim 1, wherein the hashing algorithm is a collision-resistant hash algorithm. 3. The method of claim 2, wherein the hashing algorithm is an SHA-256 algorithm. 4. The method of claim 1, further comprising:
executing, by the querying module of the processing server, a third query on the database of the processing server to sort the plurality of key-value pairs and plurality of additional key-value pairs based on the respective key. 5. The method of claim 1, further comprising:
receiving, by the receiving device of the processing server, a data signal superimposed with a rehash request, wherein the rehash request indicates a different hashing algorithm; generating, by the hashing module of the processing server, a new key for each of the plurality of data values and each value included in the plurality of additional key-value pairs; and executing, by the querying module of the processing server, a third query on the database of the processing server to replace the key in each of the plurality of key-value pairs and plurality of additional key-value pairs with the respective generated new key. 6. The method of claim 5, wherein the different hashing algorithm is a collision-resistant hashing algorithm. 7. The method of claim 6, wherein the hashing algorithm is an SHA-256 algorithm. 8. The method of claim 5, further comprising:
executing, by the querying module of the processing server, a fourth query on the database of the processing server to sort the plurality of key-value pairs and plurality of additional key-value pairs based on the respective generated new key. 9. The method of claim 1, further comprising:
receiving, by the receiving device of the processing server, a data signal superimposed with a value request, wherein the value request includes at least a requesting key; executing, by the querying module of the processing server, a third query on the database of the processing server to identify a specific key-value pair where the key corresponds to the requesting key; and electronically transmitting, by a transmitting device of the processing server, a data signal superimposed with at least the value included in the identified specific key-value pair in response to the received value request. 10. The method of claim 1, wherein the hashing algorithm is such that each generated key is unique with respect to all other generated keys. 11. A system for generating a universal distributed data storage, comprising:
a database of a processing server; a receiving device of the processing server configured to receive a data signal superimposed with a plurality of data values; a hashing module of the processing server configured to generate a key for each of the plurality of data values, wherein the respective key is generated via application of a hashing algorithm to the associated data value; and a querying module of the processing server configured to execute a first query on a database of the processing server to store each of the plurality of data values and the associated generated key as a plurality of key-value pairs, wherein the receiving device of the processing server is further configured to receive a data signal superimposed with a plurality of additional key-value pairs, wherein each value of the plurality of additional key-value pairs is not included in the plurality of data values, the querying module of the processing server is further configured to execute a second query on the database of the processing server to store each of the plurality of additional key-value pairs, and each key included in the plurality of additional key-value pairs is generated via application of the hashing algorithm to the associated value and is not included in the keys generated for each of the plurality of data values. 12. The system of claim 11, wherein the hashing algorithm is a collision-resistant hash algorithm. 13. The system of claim 12, wherein the hashing algorithm is an SHA-256 algorithm. 14. The system of claim 11, wherein the querying module of the processing server is further configured to execute a third query on the database of the processing server to sort the plurality of key-value pairs and plurality of additional key-value pairs based on the respective key. 15. The system of claim 11, wherein
the receiving device of the processing server is further configured to receive a data signal superimposed with a rehash request, wherein the rehash request indicates a different hashing algorithm, the hashing module of the processing server is further configured to generate a new key for each of the plurality of data values and each value included in the plurality of additional key-value pairs, and the querying module of the processing server is further configured to execute a third query on the database of the processing server to replace the key in each of the plurality of key-value pairs and plurality of additional key-value pairs with the respective generated new key. 16. The system of claim 15, wherein the different hashing algorithm is a collision-resistant hashing algorithm. 17. The system of claim 16, wherein the hashing algorithm is an SHA-256 algorithm. 18. The system of claim 15, wherein the querying module of the processing server is further configured to execute a fourth query on the database of the processing server to sort the plurality of key-value pairs and plurality of additional key-value pairs based on the respective generated new key. 19. The system of claim 11, further comprising:
a transmitting device of the processing server, wherein the receiving device of the processing server is further configured to receive a data signal superimposed with a value request, wherein the value request includes at least a requesting key, the querying module of the processing server is further configured to execute a third query on the database of the processing server to identify a specific key-value pair where the key corresponds to the requesting key, and the transmitting device of the processing server is configured to electronically transmit a data signal superimposed with at least the value included in the identified specific key-value pair in response to the received value request. 20. The system of claim 11, wherein the hashing algorithm is such that each generated key is unique with respect to all other generated keys. | A method for generating a universal distributed data storage includes: receiving a plurality of data values; generating a key for each of the plurality of data values, wherein the respective key is generated via application of a hashing algorithm to the associated data value; storing, in a database, each of the plurality of data values and the associated generated key as a plurality of key-value pairs; receiving a plurality of additional key-value pairs, wherein each value of the plurality of additional key-value pairs is not included in the plurality of data values; and storing, in the database, each of the plurality of additional key-value pairs, wherein each key included in the plurality of additional key-value pairs is generated via application of the hashing algorithm to the associated value and is not included in the keys generated for each of the plurality of data values.1. A method for generating a universal distributed data storage, comprising:
receiving, by a receiving device of a processing server, a data signal superimposed with a plurality of data values; generating, by a hashing module of the processing server, a key for each of the plurality of data values, wherein the respective key is generated via application of a hashing algorithm to the associated data value; executing, by a querying module of the processing server, a first query on a database of the processing server to store each of the plurality of data values and the associated generated key as a plurality of key-value pairs; receiving, by the receiving device of the processing server, a data signal superimposed with a plurality of additional key-value pairs, wherein each value of the plurality of additional key-value pairs is not included in the plurality of data values; and executing, by the querying module of the processing server, a second query on the database of the processing server to store each of the plurality of additional key-value pairs, wherein each key included in the plurality of additional key-value pairs is generated via application of the hashing algorithm to the associated value and is not included in the keys generated for each of the plurality of data values. 2. The method of claim 1, wherein the hashing algorithm is a collision-resistant hash algorithm. 3. The method of claim 2, wherein the hashing algorithm is an SHA-256 algorithm. 4. The method of claim 1, further comprising:
executing, by the querying module of the processing server, a third query on the database of the processing server to sort the plurality of key-value pairs and plurality of additional key-value pairs based on the respective key. 5. The method of claim 1, further comprising:
receiving, by the receiving device of the processing server, a data signal superimposed with a rehash request, wherein the rehash request indicates a different hashing algorithm; generating, by the hashing module of the processing server, a new key for each of the plurality of data values and each value included in the plurality of additional key-value pairs; and executing, by the querying module of the processing server, a third query on the database of the processing server to replace the key in each of the plurality of key-value pairs and plurality of additional key-value pairs with the respective generated new key. 6. The method of claim 5, wherein the different hashing algorithm is a collision-resistant hashing algorithm. 7. The method of claim 6, wherein the hashing algorithm is an SHA-256 algorithm. 8. The method of claim 5, further comprising:
executing, by the querying module of the processing server, a fourth query on the database of the processing server to sort the plurality of key-value pairs and plurality of additional key-value pairs based on the respective generated new key. 9. The method of claim 1, further comprising:
receiving, by the receiving device of the processing server, a data signal superimposed with a value request, wherein the value request includes at least a requesting key; executing, by the querying module of the processing server, a third query on the database of the processing server to identify a specific key-value pair where the key corresponds to the requesting key; and electronically transmitting, by a transmitting device of the processing server, a data signal superimposed with at least the value included in the identified specific key-value pair in response to the received value request. 10. The method of claim 1, wherein the hashing algorithm is such that each generated key is unique with respect to all other generated keys. 11. A system for generating a universal distributed data storage, comprising:
a database of a processing server; a receiving device of the processing server configured to receive a data signal superimposed with a plurality of data values; a hashing module of the processing server configured to generate a key for each of the plurality of data values, wherein the respective key is generated via application of a hashing algorithm to the associated data value; and a querying module of the processing server configured to execute a first query on a database of the processing server to store each of the plurality of data values and the associated generated key as a plurality of key-value pairs, wherein the receiving device of the processing server is further configured to receive a data signal superimposed with a plurality of additional key-value pairs, wherein each value of the plurality of additional key-value pairs is not included in the plurality of data values, the querying module of the processing server is further configured to execute a second query on the database of the processing server to store each of the plurality of additional key-value pairs, and each key included in the plurality of additional key-value pairs is generated via application of the hashing algorithm to the associated value and is not included in the keys generated for each of the plurality of data values. 12. The system of claim 11, wherein the hashing algorithm is a collision-resistant hash algorithm. 13. The system of claim 12, wherein the hashing algorithm is an SHA-256 algorithm. 14. The system of claim 11, wherein the querying module of the processing server is further configured to execute a third query on the database of the processing server to sort the plurality of key-value pairs and plurality of additional key-value pairs based on the respective key. 15. The system of claim 11, wherein
the receiving device of the processing server is further configured to receive a data signal superimposed with a rehash request, wherein the rehash request indicates a different hashing algorithm, the hashing module of the processing server is further configured to generate a new key for each of the plurality of data values and each value included in the plurality of additional key-value pairs, and the querying module of the processing server is further configured to execute a third query on the database of the processing server to replace the key in each of the plurality of key-value pairs and plurality of additional key-value pairs with the respective generated new key. 16. The system of claim 15, wherein the different hashing algorithm is a collision-resistant hashing algorithm. 17. The system of claim 16, wherein the hashing algorithm is an SHA-256 algorithm. 18. The system of claim 15, wherein the querying module of the processing server is further configured to execute a fourth query on the database of the processing server to sort the plurality of key-value pairs and plurality of additional key-value pairs based on the respective generated new key. 19. The system of claim 11, further comprising:
a transmitting device of the processing server, wherein the receiving device of the processing server is further configured to receive a data signal superimposed with a value request, wherein the value request includes at least a requesting key, the querying module of the processing server is further configured to execute a third query on the database of the processing server to identify a specific key-value pair where the key corresponds to the requesting key, and the transmitting device of the processing server is configured to electronically transmit a data signal superimposed with at least the value included in the identified specific key-value pair in response to the received value request. 20. The system of claim 11, wherein the hashing algorithm is such that each generated key is unique with respect to all other generated keys. | 2,100 |
5,723 | 5,723 | 11,668,686 | 2,176 | The present invention relates to the generation of customised documents using document templates or master documents in which a mark-up notation is used in a master document, for example to specify the content of a customised document generated from the master document. | 1. A method for displaying a master document of the type used in a document generation system to generate customised documents, the master document comprising portions of document content marked-up according to a predetermined syntax, the method comprising the steps of:
analysing the mark-up associated with at least a portion of the master document; and generating a graphical representation of the mark-up. 2. The method of claim 1 in which the graphical representation of the mark-up comprises a tabular representation. 3. The method of claim 1 in which the master document comprises a conditional document element and the mark-up comprises a rule associated with the conditional document element, the rule specifying the conditions under which the conditional document element is selected for inclusion in the customised document. 4. The method of claim 3 in which the rule comprises a logical statement involving at least one variable. 5. The method of claim 4 in which the graphical representation comprises a table having one or more elements, each element representing a logical statement in which a variable is equated to a value, and in which one or more of the elements are checked. 6. The method of claim 5 in which, if an element is checked in a first manner, the table represents a usage statement consisting of the logical statement corresponding to the checked element. 7. The method of claim 5 in which, if an element is checked in a second manner, the table represents the usage statement consisting of the complement of the logical statement corresponding to the checked element. 8. The method of claim 5 in which, if two elements corresponding to the same variable are checked, the table represents a usage statement formed, at least partially, by operating on two logical statements corresponding to the two checked elements with the OR operator. 9. The method of claim 5 in which, if two elements corresponding to different variables are checked, the table represents a usage statement formed, at least partially, by operating on two logical statements corresponding to the two checked elements with the AND operator. 10. The method of claim 5 in which the graphical representation comprises two or more tables and in which the tables represent a usage statement formed by operating on the usage statements represented by each individual table with one or more logical operators. 11. The method of claim 3 in which the graphical representation of the conditional document element is visually associated with the graphical representation of the rule. 12. The method of claim 1 in which the graphical representation comprises a table having a first set of elements specifying one or more commands and a second set of elements specifying one or more command operands. 13. A computer program product having software recorded thereon which, when executed by a computer, causes the computer to undertake the method of claim 1. 14. A method for modifying a master document of the type used in a document generation system to generate customised documents, the master document comprising portions of document content marked-up according to a predetermined syntax, the method comprising the steps of:
selecting a portion of the master document; analysing the mark-up associated with the selected portion of the master document; generating a graphical representation of the mark-up; modifying the graphical representation of the mark-up; and modifying the mark-up of the master document according to the modification of the graphical representation. 15. The method of claim 14 in which the step of modifying the graphical representation of the mark-up includes the step of modifying the graphical representation of the mark-up in response to a user input. 16. A document generation system arranged to display a master document of the type used to generate customised documents, the master document comprising portions of document content marked-up according to a predetermined syntax, the system comprising:
means for analysing the mark-up associated with at least a portion of the master document; and means for generating a graphical representation of the mark-up. 17. The document generation system of claim 16 further comprising means to modify the graphical representation of the mark-up. 18. The document generation system of claim 17 in which the means to modify the graphical representation of the mark-up comprises means to allow a user to modify the graphical representation of the mark-up. | The present invention relates to the generation of customised documents using document templates or master documents in which a mark-up notation is used in a master document, for example to specify the content of a customised document generated from the master document.1. A method for displaying a master document of the type used in a document generation system to generate customised documents, the master document comprising portions of document content marked-up according to a predetermined syntax, the method comprising the steps of:
analysing the mark-up associated with at least a portion of the master document; and generating a graphical representation of the mark-up. 2. The method of claim 1 in which the graphical representation of the mark-up comprises a tabular representation. 3. The method of claim 1 in which the master document comprises a conditional document element and the mark-up comprises a rule associated with the conditional document element, the rule specifying the conditions under which the conditional document element is selected for inclusion in the customised document. 4. The method of claim 3 in which the rule comprises a logical statement involving at least one variable. 5. The method of claim 4 in which the graphical representation comprises a table having one or more elements, each element representing a logical statement in which a variable is equated to a value, and in which one or more of the elements are checked. 6. The method of claim 5 in which, if an element is checked in a first manner, the table represents a usage statement consisting of the logical statement corresponding to the checked element. 7. The method of claim 5 in which, if an element is checked in a second manner, the table represents the usage statement consisting of the complement of the logical statement corresponding to the checked element. 8. The method of claim 5 in which, if two elements corresponding to the same variable are checked, the table represents a usage statement formed, at least partially, by operating on two logical statements corresponding to the two checked elements with the OR operator. 9. The method of claim 5 in which, if two elements corresponding to different variables are checked, the table represents a usage statement formed, at least partially, by operating on two logical statements corresponding to the two checked elements with the AND operator. 10. The method of claim 5 in which the graphical representation comprises two or more tables and in which the tables represent a usage statement formed by operating on the usage statements represented by each individual table with one or more logical operators. 11. The method of claim 3 in which the graphical representation of the conditional document element is visually associated with the graphical representation of the rule. 12. The method of claim 1 in which the graphical representation comprises a table having a first set of elements specifying one or more commands and a second set of elements specifying one or more command operands. 13. A computer program product having software recorded thereon which, when executed by a computer, causes the computer to undertake the method of claim 1. 14. A method for modifying a master document of the type used in a document generation system to generate customised documents, the master document comprising portions of document content marked-up according to a predetermined syntax, the method comprising the steps of:
selecting a portion of the master document; analysing the mark-up associated with the selected portion of the master document; generating a graphical representation of the mark-up; modifying the graphical representation of the mark-up; and modifying the mark-up of the master document according to the modification of the graphical representation. 15. The method of claim 14 in which the step of modifying the graphical representation of the mark-up includes the step of modifying the graphical representation of the mark-up in response to a user input. 16. A document generation system arranged to display a master document of the type used to generate customised documents, the master document comprising portions of document content marked-up according to a predetermined syntax, the system comprising:
means for analysing the mark-up associated with at least a portion of the master document; and means for generating a graphical representation of the mark-up. 17. The document generation system of claim 16 further comprising means to modify the graphical representation of the mark-up. 18. The document generation system of claim 17 in which the means to modify the graphical representation of the mark-up comprises means to allow a user to modify the graphical representation of the mark-up. | 2,100 |
5,724 | 5,724 | 14,484,130 | 2,158 | A term variant discernment system identifies terms in content and executes one or more discernment processes to determine a meaning for each term. An ID is assigned to each term based on its meaning, with terms and their variant terms being assigned a distinct ID when they have different meanings and with terms and their variant terms being assigned the same ID when they have the same meaning. The terms and variants can then be individually queried via a query even though the terms and their variants may have the same spelling, abbreviation, or other characteristics. | 1. A term variant discernment system comprising:
one or more processors that execute instructions to:
identify a term and a variant of the term in some content;
determine a meaning of the term and its variant; and
assign a single ID to both the term and its variant or assign distinct IDs to the term and its variant based on the determined meaning of the term and its variant;
one or more storage devices storing the term and its variant and their assigned IDs; and one or more communication interfaces that receive one or more queries from a user, wherein the one or more processors also execute instructions to:
identify one or more query terms in the one or more queries;
determine a meaning of the one or more query terms;
assign a new ID to the one or more query terms if their meaning differs from that of the term and its variant; and
assign an existing ID to the one or more query terms if their meaning is the same as that of the term or its variant. 2. The term variant discernment system of claim 1, wherein the meaning of the term and the variant are determined through statistical analysis. 3. The term variant discernment system of claim 1, wherein the meaning of the term and the variant are determined through a dictionary lookup. 4. The term variant discernment system of claim 1, wherein the meaning of the term and the variant are determined through one or more predefined rules. 5. The term variant discernment system of claim 1, wherein the meaning of the term and the variant are determined through contextual analysis. 6. The term variant discernment system of claim 1, wherein the meaning of the term and the variant are determined through one or more weighted discernment processes. 7. The term variant discernment system of claim 1 further comprising a local or remote display device, wherein the term is presented on the display device as a result of the query if its ID matches an ID of the one or more query terms, and the variant is presented on the display device as a result of the query if its ID matches an ID of the one or more query terms. 8. A term variant discernment system comprising at least one processor that executes instructions to:
identify a plurality of terms and one or more variants of each term in some content; determine a meaning for each of the plurality of terms and their variants; and for each of the plurality of terms, assign a single ID to both the term and its one or more variants or assign distinct IDs to the term and its one or more variants based on the determined meaning of the term and its one or more variants; identify one or more query terms in a query and determine a meaning for each of the one or more query terms; for each of the one or more query terms that have the same meaning as one of the plurality of terms, assign the same ID; and for each of the one or more query terms that do not have the same meaning as one of the plurality of terms assign a new ID. 9. The term variant discernment system of claim 8, wherein the at least one processor also executes instructions to store the IDs of the plurality of terms and their one or more variants in a storage device. 10. The term variant discernment system of claim 8, wherein the query is received at the at least one processor via a communication device. 11. The term variant discernment system of claim 8, wherein the meaning of the plurality of terms and their one or more variants are determined by a weighted discernment process selected from the group consisting of statistical analysis, contextual analysis, rule-based analysis, and dictionary lookup. 12. The term variant discernment system of claim 8, wherein the content is a text document. 13. The term variant discernment system of claim 8 present via a display device or client device one or more of the plurality of terms that have the same ID as that of at least one of the one or more query terms. 14. The term variant discernment system of claim 8 present via a display device or client device the one or more variants that have the same ID as that of at least one of the one or more query terms. 15. A term variant discernment system implemented method for discerning terms and their variants comprising:
identifying a term and a first variant and a second variant from some content; determine a meaning for the term and its first variant and second variant using one or more discernment processes executed on one or more processors; assign an ID to the term based on its meaning; assign the ID to the first variant; assign a new ID to the second variant; store the term and its first variant and second variant along with their assigned IDs on a storage device; receive a query comprising one or more query terms, wherein each of the query terms have a meaning; assign the term's ID to each of the one or more query terms that have the same meaning as the term, wherein the term's ID is retrieved from the storage device; assign the second variant's ID to each of the one or more query terms that have the same meaning as the second variant, wherein the second variant's ID is retrieved from the storage device; and assign a new ID to each of the one or more query terms that remain. 16. The method of claim 15 further comprising presenting the term and the first variant on a display device or client device when the one or more query terms have IDs matching the ID of the term. 17. The method of claim 15 further comprising presenting the second variant on a display device or client device when the one or more query terms have IDs matching the ID of the second variant. 18. The method of claim 15, wherein the meaning of the terms, the first variant, and the second variant are determined by a weighted discernment process selected from the group consisting of statistical analysis, contextual analysis, rule-based analysis, and dictionary lookup. 19. The method of claim 15, wherein the meaning of the one or more query terms are determined by a weighted discernment process selected from the group consisting of statistical analysis, contextual analysis, rule-based analysis, and dictionary lookup. 20. The method of claim 15 further comprising receiving the query via a communication device. | A term variant discernment system identifies terms in content and executes one or more discernment processes to determine a meaning for each term. An ID is assigned to each term based on its meaning, with terms and their variant terms being assigned a distinct ID when they have different meanings and with terms and their variant terms being assigned the same ID when they have the same meaning. The terms and variants can then be individually queried via a query even though the terms and their variants may have the same spelling, abbreviation, or other characteristics.1. A term variant discernment system comprising:
one or more processors that execute instructions to:
identify a term and a variant of the term in some content;
determine a meaning of the term and its variant; and
assign a single ID to both the term and its variant or assign distinct IDs to the term and its variant based on the determined meaning of the term and its variant;
one or more storage devices storing the term and its variant and their assigned IDs; and one or more communication interfaces that receive one or more queries from a user, wherein the one or more processors also execute instructions to:
identify one or more query terms in the one or more queries;
determine a meaning of the one or more query terms;
assign a new ID to the one or more query terms if their meaning differs from that of the term and its variant; and
assign an existing ID to the one or more query terms if their meaning is the same as that of the term or its variant. 2. The term variant discernment system of claim 1, wherein the meaning of the term and the variant are determined through statistical analysis. 3. The term variant discernment system of claim 1, wherein the meaning of the term and the variant are determined through a dictionary lookup. 4. The term variant discernment system of claim 1, wherein the meaning of the term and the variant are determined through one or more predefined rules. 5. The term variant discernment system of claim 1, wherein the meaning of the term and the variant are determined through contextual analysis. 6. The term variant discernment system of claim 1, wherein the meaning of the term and the variant are determined through one or more weighted discernment processes. 7. The term variant discernment system of claim 1 further comprising a local or remote display device, wherein the term is presented on the display device as a result of the query if its ID matches an ID of the one or more query terms, and the variant is presented on the display device as a result of the query if its ID matches an ID of the one or more query terms. 8. A term variant discernment system comprising at least one processor that executes instructions to:
identify a plurality of terms and one or more variants of each term in some content; determine a meaning for each of the plurality of terms and their variants; and for each of the plurality of terms, assign a single ID to both the term and its one or more variants or assign distinct IDs to the term and its one or more variants based on the determined meaning of the term and its one or more variants; identify one or more query terms in a query and determine a meaning for each of the one or more query terms; for each of the one or more query terms that have the same meaning as one of the plurality of terms, assign the same ID; and for each of the one or more query terms that do not have the same meaning as one of the plurality of terms assign a new ID. 9. The term variant discernment system of claim 8, wherein the at least one processor also executes instructions to store the IDs of the plurality of terms and their one or more variants in a storage device. 10. The term variant discernment system of claim 8, wherein the query is received at the at least one processor via a communication device. 11. The term variant discernment system of claim 8, wherein the meaning of the plurality of terms and their one or more variants are determined by a weighted discernment process selected from the group consisting of statistical analysis, contextual analysis, rule-based analysis, and dictionary lookup. 12. The term variant discernment system of claim 8, wherein the content is a text document. 13. The term variant discernment system of claim 8 present via a display device or client device one or more of the plurality of terms that have the same ID as that of at least one of the one or more query terms. 14. The term variant discernment system of claim 8 present via a display device or client device the one or more variants that have the same ID as that of at least one of the one or more query terms. 15. A term variant discernment system implemented method for discerning terms and their variants comprising:
identifying a term and a first variant and a second variant from some content; determine a meaning for the term and its first variant and second variant using one or more discernment processes executed on one or more processors; assign an ID to the term based on its meaning; assign the ID to the first variant; assign a new ID to the second variant; store the term and its first variant and second variant along with their assigned IDs on a storage device; receive a query comprising one or more query terms, wherein each of the query terms have a meaning; assign the term's ID to each of the one or more query terms that have the same meaning as the term, wherein the term's ID is retrieved from the storage device; assign the second variant's ID to each of the one or more query terms that have the same meaning as the second variant, wherein the second variant's ID is retrieved from the storage device; and assign a new ID to each of the one or more query terms that remain. 16. The method of claim 15 further comprising presenting the term and the first variant on a display device or client device when the one or more query terms have IDs matching the ID of the term. 17. The method of claim 15 further comprising presenting the second variant on a display device or client device when the one or more query terms have IDs matching the ID of the second variant. 18. The method of claim 15, wherein the meaning of the terms, the first variant, and the second variant are determined by a weighted discernment process selected from the group consisting of statistical analysis, contextual analysis, rule-based analysis, and dictionary lookup. 19. The method of claim 15, wherein the meaning of the one or more query terms are determined by a weighted discernment process selected from the group consisting of statistical analysis, contextual analysis, rule-based analysis, and dictionary lookup. 20. The method of claim 15 further comprising receiving the query via a communication device. | 2,100 |
5,725 | 5,725 | 14,920,935 | 2,139 | Proactively tuning a storage array includes: determining, in dependence upon telemetry from a storage array supporting a workload having one or more particular workload attributes, whether performance settings of the storage array meet predefined criteria specified in a best practices template for the particular workload attributes; and responsive to determining that the performance settings of the storage array do not meet the predefined criteria specified in the best practices template for the particular workload attributes, applying one or more performance settings specified in the best practices template to the storage array. | 1. A method of proactively tuning a storage array, the method comprising:
determining, in dependence upon telemetry from a storage array supporting a workload having one or more particular workload attributes, whether performance settings of the storage array meet predefined criteria specified in a best practices template for the particular workload attributes; and responsive to determining that the performance settings of the storage array do not meet the predefined criteria specified in the best practices template for the particular workload attributes, applying one or more performance settings specified in the best practices template to the storage array. 2. The method of claim 1, wherein:
the storage array supports workloads of different workload types; and determining whether performance settings of the storage array meet the predefined criteria specified in the best practices template for the particular workload attributes further comprises determining whether the performance settings of the storage array are meet predefined criteria specified in the best practices template for each of the different workload types. 3. The method of claim 2, further comprising:
responsive to determining that the performance settings of the storage array do not meet the predefine criteria specified in the best practices template for each of the different workload types, determining whether one or more performance settings specified in the best practices templates for the different workload types conflict; and responsive to determining that one or more of the performance settings specified in the best practices template for the different workload types conflict, determining which of the conflicting performance settings to apply in dependence upon predefined prioritization criteria. 4. The method of claim 1, wherein applying the performance settings specified in the best practices template further comprises:
recommending to a user an update to the performance settings for the storage array; upon receiving approval from the user, pushing the performance settings of the best practices template to the storage array. 5. The method of claim 1, wherein applying the performance settings specified in the best practices template further comprises:
pushing the performance settings of the best practices template to the storage array. 6. The method of claim 1, wherein:
the best practices template for the particular workload attributes further comprises one or more workload execution recommendations; and applying the performance settings specified in the best practices template further comprises providing to a user one or more of the workload execution recommendations. 7. The method of claim 1, wherein:
determining whether performance settings of the storage array meet predefined criteria specified in the best practices template for the particular workload attributes is carried out periodically. 8. An apparatus for proactively tuning a storage array, the apparatus comprising a computer processor, a computer memory operatively coupled to the computer processor, the computer memory having disposed within it computer program instructions that, when executed by the computer processor, cause the apparatus to carry out the steps of:
determining, in dependence upon telemetry from a storage array supporting a workload having one or more particular workload attributes, whether performance settings of the storage array meet predefined criteria specified in a best practices template for the particular workload attributes; and responsive to determining that the performance settings of the storage array do not meet the predefined criteria specified in the best practices template for the particular workload attributes, applying one or more performance settings specified in the best practices template to the storage array. 9. The apparatus of claim 8, wherein:
the storage array supports workloads of different workload types; and determining whether performance settings of the storage array meet the predefined criteria specified in the best practices template for the particular workload attributes further comprises determining whether the performance settings of the storage array are meet predefined criteria specified in the best practices template for each of the different workload types. 10. The apparatus of claim 9, further comprising computer program instructions that, when executed, cause the apparatus to carry out the steps of:
responsive to determining that the performance settings of the storage array do not meet the predefine criteria specified in the best practices template for each of the different workload types, determining whether one or more performance settings specified in the best practices templates for the different workload types conflict; and responsive to determining that one or more of the performance settings specified in the best practices template for the different workload types conflict, determining which of the conflicting performance settings to apply in dependence upon predefined prioritization criteria. 11. The apparatus of claim 8, wherein applying the performance settings specified in the best practices template further comprises:
recommending to a user an update to the performance settings for the storage array; upon receiving approval from the user, pushing the performance settings of the best practices template to the storage array. 12. The apparatus of claim 8, wherein applying the performance settings specified in the best practices template further comprises:
pushing the performance settings of the best practices template to the storage array. 13. The apparatus of claim 8, wherein:
the best practices template for the particular workload attributes further comprises one or more workload execution recommendations; and applying the performance settings specified in the best practices template further comprises providing to a user one or more of the workload execution recommendations. 14. The apparatus of claim 8, wherein:
determining whether performance settings of the storage array meet predefined criteria specified in the best practices template for the particular workload attributes is carried out periodically. 15. A computer program product for proactively tuning a storage array, the computer program product disposed upon a computer readable medium, the computer program product comprising computer program instructions that, when executed, cause a computer to carry out the steps of:
determining, in dependence upon telemetry from a storage array supporting a workload having one or more particular workload attributes, whether performance settings of the storage array meet predefined criteria specified in a best practices template for the particular workload attributes; and responsive to determining that the performance settings of the storage array do not meet the predefined criteria specified in the best practices template for the particular workload attributes, applying one or more performance settings specified in the best practices template to the storage array. 16. The computer program product of claim 15, wherein:
the storage array supports workloads of different workload types; and determining whether performance settings of the storage array meet the predefined criteria specified in the best practices template for the particular workload attributes further comprises determining whether the performance settings of the storage array are meet predefined criteria specified in the best practices template for each of the different workload types. 17. The computer program product of claim 16, further comprising computer program instructions that, when executed, cause the computer to carry out the steps of:
responsive to determining that the performance settings of the storage array do not meet the predefine criteria specified in the best practices template for each of the different workload types, determining whether one or more performance settings specified in the best practices templates for the different workload types conflict; and responsive to determining that one or more of the performance settings specified in the best practices template for the different workload types conflict, determining which of the conflicting performance settings to apply in dependence upon predefined prioritization criteria. 18. The computer program product of claim 15, wherein applying the performance settings specified in the best practices template further comprises:
recommending to a user an update to the performance settings for the storage array; upon receiving approval from the user, pushing the performance settings of the best practices template to the storage array. 19. The computer program product of claim 15, wherein applying the performance settings specified in the best practices template further comprises:
pushing the performance settings of the best practices template to the storage array. 20. The computer program product of claim 15, wherein:
the best practices template for the particular workload attributes further comprises one or more workload execution recommendations; and applying the performance settings specified in the best practices template further comprises providing to a user one or more of the workload execution recommendations. | Proactively tuning a storage array includes: determining, in dependence upon telemetry from a storage array supporting a workload having one or more particular workload attributes, whether performance settings of the storage array meet predefined criteria specified in a best practices template for the particular workload attributes; and responsive to determining that the performance settings of the storage array do not meet the predefined criteria specified in the best practices template for the particular workload attributes, applying one or more performance settings specified in the best practices template to the storage array.1. A method of proactively tuning a storage array, the method comprising:
determining, in dependence upon telemetry from a storage array supporting a workload having one or more particular workload attributes, whether performance settings of the storage array meet predefined criteria specified in a best practices template for the particular workload attributes; and responsive to determining that the performance settings of the storage array do not meet the predefined criteria specified in the best practices template for the particular workload attributes, applying one or more performance settings specified in the best practices template to the storage array. 2. The method of claim 1, wherein:
the storage array supports workloads of different workload types; and determining whether performance settings of the storage array meet the predefined criteria specified in the best practices template for the particular workload attributes further comprises determining whether the performance settings of the storage array are meet predefined criteria specified in the best practices template for each of the different workload types. 3. The method of claim 2, further comprising:
responsive to determining that the performance settings of the storage array do not meet the predefine criteria specified in the best practices template for each of the different workload types, determining whether one or more performance settings specified in the best practices templates for the different workload types conflict; and responsive to determining that one or more of the performance settings specified in the best practices template for the different workload types conflict, determining which of the conflicting performance settings to apply in dependence upon predefined prioritization criteria. 4. The method of claim 1, wherein applying the performance settings specified in the best practices template further comprises:
recommending to a user an update to the performance settings for the storage array; upon receiving approval from the user, pushing the performance settings of the best practices template to the storage array. 5. The method of claim 1, wherein applying the performance settings specified in the best practices template further comprises:
pushing the performance settings of the best practices template to the storage array. 6. The method of claim 1, wherein:
the best practices template for the particular workload attributes further comprises one or more workload execution recommendations; and applying the performance settings specified in the best practices template further comprises providing to a user one or more of the workload execution recommendations. 7. The method of claim 1, wherein:
determining whether performance settings of the storage array meet predefined criteria specified in the best practices template for the particular workload attributes is carried out periodically. 8. An apparatus for proactively tuning a storage array, the apparatus comprising a computer processor, a computer memory operatively coupled to the computer processor, the computer memory having disposed within it computer program instructions that, when executed by the computer processor, cause the apparatus to carry out the steps of:
determining, in dependence upon telemetry from a storage array supporting a workload having one or more particular workload attributes, whether performance settings of the storage array meet predefined criteria specified in a best practices template for the particular workload attributes; and responsive to determining that the performance settings of the storage array do not meet the predefined criteria specified in the best practices template for the particular workload attributes, applying one or more performance settings specified in the best practices template to the storage array. 9. The apparatus of claim 8, wherein:
the storage array supports workloads of different workload types; and determining whether performance settings of the storage array meet the predefined criteria specified in the best practices template for the particular workload attributes further comprises determining whether the performance settings of the storage array are meet predefined criteria specified in the best practices template for each of the different workload types. 10. The apparatus of claim 9, further comprising computer program instructions that, when executed, cause the apparatus to carry out the steps of:
responsive to determining that the performance settings of the storage array do not meet the predefine criteria specified in the best practices template for each of the different workload types, determining whether one or more performance settings specified in the best practices templates for the different workload types conflict; and responsive to determining that one or more of the performance settings specified in the best practices template for the different workload types conflict, determining which of the conflicting performance settings to apply in dependence upon predefined prioritization criteria. 11. The apparatus of claim 8, wherein applying the performance settings specified in the best practices template further comprises:
recommending to a user an update to the performance settings for the storage array; upon receiving approval from the user, pushing the performance settings of the best practices template to the storage array. 12. The apparatus of claim 8, wherein applying the performance settings specified in the best practices template further comprises:
pushing the performance settings of the best practices template to the storage array. 13. The apparatus of claim 8, wherein:
the best practices template for the particular workload attributes further comprises one or more workload execution recommendations; and applying the performance settings specified in the best practices template further comprises providing to a user one or more of the workload execution recommendations. 14. The apparatus of claim 8, wherein:
determining whether performance settings of the storage array meet predefined criteria specified in the best practices template for the particular workload attributes is carried out periodically. 15. A computer program product for proactively tuning a storage array, the computer program product disposed upon a computer readable medium, the computer program product comprising computer program instructions that, when executed, cause a computer to carry out the steps of:
determining, in dependence upon telemetry from a storage array supporting a workload having one or more particular workload attributes, whether performance settings of the storage array meet predefined criteria specified in a best practices template for the particular workload attributes; and responsive to determining that the performance settings of the storage array do not meet the predefined criteria specified in the best practices template for the particular workload attributes, applying one or more performance settings specified in the best practices template to the storage array. 16. The computer program product of claim 15, wherein:
the storage array supports workloads of different workload types; and determining whether performance settings of the storage array meet the predefined criteria specified in the best practices template for the particular workload attributes further comprises determining whether the performance settings of the storage array are meet predefined criteria specified in the best practices template for each of the different workload types. 17. The computer program product of claim 16, further comprising computer program instructions that, when executed, cause the computer to carry out the steps of:
responsive to determining that the performance settings of the storage array do not meet the predefine criteria specified in the best practices template for each of the different workload types, determining whether one or more performance settings specified in the best practices templates for the different workload types conflict; and responsive to determining that one or more of the performance settings specified in the best practices template for the different workload types conflict, determining which of the conflicting performance settings to apply in dependence upon predefined prioritization criteria. 18. The computer program product of claim 15, wherein applying the performance settings specified in the best practices template further comprises:
recommending to a user an update to the performance settings for the storage array; upon receiving approval from the user, pushing the performance settings of the best practices template to the storage array. 19. The computer program product of claim 15, wherein applying the performance settings specified in the best practices template further comprises:
pushing the performance settings of the best practices template to the storage array. 20. The computer program product of claim 15, wherein:
the best practices template for the particular workload attributes further comprises one or more workload execution recommendations; and applying the performance settings specified in the best practices template further comprises providing to a user one or more of the workload execution recommendations. | 2,100 |
5,726 | 5,726 | 15,340,102 | 2,178 | In some examples, a user sentiment of an end user that is interacting with an application to be executed on a client computing device may be inferred based on biometric data of the end user. A feature flag of the application may be toggled based on the inferred user sentiment. | 1. A non-transitory computer-readable storage medium comprising instructions executable by a processor to:
infer a user sentiment of an end user that is interacting with an application to be executed on a client computing device based on biometric data of the end user; and toggle a feature flag of the application based on the inferred user sentiment. 2. The non-transitory computer-readable storage medium of claim 1 wherein the biometric data comprises a mouse movement caused by the end user, a client computing device movement caused by the end user, facial expression of the end user, a mouse click caused by the end user, a screen touch by the end user, a geolocation of the end user, or a sequence of keyboard keys pressed. 3. The non-transitory computer-readable storage medium of claim 1 further comprising instructions executable by the processor to:
cause a biometrics library to be integrated with the application; and
collect the biometric data using the biometrics library. 4. The non-transitory computer-readable storage medium of claim 1 wherein the biometric data comprises a unique ID of the end user, a timestamp representing a time when a biometric event represented by the biometric data occurred, and an application ID of the application, wherein the infer the user sentiment comprises to infer the user sentiment based on the unique ID, the timestamp, and the application ID. 5. The non-transitory computer-readable storage medium of claim 1 further comprising instructions executable by the processor to cause a feature flag library to be integrated with the application, wherein to toggle the feature flag comprises to toggle the feature flag using the feature flag library. 6. The non-transitory computer-readable storage medium of claim 5 wherein the feature flag is in code of the application. 7. The non-transitory computer-readable storage medium of claim 5 wherein the feature flag is in code of the feature flag library. 8. The non-transitory computer-readable storage medium of claim 7 wherein to toggle the feature flag comprises to toggle the feature flag by performing a dependency injection of code from the feature flag library to the application. 9. The non-transitory computer-readable storage medium of claim 1 wherein the biometric data comprises a plurality of units of biometric data, and further comprising instructions executable by the processor to select units of biometric data of the plurality units of biometric data, and wherein to infer the user sentiment comprises to infer the user sentiment based on the selected units of biometric data. 10. The non-transitory computer-readable storage medium of claim 1 wherein the biometric data comprises a plurality of units of biometric data, each of the units of biometric data being associated with a positive user sentiment, wherein to infer the user sentiment comprises to infer the user sentiment based on a sum of weights each of which is associated with a respective unit of the units of biometric data. 11. The non-transitory computer-readable storage medium of claim 1 wherein the biometric data comprises a plurality of units of biometric data, each of the units of biometric data being associated with a negative user sentiment, wherein to infer the user sentiment comprises to infer the user sentiment based on a sum of weights each of which is associated with a respective unit of the units of biometric data. 12. The non-transitory computer-readable storage medium of claim 1 wherein the biometric data comprises a first unit of biometric data associated with a positive user sentiment and a second unit of biometric data associated with a negative user sentiment, wherein to infer the user sentiment comprises to infer the user sentiment based on a first weight associated with the first unit of biometric data and a second weight associated with a second unit of biometric data. 13. The non-transitory computer-readable storage medium of claim 12 wherein the biometric data comprises a third unit of biometric data associated with the positive user sentiment and a fourth unit of biometric data associated with the negative user sentiment, wherein to infer the user sentiment comprises to infer the user sentiment based on a difference between a first sum of the first and the third weights and a second sum of the second and fourth weights, wherein the third weight is associated with the third unit of biometric data and the fourth weight associated with the fourth unit of biometric data. 14. The non-transitory computer-readable storage medium of claim 13 wherein the first sum is normalized and the second sum is normalized. 15. The non-transitory computer-readable storage medium of claim 11 wherein, in response to the feature flag being toggled, the application is to display a message to the end user. 16. The non-transitory computer-readable storage medium of claim 11 wherein, in response to the feature flag being toggled, the application is to selectively deploy a functionality to the end user. 17. The non-transitory computer-readable storage medium of claim 17 wherein the selective deployment comprises rolling out the functionality to the end user during testing of the application, wherein the functionality comprises a beta feature. 18. A system comprising:
a processor; and a memory comprising instructions executable by the processor to:
estimate whether a sentiment of an user that is interacting with an application to be executed on a client computing device based on units of biometric data of the end user is positive, negative, or neutral, wherein the biometric data is associated with the client computing device or a peripheral device in communication with the client computing device; and
based on the estimated sentiment, toggle a feature of the application using a feature flag of the application. 19. A method comprising:
by a processor:
collecting biometric data associated with an end user from a client computing device hosting an application being operated by the end user;
determining user sentiment data representing a user sentiment based on the biometric data; and
toggling a feature flag of the application based on the determined user sentiment data. 20. The method of claim 19 wherein the biometric data comprises a plurality of units of biometric data, and further comprising, by the processor, selecting units of biometric data of the plurality units of biometric data, and wherein determining the user sentiment data comprises to determine the user sentiment data based on the selected units of biometric data. | In some examples, a user sentiment of an end user that is interacting with an application to be executed on a client computing device may be inferred based on biometric data of the end user. A feature flag of the application may be toggled based on the inferred user sentiment.1. A non-transitory computer-readable storage medium comprising instructions executable by a processor to:
infer a user sentiment of an end user that is interacting with an application to be executed on a client computing device based on biometric data of the end user; and toggle a feature flag of the application based on the inferred user sentiment. 2. The non-transitory computer-readable storage medium of claim 1 wherein the biometric data comprises a mouse movement caused by the end user, a client computing device movement caused by the end user, facial expression of the end user, a mouse click caused by the end user, a screen touch by the end user, a geolocation of the end user, or a sequence of keyboard keys pressed. 3. The non-transitory computer-readable storage medium of claim 1 further comprising instructions executable by the processor to:
cause a biometrics library to be integrated with the application; and
collect the biometric data using the biometrics library. 4. The non-transitory computer-readable storage medium of claim 1 wherein the biometric data comprises a unique ID of the end user, a timestamp representing a time when a biometric event represented by the biometric data occurred, and an application ID of the application, wherein the infer the user sentiment comprises to infer the user sentiment based on the unique ID, the timestamp, and the application ID. 5. The non-transitory computer-readable storage medium of claim 1 further comprising instructions executable by the processor to cause a feature flag library to be integrated with the application, wherein to toggle the feature flag comprises to toggle the feature flag using the feature flag library. 6. The non-transitory computer-readable storage medium of claim 5 wherein the feature flag is in code of the application. 7. The non-transitory computer-readable storage medium of claim 5 wherein the feature flag is in code of the feature flag library. 8. The non-transitory computer-readable storage medium of claim 7 wherein to toggle the feature flag comprises to toggle the feature flag by performing a dependency injection of code from the feature flag library to the application. 9. The non-transitory computer-readable storage medium of claim 1 wherein the biometric data comprises a plurality of units of biometric data, and further comprising instructions executable by the processor to select units of biometric data of the plurality units of biometric data, and wherein to infer the user sentiment comprises to infer the user sentiment based on the selected units of biometric data. 10. The non-transitory computer-readable storage medium of claim 1 wherein the biometric data comprises a plurality of units of biometric data, each of the units of biometric data being associated with a positive user sentiment, wherein to infer the user sentiment comprises to infer the user sentiment based on a sum of weights each of which is associated with a respective unit of the units of biometric data. 11. The non-transitory computer-readable storage medium of claim 1 wherein the biometric data comprises a plurality of units of biometric data, each of the units of biometric data being associated with a negative user sentiment, wherein to infer the user sentiment comprises to infer the user sentiment based on a sum of weights each of which is associated with a respective unit of the units of biometric data. 12. The non-transitory computer-readable storage medium of claim 1 wherein the biometric data comprises a first unit of biometric data associated with a positive user sentiment and a second unit of biometric data associated with a negative user sentiment, wherein to infer the user sentiment comprises to infer the user sentiment based on a first weight associated with the first unit of biometric data and a second weight associated with a second unit of biometric data. 13. The non-transitory computer-readable storage medium of claim 12 wherein the biometric data comprises a third unit of biometric data associated with the positive user sentiment and a fourth unit of biometric data associated with the negative user sentiment, wherein to infer the user sentiment comprises to infer the user sentiment based on a difference between a first sum of the first and the third weights and a second sum of the second and fourth weights, wherein the third weight is associated with the third unit of biometric data and the fourth weight associated with the fourth unit of biometric data. 14. The non-transitory computer-readable storage medium of claim 13 wherein the first sum is normalized and the second sum is normalized. 15. The non-transitory computer-readable storage medium of claim 11 wherein, in response to the feature flag being toggled, the application is to display a message to the end user. 16. The non-transitory computer-readable storage medium of claim 11 wherein, in response to the feature flag being toggled, the application is to selectively deploy a functionality to the end user. 17. The non-transitory computer-readable storage medium of claim 17 wherein the selective deployment comprises rolling out the functionality to the end user during testing of the application, wherein the functionality comprises a beta feature. 18. A system comprising:
a processor; and a memory comprising instructions executable by the processor to:
estimate whether a sentiment of an user that is interacting with an application to be executed on a client computing device based on units of biometric data of the end user is positive, negative, or neutral, wherein the biometric data is associated with the client computing device or a peripheral device in communication with the client computing device; and
based on the estimated sentiment, toggle a feature of the application using a feature flag of the application. 19. A method comprising:
by a processor:
collecting biometric data associated with an end user from a client computing device hosting an application being operated by the end user;
determining user sentiment data representing a user sentiment based on the biometric data; and
toggling a feature flag of the application based on the determined user sentiment data. 20. The method of claim 19 wherein the biometric data comprises a plurality of units of biometric data, and further comprising, by the processor, selecting units of biometric data of the plurality units of biometric data, and wherein determining the user sentiment data comprises to determine the user sentiment data based on the selected units of biometric data. | 2,100 |
5,727 | 5,727 | 14,755,401 | 2,132 | Methods, devices, and systems for managing performance of a processor having multiple compute units. An effective number of the multiple compute units may be determined to designate as having priority. On a condition that the effective number is nonzero, the effective number of the multiple compute units may each be designated as a priority compute unit. Priority compute units may have access to a shared cache whereas non-priority compute units may not. Workgroups may be preferentially dispatched to priority compute units. Memory access requests from priority compute units may be served ahead of requests from non-priority compute units. | 1. A method for managing performance of a processor having multiple compute units, the method comprising:
determining an effective number of the multiple compute units to designate as having priority; and when the effective number is nonzero:
designating the effective number of the multiple compute units each as a priority compute unit. 2. The method of claim 1, further comprising allowing each priority compute unit to allocate into a shared cache. 3. The method of claim 1, further comprising disallowing a compute unit which is not a priority compute unit to allocate into a shared cache. 4. The method of claim 1, further comprising prioritizing access to a memory by a priority compute unit over a compute unit which is not a priority compute unit. 5. The method of claim 1, further comprising serving a pending request for access to a memory by a priority compute unit prior to serving any pending request for access to the memory by a compute unit which is not a priority compute unit. 6. The method of claim 1, wherein the determining is performed dynamically. 7. The method of claim 1, wherein the determining comprises set dueling. 8. The method of claim 1, further comprising dispatching a workgroup to a priority compute unit preferentially to dispatching the workgroup to a compute unit which is not a priority compute unit. 9. A processor comprising:
multiple compute units; circuitry configured to determine an effective number of the multiple compute units to designate as having priority; and circuitry configured to, on a condition that the effective number is nonzero, designate the effective number of the compute units each as a priority compute unit. 10. The processor of claim 9, further comprising circuitry configured to allow each priority compute unit to allocate into a shared cache. 11. The processor of claim 9, further comprising circuitry configured to disallow a compute unit which is not a priority compute unit to allocate into a shared cache. 12. The processor of claim 9, further comprising circuitry configured to prioritize access to a memory by a priority compute unit over access to the memory by a compute unit which is not a priority compute unit. 13. The processor of claim 9, further comprising circuitry configured to serve a pending request for access to a memory by a priority compute unit prior to serving any pending request for access to the memory by a compute unit which is not a priority compute unit. 14. The processor of claim 9, wherein the determining is performed dynamically. 15. The processor of claim 9, wherein the determining comprises set dueling. 16. The processor of claim 9, further comprising circuitry configured to dispatch a workgroup to a priority compute unit preferentially to dispatching the workgroup to a compute unit which is not a priority compute unit. 17. A system for managing performance of a processor having multiple compute units, the system comprising:
a processor comprising
multiple compute units,
circuitry configured to determine an effective number of
the multiple compute units to designate as having priority, and circuitry configured to, on a condition that the effective number is nonzero, designate the effective number of the compute units each as a priority compute unit; and a memory accessible to the multiple compute units. 18. The system of claim 17, wherein the processor further comprises circuitry configured to allow each priority compute unit to allocate into a shared cache and circuitry configured to disallow a compute unit which is not a priority compute unit to allocate into the shared cache. 19. The system of claim 17, wherein the processor further comprises circuitry configured to prioritize access to the memory by a compute unit over access to the memory by a compute unit which is not a priority compute unit. 20. The system of claim 17, further comprising circuitry configured to dynamically determine the effective number by performing set dueling. | Methods, devices, and systems for managing performance of a processor having multiple compute units. An effective number of the multiple compute units may be determined to designate as having priority. On a condition that the effective number is nonzero, the effective number of the multiple compute units may each be designated as a priority compute unit. Priority compute units may have access to a shared cache whereas non-priority compute units may not. Workgroups may be preferentially dispatched to priority compute units. Memory access requests from priority compute units may be served ahead of requests from non-priority compute units.1. A method for managing performance of a processor having multiple compute units, the method comprising:
determining an effective number of the multiple compute units to designate as having priority; and when the effective number is nonzero:
designating the effective number of the multiple compute units each as a priority compute unit. 2. The method of claim 1, further comprising allowing each priority compute unit to allocate into a shared cache. 3. The method of claim 1, further comprising disallowing a compute unit which is not a priority compute unit to allocate into a shared cache. 4. The method of claim 1, further comprising prioritizing access to a memory by a priority compute unit over a compute unit which is not a priority compute unit. 5. The method of claim 1, further comprising serving a pending request for access to a memory by a priority compute unit prior to serving any pending request for access to the memory by a compute unit which is not a priority compute unit. 6. The method of claim 1, wherein the determining is performed dynamically. 7. The method of claim 1, wherein the determining comprises set dueling. 8. The method of claim 1, further comprising dispatching a workgroup to a priority compute unit preferentially to dispatching the workgroup to a compute unit which is not a priority compute unit. 9. A processor comprising:
multiple compute units; circuitry configured to determine an effective number of the multiple compute units to designate as having priority; and circuitry configured to, on a condition that the effective number is nonzero, designate the effective number of the compute units each as a priority compute unit. 10. The processor of claim 9, further comprising circuitry configured to allow each priority compute unit to allocate into a shared cache. 11. The processor of claim 9, further comprising circuitry configured to disallow a compute unit which is not a priority compute unit to allocate into a shared cache. 12. The processor of claim 9, further comprising circuitry configured to prioritize access to a memory by a priority compute unit over access to the memory by a compute unit which is not a priority compute unit. 13. The processor of claim 9, further comprising circuitry configured to serve a pending request for access to a memory by a priority compute unit prior to serving any pending request for access to the memory by a compute unit which is not a priority compute unit. 14. The processor of claim 9, wherein the determining is performed dynamically. 15. The processor of claim 9, wherein the determining comprises set dueling. 16. The processor of claim 9, further comprising circuitry configured to dispatch a workgroup to a priority compute unit preferentially to dispatching the workgroup to a compute unit which is not a priority compute unit. 17. A system for managing performance of a processor having multiple compute units, the system comprising:
a processor comprising
multiple compute units,
circuitry configured to determine an effective number of
the multiple compute units to designate as having priority, and circuitry configured to, on a condition that the effective number is nonzero, designate the effective number of the compute units each as a priority compute unit; and a memory accessible to the multiple compute units. 18. The system of claim 17, wherein the processor further comprises circuitry configured to allow each priority compute unit to allocate into a shared cache and circuitry configured to disallow a compute unit which is not a priority compute unit to allocate into the shared cache. 19. The system of claim 17, wherein the processor further comprises circuitry configured to prioritize access to the memory by a compute unit over access to the memory by a compute unit which is not a priority compute unit. 20. The system of claim 17, further comprising circuitry configured to dynamically determine the effective number by performing set dueling. | 2,100 |
5,728 | 5,728 | 15,271,403 | 2,125 | Performing distributed branch prediction using fused processor cores in processor-based systems is disclosed. In one aspect, a distributed branch predictor is provided as a plurality of processor cores supporting core fusion. Each processor core is configured to receive a program identifier from another of the processor cores (or from itself), generate a subsequent predicted program identifier, and forward the predicted program identifier (and, optionally, a global history indicator) to the appropriate processor core responsible for handling the next prediction. The processor core also fetches a header and/or one or more instructions for the received program identifier, and sends the header and/or the one or more instructions to the appropriate processor core for execution. The processor core also determines the processor core that will handle execution of the predicted program identifier, and sends that information to the processor core that received the predicted program identifier as an instruction window tracker. | 1. A distributed branch predictor for a multi-core processor-based system, comprising:
a plurality of processor cores configured to interoperate as a fused processor core, and each comprising:
a branch predictor; and
a plurality of predict-and-fetch engines (PFEs); and
each processor core of the plurality of processor cores configured to:
receive, from a second processor core of the plurality of processor cores, a program identifier associated with an instruction block and corresponding to the processor core as a received program identifier;
allocate a PFE of the plurality of PFEs for storing the received program identifier;
predict, using the branch predictor, a subsequent program identifier as a predicted program identifier;
identify, based on the predicted program identifier, a processor core of the plurality of processor cores corresponding to the predicted program identifier as a target processor core;
store an identifier of the target processor core in the PFE;
send the predicted program identifier to the target processor core; and
initiate a fetch of one of a header for the instruction block and one or more instructions of the instruction block based on the received program identifier. 2. The distributed branch predictor of claim 1, wherein each processor core of the plurality of processor cores is further configured to:
receive an instruction window tracker identifying a processor core of the plurality of processor cores as an execution processor core for the received program identifier; store an identifier of the execution processor core in the PFE; receive the one of the header for the instruction block and the one or more instructions of the instruction block as fetched data; send the fetched data to the execution processor core for the received program identifier; identify a processor core of the plurality of processor cores as an execution processor core for the predicted program identifier; send an instruction window tracker identifying the execution processor core for the predicted program identifier to the target processor core, based on the PFE; and deallocate the PFE. 3. The distributed branch predictor of claim 2, wherein each processor core of the plurality of processor cores is configured to identify the processor core of the plurality of processor cores as the execution processor core for the predicted program identifier based on a number of instructions between the received program identifier and the predicted program identifier. 4. The distributed branch predictor of claim 2, wherein each processor core of the plurality of processor cores is further configured to:
receive, in conjunction with the received program identifier, a global history indicator for the received program identifier; store the global history indicator for the received program identifier in the PFE; send, in conjunction with the fetched data, the global history indicator to the execution processor core for the received program identifier; update the global history indicator based on the predicted program identifier; and prior to sending the instruction window tracker for the predicted program identifier, store the global history indicator in the instruction window tracker for the predicted program identifier. 5. The distributed branch predictor of claim 2, wherein:
each processor core of the plurality of processor cores further comprises a plurality of active instruction window trackers; and each processor core of the plurality of processor cores is further configured to:
receive fetched data for a program identifier corresponding to the processor core; and
allocate an active instruction window tracker of the plurality of active instruction window trackers to store the fetched data. 6. The distributed branch predictor of claim 5, wherein:
each processor core of the plurality of processor cores further comprises a plurality of overflow instruction window trackers; each processor core of the plurality of processor cores is further configured to, prior to allocating the active instruction window tracker:
determine whether all active instruction window trackers of the plurality of active instruction window trackers have been allocated; and
responsive to determining that all active instruction window trackers of the plurality of active instruction window trackers have been allocated, allocate an overflow instruction window tracker of the plurality of overflow instruction window trackers to store the fetched data; and
each processor core of the plurality of processor cores is configured to allocate the active instruction window tracker of the plurality of active instruction window trackers to store the fetched data responsive to determining that not all active instruction window trackers of the plurality of active instruction window trackers have been allocated. 7. The distributed branch predictor of claim 6, wherein:
each processor core of the plurality of processor cores is further configured to, prior to sending the predicted program identifier to the target processor core:
determine whether an overflow instruction window tracker is in use by the target processor core; and
responsive to determining that an overflow instruction window tracker is in use by the target processor core, delay sending the predicted program identifier to the target processor core until no overflow instruction window tracker is in use by the target processor core; and
each processor core of the plurality of processor cores is configured to send the predicted program identifier to the target processor core responsive to determining that no overflow instruction window tracker is in use by the target processor core. 8. The distributed branch predictor of claim 5, wherein each processor core of the plurality of processor cores is further configured to:
receive, in conjunction with the fetched data, a global history indicator; and store the global history indicator in the active instruction window tracker. 9. The distributed branch predictor of claim 8, wherein each processor core of the plurality of processor cores is further configured to:
detect a mispredicted program identifier; responsive to detecting the mispredicted program identifier, identify an active instruction window tracker associated with the mispredicted program identifier; update branch prediction resources of a branch predictor of a processor core of the plurality of processor cores, based on misprediction correction data of the active instruction window tracker; determine a corrected program identifier; identify a processor core of the plurality of processor cores as an execution processor core for the corrected program identifier; send the global history indicator from the active instruction window tracker and the corrected program identifier to the execution processor core; and issue a flush signal to the plurality of processor cores, the flush signal comprising an age indicator for the mispredicted program identifier. 10. The distributed branch predictor of claim 9, wherein each processor core of the plurality of processor cores is further configured to:
receive the flush signal comprising the age indicator for the mispredicted program identifier; determine whether the processor core stores one or more active instruction window trackers associated with fetched data younger than the mispredicted program identifier, based on the age indicator; and responsive to determining that the processor core stores one or more active instruction window trackers associated with fetched data younger than the mispredicted program identifier, flush the one or more active instruction window trackers. 11. The distributed branch predictor of claim 1, wherein:
each processor core of the plurality of processor cores further comprises an address interleaved instruction cache; and each processor core of the plurality of processor cores is configured to initiate the fetch of the one of the header for the instruction block and the one or more instructions of the instruction by accessing the address interleaved instruction cache. 12. The distributed branch predictor of claim 1, wherein:
each processor core of the plurality of processor cores is further configured to, prior to allocating the PFE of the plurality of PFEs for storing the received program identifier:
determine whether a PFE, of the plurality of PFEs is available; and
responsive to determining that no PFE, of the plurality of PFEs is available, delay sending the predicted program identifier to the target processor core until a PFE of the plurality of PFEs becomes available; and
each processor core of the plurality of processor cores is configured to allocate the PFE of the plurality of PFEs for storing the received program identifier responsive to determining that a PFE of the plurality of PFEs is available. 13. The distributed branch predictor of claim 1 integrated into an integrated circuit (IC). 14. The distributed branch predictor 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 global positioning system (GPS) device; a mobile phone; a cellular phone; a smart phone; a session initiation protocol (SIP) phone; a tablet; a phablet; a server; a computer; a portable computer; a mobile computing device; a wearable computing device (e.g., a smart watch, a health or fitness tracker, eyewear, etc.); a desktop computer; a personal digital assistant (PDA); a monitor; a computer monitor; a television; a tuner; a radio; a satellite radio; a music player; a digital music player; a portable music player; a digital video player; a video player; a digital video disc (DVD) player; a portable digital video player; an automobile; a vehicle component; avionics systems; a drone; and a multicopter. 15. A distributed branch predictor, comprising:
a means for receiving, by a processor core of a plurality of processor cores, from a second processor core of the plurality of processor cores, a program identifier associated with an instruction block and corresponding to the processor core as a received program identifier; a means for allocating a predict-and-fetch engine (PFE) of a plurality of PFEs for storing the received program identifier; a means for predicting, using a branch predictor of the processor core, a subsequent program identifier as a predicted program identifier; a means for identifying, based on the predicted program identifier, a processor core of the plurality of processor cores corresponding to the predicted program identifier as a target processor core; a means for storing an identifier of the target processor core in the PFE; a means for sending the predicted program identifier to the target processor core; and a means for initiating a fetch of one of a header for the instruction block and one or more instructions of the instruction block based on the received program identifier. 16. The distributed branch predictor of claim 15, further comprising:
a means for receiving, by the processor core, an instruction window tracker identifying a processor core of the plurality of processor cores as an execution processor core for the received program identifier; a means for storing an identifier of the execution processor core in the PFE; a means for receiving the one of the header for the instruction block and the one or more instructions of the instruction block as fetched data; a means for sending the fetched data to the execution processor core for the received program identifier; a means for identifying a processor core of the plurality of processor cores as an execution processor core for the predicted program identifier; a means for sending an instruction window tracker identifying the execution processor core for the predicted program identifier to the target processor core, based on the PFE; and a means for deallocating the PFE. 17. A method for performing distributed branch prediction, comprising:
receiving, by a processor core of a plurality of processor cores, from a second processor core of the plurality of processor cores, a program identifier associated with an instruction block and corresponding to the processor core as a received program identifier; allocating a predict-and-fetch engine (PFE) of a plurality of PFEs for storing the received program identifier; predicting, using a branch predictor of the processor core, a subsequent program identifier as a predicted program identifier; identifying, based on the predicted program identifier, a processor core of the plurality of processor cores corresponding to the predicted program identifier as a target processor core; storing an identifier of the target processor core in the PFE; sending the predicted program identifier to the target processor core; and initiating a fetch of one of a header for the instruction block and one or more instructions of the instruction block based on the received program identifier. 18. The method of claim 17, further comprising:
receiving, by the processor core, an instruction window tracker identifying a processor core of the plurality of processor cores as an execution processor core for the received program identifier; storing an identifier of the execution processor core in the PFE; receiving the one of the header for the instruction block and the one or more instructions of the instruction block as fetched data; sending the fetched data to the execution processor core for the received program identifier; identifying a processor core of the plurality of processor cores as an execution processor core for the predicted program identifier; sending an instruction window tracker identifying the execution processor core for the predicted program identifier to the target processor core, based on the PFE; and deallocating the PFE. 19. The method of claim 18, wherein identifying the processor core of the plurality of processor cores as the execution processor core for the predicted program identifier is based on a number of instructions between the received program identifier and the predicted program identifier. 20. The method of claim 18, further comprising:
receiving, in conjunction with the received program identifier, a global history indicator for the received program identifier; storing the global history indicator for the received program identifier in the PFE; sending, in conjunction with the fetched data, the global history indicator to the execution processor core for the received program identifier; updating the global history indicator based on the predicted program identifier; and prior to sending the instruction window tracker for the predicted program identifier, storing the global history indicator in the instruction window tracker for the predicted program identifier. 21. The method of claim 18, further comprising:
receiving fetched data for a program identifier corresponding to the processor core; and allocating an active instruction window tracker of a plurality of active instruction window trackers to store the fetched data. 22. The method of claim 21, further comprising, prior to allocating the active instruction window tracker:
determining whether all active instruction window trackers of the plurality of active instruction window trackers have been allocated; and responsive to determining that all active instruction window trackers of the plurality of active instruction window trackers have been allocated, allocate an overflow instruction window tracker of a plurality of overflow instruction window trackers to store the fetched data; wherein allocating the active instruction window tracker of the plurality of active instruction window trackers to store the fetched data is responsive to determining that not all active instruction window trackers of the plurality of active instruction window trackers have been allocated. 23. The method of claim 22, further comprising, prior to sending the predicted program identifier to the target processor core:
determining whether an overflow instruction window tracker is in use by the processor core; and responsive to determining that an overflow instruction window tracker is in use by the processor core, delaying sending the predicted program identifier to the target processor core until no overflow instruction window tracker is in use by the processor core; wherein sending the predicted program identifier to the target processor core is responsive to determining that no overflow instruction window tracker is in use by the processor core. 24. The method of claim 21, further comprising:
receiving, in conjunction with the fetched data, a global history indicator; and storing the global history indicator in the active instruction window tracker. 25. The method of claim 24, further comprising:
detecting a mispredicted program identifier; responsive to detecting the mispredicted program identifier, identifying an active instruction window tracker associated with the mispredicted program identifier; updating branch prediction resources of a branch predictor of a processor core of the plurality of processor cores, based on misprediction correction data of the active instruction window tracker; determining a corrected program identifier; identifying a processor core of the plurality of processor cores as an execution processor core for the corrected program identifier; sending the global history indicator from the active instruction window tracker and the corrected program identifier to the execution processor core; and issuing a flush signal to the plurality of processor cores, the flush signal comprising an age indicator for the mispredicted program identifier. 26. The method of claim 25, further comprising:
receiving the flush signal comprising the age indicator for the mispredicted program identifier; determining whether the processor core stores one or more active instruction window trackers associated with fetched data younger than the mispredicted program identifier, based on the age indicator; and responsive to determining that the processor core stores one or more active instruction window trackers associated with fetched data younger than the mispredicted program identifier, flushing the one or more active instruction window trackers. 27. The method of claim 17, wherein initiating the fetch of the one of the header for the instruction block and the one or more instructions of the instruction block comprises accessing an address interleaved instruction cache of the processor core. 28. The method of claim 17, further comprising, prior to allocating the PFE of the plurality of PFEs for storing the received program identifier:
determining whether a PFE of the plurality of PFEs is available; and responsive to determining that no PFE of the plurality of PFEs is available, delaying sending the predicted program identifier to the target processor core until a PFE of the plurality of PFEs becomes available; wherein allocating the PFE of the plurality of PFEs for storing the received program identifier is responsive to determining that a PFE of the plurality of PFEs is available. | Performing distributed branch prediction using fused processor cores in processor-based systems is disclosed. In one aspect, a distributed branch predictor is provided as a plurality of processor cores supporting core fusion. Each processor core is configured to receive a program identifier from another of the processor cores (or from itself), generate a subsequent predicted program identifier, and forward the predicted program identifier (and, optionally, a global history indicator) to the appropriate processor core responsible for handling the next prediction. The processor core also fetches a header and/or one or more instructions for the received program identifier, and sends the header and/or the one or more instructions to the appropriate processor core for execution. The processor core also determines the processor core that will handle execution of the predicted program identifier, and sends that information to the processor core that received the predicted program identifier as an instruction window tracker.1. A distributed branch predictor for a multi-core processor-based system, comprising:
a plurality of processor cores configured to interoperate as a fused processor core, and each comprising:
a branch predictor; and
a plurality of predict-and-fetch engines (PFEs); and
each processor core of the plurality of processor cores configured to:
receive, from a second processor core of the plurality of processor cores, a program identifier associated with an instruction block and corresponding to the processor core as a received program identifier;
allocate a PFE of the plurality of PFEs for storing the received program identifier;
predict, using the branch predictor, a subsequent program identifier as a predicted program identifier;
identify, based on the predicted program identifier, a processor core of the plurality of processor cores corresponding to the predicted program identifier as a target processor core;
store an identifier of the target processor core in the PFE;
send the predicted program identifier to the target processor core; and
initiate a fetch of one of a header for the instruction block and one or more instructions of the instruction block based on the received program identifier. 2. The distributed branch predictor of claim 1, wherein each processor core of the plurality of processor cores is further configured to:
receive an instruction window tracker identifying a processor core of the plurality of processor cores as an execution processor core for the received program identifier; store an identifier of the execution processor core in the PFE; receive the one of the header for the instruction block and the one or more instructions of the instruction block as fetched data; send the fetched data to the execution processor core for the received program identifier; identify a processor core of the plurality of processor cores as an execution processor core for the predicted program identifier; send an instruction window tracker identifying the execution processor core for the predicted program identifier to the target processor core, based on the PFE; and deallocate the PFE. 3. The distributed branch predictor of claim 2, wherein each processor core of the plurality of processor cores is configured to identify the processor core of the plurality of processor cores as the execution processor core for the predicted program identifier based on a number of instructions between the received program identifier and the predicted program identifier. 4. The distributed branch predictor of claim 2, wherein each processor core of the plurality of processor cores is further configured to:
receive, in conjunction with the received program identifier, a global history indicator for the received program identifier; store the global history indicator for the received program identifier in the PFE; send, in conjunction with the fetched data, the global history indicator to the execution processor core for the received program identifier; update the global history indicator based on the predicted program identifier; and prior to sending the instruction window tracker for the predicted program identifier, store the global history indicator in the instruction window tracker for the predicted program identifier. 5. The distributed branch predictor of claim 2, wherein:
each processor core of the plurality of processor cores further comprises a plurality of active instruction window trackers; and each processor core of the plurality of processor cores is further configured to:
receive fetched data for a program identifier corresponding to the processor core; and
allocate an active instruction window tracker of the plurality of active instruction window trackers to store the fetched data. 6. The distributed branch predictor of claim 5, wherein:
each processor core of the plurality of processor cores further comprises a plurality of overflow instruction window trackers; each processor core of the plurality of processor cores is further configured to, prior to allocating the active instruction window tracker:
determine whether all active instruction window trackers of the plurality of active instruction window trackers have been allocated; and
responsive to determining that all active instruction window trackers of the plurality of active instruction window trackers have been allocated, allocate an overflow instruction window tracker of the plurality of overflow instruction window trackers to store the fetched data; and
each processor core of the plurality of processor cores is configured to allocate the active instruction window tracker of the plurality of active instruction window trackers to store the fetched data responsive to determining that not all active instruction window trackers of the plurality of active instruction window trackers have been allocated. 7. The distributed branch predictor of claim 6, wherein:
each processor core of the plurality of processor cores is further configured to, prior to sending the predicted program identifier to the target processor core:
determine whether an overflow instruction window tracker is in use by the target processor core; and
responsive to determining that an overflow instruction window tracker is in use by the target processor core, delay sending the predicted program identifier to the target processor core until no overflow instruction window tracker is in use by the target processor core; and
each processor core of the plurality of processor cores is configured to send the predicted program identifier to the target processor core responsive to determining that no overflow instruction window tracker is in use by the target processor core. 8. The distributed branch predictor of claim 5, wherein each processor core of the plurality of processor cores is further configured to:
receive, in conjunction with the fetched data, a global history indicator; and store the global history indicator in the active instruction window tracker. 9. The distributed branch predictor of claim 8, wherein each processor core of the plurality of processor cores is further configured to:
detect a mispredicted program identifier; responsive to detecting the mispredicted program identifier, identify an active instruction window tracker associated with the mispredicted program identifier; update branch prediction resources of a branch predictor of a processor core of the plurality of processor cores, based on misprediction correction data of the active instruction window tracker; determine a corrected program identifier; identify a processor core of the plurality of processor cores as an execution processor core for the corrected program identifier; send the global history indicator from the active instruction window tracker and the corrected program identifier to the execution processor core; and issue a flush signal to the plurality of processor cores, the flush signal comprising an age indicator for the mispredicted program identifier. 10. The distributed branch predictor of claim 9, wherein each processor core of the plurality of processor cores is further configured to:
receive the flush signal comprising the age indicator for the mispredicted program identifier; determine whether the processor core stores one or more active instruction window trackers associated with fetched data younger than the mispredicted program identifier, based on the age indicator; and responsive to determining that the processor core stores one or more active instruction window trackers associated with fetched data younger than the mispredicted program identifier, flush the one or more active instruction window trackers. 11. The distributed branch predictor of claim 1, wherein:
each processor core of the plurality of processor cores further comprises an address interleaved instruction cache; and each processor core of the plurality of processor cores is configured to initiate the fetch of the one of the header for the instruction block and the one or more instructions of the instruction by accessing the address interleaved instruction cache. 12. The distributed branch predictor of claim 1, wherein:
each processor core of the plurality of processor cores is further configured to, prior to allocating the PFE of the plurality of PFEs for storing the received program identifier:
determine whether a PFE, of the plurality of PFEs is available; and
responsive to determining that no PFE, of the plurality of PFEs is available, delay sending the predicted program identifier to the target processor core until a PFE of the plurality of PFEs becomes available; and
each processor core of the plurality of processor cores is configured to allocate the PFE of the plurality of PFEs for storing the received program identifier responsive to determining that a PFE of the plurality of PFEs is available. 13. The distributed branch predictor of claim 1 integrated into an integrated circuit (IC). 14. The distributed branch predictor 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 global positioning system (GPS) device; a mobile phone; a cellular phone; a smart phone; a session initiation protocol (SIP) phone; a tablet; a phablet; a server; a computer; a portable computer; a mobile computing device; a wearable computing device (e.g., a smart watch, a health or fitness tracker, eyewear, etc.); a desktop computer; a personal digital assistant (PDA); a monitor; a computer monitor; a television; a tuner; a radio; a satellite radio; a music player; a digital music player; a portable music player; a digital video player; a video player; a digital video disc (DVD) player; a portable digital video player; an automobile; a vehicle component; avionics systems; a drone; and a multicopter. 15. A distributed branch predictor, comprising:
a means for receiving, by a processor core of a plurality of processor cores, from a second processor core of the plurality of processor cores, a program identifier associated with an instruction block and corresponding to the processor core as a received program identifier; a means for allocating a predict-and-fetch engine (PFE) of a plurality of PFEs for storing the received program identifier; a means for predicting, using a branch predictor of the processor core, a subsequent program identifier as a predicted program identifier; a means for identifying, based on the predicted program identifier, a processor core of the plurality of processor cores corresponding to the predicted program identifier as a target processor core; a means for storing an identifier of the target processor core in the PFE; a means for sending the predicted program identifier to the target processor core; and a means for initiating a fetch of one of a header for the instruction block and one or more instructions of the instruction block based on the received program identifier. 16. The distributed branch predictor of claim 15, further comprising:
a means for receiving, by the processor core, an instruction window tracker identifying a processor core of the plurality of processor cores as an execution processor core for the received program identifier; a means for storing an identifier of the execution processor core in the PFE; a means for receiving the one of the header for the instruction block and the one or more instructions of the instruction block as fetched data; a means for sending the fetched data to the execution processor core for the received program identifier; a means for identifying a processor core of the plurality of processor cores as an execution processor core for the predicted program identifier; a means for sending an instruction window tracker identifying the execution processor core for the predicted program identifier to the target processor core, based on the PFE; and a means for deallocating the PFE. 17. A method for performing distributed branch prediction, comprising:
receiving, by a processor core of a plurality of processor cores, from a second processor core of the plurality of processor cores, a program identifier associated with an instruction block and corresponding to the processor core as a received program identifier; allocating a predict-and-fetch engine (PFE) of a plurality of PFEs for storing the received program identifier; predicting, using a branch predictor of the processor core, a subsequent program identifier as a predicted program identifier; identifying, based on the predicted program identifier, a processor core of the plurality of processor cores corresponding to the predicted program identifier as a target processor core; storing an identifier of the target processor core in the PFE; sending the predicted program identifier to the target processor core; and initiating a fetch of one of a header for the instruction block and one or more instructions of the instruction block based on the received program identifier. 18. The method of claim 17, further comprising:
receiving, by the processor core, an instruction window tracker identifying a processor core of the plurality of processor cores as an execution processor core for the received program identifier; storing an identifier of the execution processor core in the PFE; receiving the one of the header for the instruction block and the one or more instructions of the instruction block as fetched data; sending the fetched data to the execution processor core for the received program identifier; identifying a processor core of the plurality of processor cores as an execution processor core for the predicted program identifier; sending an instruction window tracker identifying the execution processor core for the predicted program identifier to the target processor core, based on the PFE; and deallocating the PFE. 19. The method of claim 18, wherein identifying the processor core of the plurality of processor cores as the execution processor core for the predicted program identifier is based on a number of instructions between the received program identifier and the predicted program identifier. 20. The method of claim 18, further comprising:
receiving, in conjunction with the received program identifier, a global history indicator for the received program identifier; storing the global history indicator for the received program identifier in the PFE; sending, in conjunction with the fetched data, the global history indicator to the execution processor core for the received program identifier; updating the global history indicator based on the predicted program identifier; and prior to sending the instruction window tracker for the predicted program identifier, storing the global history indicator in the instruction window tracker for the predicted program identifier. 21. The method of claim 18, further comprising:
receiving fetched data for a program identifier corresponding to the processor core; and allocating an active instruction window tracker of a plurality of active instruction window trackers to store the fetched data. 22. The method of claim 21, further comprising, prior to allocating the active instruction window tracker:
determining whether all active instruction window trackers of the plurality of active instruction window trackers have been allocated; and responsive to determining that all active instruction window trackers of the plurality of active instruction window trackers have been allocated, allocate an overflow instruction window tracker of a plurality of overflow instruction window trackers to store the fetched data; wherein allocating the active instruction window tracker of the plurality of active instruction window trackers to store the fetched data is responsive to determining that not all active instruction window trackers of the plurality of active instruction window trackers have been allocated. 23. The method of claim 22, further comprising, prior to sending the predicted program identifier to the target processor core:
determining whether an overflow instruction window tracker is in use by the processor core; and responsive to determining that an overflow instruction window tracker is in use by the processor core, delaying sending the predicted program identifier to the target processor core until no overflow instruction window tracker is in use by the processor core; wherein sending the predicted program identifier to the target processor core is responsive to determining that no overflow instruction window tracker is in use by the processor core. 24. The method of claim 21, further comprising:
receiving, in conjunction with the fetched data, a global history indicator; and storing the global history indicator in the active instruction window tracker. 25. The method of claim 24, further comprising:
detecting a mispredicted program identifier; responsive to detecting the mispredicted program identifier, identifying an active instruction window tracker associated with the mispredicted program identifier; updating branch prediction resources of a branch predictor of a processor core of the plurality of processor cores, based on misprediction correction data of the active instruction window tracker; determining a corrected program identifier; identifying a processor core of the plurality of processor cores as an execution processor core for the corrected program identifier; sending the global history indicator from the active instruction window tracker and the corrected program identifier to the execution processor core; and issuing a flush signal to the plurality of processor cores, the flush signal comprising an age indicator for the mispredicted program identifier. 26. The method of claim 25, further comprising:
receiving the flush signal comprising the age indicator for the mispredicted program identifier; determining whether the processor core stores one or more active instruction window trackers associated with fetched data younger than the mispredicted program identifier, based on the age indicator; and responsive to determining that the processor core stores one or more active instruction window trackers associated with fetched data younger than the mispredicted program identifier, flushing the one or more active instruction window trackers. 27. The method of claim 17, wherein initiating the fetch of the one of the header for the instruction block and the one or more instructions of the instruction block comprises accessing an address interleaved instruction cache of the processor core. 28. The method of claim 17, further comprising, prior to allocating the PFE of the plurality of PFEs for storing the received program identifier:
determining whether a PFE of the plurality of PFEs is available; and responsive to determining that no PFE of the plurality of PFEs is available, delaying sending the predicted program identifier to the target processor core until a PFE of the plurality of PFEs becomes available; wherein allocating the PFE of the plurality of PFEs for storing the received program identifier is responsive to determining that a PFE of the plurality of PFEs is available. | 2,100 |
5,729 | 5,729 | 14,155,554 | 2,154 | Embodiments of the present invention relate to managing content item syndication by maintaining referential integrity between isolated systems. A computing device receives a first content item, wherein the first content item has an external dependency with a second content item defined by a first reference. In response to determining that the second content item does not exist on the computing device, the computing device generates a second reference to replace the first reference, wherein the second reference defines a dependency of the first content item to a third content item. The computing device generates a link that directs a user to the third content item in response to the user attempting to access the second content item. | 1-6. (canceled) 7. A computer program product, the computer program product comprising a computer readable storage medium having program code embodied therewith, the program code executable by a processor to:
receive a first content item, wherein the first content item has an external dependency with a second content item defined by a first reference; in response to determining that the second content item does not exist on a computing device that includes the processor, generating a second reference to replace the first reference, wherein the second reference defines a dependency of the first content item to a third content item; generating a link that directs a user to the third content item in response to the user attempting to access the second content item. 8. The computer program product of claim 7, the first content item is associated with a syndication event. 9. The computer program product of claim 7, wherein the computing device that includes the processor subscribes data from a content library. 10. The computer program product of claim 7, wherein the computing device that includes the processor supports one or more of the following content management environments:
development; authoring; staging; and production. 11. The computer program product of claim 7, wherein the first content item is included in a change set received by the computing device that includes the processor. 12. The computer program product of claim 7, wherein the first, second, and/or third content item includes one or more of:
data; text; media; and webpage template. 13. A computer system comprising:
one or more computer processors; one or more computer-readable storage media; program instructions stored on the computer-readable storage media for execution by at least one of the one or more processors, the program instructions comprising: program instructions to
receive a first content item, wherein the first content item has an external dependency with a second content item defined by a first reference;
in response to determining that the second content item does not exist on a computing device that includes the at least one or more processors, generating a second reference to replace the first reference, wherein the second reference defines a dependency of the first content item to a third content item;
generating a link that directs a user to the third content item in response to the user attempting to access the second content item. 14. The computer system of claim 13, the first content item is associated with a syndication event. 15. The computer system of claim 13, wherein the computing device that includes the at least one or more processors subscribes data from a content library. 16. The computer system of claim 13, wherein the computing device that includes the at least one or more processors supports one or more of the following content management environments:
development; authoring; staging; and production. 17. The computer system of claim 13, wherein the first content item is included in a change set received by the computing device that includes the at least one or more processors. 18. The computer system of claim 13, wherein the first, second, and/or third content item includes one or more of:
data; text; media; and webpage template. | Embodiments of the present invention relate to managing content item syndication by maintaining referential integrity between isolated systems. A computing device receives a first content item, wherein the first content item has an external dependency with a second content item defined by a first reference. In response to determining that the second content item does not exist on the computing device, the computing device generates a second reference to replace the first reference, wherein the second reference defines a dependency of the first content item to a third content item. The computing device generates a link that directs a user to the third content item in response to the user attempting to access the second content item.1-6. (canceled) 7. A computer program product, the computer program product comprising a computer readable storage medium having program code embodied therewith, the program code executable by a processor to:
receive a first content item, wherein the first content item has an external dependency with a second content item defined by a first reference; in response to determining that the second content item does not exist on a computing device that includes the processor, generating a second reference to replace the first reference, wherein the second reference defines a dependency of the first content item to a third content item; generating a link that directs a user to the third content item in response to the user attempting to access the second content item. 8. The computer program product of claim 7, the first content item is associated with a syndication event. 9. The computer program product of claim 7, wherein the computing device that includes the processor subscribes data from a content library. 10. The computer program product of claim 7, wherein the computing device that includes the processor supports one or more of the following content management environments:
development; authoring; staging; and production. 11. The computer program product of claim 7, wherein the first content item is included in a change set received by the computing device that includes the processor. 12. The computer program product of claim 7, wherein the first, second, and/or third content item includes one or more of:
data; text; media; and webpage template. 13. A computer system comprising:
one or more computer processors; one or more computer-readable storage media; program instructions stored on the computer-readable storage media for execution by at least one of the one or more processors, the program instructions comprising: program instructions to
receive a first content item, wherein the first content item has an external dependency with a second content item defined by a first reference;
in response to determining that the second content item does not exist on a computing device that includes the at least one or more processors, generating a second reference to replace the first reference, wherein the second reference defines a dependency of the first content item to a third content item;
generating a link that directs a user to the third content item in response to the user attempting to access the second content item. 14. The computer system of claim 13, the first content item is associated with a syndication event. 15. The computer system of claim 13, wherein the computing device that includes the at least one or more processors subscribes data from a content library. 16. The computer system of claim 13, wherein the computing device that includes the at least one or more processors supports one or more of the following content management environments:
development; authoring; staging; and production. 17. The computer system of claim 13, wherein the first content item is included in a change set received by the computing device that includes the at least one or more processors. 18. The computer system of claim 13, wherein the first, second, and/or third content item includes one or more of:
data; text; media; and webpage template. | 2,100 |
5,730 | 5,730 | 13,800,139 | 2,163 | Methods and systems for replication group partitioning include analyzing historical workload data for a plurality of data elements to generate one or more transaction patterns and generating a recommended partitioning of the plurality of data elements into one or more replication groups, based on the one or more transaction patterns, that are optimized toward a partitioning goal. | 1. A method for replication group partitioning, comprising:
analyzing historical workload data for a plurality of data elements with a processor to identify and categorize one or more transaction patterns; and generating a recommended partitioning of the plurality of data elements into one or more replication groups, based on the one or more transaction patterns, that are optimized toward a partitioning goal. 2. The method of claim 1, further comprising receiving revisions to the recommended partitioning of the plurality of data elements from a user's input and generating a new recommended partitioning based on the received revisions. 3. The method of claim 1, wherein the plurality of data elements are tables of tablespaces in a database. 4. The method of claim 1, wherein the transaction patterns correspond to a group of transactions that updates a given set of data elements. 5. The method of claim 1, wherein the partitioning goal comprises maintaining a predetermined affinity or separation between specific data elements. 6. The method of claim 1, further comprising:
monitoring online workload changes; and generating a new recommended partitioning based on said online workload changes to maintain an optimized partitioning goal. 7. The method of claim 1, wherein generating a recommended partitioning comprises iteratively creating partition groups by selecting data elements according to one or more selection criteria. 8. The method of claim 1, wherein generating a recommended partitioning comprises exhaustively evaluating every possible partitioning of the plurality of data elements. 9. The method of claim 1, further comprising:
logging transactions that involve the plurality of data elements in a first data center; and replicating the logged transactions in a second data center, where the replicated transactions are grouped according to the recommended partitioning. 10-19. (canceled) 20. A method for grouped data replication, comprising:
analyzing historical workload data for a plurality of data elements with a processor to identify and categorize one or more transaction patterns; generating a recommended partitioning of the plurality of data elements into one or more replication groups, based on the one or more transaction patterns, that are optimized toward a partitioning goal; logging transactions that involve the plurality of data elements in a first data center; replicating the logged transactions in a second data center, where the replicated transactions are grouped according to the recommended partitioning; monitoring online workload changes; and generating a new recommended partitioning based on said online workload changes to maintain an optimized partitioning goal. | Methods and systems for replication group partitioning include analyzing historical workload data for a plurality of data elements to generate one or more transaction patterns and generating a recommended partitioning of the plurality of data elements into one or more replication groups, based on the one or more transaction patterns, that are optimized toward a partitioning goal.1. A method for replication group partitioning, comprising:
analyzing historical workload data for a plurality of data elements with a processor to identify and categorize one or more transaction patterns; and generating a recommended partitioning of the plurality of data elements into one or more replication groups, based on the one or more transaction patterns, that are optimized toward a partitioning goal. 2. The method of claim 1, further comprising receiving revisions to the recommended partitioning of the plurality of data elements from a user's input and generating a new recommended partitioning based on the received revisions. 3. The method of claim 1, wherein the plurality of data elements are tables of tablespaces in a database. 4. The method of claim 1, wherein the transaction patterns correspond to a group of transactions that updates a given set of data elements. 5. The method of claim 1, wherein the partitioning goal comprises maintaining a predetermined affinity or separation between specific data elements. 6. The method of claim 1, further comprising:
monitoring online workload changes; and generating a new recommended partitioning based on said online workload changes to maintain an optimized partitioning goal. 7. The method of claim 1, wherein generating a recommended partitioning comprises iteratively creating partition groups by selecting data elements according to one or more selection criteria. 8. The method of claim 1, wherein generating a recommended partitioning comprises exhaustively evaluating every possible partitioning of the plurality of data elements. 9. The method of claim 1, further comprising:
logging transactions that involve the plurality of data elements in a first data center; and replicating the logged transactions in a second data center, where the replicated transactions are grouped according to the recommended partitioning. 10-19. (canceled) 20. A method for grouped data replication, comprising:
analyzing historical workload data for a plurality of data elements with a processor to identify and categorize one or more transaction patterns; generating a recommended partitioning of the plurality of data elements into one or more replication groups, based on the one or more transaction patterns, that are optimized toward a partitioning goal; logging transactions that involve the plurality of data elements in a first data center; replicating the logged transactions in a second data center, where the replicated transactions are grouped according to the recommended partitioning; monitoring online workload changes; and generating a new recommended partitioning based on said online workload changes to maintain an optimized partitioning goal. | 2,100 |
5,731 | 5,731 | 13,969,249 | 2,163 | Systems for replication group partitioning include a workload profiling module configured to analyze historical workload data for a plurality of data elements to identify and categorize one or more transaction patterns; and a recommendation module configured to generate a recommended partitioning of the plurality of data elements into one or more replication groups, based on the one or more transaction patterns, that are optimized toward a partitioning goal. | 1. A system for replication group partitioning, comprising:
a workload profiling module configured to analyze historical workload data for a plurality of data elements to identify and categorize one or more transaction patterns; and a recommendation module comprising a processor configured to generate a recommended partitioning of the plurality of data elements into one or more replication groups, based on the one or more transaction patterns, that are optimized toward a partitioning goal. 2. The system of claim 1, wherein the recommendation module is further configured to receive revisions to the recommended partitioning of the plurality of data elements from a user interface and to generate a new recommended partitioning based on the received revisions. 3. The system of claim 1, wherein the plurality of data elements are tables or tablespaces in a database. 4. The system of claim 1, wherein the transaction patterns correspond to a group of transactions that updates a given sat of data elements. 5. The system of claim 1, wherein the partitioning goal comprises maintaining a predetermined affinity or separation between specific data elements. 6. The system of claim 1, further comprising a replication monitoring module configured to monitor online workload changes, wherein the recommendation module is further configured to generate a new recommended partitioning based on said online workload changes to maintain an optimized partitioning goal. 7. The system of claim 1, wherein the recommendation module is further configured to iteratively create partition groups by selecting data elements according to one or more selection criteria to generate the recommended partitioning. 8. The system of claim 1, wherein the recommendation module is further configured to exhaustively evaluate every possible partitioning of the plurality of data elements to generate the recommended partitioning. 9. The system of claim 1, further comprising a change capture module configured to log transactions that involve the plurality of data elements in a first data center and to replicate the logged transactions in a second data center, where the replicated transactions are grouped according to the recommended partitioning. 10. A computer readable storage medium comprising a computer readable program, wherein the computer readable program when executed on a computer causes the computer to perform the steps of:
analyzing historical workload data for a plurality of data elements with a processor to identify and categorize one or more transaction patterns; and generating a recommended partitioning of the plurality of data elements into one or more replication groups, based on the one or more transaction patterns, that are optimized toward a partitioning goal. | Systems for replication group partitioning include a workload profiling module configured to analyze historical workload data for a plurality of data elements to identify and categorize one or more transaction patterns; and a recommendation module configured to generate a recommended partitioning of the plurality of data elements into one or more replication groups, based on the one or more transaction patterns, that are optimized toward a partitioning goal.1. A system for replication group partitioning, comprising:
a workload profiling module configured to analyze historical workload data for a plurality of data elements to identify and categorize one or more transaction patterns; and a recommendation module comprising a processor configured to generate a recommended partitioning of the plurality of data elements into one or more replication groups, based on the one or more transaction patterns, that are optimized toward a partitioning goal. 2. The system of claim 1, wherein the recommendation module is further configured to receive revisions to the recommended partitioning of the plurality of data elements from a user interface and to generate a new recommended partitioning based on the received revisions. 3. The system of claim 1, wherein the plurality of data elements are tables or tablespaces in a database. 4. The system of claim 1, wherein the transaction patterns correspond to a group of transactions that updates a given sat of data elements. 5. The system of claim 1, wherein the partitioning goal comprises maintaining a predetermined affinity or separation between specific data elements. 6. The system of claim 1, further comprising a replication monitoring module configured to monitor online workload changes, wherein the recommendation module is further configured to generate a new recommended partitioning based on said online workload changes to maintain an optimized partitioning goal. 7. The system of claim 1, wherein the recommendation module is further configured to iteratively create partition groups by selecting data elements according to one or more selection criteria to generate the recommended partitioning. 8. The system of claim 1, wherein the recommendation module is further configured to exhaustively evaluate every possible partitioning of the plurality of data elements to generate the recommended partitioning. 9. The system of claim 1, further comprising a change capture module configured to log transactions that involve the plurality of data elements in a first data center and to replicate the logged transactions in a second data center, where the replicated transactions are grouped according to the recommended partitioning. 10. A computer readable storage medium comprising a computer readable program, wherein the computer readable program when executed on a computer causes the computer to perform the steps of:
analyzing historical workload data for a plurality of data elements with a processor to identify and categorize one or more transaction patterns; and generating a recommended partitioning of the plurality of data elements into one or more replication groups, based on the one or more transaction patterns, that are optimized toward a partitioning goal. | 2,100 |
5,732 | 5,732 | 13,243,045 | 2,175 | While an electronic device with a display and a touch-sensitive surface is in a locked, passcode-protected state, the device displays a lock screen user interface on the display. The lock screen user interface includes a plurality of restricted application launch icons, each restricted application launch icon corresponding to an application. The device also detects user input to activate a respective restricted application launch icon; and, in response to detecting the user input to activate the respective restricted application launch icon, starts a restricted session for a respective application that corresponds to the respective restricted application launch icon, wherein the respective application is configured to generate one or more content items while in the restricted session, and maintains the device in the locked, passcode-protected state for applications in the device other than the respective application. | 1. A method, comprising:
while an electronic device with a display and a touch-sensitive surface is in a locked, passcode-protected state:
displaying a lock screen user interface on the display, the lock screen user interface including a plurality of restricted application launch icons, each restricted application launch icon corresponding to an application;
detecting user input to activate a respective restricted application launch icon; and,
in response to detecting the user input to activate the respective restricted application launch icon:
starting a restricted session for a respective application that corresponds to the respective restricted application launch icon, wherein the respective application is configured to generate one or more content items while in the restricted session; and
maintaining the device in the locked, passcode-protected state for applications in the device other than the respective application. 2. The method of claim 1, wherein:
while the respective application is in the restricted session:
the respective application is enabled to present one or more content items generated by the respective application while in the restricted session; and
the respective application is disabled from presenting any content items in the respective application that were not generated while in the restricted session. 3. The method of claim 1, wherein the plurality of restricted application launch icons include one or more of a restricted note taking application launch icon, a restricted calendar application launch icon, a restricted contact list application launch icon, and a restricted voice recorder application launch icon. 4. The method of claim 1, wherein the respective restricted application launch icon is a restricted note taking application launch icon, the respective application is a note taking application, and the note taking application is configured to generate notes while in the restricted session. 5. The method of claim 4, wherein, while the note taking application is in the restricted session:
the note taking application is enabled to display one or more notes generated by the note taking application while in the restricted session; and the note taking application is disabled from displaying any notes in the note taking application that were not generated while in the restricted session. 6. The method of claim 1, wherein the respective restricted application launch icon is a restricted calendar application launch icon, the respective application is a calendar application, and the calendar application is configured to generate calendar events while in the restricted session. 7. The method of claim 6, wherein, while the calendar application is in the restricted session:
the calendar application is enabled to display one or more calendar events generated by the calendar application while in the restricted session; and the calendar application is disabled from displaying any calendar events in the calendar application that were not generated while in the restricted session. 8. The method of claim 1, wherein the respective restricted application launch icon is a restricted contact list application launch icon, the respective application is a contact list application, and the contact list application is configured to generate new contact list entries while in the restricted session. 9. The method of claim 8, wherein, while the contact list application is in the restricted session:
the contact list application is enabled to display one or more contact list entries generated by the contact list application while in the restricted session; and the contact list application is disabled from displaying any contact list entries in the contact list application that were not generated while in the restricted session. 10. The method of claim 1, wherein the respective restricted application launch icon is a restricted voice recorder application launch icon, the respective application is a voice recorder application, and the voice recorder application is configured to generate voice recordings while in the restricted session. 11. The method of claim 10, wherein, while the voice recorder application is in the restricted session:
the voice recorder application is enabled to play one or more voice recordings generated by the voice recorder application while in the restricted session; and the voice recorder application is disabled from playing any voice recordings in the voice recorder application that were not generated while in the restricted session. 12. The method of claim 1, wherein the plurality of restricted application launch icons is user configurable. 13. A method, comprising:
at an electronic device with a display, a touch-sensitive surface, and a plurality of applications:
starting a restricted session for a first application while maintaining the device in a locked, passcode-protected state for applications in the device other than the first application;
while the first application is in the restricted session:
generating one or more content items in the first application;
receiving a request to present one or more content items in the first application; and,
in response to receiving the request to present one or more content items in the first application:
presenting content items or representations thereof that meet restricted session access criteria for the first application; and
not presenting content items or representations thereof that fail to meet the restricted session access criteria for the first application. 14. The method of claim 13, wherein the restricted session access criteria include that, to be presented, a content item or representation thereof was created during the restricted session for the first application. 15. The method of claim 13, wherein the restricted session access criteria include that, to be presented, a content item or representation thereof was created within a predefined time of a current time. 16. The method of claim 13, wherein the restricted session access criteria include that, to be presented, a content item or representation thereof was created during the restricted session for the first application and within a predefined time of a current time. 17. The method of claim 13, wherein the restricted session access criteria include that, to be presented, a content item or representation thereof was created during the restricted session for the first application and a current time period of inactivity for the first application in the restricted session is less than a predefined threshold. 18. An electronic device, comprising:
a display; a touch-sensitive surface; one or more processors; memory; and one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the one or more processors, the one or more programs including instructions for: while the electronic device is in a locked, passcode-protected state:
displaying a lock screen user interface on the display, the lock screen user interface including a plurality of restricted application launch icons, each restricted application launch icon corresponding to an application;
detecting user input to activate a respective restricted application launch icon; and,
in response to detecting the user input to activate the respective restricted application launch icon:
starting a restricted session for a respective application that corresponds to the respective restricted application launch icon, wherein the respective application is configured to generate one or more content items while in the restricted session; and
maintaining the device in the locked, passcode-protected state for applications in the device other than the respective application. 19. A computer readable storage medium storing one or more programs, the one or more programs comprising instructions, which when executed by an electronic device with a display and a touch-sensitive surface, cause the device to:
while the electronic device is in a locked, passcode-protected state:
display a lock screen user interface on the display, the lock screen user interface including a plurality of restricted application launch icons, each restricted application launch icon corresponding to an application;
detect user input to activate a respective restricted application launch icon; and,
in response to detecting the user input to activate the respective restricted application launch icon:
start a restricted session for a respective application that corresponds to the respective restricted application launch icon, wherein the respective application is configured to generate one or more content items while in the restricted session; and
maintain the device in the locked, passcode-protected state for applications in the device other than the respective application. 20. A graphical user interface on an electronic device with a display and a touch-sensitive surface, a memory, and one or more processors to execute one or more programs stored in the memory, the graphical user interface comprising, while the electronic device is in a locked, passcode-protected state:
a lock screen user interface on the display, the lock screen user interface including a plurality of restricted application launch icons, each restricted application launch icon corresponding to an application; wherein: user input to activate a respective restricted application launch icon is detected; and, in response to detecting the user input to activate the respective restricted application launch icon:
a restricted session for a respective application that corresponds to the respective restricted application launch icon is started, wherein the respective application is configured to generate one or more content items while in the restricted session; and
the device is maintained in the locked, passcode-protected state for applications in the device other than the respective application. 21. An electronic device, comprising:
a display; a touch-sensitive surface; one or more processors; memory; a plurality of applications; and one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the one or more processors, the one or more programs including instructions for:
starting a restricted session for a first application while maintaining the device in a locked, passcode-protected state for applications in the device other than the first application;
while the first application is in the restricted session:
generating one or more content items in the first application;
receiving a request to present one or more content items in the first application; and,
in response to receiving the request to present one or more content items in the first application:
presenting content items or representations thereof that meet restricted session access criteria for the first application; and
not presenting content items or representations thereof that fail to meet the restricted session access criteria for the first application. 22. A computer readable storage medium storing one or more programs, the one or more programs comprising instructions, which when executed by an electronic device with a display, a touch-sensitive surface, and a plurality of applications, cause the device to:
start a restricted session for a first application while maintaining the device in a locked, passcode-protected state for applications in the device other than the first application; while the first application is in the restricted session:
generate one or more content items in the first application;
receive a request to present one or more content items in the first application; and,
in response to receiving the request to present one or more content items in the first application:
present content items or representations thereof that meet restricted session access criteria for the first application, and
not present content items or representations thereof that fail to meet the restricted session access criteria for the first application. 23. A graphical user interface on an electronic device with a display and a touch-sensitive surface, a memory, a plurality of applications, and one or more processors to execute one or more programs stored in the memory, the graphical user interface comprising:
a user interface of a first application in a restricted session, wherein the restricted session for the first application is started while maintaining the device in a locked, passcode-protected state for applications in the device other than the first application; wherein: while the first application is in the restricted session:
one or more content items is generated in the first application;
a request to present one or more content items in the first application is received; and,
in response to receiving the request to present one or more content items in the first application:
content items or representations thereof that meet restricted session access criteria for the first application are presented; and
content items or representations thereof that fail to meet the restricted session access criteria for the first application are not presented. | While an electronic device with a display and a touch-sensitive surface is in a locked, passcode-protected state, the device displays a lock screen user interface on the display. The lock screen user interface includes a plurality of restricted application launch icons, each restricted application launch icon corresponding to an application. The device also detects user input to activate a respective restricted application launch icon; and, in response to detecting the user input to activate the respective restricted application launch icon, starts a restricted session for a respective application that corresponds to the respective restricted application launch icon, wherein the respective application is configured to generate one or more content items while in the restricted session, and maintains the device in the locked, passcode-protected state for applications in the device other than the respective application.1. A method, comprising:
while an electronic device with a display and a touch-sensitive surface is in a locked, passcode-protected state:
displaying a lock screen user interface on the display, the lock screen user interface including a plurality of restricted application launch icons, each restricted application launch icon corresponding to an application;
detecting user input to activate a respective restricted application launch icon; and,
in response to detecting the user input to activate the respective restricted application launch icon:
starting a restricted session for a respective application that corresponds to the respective restricted application launch icon, wherein the respective application is configured to generate one or more content items while in the restricted session; and
maintaining the device in the locked, passcode-protected state for applications in the device other than the respective application. 2. The method of claim 1, wherein:
while the respective application is in the restricted session:
the respective application is enabled to present one or more content items generated by the respective application while in the restricted session; and
the respective application is disabled from presenting any content items in the respective application that were not generated while in the restricted session. 3. The method of claim 1, wherein the plurality of restricted application launch icons include one or more of a restricted note taking application launch icon, a restricted calendar application launch icon, a restricted contact list application launch icon, and a restricted voice recorder application launch icon. 4. The method of claim 1, wherein the respective restricted application launch icon is a restricted note taking application launch icon, the respective application is a note taking application, and the note taking application is configured to generate notes while in the restricted session. 5. The method of claim 4, wherein, while the note taking application is in the restricted session:
the note taking application is enabled to display one or more notes generated by the note taking application while in the restricted session; and the note taking application is disabled from displaying any notes in the note taking application that were not generated while in the restricted session. 6. The method of claim 1, wherein the respective restricted application launch icon is a restricted calendar application launch icon, the respective application is a calendar application, and the calendar application is configured to generate calendar events while in the restricted session. 7. The method of claim 6, wherein, while the calendar application is in the restricted session:
the calendar application is enabled to display one or more calendar events generated by the calendar application while in the restricted session; and the calendar application is disabled from displaying any calendar events in the calendar application that were not generated while in the restricted session. 8. The method of claim 1, wherein the respective restricted application launch icon is a restricted contact list application launch icon, the respective application is a contact list application, and the contact list application is configured to generate new contact list entries while in the restricted session. 9. The method of claim 8, wherein, while the contact list application is in the restricted session:
the contact list application is enabled to display one or more contact list entries generated by the contact list application while in the restricted session; and the contact list application is disabled from displaying any contact list entries in the contact list application that were not generated while in the restricted session. 10. The method of claim 1, wherein the respective restricted application launch icon is a restricted voice recorder application launch icon, the respective application is a voice recorder application, and the voice recorder application is configured to generate voice recordings while in the restricted session. 11. The method of claim 10, wherein, while the voice recorder application is in the restricted session:
the voice recorder application is enabled to play one or more voice recordings generated by the voice recorder application while in the restricted session; and the voice recorder application is disabled from playing any voice recordings in the voice recorder application that were not generated while in the restricted session. 12. The method of claim 1, wherein the plurality of restricted application launch icons is user configurable. 13. A method, comprising:
at an electronic device with a display, a touch-sensitive surface, and a plurality of applications:
starting a restricted session for a first application while maintaining the device in a locked, passcode-protected state for applications in the device other than the first application;
while the first application is in the restricted session:
generating one or more content items in the first application;
receiving a request to present one or more content items in the first application; and,
in response to receiving the request to present one or more content items in the first application:
presenting content items or representations thereof that meet restricted session access criteria for the first application; and
not presenting content items or representations thereof that fail to meet the restricted session access criteria for the first application. 14. The method of claim 13, wherein the restricted session access criteria include that, to be presented, a content item or representation thereof was created during the restricted session for the first application. 15. The method of claim 13, wherein the restricted session access criteria include that, to be presented, a content item or representation thereof was created within a predefined time of a current time. 16. The method of claim 13, wherein the restricted session access criteria include that, to be presented, a content item or representation thereof was created during the restricted session for the first application and within a predefined time of a current time. 17. The method of claim 13, wherein the restricted session access criteria include that, to be presented, a content item or representation thereof was created during the restricted session for the first application and a current time period of inactivity for the first application in the restricted session is less than a predefined threshold. 18. An electronic device, comprising:
a display; a touch-sensitive surface; one or more processors; memory; and one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the one or more processors, the one or more programs including instructions for: while the electronic device is in a locked, passcode-protected state:
displaying a lock screen user interface on the display, the lock screen user interface including a plurality of restricted application launch icons, each restricted application launch icon corresponding to an application;
detecting user input to activate a respective restricted application launch icon; and,
in response to detecting the user input to activate the respective restricted application launch icon:
starting a restricted session for a respective application that corresponds to the respective restricted application launch icon, wherein the respective application is configured to generate one or more content items while in the restricted session; and
maintaining the device in the locked, passcode-protected state for applications in the device other than the respective application. 19. A computer readable storage medium storing one or more programs, the one or more programs comprising instructions, which when executed by an electronic device with a display and a touch-sensitive surface, cause the device to:
while the electronic device is in a locked, passcode-protected state:
display a lock screen user interface on the display, the lock screen user interface including a plurality of restricted application launch icons, each restricted application launch icon corresponding to an application;
detect user input to activate a respective restricted application launch icon; and,
in response to detecting the user input to activate the respective restricted application launch icon:
start a restricted session for a respective application that corresponds to the respective restricted application launch icon, wherein the respective application is configured to generate one or more content items while in the restricted session; and
maintain the device in the locked, passcode-protected state for applications in the device other than the respective application. 20. A graphical user interface on an electronic device with a display and a touch-sensitive surface, a memory, and one or more processors to execute one or more programs stored in the memory, the graphical user interface comprising, while the electronic device is in a locked, passcode-protected state:
a lock screen user interface on the display, the lock screen user interface including a plurality of restricted application launch icons, each restricted application launch icon corresponding to an application; wherein: user input to activate a respective restricted application launch icon is detected; and, in response to detecting the user input to activate the respective restricted application launch icon:
a restricted session for a respective application that corresponds to the respective restricted application launch icon is started, wherein the respective application is configured to generate one or more content items while in the restricted session; and
the device is maintained in the locked, passcode-protected state for applications in the device other than the respective application. 21. An electronic device, comprising:
a display; a touch-sensitive surface; one or more processors; memory; a plurality of applications; and one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the one or more processors, the one or more programs including instructions for:
starting a restricted session for a first application while maintaining the device in a locked, passcode-protected state for applications in the device other than the first application;
while the first application is in the restricted session:
generating one or more content items in the first application;
receiving a request to present one or more content items in the first application; and,
in response to receiving the request to present one or more content items in the first application:
presenting content items or representations thereof that meet restricted session access criteria for the first application; and
not presenting content items or representations thereof that fail to meet the restricted session access criteria for the first application. 22. A computer readable storage medium storing one or more programs, the one or more programs comprising instructions, which when executed by an electronic device with a display, a touch-sensitive surface, and a plurality of applications, cause the device to:
start a restricted session for a first application while maintaining the device in a locked, passcode-protected state for applications in the device other than the first application; while the first application is in the restricted session:
generate one or more content items in the first application;
receive a request to present one or more content items in the first application; and,
in response to receiving the request to present one or more content items in the first application:
present content items or representations thereof that meet restricted session access criteria for the first application, and
not present content items or representations thereof that fail to meet the restricted session access criteria for the first application. 23. A graphical user interface on an electronic device with a display and a touch-sensitive surface, a memory, a plurality of applications, and one or more processors to execute one or more programs stored in the memory, the graphical user interface comprising:
a user interface of a first application in a restricted session, wherein the restricted session for the first application is started while maintaining the device in a locked, passcode-protected state for applications in the device other than the first application; wherein: while the first application is in the restricted session:
one or more content items is generated in the first application;
a request to present one or more content items in the first application is received; and,
in response to receiving the request to present one or more content items in the first application:
content items or representations thereof that meet restricted session access criteria for the first application are presented; and
content items or representations thereof that fail to meet the restricted session access criteria for the first application are not presented. | 2,100 |
5,733 | 5,733 | 15,216,943 | 2,177 | A system for providing help content to an industrial portable device includes a computer network within a plant with a help server. The industrial portable device includes a computer processor with a help application that provides help content regarding the use of the industrial portable device and/or other control applications on the industrial portable device. The help server can modify the help content in the help application, for example with help updates. The help application is separate and independent of the other control applications and can be modified independently of the other control applications. The industrial portable device may be a portable field device communicator and/or intrinsically safe. | 1. An industrial portable device, comprising:
a functional module configured to operatively couple to and interact with a field device of an industrial plant; a processor configured to control the functional module; an electronic display driven by the computer control system and configured to display information relative to the functional module to a user; and a help application implemented by the processor and configured to display content to the user on the display about how to use the functional module. 2. The industrial portable device of claim 1, further comprising:
a control application implemented by the processor and configured to control the functionality of the functional module, wherein the help application operates independently of the control application. 3. The industrial portable device of claim 2, wherein the processor is configured to provide content updates to the help application independently of the control application. 4. The industrial portable device of claim 3, further comprising:
another control application implemented by the processor and configured to control a second functionality by the industrial portable device, wherein the help application is configured to display content to the user on the display about how to use the another control application on the industrial portable device, and wherein the help application operates independently of the another control application. 5. The industrial portable device of claim 4, wherein the processor is configured to provide content updates to the help application relative to use of each of the control application and the another control application independently of each of the control application and the another control application. 6. The industrial portable device of claim 1, wherein the functional module comprises a field communicator configured to send and receive communication signals to a field device. 7. The industrial portable device of claim 6, wherein the field communicator includes electronic circuits configured to connect to a field device and/or a bus connected to a field device. 8. The industrial portable device of claim 7, wherein the field communicator includes terminals configured to connect to and communicate with HART field device and/or a FOUNDATION fieldbus field device. 9. The industrial portable device of claim 8, wherein the terminals are configured to connect to and power a HART field device or a FOUNDATION fieldbus field device, and wherein the terminals are configured to measure current on a 4-20 mA current loop. 10. The industrial portable device of claim 1, wherein the industrial portable device is intrinsically safe. 11. The industrial portable device of claim 1, further comprising:
a web browser application implemented by the processor, wherein the processor is configured to display the content from the help application with the web browser on the electronic display. 12. The industrial portable device of claim 11, further comprising:
a communication link configured to connect the processor with a computer network. 13. The industrial portable device of claim 12, wherein the processor is configured to stream at least a portion of the content from a remote source to the electronic display over the communication link. 14. The industrial portable device of claim 13, wherein at least a portion of the content that is streamed comprises instructional video. 15. The industrial portable device of claim 11, wherein the help application dynamically alters the display format of the content based on the size and/or type of electronic display. 16. The industrial portable device of claim 15, wherein the help application formats the content in HTMLS. 17. The industrial portable device of claim 1, wherein at least a portion of the content is stored locally on the industrial portable device by the processor. 18. A system for providing help content to an industrial portable device, comprising:
a computer network within a plant, the computer network including a fleet management station and a network access point operatively connected by a first communication link; an industrial portable device having a processor, at least one control application configured to control a functional interaction of the industrial portable device with a field device in the plant, an electronic display, a help application implemented by the processor to provide help information on the electronic display regarding the control application, and a second communication link configured to communicate with the network access point; and a help server connected to the computer network and accessible by the network access point, wherein the help server provides help content to the help application on the industrial portable device through the network access point. 19. The system of claim 18, wherein the help server is configured to provide the help content to the industrial portable device to update the help application without modifying the control application. 20. The system of claim 18, wherein the second communication link and the network access point comprise a wireless data communication link. 21. The system of claim 18, wherein the industrial portable device is configured to receive the help content without an internet connection. 22. The system of claim 18, wherein the industrial portable device is configured to receive the help content through an internet connection. 23. The system of claim 18, wherein the industrial portable device includes a browser application configured to display the help content from html format. 24. The system of claim 23, wherein the help server provides the help content in html 5 format. 25. The system of claim 23, wherein the help content is formatted to dynamically resize depending on the size and/or type of electronic display on the industrial portable device. 26. The system of claim 18, wherein the industrial portable device is intrinsically safe. 27. The system of claim 18, wherein the industrial portable device comprises a field communicator configured to send and receive communication signals to a field device in the plant. 28. The system of claim 18, wherein the industrial portable device comprises an ammeter configured to be connected to and test a field device and/or bus in the plant. 29. The system of claim 18, wherein the help server is configured to receive help content from an external server network outside of the plant computer network and to provide the received help content to the industrial portable device. 30. The system of claim 18, wherein help server is configured to provide the received help content to the industrial portable device automatically upon establishment of communication between the communication link of the industrial portable device and the network access point of the plant computer network. | A system for providing help content to an industrial portable device includes a computer network within a plant with a help server. The industrial portable device includes a computer processor with a help application that provides help content regarding the use of the industrial portable device and/or other control applications on the industrial portable device. The help server can modify the help content in the help application, for example with help updates. The help application is separate and independent of the other control applications and can be modified independently of the other control applications. The industrial portable device may be a portable field device communicator and/or intrinsically safe.1. An industrial portable device, comprising:
a functional module configured to operatively couple to and interact with a field device of an industrial plant; a processor configured to control the functional module; an electronic display driven by the computer control system and configured to display information relative to the functional module to a user; and a help application implemented by the processor and configured to display content to the user on the display about how to use the functional module. 2. The industrial portable device of claim 1, further comprising:
a control application implemented by the processor and configured to control the functionality of the functional module, wherein the help application operates independently of the control application. 3. The industrial portable device of claim 2, wherein the processor is configured to provide content updates to the help application independently of the control application. 4. The industrial portable device of claim 3, further comprising:
another control application implemented by the processor and configured to control a second functionality by the industrial portable device, wherein the help application is configured to display content to the user on the display about how to use the another control application on the industrial portable device, and wherein the help application operates independently of the another control application. 5. The industrial portable device of claim 4, wherein the processor is configured to provide content updates to the help application relative to use of each of the control application and the another control application independently of each of the control application and the another control application. 6. The industrial portable device of claim 1, wherein the functional module comprises a field communicator configured to send and receive communication signals to a field device. 7. The industrial portable device of claim 6, wherein the field communicator includes electronic circuits configured to connect to a field device and/or a bus connected to a field device. 8. The industrial portable device of claim 7, wherein the field communicator includes terminals configured to connect to and communicate with HART field device and/or a FOUNDATION fieldbus field device. 9. The industrial portable device of claim 8, wherein the terminals are configured to connect to and power a HART field device or a FOUNDATION fieldbus field device, and wherein the terminals are configured to measure current on a 4-20 mA current loop. 10. The industrial portable device of claim 1, wherein the industrial portable device is intrinsically safe. 11. The industrial portable device of claim 1, further comprising:
a web browser application implemented by the processor, wherein the processor is configured to display the content from the help application with the web browser on the electronic display. 12. The industrial portable device of claim 11, further comprising:
a communication link configured to connect the processor with a computer network. 13. The industrial portable device of claim 12, wherein the processor is configured to stream at least a portion of the content from a remote source to the electronic display over the communication link. 14. The industrial portable device of claim 13, wherein at least a portion of the content that is streamed comprises instructional video. 15. The industrial portable device of claim 11, wherein the help application dynamically alters the display format of the content based on the size and/or type of electronic display. 16. The industrial portable device of claim 15, wherein the help application formats the content in HTMLS. 17. The industrial portable device of claim 1, wherein at least a portion of the content is stored locally on the industrial portable device by the processor. 18. A system for providing help content to an industrial portable device, comprising:
a computer network within a plant, the computer network including a fleet management station and a network access point operatively connected by a first communication link; an industrial portable device having a processor, at least one control application configured to control a functional interaction of the industrial portable device with a field device in the plant, an electronic display, a help application implemented by the processor to provide help information on the electronic display regarding the control application, and a second communication link configured to communicate with the network access point; and a help server connected to the computer network and accessible by the network access point, wherein the help server provides help content to the help application on the industrial portable device through the network access point. 19. The system of claim 18, wherein the help server is configured to provide the help content to the industrial portable device to update the help application without modifying the control application. 20. The system of claim 18, wherein the second communication link and the network access point comprise a wireless data communication link. 21. The system of claim 18, wherein the industrial portable device is configured to receive the help content without an internet connection. 22. The system of claim 18, wherein the industrial portable device is configured to receive the help content through an internet connection. 23. The system of claim 18, wherein the industrial portable device includes a browser application configured to display the help content from html format. 24. The system of claim 23, wherein the help server provides the help content in html 5 format. 25. The system of claim 23, wherein the help content is formatted to dynamically resize depending on the size and/or type of electronic display on the industrial portable device. 26. The system of claim 18, wherein the industrial portable device is intrinsically safe. 27. The system of claim 18, wherein the industrial portable device comprises a field communicator configured to send and receive communication signals to a field device in the plant. 28. The system of claim 18, wherein the industrial portable device comprises an ammeter configured to be connected to and test a field device and/or bus in the plant. 29. The system of claim 18, wherein the help server is configured to receive help content from an external server network outside of the plant computer network and to provide the received help content to the industrial portable device. 30. The system of claim 18, wherein help server is configured to provide the received help content to the industrial portable device automatically upon establishment of communication between the communication link of the industrial portable device and the network access point of the plant computer network. | 2,100 |
5,734 | 5,734 | 14,995,989 | 2,159 | The embodiments described herein include one embodiment that provides a control method that includes connecting a first controller to a control system; receiving control system configuration data from a database, in which the configuration data comprises holistic state data of a second controller in the control system; and configuring operation of the first controller based at least in part on the configuration data received. | 1. A control system comprising:
a controller configured to be communicatively coupled to automation components in the control system and to facilitate performance of a process through interoperation with the automation components by generating a holistic state data, wherein the controller is configured to generate the holistic state data by:
determining a model configured to describe the process used by the controller;
determining input and output variables of the process;
determining constraints on the input and output variables;
determining an objective function associated with the process used by the controller; and
storing the model, the input and output variables, the constraints, and the objective function in one of a plurality of fields in the holistic state data to enable the automation components to detect and operate with the controller upon receiving the holistic state data. 2. The control system of claim 1, wherein the controller is configured to be communicatively coupled to the automation components via a communication network and to communicate the holistic state data to each of the automation components upon connecting to the communication network. 3. The control system of claim 1, wherein the controller is configured to be communicatively coupled to the automation components via a backplane and to communicate the holistic state data to the automation components upon connecting to the backplane. 4. The control system of claim 1, wherein the holistic state data is a standardized format understood by each of the automation components. 5. The control system of claim 1, wherein the controller is configured to generate the holistic state data by:
determining an intermediate search result of an optimization search; determining a state of the optimization search when the intermediate search result is determined; and storing the intermediate search result and the state in an optimization state field of the holistic state data. 6. The control system of claim 1, wherein the controller is configured to generate the holistic state data to facilitate performing an optimization search in conjunction with one or more of the automation components in the control system. 7. The control system of claim 1, wherein the controller is configured to generate the holistic state data by:
determining computational capabilities of the controller; determining interconnections with the automation components in the control system; and storing the computational capabilities and the interconnections in a controller settings field of the holistic state data. 8. The control system of claim 1, wherein the controller is configured to communicate the holistic state data to a server in the control system to facilitate determining an optimization problem. 9. The control system of claim 1, wherein the controller comprise an in-memory database configured to store the holistic state data. 10. A tangible, non-transitory computer-readable medium configured to store instructions executable by a processor of a controller, wherein the instructions comprise instructions to:
receive, using the processor, control system configuration data; determine, using the processor, automation components communicatively coupled to controller and characteristics of the automation components based at least in part on the control system configuration data; determine, using the processor, an optimization problem based at least in part on the automation components and the characteristics of each of the automation components; and instruct, using the processor, one or more of the automation components to perform a control action in a process, wherein the control action is determined based at least in part on the optimization problem. 11. The computer-readable medium of claim 10, wherein the characteristics of each of the automation components comprise a model used by the automation component,
wherein the instructions to determine the optimization problem comprise instructions to determine the optimization problem based at least in part on the model used by each of the automation components. 12. The computer-readable medium of claim 10, wherein the characteristics of each of the automation components comprise a computing capability of the automation component,
wherein the instructions to determine the optimization problem comprise instructions to determine the optimization problem based at least in part on computing compatibilities of each of the automation components. 13. The computer-readable medium of claim 10, wherein the control system configuration data comprises a plurality of holistic state data, wherein each of the plurality of holistic state data corresponds with one of the automation components. 14. The computer-readable medium of claim 13, wherein the instructions to determine the automation components and characteristics of the automation components comprise instructions to parse each of the plurality of holistic state data. 15. The computer-readable medium of claim 13, wherein each of the plurality of holistic state data comprises a standardized format with same fields. 16. The computer-readable medium of claim 10, wherein the instructions to receive the configuration data comprise instructions to receive the configuration data from a cloud. 17. A method for performing diagnostics on a control system comprising:
determining, using a processor, holistic state data captured by a controller in the control system; simulating, using the processor, operation of the controller based at least in part on the holistic state data while the controller performs other operations; analyzing, using the processor, simulation of the controller to perform diagnostics on the controller; adjusting, using the processor, operation of the control system based at least in part on the diagnostics. 18. The method of claim 17, wherein:
simulating operation comprises simulating performance of various control actions by the controller; and analyzing the simulation comprises analyzing results of the various control actions. 19. The method of claim 17, wherein analyzing the simulation comprises:
determining a predicted response to a control action determined by the controller using a model; and comparing the predicted result with an actual response to the control action to determine accuracy of the model. 20. The method of claim 19, comprising adjusting the model when the predicted response and the actual response vary. | The embodiments described herein include one embodiment that provides a control method that includes connecting a first controller to a control system; receiving control system configuration data from a database, in which the configuration data comprises holistic state data of a second controller in the control system; and configuring operation of the first controller based at least in part on the configuration data received.1. A control system comprising:
a controller configured to be communicatively coupled to automation components in the control system and to facilitate performance of a process through interoperation with the automation components by generating a holistic state data, wherein the controller is configured to generate the holistic state data by:
determining a model configured to describe the process used by the controller;
determining input and output variables of the process;
determining constraints on the input and output variables;
determining an objective function associated with the process used by the controller; and
storing the model, the input and output variables, the constraints, and the objective function in one of a plurality of fields in the holistic state data to enable the automation components to detect and operate with the controller upon receiving the holistic state data. 2. The control system of claim 1, wherein the controller is configured to be communicatively coupled to the automation components via a communication network and to communicate the holistic state data to each of the automation components upon connecting to the communication network. 3. The control system of claim 1, wherein the controller is configured to be communicatively coupled to the automation components via a backplane and to communicate the holistic state data to the automation components upon connecting to the backplane. 4. The control system of claim 1, wherein the holistic state data is a standardized format understood by each of the automation components. 5. The control system of claim 1, wherein the controller is configured to generate the holistic state data by:
determining an intermediate search result of an optimization search; determining a state of the optimization search when the intermediate search result is determined; and storing the intermediate search result and the state in an optimization state field of the holistic state data. 6. The control system of claim 1, wherein the controller is configured to generate the holistic state data to facilitate performing an optimization search in conjunction with one or more of the automation components in the control system. 7. The control system of claim 1, wherein the controller is configured to generate the holistic state data by:
determining computational capabilities of the controller; determining interconnections with the automation components in the control system; and storing the computational capabilities and the interconnections in a controller settings field of the holistic state data. 8. The control system of claim 1, wherein the controller is configured to communicate the holistic state data to a server in the control system to facilitate determining an optimization problem. 9. The control system of claim 1, wherein the controller comprise an in-memory database configured to store the holistic state data. 10. A tangible, non-transitory computer-readable medium configured to store instructions executable by a processor of a controller, wherein the instructions comprise instructions to:
receive, using the processor, control system configuration data; determine, using the processor, automation components communicatively coupled to controller and characteristics of the automation components based at least in part on the control system configuration data; determine, using the processor, an optimization problem based at least in part on the automation components and the characteristics of each of the automation components; and instruct, using the processor, one or more of the automation components to perform a control action in a process, wherein the control action is determined based at least in part on the optimization problem. 11. The computer-readable medium of claim 10, wherein the characteristics of each of the automation components comprise a model used by the automation component,
wherein the instructions to determine the optimization problem comprise instructions to determine the optimization problem based at least in part on the model used by each of the automation components. 12. The computer-readable medium of claim 10, wherein the characteristics of each of the automation components comprise a computing capability of the automation component,
wherein the instructions to determine the optimization problem comprise instructions to determine the optimization problem based at least in part on computing compatibilities of each of the automation components. 13. The computer-readable medium of claim 10, wherein the control system configuration data comprises a plurality of holistic state data, wherein each of the plurality of holistic state data corresponds with one of the automation components. 14. The computer-readable medium of claim 13, wherein the instructions to determine the automation components and characteristics of the automation components comprise instructions to parse each of the plurality of holistic state data. 15. The computer-readable medium of claim 13, wherein each of the plurality of holistic state data comprises a standardized format with same fields. 16. The computer-readable medium of claim 10, wherein the instructions to receive the configuration data comprise instructions to receive the configuration data from a cloud. 17. A method for performing diagnostics on a control system comprising:
determining, using a processor, holistic state data captured by a controller in the control system; simulating, using the processor, operation of the controller based at least in part on the holistic state data while the controller performs other operations; analyzing, using the processor, simulation of the controller to perform diagnostics on the controller; adjusting, using the processor, operation of the control system based at least in part on the diagnostics. 18. The method of claim 17, wherein:
simulating operation comprises simulating performance of various control actions by the controller; and analyzing the simulation comprises analyzing results of the various control actions. 19. The method of claim 17, wherein analyzing the simulation comprises:
determining a predicted response to a control action determined by the controller using a model; and comparing the predicted result with an actual response to the control action to determine accuracy of the model. 20. The method of claim 19, comprising adjusting the model when the predicted response and the actual response vary. | 2,100 |
5,735 | 5,735 | 14,874,841 | 2,139 | Several embodiments of memory devices and systems having a variable logical memory capacity are disclosed herein. In one embodiment, a memory device can include a plurality of memory regions that collectively define a physical memory capacity and a controller operably coupled to the plurality of memory regions. The controller is configured to advertise a first logical memory capacity to a host device, wherein the first logical memory capacity is less than the physical memory capacity, determine that at least one of the memory regions is at or near end of life, and in response to the determination, (1) retire the at least one of the memory regions and (2) reduce a logical memory capacity of the host device to a second logical memory capacity that is less than the first logical memory capacity. | 1. A memory device, comprising:
a plurality of memory regions collectively defining a physical memory capacity; and a controller operably coupled to the memory regions, wherein the controller is configured to—
advertise a first logical memory capacity to a host device, wherein the first logical memory capacity is less than the physical memory capacity,
determine that at least one of the memory regions is at or near end of life, and
in response to the determination, (1) retire the at least one of the memory regions and (2) reduce a logical memory capacity of the host device to a second logical memory capacity that is less than the first logical memory capacity. 2. The memory device of claim 1 wherein the controller is further configured to advertise the second logical memory capacity to the host device in lieu of the first logical memory capacity. 3. The memory device of claim 1 wherein the controller is further configured to:
directly access the memory regions via a first set of memory addresses;
map individual ones of the first memory addresses to second memory addresses implemented by the host device for accessing the memory regions via the controller; and
permanently remove memory addresses from the set of second memory addresses to a reduced set of memory addresses after retiring the at least one of the memory addresses. 4. The memory device of claim 3 wherein the controller is further configured to renumber the reduced set of memory addresses. 5. The memory device of claim 1 wherein the controller is further configured to send a notification to the host device indicating that the at least one of the memory regions is at or near end of life, and prompting the host device to transfer contents of the at least one of the memory regions to one or more other memory regions of the plurality of memory regions. 6. The memory device of claim 1 wherein the controller is further configured to determine that the at least one of the memory regions is at or near end of life based on a write count associated with the at least one of the memory regions. 7. The memory device of claim 1 wherein the controller is further configured to determine that the at least one of the memory regions is at or near end of life based on a bit error rate associated with the at least one of the memory regions. 8. The memory device of claim 1 wherein the memory regions comprises NAND flash memory media. 9. A method of operating a memory device, wherein the memory device includes a main memory and a controller operably coupling the main memory to a host device, wherein the main memory includes a plurality of memory regions that collectively define a physical memory capacity, and wherein the method comprises:
determining that at least one of the memory regions is at or near end of life; and in response to determining that the at least one of the memory regions is at or near end of life, retiring the at least one of the memory regions and reducing a logical memory capacity of the memory device that the controller reports to the host device. 10. The method of claim 9 wherein:
the memory regions have corresponding first memory addresses;
the method further comprises mapping the first memory addresses to second memory addresses implemented by the host device for accessing the memory regions via the controller; and
retiring the at least one of the memory regions includes remapping the first and second memory addresses such that the at least one of the memory regions is permanently inaccessible to the host device via the controller. 11. The method of claim 9 wherein the memory regions are memory blocks formed in one or more semiconductor dies. 12. The method of claim 9 wherein the memory regions are memory pages formed in memory blocks that are formed in one or more semiconductor dies. 13. The method of claim 9 wherein retiring the at least one of the memory regions further includes reducing an over-provisioning (OP) storage capacity of the memory device. 14. The method of claim 9 wherein reducing the logical memory capacity includes permanently reducing a set of logical addresses used by the host device to a reduced set of logical addresses. 15. The method of claim 9 wherein retiring the at least one of the memory regions includes transferring contents of the at least one of the memory regions to one or more other memory regions of the plurality of memory regions. 16. A system, comprising:
a host device; and a memory device storing a mapping table, wherein the memory device has a plurality of memory regions and a controller operably coupling the memory regions to the host device based on the mapping table, wherein the controller is configured to—
determine that at least one of the memory regions is at or near end of life, and
update the mapping table such that the at least one of the memory regions is permanently inaccessible to the host device via the controller. 17. The system of claim 16 wherein:
the controller is further configured to notify the host device that the at least one of the memory regions is at or near end of life; and
the host device is configured to transfer contents of the at least one of the memory regions to one or more other memory regions of the plurality of memory regions in response to the notification from the controller. 18. The system of claim 16 wherein the controller is further configured to transfer contents of the at least one of the memory regions to one or more other memory regions of the plurality of memory regions in response to determining that the at least one of the memory regions is at or near end of life. 19. The system of claim 16 wherein the controller is further configured to notify the host device that the memory device has a permanently reduced memory capacity after updating the mapping table. 20. The system of claim 16 wherein the memory device comprises a solid state drive. | Several embodiments of memory devices and systems having a variable logical memory capacity are disclosed herein. In one embodiment, a memory device can include a plurality of memory regions that collectively define a physical memory capacity and a controller operably coupled to the plurality of memory regions. The controller is configured to advertise a first logical memory capacity to a host device, wherein the first logical memory capacity is less than the physical memory capacity, determine that at least one of the memory regions is at or near end of life, and in response to the determination, (1) retire the at least one of the memory regions and (2) reduce a logical memory capacity of the host device to a second logical memory capacity that is less than the first logical memory capacity.1. A memory device, comprising:
a plurality of memory regions collectively defining a physical memory capacity; and a controller operably coupled to the memory regions, wherein the controller is configured to—
advertise a first logical memory capacity to a host device, wherein the first logical memory capacity is less than the physical memory capacity,
determine that at least one of the memory regions is at or near end of life, and
in response to the determination, (1) retire the at least one of the memory regions and (2) reduce a logical memory capacity of the host device to a second logical memory capacity that is less than the first logical memory capacity. 2. The memory device of claim 1 wherein the controller is further configured to advertise the second logical memory capacity to the host device in lieu of the first logical memory capacity. 3. The memory device of claim 1 wherein the controller is further configured to:
directly access the memory regions via a first set of memory addresses;
map individual ones of the first memory addresses to second memory addresses implemented by the host device for accessing the memory regions via the controller; and
permanently remove memory addresses from the set of second memory addresses to a reduced set of memory addresses after retiring the at least one of the memory addresses. 4. The memory device of claim 3 wherein the controller is further configured to renumber the reduced set of memory addresses. 5. The memory device of claim 1 wherein the controller is further configured to send a notification to the host device indicating that the at least one of the memory regions is at or near end of life, and prompting the host device to transfer contents of the at least one of the memory regions to one or more other memory regions of the plurality of memory regions. 6. The memory device of claim 1 wherein the controller is further configured to determine that the at least one of the memory regions is at or near end of life based on a write count associated with the at least one of the memory regions. 7. The memory device of claim 1 wherein the controller is further configured to determine that the at least one of the memory regions is at or near end of life based on a bit error rate associated with the at least one of the memory regions. 8. The memory device of claim 1 wherein the memory regions comprises NAND flash memory media. 9. A method of operating a memory device, wherein the memory device includes a main memory and a controller operably coupling the main memory to a host device, wherein the main memory includes a plurality of memory regions that collectively define a physical memory capacity, and wherein the method comprises:
determining that at least one of the memory regions is at or near end of life; and in response to determining that the at least one of the memory regions is at or near end of life, retiring the at least one of the memory regions and reducing a logical memory capacity of the memory device that the controller reports to the host device. 10. The method of claim 9 wherein:
the memory regions have corresponding first memory addresses;
the method further comprises mapping the first memory addresses to second memory addresses implemented by the host device for accessing the memory regions via the controller; and
retiring the at least one of the memory regions includes remapping the first and second memory addresses such that the at least one of the memory regions is permanently inaccessible to the host device via the controller. 11. The method of claim 9 wherein the memory regions are memory blocks formed in one or more semiconductor dies. 12. The method of claim 9 wherein the memory regions are memory pages formed in memory blocks that are formed in one or more semiconductor dies. 13. The method of claim 9 wherein retiring the at least one of the memory regions further includes reducing an over-provisioning (OP) storage capacity of the memory device. 14. The method of claim 9 wherein reducing the logical memory capacity includes permanently reducing a set of logical addresses used by the host device to a reduced set of logical addresses. 15. The method of claim 9 wherein retiring the at least one of the memory regions includes transferring contents of the at least one of the memory regions to one or more other memory regions of the plurality of memory regions. 16. A system, comprising:
a host device; and a memory device storing a mapping table, wherein the memory device has a plurality of memory regions and a controller operably coupling the memory regions to the host device based on the mapping table, wherein the controller is configured to—
determine that at least one of the memory regions is at or near end of life, and
update the mapping table such that the at least one of the memory regions is permanently inaccessible to the host device via the controller. 17. The system of claim 16 wherein:
the controller is further configured to notify the host device that the at least one of the memory regions is at or near end of life; and
the host device is configured to transfer contents of the at least one of the memory regions to one or more other memory regions of the plurality of memory regions in response to the notification from the controller. 18. The system of claim 16 wherein the controller is further configured to transfer contents of the at least one of the memory regions to one or more other memory regions of the plurality of memory regions in response to determining that the at least one of the memory regions is at or near end of life. 19. The system of claim 16 wherein the controller is further configured to notify the host device that the memory device has a permanently reduced memory capacity after updating the mapping table. 20. The system of claim 16 wherein the memory device comprises a solid state drive. | 2,100 |
5,736 | 5,736 | 15,726,738 | 2,116 | The invention relates to a method for the utilization of data from a plurality of machines, in which
operating data from a plurality of machines are detected by a plurality of sensors, wherein the operating data have different first data formats, with the respective first data format depending on the respective sensor; the operating data are converted by at least one abstraction module into abstraction data, wherein the abstraction data have a uniform second data format and are stored in a central memory device; an analysis of the abstraction data is carried out, wherein the analysis is based on operating data from at least two machines; an operating state of one of the machines is assessed with reference to the analysis; and the analysis of the abstraction data is output. | 1. A method for the utilization of data from a plurality of machines, the method comprising the steps of:
detecting operating data from a plurality of machines by means of a plurality of sensors, wherein the operating data have different first data formats, with the respective first data format depending on the respective sensor; converting the operating data by at least one abstraction module into abstraction data, wherein the abstraction data have a uniform second data format and are stored in a central memory device; carrying out an analysis of the abstraction data, wherein the analysis is based on operating data from at least two machines; assessing an operating state of one of the machines with reference to the analysis; and outputting the analysis of the abstraction data. 2. The method in accordance with claim 1,
wherein the analysis is used to control at least one of the machines. 3. The method in accordance with claim 1,
wherein the analysis is used in order to achieve an optimization of he operation of at least one of the machines. 4. The method in accordance with claim 1,
wherein the machines are involved in a common production process. 5. The method in accordance with claim 1,
wherein the first data format is a data format that is used natively by the respective sensor. 6. The method in accordance with claim 1,
wherein the second data format comprises semantics that provides the abstraction data with meanings and associates said abstraction data with at least one category. 7. The method in accordance with claim 6,
wherein the abstraction module automatically provides the operating data with the semantics. 8. The method in accordance with claim 6,
wherein the second data format comprises relationships between the categories of said abstraction data. 9. The method in accordance with claim 1, further comprising the step of:
outputting the analysis on a portable display device that displays a position of the machine to which the analysis is related. 10. The method in accordance with claim 1,
wherein at least one of the abstraction modules is integrated in the respective sensor. 11. The method in accordance with claim 1, further comprising the step of:
outputting the analysis to a production control system and/or to an operation control system. 12. The method in accordance with claim 1,
wherein the analysis comprises a prediction about a future operating state of one of the machines. 13. The method in accordance with claim 1, further comprising the steps of:
detecting operating data from a paste printer and from a soldering system by means of optical sensors; wherein the analysis comprises the quality of a paste print and the quality of a soldering process; and carrying out a change in the operation of the soldering system on the basis of the quality of the paste print; and/or carrying out a change in the operation of the paste printer on the basis of the quality of the soldering process. 14. A system comprising at least two machines, at least two sensors, and a processing device,
wherein the system is configured to carry out a method for the utilization of data from a plurality of machines, the method comprising the steps of: detecting operating data from the at least two machines by means of the at least two sensors, wherein the operating data have different first data formats, with the respective first data format depending on the respective sensor; converting the operating data by at least one abstraction module into abstraction data, wherein the abstraction data have a uniform second data format and are stored in a central memory device; carrying out an analysis of the abstraction data, wherein the analysis is based on operating data from the at least two machines; assessing an operating state of one of the machines with reference to the analysis; and outputting the analysis of the abstraction data. 15. The system in accordance with claim 14,
wherein at least one of the sensors is integrated into one of the machines. 16. The system in accordance with claim 14,
wherein at least one of the sensors is a component of one of the machines. | The invention relates to a method for the utilization of data from a plurality of machines, in which
operating data from a plurality of machines are detected by a plurality of sensors, wherein the operating data have different first data formats, with the respective first data format depending on the respective sensor; the operating data are converted by at least one abstraction module into abstraction data, wherein the abstraction data have a uniform second data format and are stored in a central memory device; an analysis of the abstraction data is carried out, wherein the analysis is based on operating data from at least two machines; an operating state of one of the machines is assessed with reference to the analysis; and the analysis of the abstraction data is output.1. A method for the utilization of data from a plurality of machines, the method comprising the steps of:
detecting operating data from a plurality of machines by means of a plurality of sensors, wherein the operating data have different first data formats, with the respective first data format depending on the respective sensor; converting the operating data by at least one abstraction module into abstraction data, wherein the abstraction data have a uniform second data format and are stored in a central memory device; carrying out an analysis of the abstraction data, wherein the analysis is based on operating data from at least two machines; assessing an operating state of one of the machines with reference to the analysis; and outputting the analysis of the abstraction data. 2. The method in accordance with claim 1,
wherein the analysis is used to control at least one of the machines. 3. The method in accordance with claim 1,
wherein the analysis is used in order to achieve an optimization of he operation of at least one of the machines. 4. The method in accordance with claim 1,
wherein the machines are involved in a common production process. 5. The method in accordance with claim 1,
wherein the first data format is a data format that is used natively by the respective sensor. 6. The method in accordance with claim 1,
wherein the second data format comprises semantics that provides the abstraction data with meanings and associates said abstraction data with at least one category. 7. The method in accordance with claim 6,
wherein the abstraction module automatically provides the operating data with the semantics. 8. The method in accordance with claim 6,
wherein the second data format comprises relationships between the categories of said abstraction data. 9. The method in accordance with claim 1, further comprising the step of:
outputting the analysis on a portable display device that displays a position of the machine to which the analysis is related. 10. The method in accordance with claim 1,
wherein at least one of the abstraction modules is integrated in the respective sensor. 11. The method in accordance with claim 1, further comprising the step of:
outputting the analysis to a production control system and/or to an operation control system. 12. The method in accordance with claim 1,
wherein the analysis comprises a prediction about a future operating state of one of the machines. 13. The method in accordance with claim 1, further comprising the steps of:
detecting operating data from a paste printer and from a soldering system by means of optical sensors; wherein the analysis comprises the quality of a paste print and the quality of a soldering process; and carrying out a change in the operation of the soldering system on the basis of the quality of the paste print; and/or carrying out a change in the operation of the paste printer on the basis of the quality of the soldering process. 14. A system comprising at least two machines, at least two sensors, and a processing device,
wherein the system is configured to carry out a method for the utilization of data from a plurality of machines, the method comprising the steps of: detecting operating data from the at least two machines by means of the at least two sensors, wherein the operating data have different first data formats, with the respective first data format depending on the respective sensor; converting the operating data by at least one abstraction module into abstraction data, wherein the abstraction data have a uniform second data format and are stored in a central memory device; carrying out an analysis of the abstraction data, wherein the analysis is based on operating data from the at least two machines; assessing an operating state of one of the machines with reference to the analysis; and outputting the analysis of the abstraction data. 15. The system in accordance with claim 14,
wherein at least one of the sensors is integrated into one of the machines. 16. The system in accordance with claim 14,
wherein at least one of the sensors is a component of one of the machines. | 2,100 |
5,737 | 5,737 | 14,445,480 | 2,152 | Various of the present embodiments convert structured data to a channel-based representation facilitating pattern recognition by a compression utility. The channels may include a key channel, a number channel, a type channel, a length channel, etc. These channels reflect the same information as the structured data, but reorganized based upon the structured data's hierarchic structure. The encoder and decoder may include rule sets specifying the relations between the channels to deconstruct/construct the JSON file. Memoization, length encoding, and type encoding extensions may also be applied as part of the encoding/decoding process to further improve compression. | 1. A computer-implemented method for channeling structured data, comprising:
receiving structured data comprising key-value pairs; generating a plurality of channel elements from the received structured data; and creating a channeled representation by assembling the channel elements into a plurality of channels. 2. The computer-implemented method of claim 1, wherein the structured data is JSON. 3. The computer-implemented method of claim 1, wherein generating a plurality of channel elements comprises generating type channel elements, length channel elements, key channel elements, and number channel elements,
wherein the type channel elements indicate a type of value associated with each key-value pair in the structured data. 4. The computer-implemented method of claim 1, wherein generating a plurality of channel elements comprises iterating in a depth-first search through key-value pairs in the structured data and inserting each channel type element in its respective channel in the order in which it was encountered in the structured data. 5. The computer-implemented method of claim 4, wherein generating length channel elements comprises identifying a number of key-value pairs associated with an object as a length channel element. 6. The computer-implemented method of claim 1, wherein generating number channel elements comprises determining a number of bytes with which to represent a number and appending the number to the number channel element . 7. The computer-implemented method of claim 1, wherein creating a channeled representation comprises identifying a pattern in at least one of the assembled channel elements and substituting a memoization reference for the pattern. 8. A non-transitory computer-readable medium comprising instructions configured to cause one or more computer processors to perform a method, comprising:
receiving structured data comprising key-value pairs; generating a plurality of channel elements from the received structured data; and creating a channeled representation by assembling the channel elements into a plurality of channels. 9. The non-transitory computer-readable medium of claim 8, wherein the structured data is a JSON . 10. The non-transitory computer-readable medium of claim 8, wherein generating a plurality of channel elements comprises generating type channel elements, length channel elements, key channel elements, and number channel elements,
wherein the type channel elements indicate a type of value associated with each key-value pair in the structured data. 11. The non-transitory computer-readable medium of claim 8, wherein generating a plurality of channel elements comprises iterating in a depth-first search through key-value pairs in the structured data and inserting each channel type element in its respective channel in the order in which it was encountered in the structured data. 12. The non-transitory computer-readable medium of claim 11, wherein generating length channel elements comprises identifying a number of key-value pairs associated with an object as an length channel element. 13. The non-transitory computer-readable medium of claim 8, wherein generating number channel elements comprises determining a number of bytes with which to represent a number and appending the number to the number channel element. 14. The non-transitory computer-readable medium of claim 8, wherein creating a channeled representation comprises identifying a pattern in at least one of the assembled channel elements and substituting a memoization reference for the pattern. 15. A computer-implemented method for dechanneling a structured data, comprising:
receiving a channeled data representation of structured data, the channeled data representation comprising a types channel and a length channel, the types channel comprising a plurality of types elements, wherein the types channel elements indicate a type of value associated with each key-value pair in the structured data; determining that a types channel element of the channeled data representation references a first object; in response to determining that a types channel element references the first object, determining a next length element in the length channel; and generating a plurality of structured data key-value pairs. 16. The computer-implemented method of claim 15, wherein the structured data is JSON. 17. The computer-implemented method of claim 15, wherein the types channel comprises at least one type element reflecting a length of an iterable object. 18. The computer-implemented method of claim 15, the method further comprising considering the next N elements in the type channel, where N elements are indicated in the next length element in the length channel. 19. The computer-implemented method of claim 18, wherein one of the next N elements identifies a second object element, and in response to determining that one of the next N elements identifies a second object element, determining a next length element in the length channel. 20. The computer-implemented method of claim 15, wherein the channeled data further comprising an integers channel, the integers channel reflecting variable length of integers. | Various of the present embodiments convert structured data to a channel-based representation facilitating pattern recognition by a compression utility. The channels may include a key channel, a number channel, a type channel, a length channel, etc. These channels reflect the same information as the structured data, but reorganized based upon the structured data's hierarchic structure. The encoder and decoder may include rule sets specifying the relations between the channels to deconstruct/construct the JSON file. Memoization, length encoding, and type encoding extensions may also be applied as part of the encoding/decoding process to further improve compression.1. A computer-implemented method for channeling structured data, comprising:
receiving structured data comprising key-value pairs; generating a plurality of channel elements from the received structured data; and creating a channeled representation by assembling the channel elements into a plurality of channels. 2. The computer-implemented method of claim 1, wherein the structured data is JSON. 3. The computer-implemented method of claim 1, wherein generating a plurality of channel elements comprises generating type channel elements, length channel elements, key channel elements, and number channel elements,
wherein the type channel elements indicate a type of value associated with each key-value pair in the structured data. 4. The computer-implemented method of claim 1, wherein generating a plurality of channel elements comprises iterating in a depth-first search through key-value pairs in the structured data and inserting each channel type element in its respective channel in the order in which it was encountered in the structured data. 5. The computer-implemented method of claim 4, wherein generating length channel elements comprises identifying a number of key-value pairs associated with an object as a length channel element. 6. The computer-implemented method of claim 1, wherein generating number channel elements comprises determining a number of bytes with which to represent a number and appending the number to the number channel element . 7. The computer-implemented method of claim 1, wherein creating a channeled representation comprises identifying a pattern in at least one of the assembled channel elements and substituting a memoization reference for the pattern. 8. A non-transitory computer-readable medium comprising instructions configured to cause one or more computer processors to perform a method, comprising:
receiving structured data comprising key-value pairs; generating a plurality of channel elements from the received structured data; and creating a channeled representation by assembling the channel elements into a plurality of channels. 9. The non-transitory computer-readable medium of claim 8, wherein the structured data is a JSON . 10. The non-transitory computer-readable medium of claim 8, wherein generating a plurality of channel elements comprises generating type channel elements, length channel elements, key channel elements, and number channel elements,
wherein the type channel elements indicate a type of value associated with each key-value pair in the structured data. 11. The non-transitory computer-readable medium of claim 8, wherein generating a plurality of channel elements comprises iterating in a depth-first search through key-value pairs in the structured data and inserting each channel type element in its respective channel in the order in which it was encountered in the structured data. 12. The non-transitory computer-readable medium of claim 11, wherein generating length channel elements comprises identifying a number of key-value pairs associated with an object as an length channel element. 13. The non-transitory computer-readable medium of claim 8, wherein generating number channel elements comprises determining a number of bytes with which to represent a number and appending the number to the number channel element. 14. The non-transitory computer-readable medium of claim 8, wherein creating a channeled representation comprises identifying a pattern in at least one of the assembled channel elements and substituting a memoization reference for the pattern. 15. A computer-implemented method for dechanneling a structured data, comprising:
receiving a channeled data representation of structured data, the channeled data representation comprising a types channel and a length channel, the types channel comprising a plurality of types elements, wherein the types channel elements indicate a type of value associated with each key-value pair in the structured data; determining that a types channel element of the channeled data representation references a first object; in response to determining that a types channel element references the first object, determining a next length element in the length channel; and generating a plurality of structured data key-value pairs. 16. The computer-implemented method of claim 15, wherein the structured data is JSON. 17. The computer-implemented method of claim 15, wherein the types channel comprises at least one type element reflecting a length of an iterable object. 18. The computer-implemented method of claim 15, the method further comprising considering the next N elements in the type channel, where N elements are indicated in the next length element in the length channel. 19. The computer-implemented method of claim 18, wherein one of the next N elements identifies a second object element, and in response to determining that one of the next N elements identifies a second object element, determining a next length element in the length channel. 20. The computer-implemented method of claim 15, wherein the channeled data further comprising an integers channel, the integers channel reflecting variable length of integers. | 2,100 |
5,738 | 5,738 | 15,109,689 | 2,129 | Method and apparatus for seismic data processing estimate primaries and/or internal multiples by solving a two-way wave equation using first and later arrivals from each layer of an underground formation explored using waves, and summing contributions of the layers to the primaries and/or the internal multiples, without using adaptive subtraction. | 1. A method, comprising:
receiving data recorded by sensors while an underground formation is explored using waves; obtaining a layer model that specifies one or more impedance and/or velocity changes inside the underground formation, a layer of the model layer being defined between adjacent among the one or more impedance and/or velocity changes; extracting from the data, first and later arrivals of the waves emerging from each of the one or more impedance and/or velocity changes; and estimating at least one of primaries and internal multiples by solving a two-way wave equation for each layer of the model layer, using the first and the later arrivals, and summing portions of resulting solutions to obtain the primaries and/or to the internal multiples. 2. The method of claim 1, wherein the layer model is obtained from log data including measurements of wave velocity and/or of density inside the underground formation. 3. The method of claim 1, wherein the layer model is obtained by inversion. 4. The method of claim 1, wherein the layer model is a two-dimensional model. 5. The method of claim 1, wherein, a contribution, ΔP(ξ), to the primaries due to a layer from the depth ξ to a next depth ξ+Δξ is
ΔP(ξ)=ΔR(ξ)(1−H(t−(τ(xg,yg,zg,xm,ym,ξ)−T(ξ))))
where H is Heaviside function,
ΔR(ξ)=R(xs,ys,zs,xg,yg,zg,m(ξ))−R(xs,ys,zs,xg,yg,zg,m(ξ+Δξ)),
R(xs, ys, zs, xg, yg, zg, m (ξ)) and R(xs, ys, zs, xg, yg, zg, m (ξ+Δξ)) being full solutions of the two-way wave equation for the depth ξ and the next depth ξ+Δξ, respectively, with
m(ξ)=m(xm,ym,zm)(1−H(z−ξ))+H(z−ξ)m(xm,ym,ξ) and
m(ξ+Δξ)=m(xm,ym,zm)(1−H(z−H(z−ξ−Δξ))+H(z−ξ)m(xm,ym,ξ+Δξ),
for a wave source being located at xs, ys, zs, a sensor being located at xg, yg, zg, the layer model being m(xm, ym, zm), and m(xm, ym, ξ) and m(xm, ym, ξ+Δξ) representing the wave propagating with the constant velocity below depth ξ and ξ+Δξ, respectively, and τ(xg, yg, zg, xm, ym, ξ) being a two-way travel time from the sensor to the layer. 6. The method of claim 5, further comprising:
determining the two-way travel time analytically, or determining the two-way travel time using a ray tracing method. 7. The method of claim 5, wherein the primaries are calculated by adding contributions of layers above a detection depth ξmax:
P(xs,ys,zs,xg,yg,zg,m)=Σξ=ξmax ξ=0 ΔP(ξ)Δξ. 8. The method of claim 7, further comprising:
subtracting the calculated primaries from the data, without using adaptive subtraction; and generating an image of the underground formation using a result of the subtracting. 9. The method of claim 7, wherein the internal multiples, M, are calculated by subtracting the primaries, P, from a full solution of the two-way equation, R:
M(xs,ys,zs,xg,yg,zg,m)=R(xs,ys,zs,xg,yg,zg,m)−P(xs,ys,zs,xg,yg,zg,m). 10. The method of claim 9, further comprising:
subtracting the internal multiples from the data without using adaptive subtraction; and generating an image of the underground formation using a result of the subtracting. 11. The method of claim 5,
wherein a contribution, ΔM(ξ), to the internal multiples due to the layer from ξ to ξ+Δξ is ΔM(ξ)=ΔR(ξ)−ΔP(ξ), and the internal multiples, M, are calculated by adding contributions of all layers up to a detection depth ξmax:
M(xs,ys,zs,xg,yg,zg,m)=Σξ=ξmax ξ=0 ΔM(ξ)Δξ. 12. A data processing apparatus, the apparatus comprising:
an interface configured to receive log data and data recorded by sensors while an underground formation is explored using waves; and a data processing unit configured
to obtain a layer model from the log data, the layer model specifying one or more impedance changes inside the underground formation, a layer of the model layer being defined between adjacent among the one or more impedance and/or velocity changes;
to extract from the data, first and later arrivals of the waves emerging from each of the one or more impedance changes; and
to estimate at least one of primaries and internal multiples by solving a two-way wave equation using the first and later arrivals, for each layer of the model layer, and then summing portions of resulting solutions to obtain the primaries and/or to the internal multiples. 13. The apparatus of claim 12, wherein the log data includes measurements of wave velocity and of density inside the underground formation. 14. The apparatus of claim 12, wherein the data processing unit solves the two-way wave equation to obtain a contribution, ΔP(ξ), to the primaries due to a layer from the depth ξ to a next depth ξ+Δξ as
ΔP(ξ)=ΔR(ξ)(1−H(t−(τ(xg,yg,zg,xm,ym,ξ)−T(ξ))))
where H is Heaviside function,
ΔR(ξ)=R(xs,ys,zs,xg,yg,zg,m(ξ))−R(xs,ys,zs,xg,yg,zg,m(ξ+Δξ)),
R(xs, ys, zs, xg, yg, zg, m (ξ)) and R(xs, ys, zs, xg, yg, zg, m (ξ+Δξ)) being full solutions of the two-way wave equation for the depth ξ and the next depth ξ+Δξ, respectively, with
m(ξ)m(xm,ym,zm)(1−H(z−ξ))+H(z−ξ)m(xm,ym,ξ) and
m(ξ+Δξ)=m(xm,ym,zm)(1−H(z−ξ−Δξ)+H(z−ξ)m(xm,ym,ξ+Δξ),
for a wave source being located at xs, ys, zs, a sensor being located at xg, yg, zg, the layer model being m(xm, ym, zm), and m(xm, ym, ξ) and m(xm, ym, ξ+Δξ) representing the wave propagating with the constant velocity below depth and respectively, and τ(xg, yg, zg, xm, ym, ξ) being a two-way travel time from the sensor to the layer. 15. The apparatus of claim 14, wherein the data processing unit further configured to determine the two-way travel time analytically, or using a ray tracing method. 16. The apparatus of claim 14, wherein the data processing unit is further configured
to calculate the primaries P(xs, ys, zs, xg, yg, zg, m) by adding contributions of layers above a detection depth ξmax, to subtract the calculated primaries from the data, without using adaptive subtraction, and to generate an image of the underground formation using a result of the subtracting. 17. The apparatus of claim 14, wherein the data processing unit is further configured
to calculate the primaries P(xs, ys, zs, xg, yg, zg, m) by adding contributions of layers above a detection depth ξmax, and to calculate the internal multiples, M, by subtracting the primaries, P, from a full solution of the two-way equation, R:
M(xs,ys,zs,xg,yg,zg,m)=R(xs,ys,zs,xg,yg,zg,m)−P(xs,ys,zs,xg,yg,zg,m). 18. The apparatus of claim 14, wherein the data processing unit is further configured
to calculate a contribution, ΔM(ξ) to the internal multiples due to the layer from ξ to ξ+Δξ is ΔM(ξ)=ΔR(ξ)−ΔP(ξ) and the internal multiples, M, by adding contributions of all layers up to a detection depth ξmax:
M(xs,ys,zs,xg,yg,zg,m)=Σξ=ξmax ξ=0 ΔM(ξ)Δξ. 19. The apparatus of claim 18, wherein the data processing unit is further configured
to subtract the internal multiples from the data without using adaptive subtraction; and to generate an image of the underground formation using a result of the subtracting. 20. A non-transitory computer readable medium storing executable codes, which, when executed by a computer make the computer perform a method for processing data recorded by sensors while an underground formation is explored using waves, the method comprising:
obtaining a layer model from log data, the layer model specifying one or more impedance changes inside the underground formation; extracting from the data, first and later arrivals of the waves emerging from each of the one or more impedance changes; and estimating at least one of primaries and internal multiples by solving a two-way wave equation using the first and later arrivals for each layer between adjacent among the one or more impedance and/or velocity changes, and summing contributions of each layer to the primaries and/or the internal multiples. | Method and apparatus for seismic data processing estimate primaries and/or internal multiples by solving a two-way wave equation using first and later arrivals from each layer of an underground formation explored using waves, and summing contributions of the layers to the primaries and/or the internal multiples, without using adaptive subtraction.1. A method, comprising:
receiving data recorded by sensors while an underground formation is explored using waves; obtaining a layer model that specifies one or more impedance and/or velocity changes inside the underground formation, a layer of the model layer being defined between adjacent among the one or more impedance and/or velocity changes; extracting from the data, first and later arrivals of the waves emerging from each of the one or more impedance and/or velocity changes; and estimating at least one of primaries and internal multiples by solving a two-way wave equation for each layer of the model layer, using the first and the later arrivals, and summing portions of resulting solutions to obtain the primaries and/or to the internal multiples. 2. The method of claim 1, wherein the layer model is obtained from log data including measurements of wave velocity and/or of density inside the underground formation. 3. The method of claim 1, wherein the layer model is obtained by inversion. 4. The method of claim 1, wherein the layer model is a two-dimensional model. 5. The method of claim 1, wherein, a contribution, ΔP(ξ), to the primaries due to a layer from the depth ξ to a next depth ξ+Δξ is
ΔP(ξ)=ΔR(ξ)(1−H(t−(τ(xg,yg,zg,xm,ym,ξ)−T(ξ))))
where H is Heaviside function,
ΔR(ξ)=R(xs,ys,zs,xg,yg,zg,m(ξ))−R(xs,ys,zs,xg,yg,zg,m(ξ+Δξ)),
R(xs, ys, zs, xg, yg, zg, m (ξ)) and R(xs, ys, zs, xg, yg, zg, m (ξ+Δξ)) being full solutions of the two-way wave equation for the depth ξ and the next depth ξ+Δξ, respectively, with
m(ξ)=m(xm,ym,zm)(1−H(z−ξ))+H(z−ξ)m(xm,ym,ξ) and
m(ξ+Δξ)=m(xm,ym,zm)(1−H(z−H(z−ξ−Δξ))+H(z−ξ)m(xm,ym,ξ+Δξ),
for a wave source being located at xs, ys, zs, a sensor being located at xg, yg, zg, the layer model being m(xm, ym, zm), and m(xm, ym, ξ) and m(xm, ym, ξ+Δξ) representing the wave propagating with the constant velocity below depth ξ and ξ+Δξ, respectively, and τ(xg, yg, zg, xm, ym, ξ) being a two-way travel time from the sensor to the layer. 6. The method of claim 5, further comprising:
determining the two-way travel time analytically, or determining the two-way travel time using a ray tracing method. 7. The method of claim 5, wherein the primaries are calculated by adding contributions of layers above a detection depth ξmax:
P(xs,ys,zs,xg,yg,zg,m)=Σξ=ξmax ξ=0 ΔP(ξ)Δξ. 8. The method of claim 7, further comprising:
subtracting the calculated primaries from the data, without using adaptive subtraction; and generating an image of the underground formation using a result of the subtracting. 9. The method of claim 7, wherein the internal multiples, M, are calculated by subtracting the primaries, P, from a full solution of the two-way equation, R:
M(xs,ys,zs,xg,yg,zg,m)=R(xs,ys,zs,xg,yg,zg,m)−P(xs,ys,zs,xg,yg,zg,m). 10. The method of claim 9, further comprising:
subtracting the internal multiples from the data without using adaptive subtraction; and generating an image of the underground formation using a result of the subtracting. 11. The method of claim 5,
wherein a contribution, ΔM(ξ), to the internal multiples due to the layer from ξ to ξ+Δξ is ΔM(ξ)=ΔR(ξ)−ΔP(ξ), and the internal multiples, M, are calculated by adding contributions of all layers up to a detection depth ξmax:
M(xs,ys,zs,xg,yg,zg,m)=Σξ=ξmax ξ=0 ΔM(ξ)Δξ. 12. A data processing apparatus, the apparatus comprising:
an interface configured to receive log data and data recorded by sensors while an underground formation is explored using waves; and a data processing unit configured
to obtain a layer model from the log data, the layer model specifying one or more impedance changes inside the underground formation, a layer of the model layer being defined between adjacent among the one or more impedance and/or velocity changes;
to extract from the data, first and later arrivals of the waves emerging from each of the one or more impedance changes; and
to estimate at least one of primaries and internal multiples by solving a two-way wave equation using the first and later arrivals, for each layer of the model layer, and then summing portions of resulting solutions to obtain the primaries and/or to the internal multiples. 13. The apparatus of claim 12, wherein the log data includes measurements of wave velocity and of density inside the underground formation. 14. The apparatus of claim 12, wherein the data processing unit solves the two-way wave equation to obtain a contribution, ΔP(ξ), to the primaries due to a layer from the depth ξ to a next depth ξ+Δξ as
ΔP(ξ)=ΔR(ξ)(1−H(t−(τ(xg,yg,zg,xm,ym,ξ)−T(ξ))))
where H is Heaviside function,
ΔR(ξ)=R(xs,ys,zs,xg,yg,zg,m(ξ))−R(xs,ys,zs,xg,yg,zg,m(ξ+Δξ)),
R(xs, ys, zs, xg, yg, zg, m (ξ)) and R(xs, ys, zs, xg, yg, zg, m (ξ+Δξ)) being full solutions of the two-way wave equation for the depth ξ and the next depth ξ+Δξ, respectively, with
m(ξ)m(xm,ym,zm)(1−H(z−ξ))+H(z−ξ)m(xm,ym,ξ) and
m(ξ+Δξ)=m(xm,ym,zm)(1−H(z−ξ−Δξ)+H(z−ξ)m(xm,ym,ξ+Δξ),
for a wave source being located at xs, ys, zs, a sensor being located at xg, yg, zg, the layer model being m(xm, ym, zm), and m(xm, ym, ξ) and m(xm, ym, ξ+Δξ) representing the wave propagating with the constant velocity below depth and respectively, and τ(xg, yg, zg, xm, ym, ξ) being a two-way travel time from the sensor to the layer. 15. The apparatus of claim 14, wherein the data processing unit further configured to determine the two-way travel time analytically, or using a ray tracing method. 16. The apparatus of claim 14, wherein the data processing unit is further configured
to calculate the primaries P(xs, ys, zs, xg, yg, zg, m) by adding contributions of layers above a detection depth ξmax, to subtract the calculated primaries from the data, without using adaptive subtraction, and to generate an image of the underground formation using a result of the subtracting. 17. The apparatus of claim 14, wherein the data processing unit is further configured
to calculate the primaries P(xs, ys, zs, xg, yg, zg, m) by adding contributions of layers above a detection depth ξmax, and to calculate the internal multiples, M, by subtracting the primaries, P, from a full solution of the two-way equation, R:
M(xs,ys,zs,xg,yg,zg,m)=R(xs,ys,zs,xg,yg,zg,m)−P(xs,ys,zs,xg,yg,zg,m). 18. The apparatus of claim 14, wherein the data processing unit is further configured
to calculate a contribution, ΔM(ξ) to the internal multiples due to the layer from ξ to ξ+Δξ is ΔM(ξ)=ΔR(ξ)−ΔP(ξ) and the internal multiples, M, by adding contributions of all layers up to a detection depth ξmax:
M(xs,ys,zs,xg,yg,zg,m)=Σξ=ξmax ξ=0 ΔM(ξ)Δξ. 19. The apparatus of claim 18, wherein the data processing unit is further configured
to subtract the internal multiples from the data without using adaptive subtraction; and to generate an image of the underground formation using a result of the subtracting. 20. A non-transitory computer readable medium storing executable codes, which, when executed by a computer make the computer perform a method for processing data recorded by sensors while an underground formation is explored using waves, the method comprising:
obtaining a layer model from log data, the layer model specifying one or more impedance changes inside the underground formation; extracting from the data, first and later arrivals of the waves emerging from each of the one or more impedance changes; and estimating at least one of primaries and internal multiples by solving a two-way wave equation using the first and later arrivals for each layer between adjacent among the one or more impedance and/or velocity changes, and summing contributions of each layer to the primaries and/or the internal multiples. | 2,100 |
5,739 | 5,739 | 15,966,024 | 2,139 | Staging data on a storage element integrating fast durable storage and bulk durable storage, including: receiving, at a storage element integrating fast durable storage and bulk durable storage, a data storage operation from a host computer; storing data corresponding to the data storage operation within fast durable storage in accordance with a first data resiliency technique; and responsive to detecting a condition for transferring data between fast durable storage and bulk durable storage, transferring the data from fast durable storage to bulk durable storage in accordance with a second data resiliency technique. | 1. A method of staging data, the method comprising:
receiving, at a storage element integrating fast durable storage and bulk durable storage, a data storage operation from a host computer; storing data corresponding to the data storage operation within fast durable storage in accordance with a first data resiliency technique; and responsive to detecting a condition for transferring data between fast durable storage and bulk durable storage, transferring the data from fast durable storage to bulk durable storage in accordance with a second data resiliency technique. 2. The method of claim 1, wherein the data storage operation is a write operation, wherein performing the write operation comprises storing data in fast bulk storage in a RAID N+2 format data stripe, and wherein the RAID N+2 format data stripe is stored in bulk durable storage in a RAID M+2 format data stripe. 3. The method of claim 2, wherein RAID parity calculations are a merger of parity calculations for multiple partial erasure coded parity calculations within a Galois field for partially filled data stripe updates. 4. The method of claim 1, further comprising:
determining a data storage optimization that is applicable to one or more portions of stored data within the fast durable storage; and modifying the one or more portions of stored data within the fast durable storage to generate modified data. 5. The method of claim 4, further comprising:
storing, after modifying the one or more portions of data, the modified data within the fast durable storage. 6. The method of claim 4, further comprising:
storing, after modifying the one or more portions of data, the modified data within the bulk durable storage. 7. The method of claim 4, wherein the data storage optimization is one or more of: data compression, data deduplication, or garbage collection. 8. The method of claim 1, further comprising:
determining, based on received write operations and corresponding data payload sizes over a window of time, a data storage consumption rate; and dynamically transferring, from the fast durable storage to the bulk durable storage and in dependence upon the data storage consumption rate and storage availability of the fast durable storage, one or more portions of stored data at a transfer rate that avoids stalling subsequently received data storage operations. 9. An apparatus for staging data, the apparatus comprising a computer processor, a computer memory operatively coupled to the computer processor, the computer memory having disposed within it computer program instructions that, when executed by the computer processor, cause the apparatus to carry out the steps of:
receiving, at a storage element integrating fast durable storage and bulk durable storage, a data storage operation from a host computer; storing data corresponding to the data storage operation within fast durable storage in accordance with a first data resiliency technique; and responsive to detecting a condition for transferring data between fast durable storage and bulk durable storage, transferring the data from fast durable storage to bulk durable storage in accordance with a second data resiliency technique. 10. The apparatus of claim 9, wherein the fast durable storage comprises nonvolatile random access memory. 11. The apparatus of claim 9, wherein the bulk durable storage comprises one or more solid state drives. 12. The apparatus of claim 9, wherein the storage element further comprises volatile random access memory, and wherein the one or more controllers are further configured to, in response to a loss of power to the storage element and in dependence upon energy provided by the stored energy device, transfer data from the volatile random access memory into one or more of the fast durable storage or the bulk durable storage. 13. The apparatus of claim 9, wherein the computer program instructions that, when executed by the computer processor, cause the apparatus to carry out the steps of:
determining a data storage optimization that is applicable to one or more portions of stored data within the fast durable storage; and modifying the one or more portions of stored data within the fast durable storage to generate modified data. 14. The apparatus of claim 13, wherein the computer program instructions that, when executed by the computer processor, cause the apparatus to carry out the steps of:
storing, after modifying the one or more portions of data, the modified data within the fast durable storage. 15. The apparatus of claim 13, wherein the computer program instructions that, when executed by the computer processor, cause the apparatus to carry out the steps of:
storing, after modifying the one or more portions of data, the modified data within the bulk durable storage. 16. A computer program product for staging data, the computer program product disposed upon a computer readable medium, the computer program product comprising computer program instructions that, when executed, cause a computer to carry out the steps of:
receiving, at a storage element integrating fast durable storage and bulk durable storage, a data storage operation from a host computer; storing data corresponding to the data storage operation within fast durable storage in accordance with a first data resiliency technique; and responsive to detecting a condition for transferring data between fast durable storage and bulk durable storage, transferring the data from fast durable storage to bulk durable storage in accordance with a second data resiliency technique. 17. The computer program product of claim 16, wherein the data storage operation is a write operation, wherein performing the write operation comprises storing data in fast bulk storage in a RAID N+2 format data stripe, and wherein the RAID N+2 format data stripe is stored in bulk durable storage in a RAID M+2 format data stripe. 18. The computer program product of claim 16, wherein the computer program instructions, when executed, further cause the computer to carry out the steps of:
determining a data storage optimization that is applicable to one or more portions of stored data within the fast durable storage; and modifying the one or more portions of stored data within the fast durable storage to generate modified data. 19. The computer program product of claim 16, wherein the computer program instructions, when executed, further cause the computer to carry out the steps of:
storing, after modifying the one or more portions of data, the modified data within the fast durable storage. 20. The computer program product of claim 16, wherein the computer program instructions, when executed, further cause the computer to carry out the steps of:
storing, after modifying the one or more portions of data, the modified data within the bulk durable storage. | Staging data on a storage element integrating fast durable storage and bulk durable storage, including: receiving, at a storage element integrating fast durable storage and bulk durable storage, a data storage operation from a host computer; storing data corresponding to the data storage operation within fast durable storage in accordance with a first data resiliency technique; and responsive to detecting a condition for transferring data between fast durable storage and bulk durable storage, transferring the data from fast durable storage to bulk durable storage in accordance with a second data resiliency technique.1. A method of staging data, the method comprising:
receiving, at a storage element integrating fast durable storage and bulk durable storage, a data storage operation from a host computer; storing data corresponding to the data storage operation within fast durable storage in accordance with a first data resiliency technique; and responsive to detecting a condition for transferring data between fast durable storage and bulk durable storage, transferring the data from fast durable storage to bulk durable storage in accordance with a second data resiliency technique. 2. The method of claim 1, wherein the data storage operation is a write operation, wherein performing the write operation comprises storing data in fast bulk storage in a RAID N+2 format data stripe, and wherein the RAID N+2 format data stripe is stored in bulk durable storage in a RAID M+2 format data stripe. 3. The method of claim 2, wherein RAID parity calculations are a merger of parity calculations for multiple partial erasure coded parity calculations within a Galois field for partially filled data stripe updates. 4. The method of claim 1, further comprising:
determining a data storage optimization that is applicable to one or more portions of stored data within the fast durable storage; and modifying the one or more portions of stored data within the fast durable storage to generate modified data. 5. The method of claim 4, further comprising:
storing, after modifying the one or more portions of data, the modified data within the fast durable storage. 6. The method of claim 4, further comprising:
storing, after modifying the one or more portions of data, the modified data within the bulk durable storage. 7. The method of claim 4, wherein the data storage optimization is one or more of: data compression, data deduplication, or garbage collection. 8. The method of claim 1, further comprising:
determining, based on received write operations and corresponding data payload sizes over a window of time, a data storage consumption rate; and dynamically transferring, from the fast durable storage to the bulk durable storage and in dependence upon the data storage consumption rate and storage availability of the fast durable storage, one or more portions of stored data at a transfer rate that avoids stalling subsequently received data storage operations. 9. An apparatus for staging data, the apparatus comprising a computer processor, a computer memory operatively coupled to the computer processor, the computer memory having disposed within it computer program instructions that, when executed by the computer processor, cause the apparatus to carry out the steps of:
receiving, at a storage element integrating fast durable storage and bulk durable storage, a data storage operation from a host computer; storing data corresponding to the data storage operation within fast durable storage in accordance with a first data resiliency technique; and responsive to detecting a condition for transferring data between fast durable storage and bulk durable storage, transferring the data from fast durable storage to bulk durable storage in accordance with a second data resiliency technique. 10. The apparatus of claim 9, wherein the fast durable storage comprises nonvolatile random access memory. 11. The apparatus of claim 9, wherein the bulk durable storage comprises one or more solid state drives. 12. The apparatus of claim 9, wherein the storage element further comprises volatile random access memory, and wherein the one or more controllers are further configured to, in response to a loss of power to the storage element and in dependence upon energy provided by the stored energy device, transfer data from the volatile random access memory into one or more of the fast durable storage or the bulk durable storage. 13. The apparatus of claim 9, wherein the computer program instructions that, when executed by the computer processor, cause the apparatus to carry out the steps of:
determining a data storage optimization that is applicable to one or more portions of stored data within the fast durable storage; and modifying the one or more portions of stored data within the fast durable storage to generate modified data. 14. The apparatus of claim 13, wherein the computer program instructions that, when executed by the computer processor, cause the apparatus to carry out the steps of:
storing, after modifying the one or more portions of data, the modified data within the fast durable storage. 15. The apparatus of claim 13, wherein the computer program instructions that, when executed by the computer processor, cause the apparatus to carry out the steps of:
storing, after modifying the one or more portions of data, the modified data within the bulk durable storage. 16. A computer program product for staging data, the computer program product disposed upon a computer readable medium, the computer program product comprising computer program instructions that, when executed, cause a computer to carry out the steps of:
receiving, at a storage element integrating fast durable storage and bulk durable storage, a data storage operation from a host computer; storing data corresponding to the data storage operation within fast durable storage in accordance with a first data resiliency technique; and responsive to detecting a condition for transferring data between fast durable storage and bulk durable storage, transferring the data from fast durable storage to bulk durable storage in accordance with a second data resiliency technique. 17. The computer program product of claim 16, wherein the data storage operation is a write operation, wherein performing the write operation comprises storing data in fast bulk storage in a RAID N+2 format data stripe, and wherein the RAID N+2 format data stripe is stored in bulk durable storage in a RAID M+2 format data stripe. 18. The computer program product of claim 16, wherein the computer program instructions, when executed, further cause the computer to carry out the steps of:
determining a data storage optimization that is applicable to one or more portions of stored data within the fast durable storage; and modifying the one or more portions of stored data within the fast durable storage to generate modified data. 19. The computer program product of claim 16, wherein the computer program instructions, when executed, further cause the computer to carry out the steps of:
storing, after modifying the one or more portions of data, the modified data within the fast durable storage. 20. The computer program product of claim 16, wherein the computer program instructions, when executed, further cause the computer to carry out the steps of:
storing, after modifying the one or more portions of data, the modified data within the bulk durable storage. | 2,100 |
5,740 | 5,740 | 15,541,297 | 2,175 | As triggered by a user gesture, application interface elements that belong to applications of a same type are made movable. The movable application interface elements are automatically gathered into a same folder on a user interface. This helps a user gather application interface elements on a graphic user interface by performing a few operations, reduces manual operations of the user, saves electric power, and enhances user experience. | 1. A portable electronic device, comprising:
a display, wherein the display comprises a touch-sensitive surface and a screen; one or more processors; a memory; multiple applications; and one or more programs, wherein the one or more programs are stored in the memory and are configured to be executed by the one or more processors, wherein the one or more programs comprise an instruction, and the instruction is used to: display a first application interface element in a first area of the screen, wherein the first application interface element corresponds to a first application; display a second application interface element in a second area of the screen, wherein the second application interface element corresponds to a second application, the second application is different from the first application, and the second application and the first application are applications of a same type; detect a first gesture in a third area of the touch-sensitive surface; respond to the first gesture so that the first application interface element and the second application interface element are movable; detect a second gesture in a fourth area of the touch-sensitive surface; and respond to the second gesture to trigger the following events: displaying a first folder in a fifth area of the screen; and automatically moving the first application interface element and the second application interface element to a fifth area corresponding to the first folder, so that the first application interface element and the second application interface element are associated with the first folder. 2. The portable electronic device according to claim 1, wherein the instruction is further used to:
display a third application interface element in a sixth area of the screen, wherein the third application interface element corresponds to a third application, and the third application interface element does not respond to the first gesture; detect a third gesture in a seventh area of the touch-sensitive surface; and respond to the third gesture so that the third application interface element is movable, wherein the responding to the second gesture further triggers the following event: automatically moving the third application interface element to a fifth area corresponding to the first folder, so that the third application interface element is associated with the first folder. 3. The portable electronic device according to claim 1, wherein the instruction is further used to:
display a fourth application interface element in an eighth area of the screen, wherein the fourth application interface element corresponds to a fourth application, the fourth application is different from the first application, the fourth application and the first application are applications of a same type, and the responding to the first gesture further causes the fourth application interface element to be movable; and detect a fourth gesture in a ninth area of the touch-sensitive surface, and respond to the fourth gesture so that the fourth application interface element is unmovable, wherein the fourth application interface element does not respond to the second gesture. 4. The portable electronic device according to claim 1, wherein the instruction is further used to:
display a fifth application interface element in a tenth area of the screen, wherein the fifth application interface element corresponds to a fifth application, the fifth application and the first application are applications of different types, and the fifth application interface element does not respond to the first gesture. 5. The portable electronic device according to claim 1, wherein that the first application interface element and the second application interface element are associated with the first folder comprises: under a node corresponding to the first folder, adding a node corresponding to the first application interface element and a node corresponding to the second application interface element, so that a display effect of the first application interface element on the screen is that the first application interface element is in the first folder, and a display effect of the second application interface element on the screen is that the second application interface element is in the first folder. 6. The portable electronic device according to claim 1, wherein the third area comprises one of the following: the first area, the second area, a blank area that displays no application interface element on the screen, or an interface element that is displayed on the screen and used to trigger movement of an application interface element. 7. The portable electronic device according to claim 1, wherein that the first application interface element is movable comprises one of the following: the first application interface element being shaking, the first application interface element being activated, the first application interface element being in an editable state, or the first application interface element being movable to an application interface element tray. 8. The portable electronic device according to claim 1, wherein that the second application interface element is movable comprises one of: the second application interface element being shaking, the second application interface element being activated, the second application interface element being in an editable state, or the second application interface element being movable to an application interface element tray. 9. The portable electronic device according to claim 1, wherein the fourth area comprises one of the following: the first area, the second area, the third area, a blank area that displays no application interface element on the screen, or an interface element that is displayed on the screen and used to trigger movement of an application interface element. 10. The portable electronic device according to claim 1, wherein the fifth area is determined according to one of or any combination of: the first area, the second area, the third area, or the fourth area. 11. A method, applied to a portable electronic device that comprises a display and multiple applications, wherein the display comprises a touch-sensitive surface and a screen, and the method comprises:
displaying a first application interface element in a first area of the screen, wherein the first application interface element corresponds to a first application; displaying a second application interface element in a second area of the screen, wherein the second application interface element corresponds to a second application, the second application is different from the first application, and the second application and the first application are applications of a same type; detecting a first gesture in a third area of the touch-sensitive surface; responding to the first gesture so that the first application interface element and the second application interface element are movable; detecting a second gesture in a fourth area of the touch-sensitive surface; and responding to the second gesture to trigger the following events: displaying a first folder in a fifth area of the screen; and automatically moving the first application interface element and the second application interface element to a fifth area corresponding to the first folder, so that the first application interface element and the second application interface element are associated with the first folder. 12. The method according to claim 11, further comprising:
displaying a third application interface element in a sixth area of the screen, wherein the third application interface element corresponds to a third application, and the third application interface element does not respond to the first gesture; detecting a third gesture in a seventh area of the touch-sensitive surface; and responding to the third gesture so that the third application interface element is movable, wherein the responding to the second gesture further triggers the following event: automatically moving the third application interface element to a fifth area corresponding to the first folder, so that the third application interface element is associated with the first folder. 13. The method according to claim 11, further comprising:
displaying a fourth application interface element in an eighth area of the screen, wherein the fourth application interface element corresponds to a fourth application, the fourth application is different from the first application, the fourth application and the first application are applications of a same type, and the responding to the first gesture further causes the fourth application interface element to be movable; and detecting a fourth gesture in a ninth area of the touch-sensitive surface, and responding to the fourth gesture so that the fourth application interface element is unmovable, wherein the fourth application interface element does not respond to the second gesture. 14. The method according to claim 11, further comprising:
displaying a fifth application interface element in a tenth area of the screen, wherein the fifth application interface element corresponds to a fifth application, the fifth application and the first application are applications of different types, and the fifth application interface element does not respond to the first gesture. 15. The method according to claim 1, wherein that the first application interface element and the second application interface element are associated with the first folder comprises: under a node corresponding to the first folder, adding a node corresponding to the first application interface element and a node corresponding to the second application interface element, so that a display effect of the first application interface element on the screen is that the first application interface element is in the first folder, and a display effect of the second application interface element on the screen is that the second application interface element is in the first folder. 16. The method according to claim 1, wherein the third area comprises one of the following: the first area, the second area, a blank area that displays no application interface element on the screen, or an interface element that is displayed on the screen and used to trigger movement of an application interface element. 17. The method according to claim 1, wherein that the first application interface element is movable comprises one of the following: the first application interface element being shaking, the first application interface element being activated, the first application interface element being in an editable state, or the first application interface element being movable to an application interface element tray. 18. The method according to claim 1, wherein that the second application interface element is movable comprises one of: the second application interface element being shaking, the second application interface element being activated, the second application interface element being in an editable state, or the second application interface element being movable to an application interface element tray. 19. The method according to claim 1, wherein the fourth area comprises one of the following: the first area, the second area, the third area, a blank area that displays no application interface element on the screen, or an interface element that is displayed on the screen and used to trigger movement of an application interface element. 20. The method according to claim 1, wherein the fifth area is determined according to one of or any combination of: the first area, the second area, the third area, or the fourth area. 21.-174. (canceled) | As triggered by a user gesture, application interface elements that belong to applications of a same type are made movable. The movable application interface elements are automatically gathered into a same folder on a user interface. This helps a user gather application interface elements on a graphic user interface by performing a few operations, reduces manual operations of the user, saves electric power, and enhances user experience.1. A portable electronic device, comprising:
a display, wherein the display comprises a touch-sensitive surface and a screen; one or more processors; a memory; multiple applications; and one or more programs, wherein the one or more programs are stored in the memory and are configured to be executed by the one or more processors, wherein the one or more programs comprise an instruction, and the instruction is used to: display a first application interface element in a first area of the screen, wherein the first application interface element corresponds to a first application; display a second application interface element in a second area of the screen, wherein the second application interface element corresponds to a second application, the second application is different from the first application, and the second application and the first application are applications of a same type; detect a first gesture in a third area of the touch-sensitive surface; respond to the first gesture so that the first application interface element and the second application interface element are movable; detect a second gesture in a fourth area of the touch-sensitive surface; and respond to the second gesture to trigger the following events: displaying a first folder in a fifth area of the screen; and automatically moving the first application interface element and the second application interface element to a fifth area corresponding to the first folder, so that the first application interface element and the second application interface element are associated with the first folder. 2. The portable electronic device according to claim 1, wherein the instruction is further used to:
display a third application interface element in a sixth area of the screen, wherein the third application interface element corresponds to a third application, and the third application interface element does not respond to the first gesture; detect a third gesture in a seventh area of the touch-sensitive surface; and respond to the third gesture so that the third application interface element is movable, wherein the responding to the second gesture further triggers the following event: automatically moving the third application interface element to a fifth area corresponding to the first folder, so that the third application interface element is associated with the first folder. 3. The portable electronic device according to claim 1, wherein the instruction is further used to:
display a fourth application interface element in an eighth area of the screen, wherein the fourth application interface element corresponds to a fourth application, the fourth application is different from the first application, the fourth application and the first application are applications of a same type, and the responding to the first gesture further causes the fourth application interface element to be movable; and detect a fourth gesture in a ninth area of the touch-sensitive surface, and respond to the fourth gesture so that the fourth application interface element is unmovable, wherein the fourth application interface element does not respond to the second gesture. 4. The portable electronic device according to claim 1, wherein the instruction is further used to:
display a fifth application interface element in a tenth area of the screen, wherein the fifth application interface element corresponds to a fifth application, the fifth application and the first application are applications of different types, and the fifth application interface element does not respond to the first gesture. 5. The portable electronic device according to claim 1, wherein that the first application interface element and the second application interface element are associated with the first folder comprises: under a node corresponding to the first folder, adding a node corresponding to the first application interface element and a node corresponding to the second application interface element, so that a display effect of the first application interface element on the screen is that the first application interface element is in the first folder, and a display effect of the second application interface element on the screen is that the second application interface element is in the first folder. 6. The portable electronic device according to claim 1, wherein the third area comprises one of the following: the first area, the second area, a blank area that displays no application interface element on the screen, or an interface element that is displayed on the screen and used to trigger movement of an application interface element. 7. The portable electronic device according to claim 1, wherein that the first application interface element is movable comprises one of the following: the first application interface element being shaking, the first application interface element being activated, the first application interface element being in an editable state, or the first application interface element being movable to an application interface element tray. 8. The portable electronic device according to claim 1, wherein that the second application interface element is movable comprises one of: the second application interface element being shaking, the second application interface element being activated, the second application interface element being in an editable state, or the second application interface element being movable to an application interface element tray. 9. The portable electronic device according to claim 1, wherein the fourth area comprises one of the following: the first area, the second area, the third area, a blank area that displays no application interface element on the screen, or an interface element that is displayed on the screen and used to trigger movement of an application interface element. 10. The portable electronic device according to claim 1, wherein the fifth area is determined according to one of or any combination of: the first area, the second area, the third area, or the fourth area. 11. A method, applied to a portable electronic device that comprises a display and multiple applications, wherein the display comprises a touch-sensitive surface and a screen, and the method comprises:
displaying a first application interface element in a first area of the screen, wherein the first application interface element corresponds to a first application; displaying a second application interface element in a second area of the screen, wherein the second application interface element corresponds to a second application, the second application is different from the first application, and the second application and the first application are applications of a same type; detecting a first gesture in a third area of the touch-sensitive surface; responding to the first gesture so that the first application interface element and the second application interface element are movable; detecting a second gesture in a fourth area of the touch-sensitive surface; and responding to the second gesture to trigger the following events: displaying a first folder in a fifth area of the screen; and automatically moving the first application interface element and the second application interface element to a fifth area corresponding to the first folder, so that the first application interface element and the second application interface element are associated with the first folder. 12. The method according to claim 11, further comprising:
displaying a third application interface element in a sixth area of the screen, wherein the third application interface element corresponds to a third application, and the third application interface element does not respond to the first gesture; detecting a third gesture in a seventh area of the touch-sensitive surface; and responding to the third gesture so that the third application interface element is movable, wherein the responding to the second gesture further triggers the following event: automatically moving the third application interface element to a fifth area corresponding to the first folder, so that the third application interface element is associated with the first folder. 13. The method according to claim 11, further comprising:
displaying a fourth application interface element in an eighth area of the screen, wherein the fourth application interface element corresponds to a fourth application, the fourth application is different from the first application, the fourth application and the first application are applications of a same type, and the responding to the first gesture further causes the fourth application interface element to be movable; and detecting a fourth gesture in a ninth area of the touch-sensitive surface, and responding to the fourth gesture so that the fourth application interface element is unmovable, wherein the fourth application interface element does not respond to the second gesture. 14. The method according to claim 11, further comprising:
displaying a fifth application interface element in a tenth area of the screen, wherein the fifth application interface element corresponds to a fifth application, the fifth application and the first application are applications of different types, and the fifth application interface element does not respond to the first gesture. 15. The method according to claim 1, wherein that the first application interface element and the second application interface element are associated with the first folder comprises: under a node corresponding to the first folder, adding a node corresponding to the first application interface element and a node corresponding to the second application interface element, so that a display effect of the first application interface element on the screen is that the first application interface element is in the first folder, and a display effect of the second application interface element on the screen is that the second application interface element is in the first folder. 16. The method according to claim 1, wherein the third area comprises one of the following: the first area, the second area, a blank area that displays no application interface element on the screen, or an interface element that is displayed on the screen and used to trigger movement of an application interface element. 17. The method according to claim 1, wherein that the first application interface element is movable comprises one of the following: the first application interface element being shaking, the first application interface element being activated, the first application interface element being in an editable state, or the first application interface element being movable to an application interface element tray. 18. The method according to claim 1, wherein that the second application interface element is movable comprises one of: the second application interface element being shaking, the second application interface element being activated, the second application interface element being in an editable state, or the second application interface element being movable to an application interface element tray. 19. The method according to claim 1, wherein the fourth area comprises one of the following: the first area, the second area, the third area, a blank area that displays no application interface element on the screen, or an interface element that is displayed on the screen and used to trigger movement of an application interface element. 20. The method according to claim 1, wherein the fifth area is determined according to one of or any combination of: the first area, the second area, the third area, or the fourth area. 21.-174. (canceled) | 2,100 |
5,741 | 5,741 | 13,593,462 | 2,176 | A web page including one or more web applications is generated using third-party scripts, in a manner that protects private content that may be included in the web page. According to this technique, third-party scripts that are to be executed within a browser environment are instead executed by a web server that is generating the web page, so that the web server can protect against any programmatic attempts to improperly access private content included in the web page. | 1. A method of generating a web page that includes one or more web applications, comprising the steps of:
receiving a request to generate the web page; generating hypertext markup language (HTML) code for the web page, wherein the HTML code for the web page includes a different shell area for each of the web applications; generating, for each of the web applications, HTML code for the web application by executing a browser-side script associated with the web application via a server-side script engine; inserting the HTML code for the one or more web applications into respective shell areas included in the web page; and transmitting the web page in response to the request. 2. The method of claim 1, further comprising the steps of:
receiving a request from the user to update a view of one of the web applications; generating updated HTML code for the web application by re-executing the browser-side script based on the request via a server-side script engine; and transmitting the updated HTML code in response to the request. 3. The method of claim 2, wherein HTML code for other portions of the web page are not transmitted with the updated HTML code. 4. The method of claim 1, wherein the browser-side script associated with each of the web applications is stored in a database that is not accessible to the web browser application but is accessible to the server-side script engine. 5. The method of claim 1, wherein the request is received from a web browser application and the web page is transmitted to the web browser application. 6. The method of claim 1, wherein the browser-side script is JavaScript (JS) code and the server-side script engine is a server-side JS engine. 7. The method of claim 1, wherein at least one of the web applications is developed from an untrusted source. 8. A non-transitory computer readable storage medium comprising instructions for causing a computer system for carrying out a method of generating a web page that includes one or more web applications, said method comprising the steps of:
receiving a request to generate the web page; generating hypertext markup language (HTML) code for the web page, wherein the HTML code for the web page includes a different shell area for each of the web applications; generating, for each of the web applications, HTML code for the web application by executing a browser-side script associated with the web application via a server-side script engine; inserting the HTML code for the one or more web applications into respective shell areas included in the web page; and transmitting the web page in response to the request. 9. The non-transitory computer readable storage medium of claim 8, wherein the method further comprises the steps of:
receiving a request from the user to update a view of one of the web applications; generating updated HTML code for the web application by re-executing the browser-side script based on the request via a server-side script engine; and transmitting the updated HTML code in response to the request. 10. The non-transitory computer readable storage medium of claim 9, wherein HTML code for other portions of the web page are not transmitted with the updated HTML code. 11. The non-transitory computer readable storage medium of claim 8, wherein the browser-side script associated with each of the web applications is stored in a database that is not accessible to the web browser application but is accessible to the server-side script engine. 12. The non-transitory computer readable storage medium of claim 8, wherein the request is received from a web browser application and the web page is transmitted to the web browser application. 13. The non-transitory computer readable storage medium of claim 8, wherein the browser-side script is JavaScript (JS) code and the server-side script engine is a server-side JS engine. 14. The non-transitory computer readable storage medium of claim 8, wherein at least one of the web applications is developed by an untrusted source. 15. A computer system for an online network of users, comprising:
a database of users including private content of the users; and a web server for generating a web page that includes private content of a user and a web application from an untrusted source, the web server having a server-side script engine for executing a browser-side script associated with the web application and generating HTML code for the web application with the server-side script engine. 16. The computer system of claim 15, wherein the web server is configured to generate HTML code for a web page that includes a shell area for the web application and insert the HTML code for the web application into the shell area. 17. The computer system of claim 16, wherein web page including the web application is transmitted to a web browser application. 18. The computer system of claim 17, wherein the web server is configured to re-execute the browser-side script to generate an updated HTML code for the web application, and transmit the updated HTML code to the web browser application. 19. The computer system of claim 18, wherein HTML code for other portions of the web page are not transmitted with the updated HTML code. 20. The computer system of claim 15, wherein the browser-side script is JavaScript (JS) code and the server-side script engine is a server-side JS engine. | A web page including one or more web applications is generated using third-party scripts, in a manner that protects private content that may be included in the web page. According to this technique, third-party scripts that are to be executed within a browser environment are instead executed by a web server that is generating the web page, so that the web server can protect against any programmatic attempts to improperly access private content included in the web page.1. A method of generating a web page that includes one or more web applications, comprising the steps of:
receiving a request to generate the web page; generating hypertext markup language (HTML) code for the web page, wherein the HTML code for the web page includes a different shell area for each of the web applications; generating, for each of the web applications, HTML code for the web application by executing a browser-side script associated with the web application via a server-side script engine; inserting the HTML code for the one or more web applications into respective shell areas included in the web page; and transmitting the web page in response to the request. 2. The method of claim 1, further comprising the steps of:
receiving a request from the user to update a view of one of the web applications; generating updated HTML code for the web application by re-executing the browser-side script based on the request via a server-side script engine; and transmitting the updated HTML code in response to the request. 3. The method of claim 2, wherein HTML code for other portions of the web page are not transmitted with the updated HTML code. 4. The method of claim 1, wherein the browser-side script associated with each of the web applications is stored in a database that is not accessible to the web browser application but is accessible to the server-side script engine. 5. The method of claim 1, wherein the request is received from a web browser application and the web page is transmitted to the web browser application. 6. The method of claim 1, wherein the browser-side script is JavaScript (JS) code and the server-side script engine is a server-side JS engine. 7. The method of claim 1, wherein at least one of the web applications is developed from an untrusted source. 8. A non-transitory computer readable storage medium comprising instructions for causing a computer system for carrying out a method of generating a web page that includes one or more web applications, said method comprising the steps of:
receiving a request to generate the web page; generating hypertext markup language (HTML) code for the web page, wherein the HTML code for the web page includes a different shell area for each of the web applications; generating, for each of the web applications, HTML code for the web application by executing a browser-side script associated with the web application via a server-side script engine; inserting the HTML code for the one or more web applications into respective shell areas included in the web page; and transmitting the web page in response to the request. 9. The non-transitory computer readable storage medium of claim 8, wherein the method further comprises the steps of:
receiving a request from the user to update a view of one of the web applications; generating updated HTML code for the web application by re-executing the browser-side script based on the request via a server-side script engine; and transmitting the updated HTML code in response to the request. 10. The non-transitory computer readable storage medium of claim 9, wherein HTML code for other portions of the web page are not transmitted with the updated HTML code. 11. The non-transitory computer readable storage medium of claim 8, wherein the browser-side script associated with each of the web applications is stored in a database that is not accessible to the web browser application but is accessible to the server-side script engine. 12. The non-transitory computer readable storage medium of claim 8, wherein the request is received from a web browser application and the web page is transmitted to the web browser application. 13. The non-transitory computer readable storage medium of claim 8, wherein the browser-side script is JavaScript (JS) code and the server-side script engine is a server-side JS engine. 14. The non-transitory computer readable storage medium of claim 8, wherein at least one of the web applications is developed by an untrusted source. 15. A computer system for an online network of users, comprising:
a database of users including private content of the users; and a web server for generating a web page that includes private content of a user and a web application from an untrusted source, the web server having a server-side script engine for executing a browser-side script associated with the web application and generating HTML code for the web application with the server-side script engine. 16. The computer system of claim 15, wherein the web server is configured to generate HTML code for a web page that includes a shell area for the web application and insert the HTML code for the web application into the shell area. 17. The computer system of claim 16, wherein web page including the web application is transmitted to a web browser application. 18. The computer system of claim 17, wherein the web server is configured to re-execute the browser-side script to generate an updated HTML code for the web application, and transmit the updated HTML code to the web browser application. 19. The computer system of claim 18, wherein HTML code for other portions of the web page are not transmitted with the updated HTML code. 20. The computer system of claim 15, wherein the browser-side script is JavaScript (JS) code and the server-side script engine is a server-side JS engine. | 2,100 |
5,742 | 5,742 | 14,788,510 | 2,176 | A system for controlling a device, comprising a user-controlled overlay configured to receive one or more user-entered controls and to generate a display on a screen of the device that includes a tab, a panel and a plurality of icons disposed within the panel. A touch screen controller configured to receive user-entered screen interface data from the screen and to generate coordinate data from the user-entered screen interface data. A processor coupled to the user-controlled overlay and the touch screen controller, the processor configured to modify the user-controlled overlay to generate a user-interface window for an application associated with a selected icon in response to the coordinate data. The user-controlled overlay includes a fly-out window associated with one or more of the icons, wherein the content of the fly-out window is generated from an alert received at a wireless interface of the device. | 1. A system for controlling a device, comprising:
a user-controlled overlay configured to receive one or more user-entered controls and to generate a display on a screen of the device that includes a tab, a panel and a plurality of icons disposed within the panel; a touch screen controller configured to receive user-entered screen interface data from the screen and to generate coordinate data from the user-entered screen interface data; a processor coupled to the user-controlled overlay and the touch screen controller, the processor configured to modify the user-controlled overlay to generate a user-interface window for an application associated with a selected icon in response to the coordinate data; and wherein the user-controlled overlay includes a fly-out window associated with one or more of the icons, wherein the content of the fly-out window is generated from an alert received at a wireless interface of the device. 2. The system of claim 1, wherein the panel and the plurality of icons are not displayed on the screen in a first state and are displayed on the screen in a second state. 3. The system of claim 1, wherein the panel, the plurality of icons and the tab can be relocated by a user. 4. The system of claim 1, wherein the panel, the plurality of icons and the tab can be relocated by a user by relocating the tab from a first perimeter edge of the screen to a second perimeter edge of the screen. 5. The system of claim 1, wherein the user-controlled overlay further comprises a folder display containing a plurality of icons that is generated when a folder icon in the panel is selected by a user. 6. The system of claim 1, wherein the plurality of icons comprises a plurality of icons that are selected by a network operator and a plurality of icons that are selected by a user. 7. The system of claim 1, wherein the plurality of icons can be scrolled within the panel. 8. A method for controlling a display, comprising:
launching a boot loader of the device; launching a user-controlled overlay of the device; launching a plurality of applications of the device; and generating a display on a screen of the device that comprises the user-controlled overlay and an icon for each of the plurality of applications. 9. The method of claim 8 wherein the user-controlled overlay comprises a tab that is shown on the screen in a first state and a panel containing a subset of the plurality of icons that is shown on the screen in the second state and not in the first state. 10. The method of claim 8 further comprising:
receiving an alert; and
generating a fly-out display for one of the icons in the panel. 11. The method of claim 9 further comprising relocating the panel in response to a user control. 12. The method of claim 9 further comprising relocating the plurality of icons in response to a user control. 13. The method of claim 9 further comprising relocating the tab in response to a user control. 14. The method of claim 9 further comprising relocating the panel, the plurality of icons and the tab by a user by relocating the tab from a first perimeter edge of the screen to a second perimeter edge of the screen. 15. The method of claim 9 further comprising generating a folder display containing a plurality of icons when a folder icon in the panel is selected by a user. 16. The method of claim 8 further comprising:
selecting a first plurality of icons by a network operator; and
selecting a second plurality of icons by a user. 17. The method of claim 8 further comprising scrolling the plurality of icons within s panel. 18. The method of claim 9 further comprising relocating the panel by a user by relocating the tab from a first perimeter edge of the screen to a second perimeter edge of the screen. 19. The method of claim 9 further comprising relocating the plurality of icons by a user by relocating the plurality of icons from a first perimeter edge of the screen to a second perimeter edge of the screen. 20. In a system for controlling a device having a user-controlled overlay configured to receive one or more user-entered controls and to generate a display on a screen of the device that includes a tab, a panel and a plurality of icons disposed within the panel, a touch screen controller configured to receive user-entered screen interface data from the screen and to generate coordinate data from the user-entered screen interface data, a processor coupled to the user-controlled overlay and the touch screen controller, the processor configured to modify the user-controlled overlay to generate a user-interface window for an application associated with a selected icon in response to the coordinate data, wherein the user-controlled overlay includes a fly-out window associated with one or more of the icons, wherein the content of the fly-out window is generated from an alert received at a wireless interface of the device, wherein the panel and the plurality of icons are not displayed on the screen in a first state and are displayed on the screen in a second state, wherein the panel, the plurality of icons and the tab can be relocated by a user, wherein the panel, the plurality of icons and the tab can be relocated by a user by relocating the tab from a first perimeter edge of the screen to a second perimeter edge of the screen, wherein the user-controlled overlay further comprises a folder display containing a plurality of icons that is generated when a folder icon in the panel is selected by a user, wherein the plurality of icons comprises a plurality of icons that are selected by a network operator and a plurality of icons that are selected by a user, and wherein the plurality of icons can be scrolled within the panel, the method comprising:
launching a boot loader of the device; launching a user-controlled overlay of the device; launching a plurality of applications of the device; generating a display on a screen of the device that comprises the user-controlled overlay and an icon for each of the plurality of applications; receiving an alert; generating a fly-out display for one of the icons in the panel; relocating the panel in response to a user control; relocating the plurality of icons in response to a user control; relocating the tab in response to a user control; relocating the panel, the plurality of icons and the tab by a user by relocating the tab from a first perimeter edge of the screen to a second perimeter edge of the screen; generating a folder display containing a plurality of icons when a folder icon in the panel is selected by a user; selecting a first plurality of icons by a network operator; selecting a second plurality of icons by a user; scrolling the plurality of icons within s panel; relocating the panel by a user by relocating the tab from a first perimeter edge of the screen to a second perimeter edge of the screen; relocating the plurality of icons by a user by relocating the plurality of icons from a first perimeter edge of the screen to a second perimeter edge of the screen; and wherein the user-controlled overlay comprises a tab that is shown on the screen in a first state and a panel containing a subset of the plurality of icons that is shown on the screen in the second state and not in the first state. | A system for controlling a device, comprising a user-controlled overlay configured to receive one or more user-entered controls and to generate a display on a screen of the device that includes a tab, a panel and a plurality of icons disposed within the panel. A touch screen controller configured to receive user-entered screen interface data from the screen and to generate coordinate data from the user-entered screen interface data. A processor coupled to the user-controlled overlay and the touch screen controller, the processor configured to modify the user-controlled overlay to generate a user-interface window for an application associated with a selected icon in response to the coordinate data. The user-controlled overlay includes a fly-out window associated with one or more of the icons, wherein the content of the fly-out window is generated from an alert received at a wireless interface of the device.1. A system for controlling a device, comprising:
a user-controlled overlay configured to receive one or more user-entered controls and to generate a display on a screen of the device that includes a tab, a panel and a plurality of icons disposed within the panel; a touch screen controller configured to receive user-entered screen interface data from the screen and to generate coordinate data from the user-entered screen interface data; a processor coupled to the user-controlled overlay and the touch screen controller, the processor configured to modify the user-controlled overlay to generate a user-interface window for an application associated with a selected icon in response to the coordinate data; and wherein the user-controlled overlay includes a fly-out window associated with one or more of the icons, wherein the content of the fly-out window is generated from an alert received at a wireless interface of the device. 2. The system of claim 1, wherein the panel and the plurality of icons are not displayed on the screen in a first state and are displayed on the screen in a second state. 3. The system of claim 1, wherein the panel, the plurality of icons and the tab can be relocated by a user. 4. The system of claim 1, wherein the panel, the plurality of icons and the tab can be relocated by a user by relocating the tab from a first perimeter edge of the screen to a second perimeter edge of the screen. 5. The system of claim 1, wherein the user-controlled overlay further comprises a folder display containing a plurality of icons that is generated when a folder icon in the panel is selected by a user. 6. The system of claim 1, wherein the plurality of icons comprises a plurality of icons that are selected by a network operator and a plurality of icons that are selected by a user. 7. The system of claim 1, wherein the plurality of icons can be scrolled within the panel. 8. A method for controlling a display, comprising:
launching a boot loader of the device; launching a user-controlled overlay of the device; launching a plurality of applications of the device; and generating a display on a screen of the device that comprises the user-controlled overlay and an icon for each of the plurality of applications. 9. The method of claim 8 wherein the user-controlled overlay comprises a tab that is shown on the screen in a first state and a panel containing a subset of the plurality of icons that is shown on the screen in the second state and not in the first state. 10. The method of claim 8 further comprising:
receiving an alert; and
generating a fly-out display for one of the icons in the panel. 11. The method of claim 9 further comprising relocating the panel in response to a user control. 12. The method of claim 9 further comprising relocating the plurality of icons in response to a user control. 13. The method of claim 9 further comprising relocating the tab in response to a user control. 14. The method of claim 9 further comprising relocating the panel, the plurality of icons and the tab by a user by relocating the tab from a first perimeter edge of the screen to a second perimeter edge of the screen. 15. The method of claim 9 further comprising generating a folder display containing a plurality of icons when a folder icon in the panel is selected by a user. 16. The method of claim 8 further comprising:
selecting a first plurality of icons by a network operator; and
selecting a second plurality of icons by a user. 17. The method of claim 8 further comprising scrolling the plurality of icons within s panel. 18. The method of claim 9 further comprising relocating the panel by a user by relocating the tab from a first perimeter edge of the screen to a second perimeter edge of the screen. 19. The method of claim 9 further comprising relocating the plurality of icons by a user by relocating the plurality of icons from a first perimeter edge of the screen to a second perimeter edge of the screen. 20. In a system for controlling a device having a user-controlled overlay configured to receive one or more user-entered controls and to generate a display on a screen of the device that includes a tab, a panel and a plurality of icons disposed within the panel, a touch screen controller configured to receive user-entered screen interface data from the screen and to generate coordinate data from the user-entered screen interface data, a processor coupled to the user-controlled overlay and the touch screen controller, the processor configured to modify the user-controlled overlay to generate a user-interface window for an application associated with a selected icon in response to the coordinate data, wherein the user-controlled overlay includes a fly-out window associated with one or more of the icons, wherein the content of the fly-out window is generated from an alert received at a wireless interface of the device, wherein the panel and the plurality of icons are not displayed on the screen in a first state and are displayed on the screen in a second state, wherein the panel, the plurality of icons and the tab can be relocated by a user, wherein the panel, the plurality of icons and the tab can be relocated by a user by relocating the tab from a first perimeter edge of the screen to a second perimeter edge of the screen, wherein the user-controlled overlay further comprises a folder display containing a plurality of icons that is generated when a folder icon in the panel is selected by a user, wherein the plurality of icons comprises a plurality of icons that are selected by a network operator and a plurality of icons that are selected by a user, and wherein the plurality of icons can be scrolled within the panel, the method comprising:
launching a boot loader of the device; launching a user-controlled overlay of the device; launching a plurality of applications of the device; generating a display on a screen of the device that comprises the user-controlled overlay and an icon for each of the plurality of applications; receiving an alert; generating a fly-out display for one of the icons in the panel; relocating the panel in response to a user control; relocating the plurality of icons in response to a user control; relocating the tab in response to a user control; relocating the panel, the plurality of icons and the tab by a user by relocating the tab from a first perimeter edge of the screen to a second perimeter edge of the screen; generating a folder display containing a plurality of icons when a folder icon in the panel is selected by a user; selecting a first plurality of icons by a network operator; selecting a second plurality of icons by a user; scrolling the plurality of icons within s panel; relocating the panel by a user by relocating the tab from a first perimeter edge of the screen to a second perimeter edge of the screen; relocating the plurality of icons by a user by relocating the plurality of icons from a first perimeter edge of the screen to a second perimeter edge of the screen; and wherein the user-controlled overlay comprises a tab that is shown on the screen in a first state and a panel containing a subset of the plurality of icons that is shown on the screen in the second state and not in the first state. | 2,100 |
5,743 | 5,743 | 14,874,101 | 2,193 | The present invention is a system and method for creating a customized protective equipment item having improved fit. A measuring device takes measurements of a person. The measurements are sent to a computer, which has software for translating the measurements into a custom selection of standard sized components used to assemble the custom protective equipment item. An assembly process builds the completed protective equipment item which is customized to the wearer's size requirements. | 1. A system for creating a custom fit protective equipment item for a person comprising:
a measuring device for measuring the person; a first computer for receiving and processing the measurements; a second computer for receiving the results generated by the first computer and having software configured to translate said measurements into instructions for creation of the custom protective equipment item; and an assembly process for assembling the custom protective equipment item. 2. The system of claim 1 wherein:
the first computer additionally comprises software configured to process said measurements into a selection of standard size pieces that assemble to create the custom protective equipment item. 3. The system of claim 2 wherein:
the measuring device is a three dimensional scanning device. 4. The system of claim 2 wherein:
the first computer translates the measurements into a selection of standard size components by use of an algorithm. 5. The system of claim 2 wherein:
the first computer is connected to the second computer via the internet. 6. The system of claim 2 wherein:
the assembly process involves an assembly line. 7. The system of claim 6 wherein:
the assembly process is automated. 8. The system of claim 7 wherein:
the assembly process comprises at least one robot to assemble the protective equipment item. 9. The system of claim 1 wherein:
the protective equipment item is a helmet. 10. The system of claim 1 wherein:
the protective equipment item is any type of athletic equipment. 11. The system of claim 1 wherein:
the assembly process comprises a series of bins having a series of compartments for housing components for use in assembling the protective equipment. 12. The system of claim 11 wherein:
each of the components for the protective equipment item are sorted into each of said bins and further sorted into each of said compartments of said bin. 13. A system for creating a custom protective equipment item for a person comprising:
an electronic measuring device for measuring the person; a first computer for receiving the measurements and having software capable of translating the measurements into a selection of standard size pieces that assemble to create the custom protective equipment item; a second computer connected to the first computer via the internet, configured to receive the selection generated by the first computer and generate a series of instructions for assembly of the custom protective equipment item; and an assembly process for assembling the selection of standard size components into the custom protective equipment item based on the instructions received by the second computer. 14. The system of claim 13 wherein:
the assembly process is automated. 15. The system of claim 14 wherein:
the assembly process comprises at least one robot to assemble the custom protective equipment item. 16. The system of claim 15 wherein:
the assembly process comprises a series of bins having a series of compartments wherein each of the components for the custom protective equipment item are sorted by bin and further sorted by type of component into each compartment of said bin. 17. The system of claim 13 wherein:
the custom protective equipment item is a helmet. 18. The system of claim 13 wherein:
the custom protective equipment item is an athletic equipment item. 19. A method for creating a custom protective equipment item for a person comprising the steps of:
taking a number of measurements of the person using a measuring device; inputting said measurements into a first computer configured to receive said measurements and having software capable of translating the measurements into a selection of standard size pieces for the assembly of the custom protective equipment item; processing said measurements into the selection of standard size components for the custom protective equipment item on the computer; transmitting said results to a second computer configured to receive said results generated by the first computer and translate said results into assembly instructions for the custom protective equipment item; and assembling the selection of standard size components into the custom protective equipment item. 20. The method of claim 19 where:
the custom protective equipment item is assembled with at least one standard component of a first size and a second standard component of a second size. | The present invention is a system and method for creating a customized protective equipment item having improved fit. A measuring device takes measurements of a person. The measurements are sent to a computer, which has software for translating the measurements into a custom selection of standard sized components used to assemble the custom protective equipment item. An assembly process builds the completed protective equipment item which is customized to the wearer's size requirements.1. A system for creating a custom fit protective equipment item for a person comprising:
a measuring device for measuring the person; a first computer for receiving and processing the measurements; a second computer for receiving the results generated by the first computer and having software configured to translate said measurements into instructions for creation of the custom protective equipment item; and an assembly process for assembling the custom protective equipment item. 2. The system of claim 1 wherein:
the first computer additionally comprises software configured to process said measurements into a selection of standard size pieces that assemble to create the custom protective equipment item. 3. The system of claim 2 wherein:
the measuring device is a three dimensional scanning device. 4. The system of claim 2 wherein:
the first computer translates the measurements into a selection of standard size components by use of an algorithm. 5. The system of claim 2 wherein:
the first computer is connected to the second computer via the internet. 6. The system of claim 2 wherein:
the assembly process involves an assembly line. 7. The system of claim 6 wherein:
the assembly process is automated. 8. The system of claim 7 wherein:
the assembly process comprises at least one robot to assemble the protective equipment item. 9. The system of claim 1 wherein:
the protective equipment item is a helmet. 10. The system of claim 1 wherein:
the protective equipment item is any type of athletic equipment. 11. The system of claim 1 wherein:
the assembly process comprises a series of bins having a series of compartments for housing components for use in assembling the protective equipment. 12. The system of claim 11 wherein:
each of the components for the protective equipment item are sorted into each of said bins and further sorted into each of said compartments of said bin. 13. A system for creating a custom protective equipment item for a person comprising:
an electronic measuring device for measuring the person; a first computer for receiving the measurements and having software capable of translating the measurements into a selection of standard size pieces that assemble to create the custom protective equipment item; a second computer connected to the first computer via the internet, configured to receive the selection generated by the first computer and generate a series of instructions for assembly of the custom protective equipment item; and an assembly process for assembling the selection of standard size components into the custom protective equipment item based on the instructions received by the second computer. 14. The system of claim 13 wherein:
the assembly process is automated. 15. The system of claim 14 wherein:
the assembly process comprises at least one robot to assemble the custom protective equipment item. 16. The system of claim 15 wherein:
the assembly process comprises a series of bins having a series of compartments wherein each of the components for the custom protective equipment item are sorted by bin and further sorted by type of component into each compartment of said bin. 17. The system of claim 13 wherein:
the custom protective equipment item is a helmet. 18. The system of claim 13 wherein:
the custom protective equipment item is an athletic equipment item. 19. A method for creating a custom protective equipment item for a person comprising the steps of:
taking a number of measurements of the person using a measuring device; inputting said measurements into a first computer configured to receive said measurements and having software capable of translating the measurements into a selection of standard size pieces for the assembly of the custom protective equipment item; processing said measurements into the selection of standard size components for the custom protective equipment item on the computer; transmitting said results to a second computer configured to receive said results generated by the first computer and translate said results into assembly instructions for the custom protective equipment item; and assembling the selection of standard size components into the custom protective equipment item. 20. The method of claim 19 where:
the custom protective equipment item is assembled with at least one standard component of a first size and a second standard component of a second size. | 2,100 |
5,744 | 5,744 | 14,188,409 | 2,143 | A vehicle information system includes a user interface, a computer unit, and a communications interface designed for communicating with an external computer unit. An external application program that is allocated to the external computer unit is made available to a user of the vehicle by the user interface. An operator control instruction allocated to the external application program and in the form of a container with a discrete file system is made available to the computer unit. When the user retrieves, by way of the user interface, the operator control instruction, entry data contained in the container are signaled by the user interface. When a link that relates to a section of the operator control instruction of the specific external application program is retrieved, proceeding from the currently signaled operator control instruction of the external application program, the user searches only the data within the container that belong to the specific link by way of the user interface and once found these data are signaled by the user interface. | 1. A method of operating a vehicle information system having a user interface, a computer unit, and a communications interface operatively configured to communicate with an external computer unit, the method comprising the acts of:
making available to a user of the vehicle information system, via the user interface, an external application program allocated to the external computer unit; making available to the computer unit an operator control instruction allocated to the external application program, the operator control instruction being in a form of a container with a discrete file system; upon retrieval, via the user interface, of the operator control instruction allocated to the external application program, signaling, via the user interface, entry data contained in the container; and upon retrieval of a link relating to a section of the operator control instruction of a specific external application program, proceeding from a currently signaled operator control instruction entry data of the external application program, searching, via the user interface, only data within the container that belongs to the link and, once said data is found, signaling said data via the user interface. 2. The method according to claim 1, wherein a specific identifier of the entry data for the operator control instruction allocated to the specific external application program is embedded in a list in a prespecified sorting sequence; and
if an identical identifier to the embedded specific identifier is already present as an element of the list, adding a flag of the specific external application program to the specific identifier of the entry data. 3. The method according to claim 1, further comprising the act of:
if the operator control instruction allocated to the specific external application program is not available in a prespecified language version, signaling in a prespecified language, via the user interface, that the operator control instruction is not available in the prespecified language version. 4. The method according to claim 3, further comprising the acts of:
if the operator control instruction is not available in the prespecified language version, offering a language version to the user, via the user interface; and regardless of the offered language version, signaling the operator control instruction in the prespecificed language version. 5. The method according to claim 1, wherein the computer unit includes a cache memory, the method further comprising the acts of:
after a connection is established between the communication interface and the external computer unit, testing to determine whether the container of the operator control instruction allocated to the specific external application program is already stored in the cache memory; and if the container is already stored in the cache memory, using the already stored container for making available the computer unit; and if the container is not already stored, then storing the container in the cache memory when the communications interface is made available to the computer unit. 6. A vehicle information system operable with an external computer unit, the vehicle information system comprising:
a user interface; a computer unit coupled with the user interface; a communications interface coupled with the computer unit and being operatively configured to communicate with the external computer unit, wherein
an external application program allocated to the external computer unit is made available to a user of the vehicle information system via the user interface,
an operator control instruction allocated to the specific external application program is made available to the computer unit, the operator control instruction being in the form of a container with a discrete file system,
upon retrieval via the user interface of the operator control instruction allocated to the specific external application program, entry data contained in the container is signaled via the user interface, and
upon retrieving a link relating to a section of the operator control instruction, proceeding from the made available entry data, only searching the entry data within the container belonging to the specific link via the user interface, and once the entry data is found, signaling the entry data via the user interface. 7. A computer product of a vehicle information system having a user interface, a computer unit and a communications interface operatively configured to communicate with an external computer unit, the computer product comprising a computer readable medium having program code segments stored thereon for execution by the computer unit that:
make available to a user of the vehicle information system, via the user interface, an external application program allocated to the external computer unit; make available to the computer unit an operator control instruction allocated to the external application program, the operator control instruction being in a form of a container with a discrete file system; upon retrieval, via the user interface, of the operator control instruction allocated to the external application program, signal, via the user interface, entry data contained in the container; and upon retrieval of a link relating to a section of the operator control instruction of a specific external application program, proceeding from a currently signaled operator control instruction entry data of the external application program, search, via the user interface, only data within the container that belongs to the link and, once said data is found, signaling said data via the user interface. | A vehicle information system includes a user interface, a computer unit, and a communications interface designed for communicating with an external computer unit. An external application program that is allocated to the external computer unit is made available to a user of the vehicle by the user interface. An operator control instruction allocated to the external application program and in the form of a container with a discrete file system is made available to the computer unit. When the user retrieves, by way of the user interface, the operator control instruction, entry data contained in the container are signaled by the user interface. When a link that relates to a section of the operator control instruction of the specific external application program is retrieved, proceeding from the currently signaled operator control instruction of the external application program, the user searches only the data within the container that belong to the specific link by way of the user interface and once found these data are signaled by the user interface.1. A method of operating a vehicle information system having a user interface, a computer unit, and a communications interface operatively configured to communicate with an external computer unit, the method comprising the acts of:
making available to a user of the vehicle information system, via the user interface, an external application program allocated to the external computer unit; making available to the computer unit an operator control instruction allocated to the external application program, the operator control instruction being in a form of a container with a discrete file system; upon retrieval, via the user interface, of the operator control instruction allocated to the external application program, signaling, via the user interface, entry data contained in the container; and upon retrieval of a link relating to a section of the operator control instruction of a specific external application program, proceeding from a currently signaled operator control instruction entry data of the external application program, searching, via the user interface, only data within the container that belongs to the link and, once said data is found, signaling said data via the user interface. 2. The method according to claim 1, wherein a specific identifier of the entry data for the operator control instruction allocated to the specific external application program is embedded in a list in a prespecified sorting sequence; and
if an identical identifier to the embedded specific identifier is already present as an element of the list, adding a flag of the specific external application program to the specific identifier of the entry data. 3. The method according to claim 1, further comprising the act of:
if the operator control instruction allocated to the specific external application program is not available in a prespecified language version, signaling in a prespecified language, via the user interface, that the operator control instruction is not available in the prespecified language version. 4. The method according to claim 3, further comprising the acts of:
if the operator control instruction is not available in the prespecified language version, offering a language version to the user, via the user interface; and regardless of the offered language version, signaling the operator control instruction in the prespecificed language version. 5. The method according to claim 1, wherein the computer unit includes a cache memory, the method further comprising the acts of:
after a connection is established between the communication interface and the external computer unit, testing to determine whether the container of the operator control instruction allocated to the specific external application program is already stored in the cache memory; and if the container is already stored in the cache memory, using the already stored container for making available the computer unit; and if the container is not already stored, then storing the container in the cache memory when the communications interface is made available to the computer unit. 6. A vehicle information system operable with an external computer unit, the vehicle information system comprising:
a user interface; a computer unit coupled with the user interface; a communications interface coupled with the computer unit and being operatively configured to communicate with the external computer unit, wherein
an external application program allocated to the external computer unit is made available to a user of the vehicle information system via the user interface,
an operator control instruction allocated to the specific external application program is made available to the computer unit, the operator control instruction being in the form of a container with a discrete file system,
upon retrieval via the user interface of the operator control instruction allocated to the specific external application program, entry data contained in the container is signaled via the user interface, and
upon retrieving a link relating to a section of the operator control instruction, proceeding from the made available entry data, only searching the entry data within the container belonging to the specific link via the user interface, and once the entry data is found, signaling the entry data via the user interface. 7. A computer product of a vehicle information system having a user interface, a computer unit and a communications interface operatively configured to communicate with an external computer unit, the computer product comprising a computer readable medium having program code segments stored thereon for execution by the computer unit that:
make available to a user of the vehicle information system, via the user interface, an external application program allocated to the external computer unit; make available to the computer unit an operator control instruction allocated to the external application program, the operator control instruction being in a form of a container with a discrete file system; upon retrieval, via the user interface, of the operator control instruction allocated to the external application program, signal, via the user interface, entry data contained in the container; and upon retrieval of a link relating to a section of the operator control instruction of a specific external application program, proceeding from a currently signaled operator control instruction entry data of the external application program, search, via the user interface, only data within the container that belongs to the link and, once said data is found, signaling said data via the user interface. | 2,100 |
5,745 | 5,745 | 15,178,324 | 2,195 | Embodiments provide for application-specific provisioning of files or registry keys. As applications are installed or launched, data is recorded by an application virtualization engine, and an index is created linking the recorded data to both the application and the underlying files or registry keys. As applications are requested (e.g., launched, updated, or the like), the application virtualization engine reveals various copies of file or registry keys to the application on demand or in accordance with a policy. | 1. A computing system for application virtualization, the computing system comprising:
an application cloaking database that maps associations between a plurality of applications and their respective file and configuration data; and an application virtualization engine that:
receives a notification that an application event is occurring;
records the file and configuration data from the application event;
indexes the recorded file and configuration data in the application cloaking database on underlying storage to identify which applications share common recorded file and configuration data;
subsequently intercepts a request for a file or configuration data from at least one of a plurality of applications;
searches the application cloaking database for the requested file or configuration data;
adjusts a filter to reveal a cached copy of the requested file or configuration data to the at least one of the plurality of applications if the requested file or configuration data is in the application cloaking database; and
retrieving the requested file or configuration data from underlying storage if the requested file or configuration data is not in the application cloaking database. 2. The computing system of claim 1, wherein the application cloaking database is sourced across one or more underlying disk volumes. 3. The computing system of claim 1, wherein the application cloaking database is sourced on a synthetic block device. 4. The computing system of claim 1, wherein upon a launch of the at least one of the plurality of applications, the application virtualization engine further:
retrieves the indexed recorded file or configuration data associated with the at least one of the plurality of applications from the application cloaking database; and presents the indexed recorded file or configuration data to the at least one of the plurality of applications. 5. The computing system of claim 1, further comprising:
merging the application cloaking database with other application cloaking databases to create a master application cloaking database, the master application cloaking database routing requests between the at least one of the plurality of applications and the underlying storage. 6. The computing system of claim 1, wherein the same file and configuration data are shared by a plurality of remote desktop sessions. 7. The computing system of claim 1, wherein at least one of the plurality of applications share access to the same file and configuration data. 8. The computing system of claim 7, wherein the same file and configuration data are represented to the plurality of applications as residing in more than one location on the underlying storage. 9. A method for application virtualization, the method comprising:
intercepting, by an application virtualization engine, a request for a file or configuration data from at least one of a plurality of applications executing on a computing device, the at least one of the plurality of applications being delivered virtually by the application virtualization engine to the computing device; searching a cache for the requested file or configuration data; and if the requested file or configuration data is in the cache, adjusting a filter to reveal a cached copy of the requested file or configuration data to the at least one of the plurality of applications; else retrieving the requested file or configuration data from underlying storage accessible to the application virtualization engine and updating the cache with the retrieved file or configuration data. 10. The method of claim 9, wherein adjusting the filter comprises concealing the cached copy of the requested file or configuration data to remove the requested file or configuration data from view by the at least one of the plurality of applications. 11. The method of claim 9, wherein adjusting the filter comprises changing, in response to a trigger event, the revealed cached files and configuration data associated with the at least one of the plurality of applications from an older version of the cached files and configuration data to an upgraded version of the cached files and configuration data. 12. The method of claim 11, wherein the trigger event is the termination of the at least one of the plurality of applications. 13. The method of claim 9, wherein adjusting the filters is based on a policy related to one or more of any of the following: a time of day, a day of week, a software license compliance, current load levels on underlying infrastructure, version of the operating system used by a VDI or RDSH user, client access device type used by a VDI user, and a network location of a user. 14. The method of claim 9, further comprising:
recording intercepted requests for file or configuration data; auditing the intercepted requests to find application file access patterns; analyzing the application file access patterns; and proactively pre-populating the look-aside cache. 15. The method of claim 14, further comprising placing file or configuration data optimally across the underlying storage based on the application file access patterns. 16. The method of claim 15, further comprising placing file or configuration data upon a low-latency storage media comprising one or more of: flash memory and solid state disks (SSD). 17. A non-transitory computer-readable medium including instructions that are configured, when executed by an application virtualization engine, to leverage a virtualized mapping of chained file systems utilized by at least one application executing on an operating system by:
checking an application cloaking database for file or configuration data requested by the at least one application, the at least one application being provided virtually by the application virtualization engine; upon determining that the at least one application exists on an underlying storage device already mounted to the operating system:
obtaining a local copy of the file or configuration data for use by the at least one application;
else,
mounting the file or configuration data from the underlying storage device for use by the at least one application. 18. The non-transitory computer-readable medium of claim 17, further comprising instructions for composing a virtual hard drive containing the file or configuration data used by the at least one application. 19. The non-transitory computer-readable medium of claim 17, wherein checking the application cloaking database further comprises auditing application usage data for one or more of application management, statistics reports, and license control. 20. The non-transitory computer-readable medium of claim 17, further comprising editing a security setting of the file or configuration data based upon an access policy. | Embodiments provide for application-specific provisioning of files or registry keys. As applications are installed or launched, data is recorded by an application virtualization engine, and an index is created linking the recorded data to both the application and the underlying files or registry keys. As applications are requested (e.g., launched, updated, or the like), the application virtualization engine reveals various copies of file or registry keys to the application on demand or in accordance with a policy.1. A computing system for application virtualization, the computing system comprising:
an application cloaking database that maps associations between a plurality of applications and their respective file and configuration data; and an application virtualization engine that:
receives a notification that an application event is occurring;
records the file and configuration data from the application event;
indexes the recorded file and configuration data in the application cloaking database on underlying storage to identify which applications share common recorded file and configuration data;
subsequently intercepts a request for a file or configuration data from at least one of a plurality of applications;
searches the application cloaking database for the requested file or configuration data;
adjusts a filter to reveal a cached copy of the requested file or configuration data to the at least one of the plurality of applications if the requested file or configuration data is in the application cloaking database; and
retrieving the requested file or configuration data from underlying storage if the requested file or configuration data is not in the application cloaking database. 2. The computing system of claim 1, wherein the application cloaking database is sourced across one or more underlying disk volumes. 3. The computing system of claim 1, wherein the application cloaking database is sourced on a synthetic block device. 4. The computing system of claim 1, wherein upon a launch of the at least one of the plurality of applications, the application virtualization engine further:
retrieves the indexed recorded file or configuration data associated with the at least one of the plurality of applications from the application cloaking database; and presents the indexed recorded file or configuration data to the at least one of the plurality of applications. 5. The computing system of claim 1, further comprising:
merging the application cloaking database with other application cloaking databases to create a master application cloaking database, the master application cloaking database routing requests between the at least one of the plurality of applications and the underlying storage. 6. The computing system of claim 1, wherein the same file and configuration data are shared by a plurality of remote desktop sessions. 7. The computing system of claim 1, wherein at least one of the plurality of applications share access to the same file and configuration data. 8. The computing system of claim 7, wherein the same file and configuration data are represented to the plurality of applications as residing in more than one location on the underlying storage. 9. A method for application virtualization, the method comprising:
intercepting, by an application virtualization engine, a request for a file or configuration data from at least one of a plurality of applications executing on a computing device, the at least one of the plurality of applications being delivered virtually by the application virtualization engine to the computing device; searching a cache for the requested file or configuration data; and if the requested file or configuration data is in the cache, adjusting a filter to reveal a cached copy of the requested file or configuration data to the at least one of the plurality of applications; else retrieving the requested file or configuration data from underlying storage accessible to the application virtualization engine and updating the cache with the retrieved file or configuration data. 10. The method of claim 9, wherein adjusting the filter comprises concealing the cached copy of the requested file or configuration data to remove the requested file or configuration data from view by the at least one of the plurality of applications. 11. The method of claim 9, wherein adjusting the filter comprises changing, in response to a trigger event, the revealed cached files and configuration data associated with the at least one of the plurality of applications from an older version of the cached files and configuration data to an upgraded version of the cached files and configuration data. 12. The method of claim 11, wherein the trigger event is the termination of the at least one of the plurality of applications. 13. The method of claim 9, wherein adjusting the filters is based on a policy related to one or more of any of the following: a time of day, a day of week, a software license compliance, current load levels on underlying infrastructure, version of the operating system used by a VDI or RDSH user, client access device type used by a VDI user, and a network location of a user. 14. The method of claim 9, further comprising:
recording intercepted requests for file or configuration data; auditing the intercepted requests to find application file access patterns; analyzing the application file access patterns; and proactively pre-populating the look-aside cache. 15. The method of claim 14, further comprising placing file or configuration data optimally across the underlying storage based on the application file access patterns. 16. The method of claim 15, further comprising placing file or configuration data upon a low-latency storage media comprising one or more of: flash memory and solid state disks (SSD). 17. A non-transitory computer-readable medium including instructions that are configured, when executed by an application virtualization engine, to leverage a virtualized mapping of chained file systems utilized by at least one application executing on an operating system by:
checking an application cloaking database for file or configuration data requested by the at least one application, the at least one application being provided virtually by the application virtualization engine; upon determining that the at least one application exists on an underlying storage device already mounted to the operating system:
obtaining a local copy of the file or configuration data for use by the at least one application;
else,
mounting the file or configuration data from the underlying storage device for use by the at least one application. 18. The non-transitory computer-readable medium of claim 17, further comprising instructions for composing a virtual hard drive containing the file or configuration data used by the at least one application. 19. The non-transitory computer-readable medium of claim 17, wherein checking the application cloaking database further comprises auditing application usage data for one or more of application management, statistics reports, and license control. 20. The non-transitory computer-readable medium of claim 17, further comprising editing a security setting of the file or configuration data based upon an access policy. | 2,100 |
5,746 | 5,746 | 13,928,305 | 2,174 | A remote control system and related method for controlling a video device are presented. The remote control system contains a plurality of buttons arranged in a grid pattern that correspond to user selectable options displayed on a display screen arranged in the same grid pattern. The user selects options on the screen by pressing the corresponding button on the remote control. | 1. A video device, comprising:
a controller coupleable to a display screen; a memory coupled to the controller; a user interface stored on the memory and configured to be output to the display screen; a menu stored on the memory and displayable on the user interface, the menu including a plurality of user selectable options arranged in a grid pattern; and a receiver coupled to the controller and configured to receive wireless signals from a remote control, the remote control including a plurality of buttons configured in a same grid pattern as the plurality of user selectable options and each button of the plurality of buttons corresponding to one of the user selectable options, wherein the received wireless signals instruct the controller to select the corresponding one user selectable option in response to a corresponding button of the plurality of buttons being pressed. 2. The video device of claim 1, the grid pattern comprising at least three columns and at least three rows. 3. The video device of claim 2, wherein the number of rows can change. 4. The video device of claim 1, wherein the controller is configured to visually indicate one of the plurality of user selectable options in response to the corresponding button being touched. 5. The video device of claim 1, wherein the video device is a set-top box. 6. A remote control, comprising:
a plurality of buttons arranged in grid pattern, wherein each button of the plurality of buttons corresponds to one of a plurality of user selectable options displayed by a video device in a same grid pattern as the plurality of buttons; a controller coupled to the plurality of buttons and configured to output a first control signal in response to a user touching one of the buttons and a second control signal in response to a user pressing one of the buttons; and a transmitter coupled to the controller and configured to transmit the first control signal and second control signal. 7. The system of claim 6, the grid pattern comprising at least three columns and at least three rows. 8. The system of claim 6, wherein the plurality of buttons provide tactile feedback to a user when moving a finger between the buttons. 9. The system of claim 6, wherein the first control signal is configured to cause the menu to visually indicate the user selectable option that corresponds to the touched button, and the second control signal is configured to select the user selectable option corresponding to the pressed button. 10. A dual-function remote control, comprising:
a plurality of buttons arranged in a grid pattern and configured to be dual function, wherein the plurality of buttons correspond to user selectable options displayed on a display screen and arranged in a same grid pattern as the plurality of buttons, and wherein the plurality of buttons provide other static functions, including at least one of: play, pause, stop, rewind, fast forward, select, up, down, left, right, search, guide, DVR, clear, menu, and back; a controller coupled to the plurality of buttons and configured to output a signal in response to the button being pressed; and a transmitter coupled to the controller and configured to transmit the signal to a video device, the video device coupled to the display screen. 11. The dual-function remote control of claim 10, wherein pressing one of the plurality of buttons when the display screen is not displaying the user selectable options in a grid pattern causes the static functions to execute. 12. The dual-function remote control of claim 10, wherein the remote control is configured to receive signals from the video device. 13. The dual-function remote control of claim 12, wherein the video device transmits signals to the remote control to transmit the static functions of the plurality of buttons when the video device is not displaying the grid pattern. 14. A method, comprising:
outputting a user interface of a video device to a display screen; outputting a plurality of user selectable options arranged in a grid pattern on the user interface; receiving wireless signals from a remote control having a plurality of buttons arranged in a same grid pattern as the plurality of user selectable options, each one of the plurality of buttons corresponding to one of the plurality of user selectable options; highlighting one of the plurality of user selectable options in response to a user touching the corresponding one of the plurality of buttons on the remote control; and selecting one of the plurality of user selectable options in response to the user pressing the corresponding one of the plurality of buttons on the remote control. 15. The method of claim 14, further comprising changing a number or rows or columns based on what user selectable options are being displayed. 16. The method of claim 14, the grid pattern comprising at least three columns and at least three rows. 17. The method of claim 14, further comprising transmitting a signal to the remote control to configure the buttons to execute a pre-set static function. 18. A method, comprising:
receiving a signal at a remote control from a video device, the remote control configured to enter into a grid mode in response to a first signal, and a standard mode in response to a second signal; entering into the grid mode comprising:
sensing a finger position on a plurality of buttons arranged in a grid pattern on a remote control, the plurality of buttons corresponding to a user interface with a plurality of user selectable options arranged in a same grid pattern as the plurality of buttons, wherein each of the plurality of user selectable options corresponds to one of the plurality of buttons;
transmitting the finger position to a video device, the video device configured to output to a display screen and to visually indicate the user selectable option that corresponds to the button touched by the sensed finger;
detecting one of the plurality of buttons being pressed; and
transmitting the button press to the video device, the video device configured to select the user selectable option corresponding to the pressed button; and
entering into the standard mode comprising:
detecting one of the plurality of buttons being pressed; and
transmitting the button press to the video device, the video device configured to execute a pre-set function tied to the pressed button. 19. The method of claim 18, further comprising providing tactile feedback when a user moves their finger from one of the buttons to another of the buttons. 20. The method of claim 19, wherein the tactile feedback is a physical structure positioned between each of the plurality of buttons arranged in the grid pattern. | A remote control system and related method for controlling a video device are presented. The remote control system contains a plurality of buttons arranged in a grid pattern that correspond to user selectable options displayed on a display screen arranged in the same grid pattern. The user selects options on the screen by pressing the corresponding button on the remote control.1. A video device, comprising:
a controller coupleable to a display screen; a memory coupled to the controller; a user interface stored on the memory and configured to be output to the display screen; a menu stored on the memory and displayable on the user interface, the menu including a plurality of user selectable options arranged in a grid pattern; and a receiver coupled to the controller and configured to receive wireless signals from a remote control, the remote control including a plurality of buttons configured in a same grid pattern as the plurality of user selectable options and each button of the plurality of buttons corresponding to one of the user selectable options, wherein the received wireless signals instruct the controller to select the corresponding one user selectable option in response to a corresponding button of the plurality of buttons being pressed. 2. The video device of claim 1, the grid pattern comprising at least three columns and at least three rows. 3. The video device of claim 2, wherein the number of rows can change. 4. The video device of claim 1, wherein the controller is configured to visually indicate one of the plurality of user selectable options in response to the corresponding button being touched. 5. The video device of claim 1, wherein the video device is a set-top box. 6. A remote control, comprising:
a plurality of buttons arranged in grid pattern, wherein each button of the plurality of buttons corresponds to one of a plurality of user selectable options displayed by a video device in a same grid pattern as the plurality of buttons; a controller coupled to the plurality of buttons and configured to output a first control signal in response to a user touching one of the buttons and a second control signal in response to a user pressing one of the buttons; and a transmitter coupled to the controller and configured to transmit the first control signal and second control signal. 7. The system of claim 6, the grid pattern comprising at least three columns and at least three rows. 8. The system of claim 6, wherein the plurality of buttons provide tactile feedback to a user when moving a finger between the buttons. 9. The system of claim 6, wherein the first control signal is configured to cause the menu to visually indicate the user selectable option that corresponds to the touched button, and the second control signal is configured to select the user selectable option corresponding to the pressed button. 10. A dual-function remote control, comprising:
a plurality of buttons arranged in a grid pattern and configured to be dual function, wherein the plurality of buttons correspond to user selectable options displayed on a display screen and arranged in a same grid pattern as the plurality of buttons, and wherein the plurality of buttons provide other static functions, including at least one of: play, pause, stop, rewind, fast forward, select, up, down, left, right, search, guide, DVR, clear, menu, and back; a controller coupled to the plurality of buttons and configured to output a signal in response to the button being pressed; and a transmitter coupled to the controller and configured to transmit the signal to a video device, the video device coupled to the display screen. 11. The dual-function remote control of claim 10, wherein pressing one of the plurality of buttons when the display screen is not displaying the user selectable options in a grid pattern causes the static functions to execute. 12. The dual-function remote control of claim 10, wherein the remote control is configured to receive signals from the video device. 13. The dual-function remote control of claim 12, wherein the video device transmits signals to the remote control to transmit the static functions of the plurality of buttons when the video device is not displaying the grid pattern. 14. A method, comprising:
outputting a user interface of a video device to a display screen; outputting a plurality of user selectable options arranged in a grid pattern on the user interface; receiving wireless signals from a remote control having a plurality of buttons arranged in a same grid pattern as the plurality of user selectable options, each one of the plurality of buttons corresponding to one of the plurality of user selectable options; highlighting one of the plurality of user selectable options in response to a user touching the corresponding one of the plurality of buttons on the remote control; and selecting one of the plurality of user selectable options in response to the user pressing the corresponding one of the plurality of buttons on the remote control. 15. The method of claim 14, further comprising changing a number or rows or columns based on what user selectable options are being displayed. 16. The method of claim 14, the grid pattern comprising at least three columns and at least three rows. 17. The method of claim 14, further comprising transmitting a signal to the remote control to configure the buttons to execute a pre-set static function. 18. A method, comprising:
receiving a signal at a remote control from a video device, the remote control configured to enter into a grid mode in response to a first signal, and a standard mode in response to a second signal; entering into the grid mode comprising:
sensing a finger position on a plurality of buttons arranged in a grid pattern on a remote control, the plurality of buttons corresponding to a user interface with a plurality of user selectable options arranged in a same grid pattern as the plurality of buttons, wherein each of the plurality of user selectable options corresponds to one of the plurality of buttons;
transmitting the finger position to a video device, the video device configured to output to a display screen and to visually indicate the user selectable option that corresponds to the button touched by the sensed finger;
detecting one of the plurality of buttons being pressed; and
transmitting the button press to the video device, the video device configured to select the user selectable option corresponding to the pressed button; and
entering into the standard mode comprising:
detecting one of the plurality of buttons being pressed; and
transmitting the button press to the video device, the video device configured to execute a pre-set function tied to the pressed button. 19. The method of claim 18, further comprising providing tactile feedback when a user moves their finger from one of the buttons to another of the buttons. 20. The method of claim 19, wherein the tactile feedback is a physical structure positioned between each of the plurality of buttons arranged in the grid pattern. | 2,100 |
5,747 | 5,747 | 14,786,819 | 2,176 | Disclosed is a device for inputting symbols in an entry field. An example of the device includes an interface unit having a touch screen and a module for processing graphics objects. The module may include a detection unit for detecting a start and an end of a current graphics object being input; a storage unit for storing graphics data corresponding to the input graphics object; a recognition unit for generating a list of candidate strings of symbols from the graphics data, each candidate string being associated with a pertinence value; and an insertion unit for inserting into the entry field a string selected by the user from the list, a data group comprising the graphics data, the candidate strings, the pertinence values, and an identifier of the selected string being stored during a predetermined duration. | 1.-34. (canceled) 35. An input device suitable for being used by a user to input symbols into an entry field of an application that is executable on said device, the device comprising:
an interface unit having a touch screen, said interface unit enabling graphics objects to be input manually and displayed in an input zone of said screen; and a graphics object processor module, said processor module comprising, for the purpose of processing each current graphics object: a detection unit for detecting a start of input and an end of input of said current graphics object in said input zone; a storage unit suitable, on detecting a start of input of said current graphics object, for storing graphics data corresponding to said current graphics object throughout the time it is being input; a recognition unit configured to generate from said graphics data candidate strings, each having at least one symbol, each of said candidate strings being associated with a pertinence value representative of the pertinence of said candidate string relative to said graphics data; and an insertion unit configured to insert into said entry field a string selected from said candidate strings as a function of their pertinence; wherein the storage means are configured to store in association with said graphics data, said candidate strings and their associated pertinence values, together with an identifier of the selected string, said association forming a first data group, and being configured to conserve said first data group in memory for a first predetermined duration; wherein the processor module is configured to enable the user to use the interface unit to edit a string being displayed in the entry field, the data group of said edited string being modified in response to said editing by the processor module and stored by the storage means. 36. A device according to claim 35, the interface unit being configured, when the end of input of the current graphics object has been detected and if no subsequent start of input of a graphics object has been detected within a predetermined length of time starting from said detection of the end of input, to shift the display of the current graphics object in the input zone so as to release space in said input zone for inputting a subsequent graphics object. 37. A device according to claim 36, wherein the predetermined length of time is a function of the position of the current graphics object in the input zone. 38. A device according to claim 36, wherein the predetermined length of time is a function of the total length of the trace along the main input axis of the graphics objects being displayed in the input zone. 39. A device according to claim 36, wherein the interface unit is configured, once said shifting has been performed, to display a graphics indicator in the input zone to define a region of the input zone adjacent to the current graphics object; and
wherein, if the detection unit detects the start of input of a subsequent graphics object in said region, the storage unit is configured to store the graphics data of the subsequent graphics object throughout the time it is being input in association with the graphics data of the first data group. 40. A device according to claim 36, wherein the interface unit is configured, once said shifting has been performed, to display a graphics indicator in the input zone to define a region of the input zone adjacent to the current graphics object; and
wherein, if the detection unit detects a start of input of a subsequent graphics object outside said region, the storage unit is configured to store the graphics data of the subsequent graphics object throughout the time it is being input in a second data group independent of said first data group. 41. A device according to claim 39, wherein, if the interface unit detects the start of the subsequent graphics object being input outside said region of the input zone, the insertion unit confirms said selected string. 42. A device according to 41, wherein the processor module is configured, after a second predetermined duration measured from said confirmation, to cause the current graphics object to be displayed in block characters, the storage means conserving said first data group in memory during said first predetermined duration. 43. A device according to claim 39, wherein the graphics indicator represents an empty space in the input zone between the current graphics object and an unused portion of the input zone. 44. A device according to claim 35, wherein each said graphics object represents a handwritten symbol. 45. A device according to claim 35, wherein, in order to edit a graphics object, the processor module enables the user to use the touch screen to select said graphics object for editing. 46. A device according to claim 45, wherein said selection is performed by pressing a point of contact against the touch screen on the graphics object to be edited, said selection causing the corresponding string inserted in the entry field to be selected as the active string. 47. An input method performed by an input device suitable for being used by a user to enter symbols into an entry field of an application that can be executed on said device, the device comprising an interface having a touch screen, said interface enabling graphics objects to be input manually and displayed in an input zone of said screen, the method comprising processing of graphics objects, said processing comprising for each current graphics object:
detecting a start and an end of said current graphics object being input in said input zone; on detecting a start of said current graphics object being input, storing graphics data corresponding to said current graphics object throughout the time it is being input; generating candidate strings of at least one symbol from said graphics data, each of said candidate strings being associated with a pertinence value representative of the pertinence of said candidate string relative to said graphics data; and inserting in said entry field a said string as selected from among said candidate strings as a function of its pertinence; and storing in memory, in association with said graphics data, said candidate strings and their associated pertinence values, together with an identifier of said selected string, said association forming a first data group, and conserving said first data group in memory during a first predetermined duration; editing a string being displayed in the entry field, the data group of said edited string being modified and stored in response to said editing. 48. A computer program including instructions for executing steps of a configuration method according to claim 47 when said program is executed by a computer. 49. A computer readable data medium storing a computer program including instructions for executing steps of a configuration method according to claim 47. | Disclosed is a device for inputting symbols in an entry field. An example of the device includes an interface unit having a touch screen and a module for processing graphics objects. The module may include a detection unit for detecting a start and an end of a current graphics object being input; a storage unit for storing graphics data corresponding to the input graphics object; a recognition unit for generating a list of candidate strings of symbols from the graphics data, each candidate string being associated with a pertinence value; and an insertion unit for inserting into the entry field a string selected by the user from the list, a data group comprising the graphics data, the candidate strings, the pertinence values, and an identifier of the selected string being stored during a predetermined duration.1.-34. (canceled) 35. An input device suitable for being used by a user to input symbols into an entry field of an application that is executable on said device, the device comprising:
an interface unit having a touch screen, said interface unit enabling graphics objects to be input manually and displayed in an input zone of said screen; and a graphics object processor module, said processor module comprising, for the purpose of processing each current graphics object: a detection unit for detecting a start of input and an end of input of said current graphics object in said input zone; a storage unit suitable, on detecting a start of input of said current graphics object, for storing graphics data corresponding to said current graphics object throughout the time it is being input; a recognition unit configured to generate from said graphics data candidate strings, each having at least one symbol, each of said candidate strings being associated with a pertinence value representative of the pertinence of said candidate string relative to said graphics data; and an insertion unit configured to insert into said entry field a string selected from said candidate strings as a function of their pertinence; wherein the storage means are configured to store in association with said graphics data, said candidate strings and their associated pertinence values, together with an identifier of the selected string, said association forming a first data group, and being configured to conserve said first data group in memory for a first predetermined duration; wherein the processor module is configured to enable the user to use the interface unit to edit a string being displayed in the entry field, the data group of said edited string being modified in response to said editing by the processor module and stored by the storage means. 36. A device according to claim 35, the interface unit being configured, when the end of input of the current graphics object has been detected and if no subsequent start of input of a graphics object has been detected within a predetermined length of time starting from said detection of the end of input, to shift the display of the current graphics object in the input zone so as to release space in said input zone for inputting a subsequent graphics object. 37. A device according to claim 36, wherein the predetermined length of time is a function of the position of the current graphics object in the input zone. 38. A device according to claim 36, wherein the predetermined length of time is a function of the total length of the trace along the main input axis of the graphics objects being displayed in the input zone. 39. A device according to claim 36, wherein the interface unit is configured, once said shifting has been performed, to display a graphics indicator in the input zone to define a region of the input zone adjacent to the current graphics object; and
wherein, if the detection unit detects the start of input of a subsequent graphics object in said region, the storage unit is configured to store the graphics data of the subsequent graphics object throughout the time it is being input in association with the graphics data of the first data group. 40. A device according to claim 36, wherein the interface unit is configured, once said shifting has been performed, to display a graphics indicator in the input zone to define a region of the input zone adjacent to the current graphics object; and
wherein, if the detection unit detects a start of input of a subsequent graphics object outside said region, the storage unit is configured to store the graphics data of the subsequent graphics object throughout the time it is being input in a second data group independent of said first data group. 41. A device according to claim 39, wherein, if the interface unit detects the start of the subsequent graphics object being input outside said region of the input zone, the insertion unit confirms said selected string. 42. A device according to 41, wherein the processor module is configured, after a second predetermined duration measured from said confirmation, to cause the current graphics object to be displayed in block characters, the storage means conserving said first data group in memory during said first predetermined duration. 43. A device according to claim 39, wherein the graphics indicator represents an empty space in the input zone between the current graphics object and an unused portion of the input zone. 44. A device according to claim 35, wherein each said graphics object represents a handwritten symbol. 45. A device according to claim 35, wherein, in order to edit a graphics object, the processor module enables the user to use the touch screen to select said graphics object for editing. 46. A device according to claim 45, wherein said selection is performed by pressing a point of contact against the touch screen on the graphics object to be edited, said selection causing the corresponding string inserted in the entry field to be selected as the active string. 47. An input method performed by an input device suitable for being used by a user to enter symbols into an entry field of an application that can be executed on said device, the device comprising an interface having a touch screen, said interface enabling graphics objects to be input manually and displayed in an input zone of said screen, the method comprising processing of graphics objects, said processing comprising for each current graphics object:
detecting a start and an end of said current graphics object being input in said input zone; on detecting a start of said current graphics object being input, storing graphics data corresponding to said current graphics object throughout the time it is being input; generating candidate strings of at least one symbol from said graphics data, each of said candidate strings being associated with a pertinence value representative of the pertinence of said candidate string relative to said graphics data; and inserting in said entry field a said string as selected from among said candidate strings as a function of its pertinence; and storing in memory, in association with said graphics data, said candidate strings and their associated pertinence values, together with an identifier of said selected string, said association forming a first data group, and conserving said first data group in memory during a first predetermined duration; editing a string being displayed in the entry field, the data group of said edited string being modified and stored in response to said editing. 48. A computer program including instructions for executing steps of a configuration method according to claim 47 when said program is executed by a computer. 49. A computer readable data medium storing a computer program including instructions for executing steps of a configuration method according to claim 47. | 2,100 |
5,748 | 5,748 | 14,460,713 | 2,194 | A system, method, apparatus, and computer program product for generating a cabling plan for a computing system are disclosed. A method may include accessing an elevation plan defining a respective mount position for each of a set of components of the computing system. The method may also include determining one or more port pairs to be used for interconnecting the plurality of components. The method may further include determining, for each port pair, a cable length to use to connect the port pair. The cable length may be determined based at least in part on mount positions defined by the elevation plan for the two components connected by the port pair. The method may additionally include generating a cabling plan defining the cable length to use to connect each respective port pair. | 1. A method for generating a cabling plan for a computing system, the method comprising:
accessing an elevation plan defining a respective mount position for each of a plurality of components of the computing system within one or more racks; determining one or more port pairs to be used for interconnecting the plurality of components, wherein each port pair of the one or more port pairs comprises a pair of ports for connecting two components of the plurality of components; determining, for each port pair of the one or more port pairs, a cable length to use to connect the pair of ports in the port pair, wherein the cable length is determined based at least in part on mount positions defined by the elevation plan for the two components connected by the port pair; and generating a cabling plan defining, for each port pair of the one or more port pairs, the cable length to use to connect the pair of ports in the port pair, wherein the method is performed by processing circuitry. 2. The method of claim 1, wherein the computing system is a converged infrastructure comprising one or more compute layer components, one or more storage layer components, and one or more network layer components. 3. The method of claim 1, wherein:
each port pair of the one or more port pairs has an associated cable type for connecting the pair of ports in the port pair; and the cabling plan further defines, for each port pair of the one or more port pairs, the associated cable type for the port pair. 4. The method of claim 3, wherein the associated cable type is selected from the group consisting of Category 6 (Cat 6) cable, Category 5 (Cat 5) cable, Twinaxial (Twinax) cable, and Serial Attached Small Computer System Interface (SAS) cable. 5. The method of claim 1, wherein determining the cable length for each port pair of the one or more port pairs comprises:
determining, based at least in part on mount positions defined by the elevation plan for the two components connected by the port pair, a minimum cable length needed to connect the pair of ports in the port pair; and determining a shortest cable length from a plurality of available cable lengths satisfying the minimum cable length. 6. The method of claim 1, further comprising, for each of at least one port pair of the one or more port pairs:
determining a horizontal distance between a position of a first port in the port pair and a vertical routing position at which a cable connecting the first port and a second port in the port pair will be routed vertically from a mount position of a component on which the first port is implemented toward a mount position of a component on which the second port is implemented; and determining the cable length to use to connect the pair of ports in the port pair further based on the horizontal distance. 7. The method of claim 6, wherein the first port has a predefined association with a horizontal routing direction specifying a horizontal direction in which a cable connected to the first port should be routed, and wherein determining the horizontal distance comprises determining the horizontal distance in accordance with the horizontal routing direction. 8. The method of claim 6, wherein the horizontal distance comprises one or more of:
a horizontal distance between the position of the first port and a side of a rack including the mount position of the component on which the first port is implemented; and a horizontal distance between the position of the first port and a location of a cable channel usable for vertically routing cables within the rack including the mount position of the component on which the first port is implemented. 9. A computer program product comprising at least one non-transitory computer-readable storage medium having program instructions stored thereon, which when executed by at least one processor, cause the at least one processor to perform a method for generating a cabling plan for a computing system, the method comprising:
accessing an elevation plan defining a respective mount position for each of a plurality of components of the computing system within one or more racks; determining one or more port pairs to be used for interconnecting the plurality of components, wherein each port pair of the one or more port pairs comprises a pair of ports for connecting two components of the plurality of components; determining, for each port pair of the one or more port pairs, a cable length to use to connect the pair of ports in the port pair, wherein the cable length is determined based at least in part on mount positions defined by the elevation plan for the two components connected by the port pair; and generating a cabling plan defining, for each port pair of the one or more port pairs, the cable length to use to connect the pair of ports in the port pair. 10. The computer program product of claim 9, wherein the computing system is a converged infrastructure comprising one or more compute layer components, one or more storage layer components, and one or more network layer components. 11. The computer program product of claim 9, wherein:
each port pair of the one or more port pairs has an associated cable type for connecting the pair of ports in the port pair; and the cabling plan further defines, for each port pair of the one or more port pairs, the associated cable type for the port pair. 12. The computer program product of claim 9, wherein generating the cabling plan comprises generating an electronic output file specifying the cabling plan. 13. The computer program product of claim 9, wherein determining the cable length for each port pair of the one or more port pairs comprises:
determining, based at least in part on mount positions defined by the elevation plan for the two components connected by the port pair, a minimum cable length needed to connect the pair of ports in the port pair; and determining a shortest cable length from a plurality of available cable lengths satisfying the minimum cable length. 14. The computer program product of claim 9, wherein the method further comprises, for each of at least one port pair of the one or more port pairs:
determining a horizontal distance between a position of a first port in the port pair and a vertical routing position at which a cable connecting the first port and a second port in the port pair will be routed vertically from a mount position of a component on which the first port is implemented toward a mount position of a component on which the second port is implemented; and determining the cable length to use to connect the pair of ports in the port pair further based on the horizontal distance. 15. The computer program product of claim 14, wherein the first port has a predefined association with a horizontal routing direction specifying a horizontal direction in which a cable connected to the first port should be routed, and wherein determining the horizontal distance comprises determining the horizontal distance in accordance with the horizontal routing direction. 16. The computer program product of claim 14, wherein the horizontal distance comprises one or more of:
a horizontal distance between the position of the first port and a side of a rack including the mount position of the component on which the first port is implemented; and a horizontal distance between the position of the first port and a location of a cable channel usable for vertically routing cables within the rack including the mount position of the component on which the first port is implemented. 17. A system for generating a cabling plan for a computing system, the system comprising:
at least one processor; and at least one memory storing computer program code, wherein the at least one memory and stored computer program code are configured, with the at least one processor, to cause the system to at least:
access an elevation plan defining a respective mount position for each of a plurality of components of a computing system within one or more racks;
determine one or more port pairs to be used for interconnecting the plurality of components, wherein each port pair of the one or more port pairs comprises a pair of ports for connecting two components of the plurality of components;
determine, for each port pair of the one or more port pairs, a cable length to use to connect the pair of ports in the port pair, wherein the cable length is determined based at least in part on mount positions defined by the elevation plan for the two components connected by the port pair; and
generate a cabling plan defining, for each port pair of the one or more port pairs, the cable length to use to connect the pair of ports in the port pair. 18. The system of claim 17, wherein:
each port pair of the one or more port pairs has an associated cable type for connecting the pair of ports in the port pair; and the cabling plan further defines, for each port pair of the one or more port pairs, the associated cable type for the port pair. 19. The system of claim 17, wherein the at least one memory and stored computer program code are configured, with the at least one processor, to further cause the system to determine the cable length for each port pair of the one or more port pairs at least in party by:
determining, based at least in part on mount positions defined by the elevation plan for the two components connected by the port pair, a minimum cable length needed to connect the pair of ports in the port pair; and determining a shortest cable length from a plurality of available cable lengths satisfying the minimum cable length. 20. The system of claim 17, wherein the at least one memory and stored computer program code are configured, with the at least one processor, to further cause the system, for each of at least one port pair of the one or more port pairs, to:
determine a horizontal distance between a position of a first port in the port pair and a vertical routing position at which a cable connecting the first port and a second port in the port pair will be routed vertically from a mount position of a component on which the first port is implemented toward a mount position of a component on which the second port is implemented; and determine the cable length to use to connect the pair of ports in the port pair further based on the horizontal distance. | A system, method, apparatus, and computer program product for generating a cabling plan for a computing system are disclosed. A method may include accessing an elevation plan defining a respective mount position for each of a set of components of the computing system. The method may also include determining one or more port pairs to be used for interconnecting the plurality of components. The method may further include determining, for each port pair, a cable length to use to connect the port pair. The cable length may be determined based at least in part on mount positions defined by the elevation plan for the two components connected by the port pair. The method may additionally include generating a cabling plan defining the cable length to use to connect each respective port pair.1. A method for generating a cabling plan for a computing system, the method comprising:
accessing an elevation plan defining a respective mount position for each of a plurality of components of the computing system within one or more racks; determining one or more port pairs to be used for interconnecting the plurality of components, wherein each port pair of the one or more port pairs comprises a pair of ports for connecting two components of the plurality of components; determining, for each port pair of the one or more port pairs, a cable length to use to connect the pair of ports in the port pair, wherein the cable length is determined based at least in part on mount positions defined by the elevation plan for the two components connected by the port pair; and generating a cabling plan defining, for each port pair of the one or more port pairs, the cable length to use to connect the pair of ports in the port pair, wherein the method is performed by processing circuitry. 2. The method of claim 1, wherein the computing system is a converged infrastructure comprising one or more compute layer components, one or more storage layer components, and one or more network layer components. 3. The method of claim 1, wherein:
each port pair of the one or more port pairs has an associated cable type for connecting the pair of ports in the port pair; and the cabling plan further defines, for each port pair of the one or more port pairs, the associated cable type for the port pair. 4. The method of claim 3, wherein the associated cable type is selected from the group consisting of Category 6 (Cat 6) cable, Category 5 (Cat 5) cable, Twinaxial (Twinax) cable, and Serial Attached Small Computer System Interface (SAS) cable. 5. The method of claim 1, wherein determining the cable length for each port pair of the one or more port pairs comprises:
determining, based at least in part on mount positions defined by the elevation plan for the two components connected by the port pair, a minimum cable length needed to connect the pair of ports in the port pair; and determining a shortest cable length from a plurality of available cable lengths satisfying the minimum cable length. 6. The method of claim 1, further comprising, for each of at least one port pair of the one or more port pairs:
determining a horizontal distance between a position of a first port in the port pair and a vertical routing position at which a cable connecting the first port and a second port in the port pair will be routed vertically from a mount position of a component on which the first port is implemented toward a mount position of a component on which the second port is implemented; and determining the cable length to use to connect the pair of ports in the port pair further based on the horizontal distance. 7. The method of claim 6, wherein the first port has a predefined association with a horizontal routing direction specifying a horizontal direction in which a cable connected to the first port should be routed, and wherein determining the horizontal distance comprises determining the horizontal distance in accordance with the horizontal routing direction. 8. The method of claim 6, wherein the horizontal distance comprises one or more of:
a horizontal distance between the position of the first port and a side of a rack including the mount position of the component on which the first port is implemented; and a horizontal distance between the position of the first port and a location of a cable channel usable for vertically routing cables within the rack including the mount position of the component on which the first port is implemented. 9. A computer program product comprising at least one non-transitory computer-readable storage medium having program instructions stored thereon, which when executed by at least one processor, cause the at least one processor to perform a method for generating a cabling plan for a computing system, the method comprising:
accessing an elevation plan defining a respective mount position for each of a plurality of components of the computing system within one or more racks; determining one or more port pairs to be used for interconnecting the plurality of components, wherein each port pair of the one or more port pairs comprises a pair of ports for connecting two components of the plurality of components; determining, for each port pair of the one or more port pairs, a cable length to use to connect the pair of ports in the port pair, wherein the cable length is determined based at least in part on mount positions defined by the elevation plan for the two components connected by the port pair; and generating a cabling plan defining, for each port pair of the one or more port pairs, the cable length to use to connect the pair of ports in the port pair. 10. The computer program product of claim 9, wherein the computing system is a converged infrastructure comprising one or more compute layer components, one or more storage layer components, and one or more network layer components. 11. The computer program product of claim 9, wherein:
each port pair of the one or more port pairs has an associated cable type for connecting the pair of ports in the port pair; and the cabling plan further defines, for each port pair of the one or more port pairs, the associated cable type for the port pair. 12. The computer program product of claim 9, wherein generating the cabling plan comprises generating an electronic output file specifying the cabling plan. 13. The computer program product of claim 9, wherein determining the cable length for each port pair of the one or more port pairs comprises:
determining, based at least in part on mount positions defined by the elevation plan for the two components connected by the port pair, a minimum cable length needed to connect the pair of ports in the port pair; and determining a shortest cable length from a plurality of available cable lengths satisfying the minimum cable length. 14. The computer program product of claim 9, wherein the method further comprises, for each of at least one port pair of the one or more port pairs:
determining a horizontal distance between a position of a first port in the port pair and a vertical routing position at which a cable connecting the first port and a second port in the port pair will be routed vertically from a mount position of a component on which the first port is implemented toward a mount position of a component on which the second port is implemented; and determining the cable length to use to connect the pair of ports in the port pair further based on the horizontal distance. 15. The computer program product of claim 14, wherein the first port has a predefined association with a horizontal routing direction specifying a horizontal direction in which a cable connected to the first port should be routed, and wherein determining the horizontal distance comprises determining the horizontal distance in accordance with the horizontal routing direction. 16. The computer program product of claim 14, wherein the horizontal distance comprises one or more of:
a horizontal distance between the position of the first port and a side of a rack including the mount position of the component on which the first port is implemented; and a horizontal distance between the position of the first port and a location of a cable channel usable for vertically routing cables within the rack including the mount position of the component on which the first port is implemented. 17. A system for generating a cabling plan for a computing system, the system comprising:
at least one processor; and at least one memory storing computer program code, wherein the at least one memory and stored computer program code are configured, with the at least one processor, to cause the system to at least:
access an elevation plan defining a respective mount position for each of a plurality of components of a computing system within one or more racks;
determine one or more port pairs to be used for interconnecting the plurality of components, wherein each port pair of the one or more port pairs comprises a pair of ports for connecting two components of the plurality of components;
determine, for each port pair of the one or more port pairs, a cable length to use to connect the pair of ports in the port pair, wherein the cable length is determined based at least in part on mount positions defined by the elevation plan for the two components connected by the port pair; and
generate a cabling plan defining, for each port pair of the one or more port pairs, the cable length to use to connect the pair of ports in the port pair. 18. The system of claim 17, wherein:
each port pair of the one or more port pairs has an associated cable type for connecting the pair of ports in the port pair; and the cabling plan further defines, for each port pair of the one or more port pairs, the associated cable type for the port pair. 19. The system of claim 17, wherein the at least one memory and stored computer program code are configured, with the at least one processor, to further cause the system to determine the cable length for each port pair of the one or more port pairs at least in party by:
determining, based at least in part on mount positions defined by the elevation plan for the two components connected by the port pair, a minimum cable length needed to connect the pair of ports in the port pair; and determining a shortest cable length from a plurality of available cable lengths satisfying the minimum cable length. 20. The system of claim 17, wherein the at least one memory and stored computer program code are configured, with the at least one processor, to further cause the system, for each of at least one port pair of the one or more port pairs, to:
determine a horizontal distance between a position of a first port in the port pair and a vertical routing position at which a cable connecting the first port and a second port in the port pair will be routed vertically from a mount position of a component on which the first port is implemented toward a mount position of a component on which the second port is implemented; and determine the cable length to use to connect the pair of ports in the port pair further based on the horizontal distance. | 2,100 |
5,749 | 5,749 | 15,443,220 | 2,178 | A method includes determining dimensions of a web browser presenting a webpage, the webpage including an inner container and an outer container. The method modifies dimensions of the outer container of the webpage based upon an associated maximum height value, an associated minimum height value, and an amount of data within the outer container. Responsive to calculating a vertical height of the inner container, assigning a maximum height value and a minimum height value to the inner container. The method modifies dimensions of the inner container to a minimum height for the web browser to present the data of the webpage, based on the assigned maximum height value and minimum height value of the inner container. The method augments the web browser to include a scrollbar based on the modified dimensions of the outer container and the modified dimensions of the inner container. | 1. A method for calculating a space on a web browser for a scrollbar, the method comprising:
determining, by one or more processors, dimensions of a web browser presenting a webpage, the webpage including an inner container and an outer container; modifying, by one or more processors, dimensions of the outer container of the webpage based upon an associated maximum height value, an associated minimum height value, and an amount of data within the outer container; responsive to calculating a vertical height of the inner container, assigning, by one or more processors, a maximum height value and a minimum height value to the inner container; modifying, by one or more processors, dimensions of the inner container to a minimum height for the web browser to present the data of the webpage, based on the assigned maximum height value and minimum height value of the inner container; and augmenting, by one or more processors, the web browser to include a scrollbar based on the modified dimensions of the outer container and the modified dimensions of the inner container. 2. The method of claim 1, wherein modifying dimensions of the inner container further comprises:
identifying, by one or more processors, content of the webpage in the inner container; and augmenting, by one or more processors, the content of the webpage in the inner container to include a space to present the scrollbar. 3. The method of claim 1, wherein modifying dimensions of the outer container further comprises:
responsive to determining that the maximum height value for the outer container meets a value threshold for displaying the content of the webpage that is within the outer container, augmenting, by one or more processors, the outer container to display all the content of the webpage that is within the outer container without including a scrollbar in the outer container. 4. The method of claim 1, further comprising:
identifying, by one or more processors, a main working area within the inner container, wherein the main working area includes a data structure, and wherein the main working area is flexible, allowing modifications to the dimensions of main working area; and determining, by one or more processors, available space in the main working area of the inner container. 5. The method of claim 3, further comprising:
responsive to determining that the maximum height value for the inner container meets a value threshold for displaying the content of the webpage that is within the inner container, augmenting, by one or more processors, the inner container to display all the content of the webpage that is within the inner container without including a scrollbar in the inner container. 6. The method of claim 1, wherein modifying dimensions of the outer container further comprise:
determining, by one or more processors, an overflow attribute associated with the outer container, the overflow attribute indicating whether webpage content within the outer container exceeds an available display area of the outer container. 7. The method of claim 1, wherein the scrollbar is displayed in one of: (i) the outer container and (ii) the inner container. 8. A computer program product comprising:
one or more computer readable tangible storage media and program instructions stored on at least one of the one or more storage media, the program instructions comprising: program instructions to determine dimensions of a web browser presenting a webpage, the webpage including an inner container and an outer container; program instructions to, modify dimensions of the outer container of the webpage based upon an associated maximum height value, an associated minimum height value, and an amount of data within the outer container; program instructions to, responsive to calculating a vertical height of the inner container, assign a maximum height value and a minimum height value to the inner container; program instructions to modify dimensions of the inner container to a minimum height for the web browser to present the data of the webpage, based on the assigned maximum height value and minimum height value of the inner container; and program instructions to augment the web browser to include a scrollbar based on the modified dimensions of the outer container and the modified dimensions of the inner container. 9. The computer program product of claim 8, wherein modifying dimensions of the inner container further comprising program instructions, stored on the one or more computer readable storage media, which when executed by a processor, cause the processor to:
identify content of the webpage in the inner container; and augment the content of the webpage in the inner container to include a space to present the scrollbar. 10. The computer program product of claim 8, wherein modifying dimensions of the outer container further comprises:
responsive to determining that the maximum height value for the outer container meets a value threshold for displaying the content of the webpage that is within the outer container, augmenting the outer container to display all the content of the webpage that is within the outer container without including a scrollbar in the outer container. 11. The computer program product of claim 8, further comprising program instructions, stored on the one or more computer readable storage media, which when executed by a processor, cause the processor to:
identify a main working area within the inner container, wherein the main working area includes a data structure, and wherein the main working area is flexible, allowing modifications to the dimensions of main working area; and determine available space in the main working area of the inner container. 12. The computer program product of claim 10, further comprising program instructions, stored on the one or more computer readable storage media, which when executed by a processor, cause the processor to:
responsive to determining that the maximum height value for the inner container meets a value threshold for displaying the content of the webpage that is within the inner container, augmenting the inner container to display all the content of the webpage that is within the inner container without including a scrollbar in the inner container. 13. The computer program product of claim 8, wherein modifying dimensions of the outer container further comprise:
determining an overflow attribute associated with the outer container, the overflow attribute indicating whether webpage content within the outer container exceeds an available display area of the outer container. 14. The computer program product of claim 8, wherein the scrollbar is displayed in one of: (i) the outer container and (ii) the inner container. 15. A computer system comprising:
one or more computer processors; one or more computer readable storage media; and program instructions stored on the computer readable storage media for execution by at least one of the one or more computer processors, the program instructions comprising: program instructions to determine dimensions of a web browser presenting a webpage, the webpage including an inner container and an outer container; program instructions to, modify dimensions of the outer container of the webpage based upon an associated maximum height value, an associated minimum height value, and an amount of data within the outer container; program instructions to, responsive to calculating a vertical height of the inner container, assign a maximum height value and a minimum height value to the inner container; program instructions to modify dimensions of the inner container to a minimum height for the web browser to present the data of the webpage, based on the assigned maximum height value and minimum height value of the inner container; and program instructions to augment the web browser to include a scrollbar based on the modified dimensions of the outer container and the modified dimensions of the inner container. 16. The computer system of claim 8, wherein modifying dimensions of the inner container further comprising program instructions, stored on the one or more computer readable storage media, which when executed by a processor, cause the processor to:
identify content of the webpage in the inner container; and augment the content of the webpage in the inner container to include a space to present the scrollbar. 17. The computer system of claim 8, wherein modifying dimensions of the outer container further comprises:
responsive to determining that the maximum height value for the outer container meets a value threshold for displaying the content of the webpage that is within the outer container, augmenting the outer container to display all the content of the webpage that is within the outer container without including a scrollbar in the outer container. 18. The computer system of claim 8, further comprising program instructions, stored on the one or more computer readable storage media, which when executed by a processor, cause the processor to:
identify a main working area within the inner container, wherein the main working area includes a data structure, and wherein the main working area is flexible, allowing modifications to the dimensions of main working area; and determine available space in the main working area of the inner container. 19. The computer system of claim 10, further comprising program instructions, stored on the one or more computer readable storage media, which when executed by a processor, cause the processor to:
responsive to determining that the maximum height value for the inner container meets a value threshold for displaying the content of the webpage that is within the inner container, augmenting the inner container to display all the content of the webpage that is within the inner container without including a scrollbar in the inner container. 20. The computer system of claim 8, wherein modifying dimensions of the outer container further comprise:
determining an overflow attribute associated with the outer container, the overflow attribute indicating whether webpage content within the outer container exceeds an available display area of the outer container. | A method includes determining dimensions of a web browser presenting a webpage, the webpage including an inner container and an outer container. The method modifies dimensions of the outer container of the webpage based upon an associated maximum height value, an associated minimum height value, and an amount of data within the outer container. Responsive to calculating a vertical height of the inner container, assigning a maximum height value and a minimum height value to the inner container. The method modifies dimensions of the inner container to a minimum height for the web browser to present the data of the webpage, based on the assigned maximum height value and minimum height value of the inner container. The method augments the web browser to include a scrollbar based on the modified dimensions of the outer container and the modified dimensions of the inner container.1. A method for calculating a space on a web browser for a scrollbar, the method comprising:
determining, by one or more processors, dimensions of a web browser presenting a webpage, the webpage including an inner container and an outer container; modifying, by one or more processors, dimensions of the outer container of the webpage based upon an associated maximum height value, an associated minimum height value, and an amount of data within the outer container; responsive to calculating a vertical height of the inner container, assigning, by one or more processors, a maximum height value and a minimum height value to the inner container; modifying, by one or more processors, dimensions of the inner container to a minimum height for the web browser to present the data of the webpage, based on the assigned maximum height value and minimum height value of the inner container; and augmenting, by one or more processors, the web browser to include a scrollbar based on the modified dimensions of the outer container and the modified dimensions of the inner container. 2. The method of claim 1, wherein modifying dimensions of the inner container further comprises:
identifying, by one or more processors, content of the webpage in the inner container; and augmenting, by one or more processors, the content of the webpage in the inner container to include a space to present the scrollbar. 3. The method of claim 1, wherein modifying dimensions of the outer container further comprises:
responsive to determining that the maximum height value for the outer container meets a value threshold for displaying the content of the webpage that is within the outer container, augmenting, by one or more processors, the outer container to display all the content of the webpage that is within the outer container without including a scrollbar in the outer container. 4. The method of claim 1, further comprising:
identifying, by one or more processors, a main working area within the inner container, wherein the main working area includes a data structure, and wherein the main working area is flexible, allowing modifications to the dimensions of main working area; and determining, by one or more processors, available space in the main working area of the inner container. 5. The method of claim 3, further comprising:
responsive to determining that the maximum height value for the inner container meets a value threshold for displaying the content of the webpage that is within the inner container, augmenting, by one or more processors, the inner container to display all the content of the webpage that is within the inner container without including a scrollbar in the inner container. 6. The method of claim 1, wherein modifying dimensions of the outer container further comprise:
determining, by one or more processors, an overflow attribute associated with the outer container, the overflow attribute indicating whether webpage content within the outer container exceeds an available display area of the outer container. 7. The method of claim 1, wherein the scrollbar is displayed in one of: (i) the outer container and (ii) the inner container. 8. A computer program product comprising:
one or more computer readable tangible storage media and program instructions stored on at least one of the one or more storage media, the program instructions comprising: program instructions to determine dimensions of a web browser presenting a webpage, the webpage including an inner container and an outer container; program instructions to, modify dimensions of the outer container of the webpage based upon an associated maximum height value, an associated minimum height value, and an amount of data within the outer container; program instructions to, responsive to calculating a vertical height of the inner container, assign a maximum height value and a minimum height value to the inner container; program instructions to modify dimensions of the inner container to a minimum height for the web browser to present the data of the webpage, based on the assigned maximum height value and minimum height value of the inner container; and program instructions to augment the web browser to include a scrollbar based on the modified dimensions of the outer container and the modified dimensions of the inner container. 9. The computer program product of claim 8, wherein modifying dimensions of the inner container further comprising program instructions, stored on the one or more computer readable storage media, which when executed by a processor, cause the processor to:
identify content of the webpage in the inner container; and augment the content of the webpage in the inner container to include a space to present the scrollbar. 10. The computer program product of claim 8, wherein modifying dimensions of the outer container further comprises:
responsive to determining that the maximum height value for the outer container meets a value threshold for displaying the content of the webpage that is within the outer container, augmenting the outer container to display all the content of the webpage that is within the outer container without including a scrollbar in the outer container. 11. The computer program product of claim 8, further comprising program instructions, stored on the one or more computer readable storage media, which when executed by a processor, cause the processor to:
identify a main working area within the inner container, wherein the main working area includes a data structure, and wherein the main working area is flexible, allowing modifications to the dimensions of main working area; and determine available space in the main working area of the inner container. 12. The computer program product of claim 10, further comprising program instructions, stored on the one or more computer readable storage media, which when executed by a processor, cause the processor to:
responsive to determining that the maximum height value for the inner container meets a value threshold for displaying the content of the webpage that is within the inner container, augmenting the inner container to display all the content of the webpage that is within the inner container without including a scrollbar in the inner container. 13. The computer program product of claim 8, wherein modifying dimensions of the outer container further comprise:
determining an overflow attribute associated with the outer container, the overflow attribute indicating whether webpage content within the outer container exceeds an available display area of the outer container. 14. The computer program product of claim 8, wherein the scrollbar is displayed in one of: (i) the outer container and (ii) the inner container. 15. A computer system comprising:
one or more computer processors; one or more computer readable storage media; and program instructions stored on the computer readable storage media for execution by at least one of the one or more computer processors, the program instructions comprising: program instructions to determine dimensions of a web browser presenting a webpage, the webpage including an inner container and an outer container; program instructions to, modify dimensions of the outer container of the webpage based upon an associated maximum height value, an associated minimum height value, and an amount of data within the outer container; program instructions to, responsive to calculating a vertical height of the inner container, assign a maximum height value and a minimum height value to the inner container; program instructions to modify dimensions of the inner container to a minimum height for the web browser to present the data of the webpage, based on the assigned maximum height value and minimum height value of the inner container; and program instructions to augment the web browser to include a scrollbar based on the modified dimensions of the outer container and the modified dimensions of the inner container. 16. The computer system of claim 8, wherein modifying dimensions of the inner container further comprising program instructions, stored on the one or more computer readable storage media, which when executed by a processor, cause the processor to:
identify content of the webpage in the inner container; and augment the content of the webpage in the inner container to include a space to present the scrollbar. 17. The computer system of claim 8, wherein modifying dimensions of the outer container further comprises:
responsive to determining that the maximum height value for the outer container meets a value threshold for displaying the content of the webpage that is within the outer container, augmenting the outer container to display all the content of the webpage that is within the outer container without including a scrollbar in the outer container. 18. The computer system of claim 8, further comprising program instructions, stored on the one or more computer readable storage media, which when executed by a processor, cause the processor to:
identify a main working area within the inner container, wherein the main working area includes a data structure, and wherein the main working area is flexible, allowing modifications to the dimensions of main working area; and determine available space in the main working area of the inner container. 19. The computer system of claim 10, further comprising program instructions, stored on the one or more computer readable storage media, which when executed by a processor, cause the processor to:
responsive to determining that the maximum height value for the inner container meets a value threshold for displaying the content of the webpage that is within the inner container, augmenting the inner container to display all the content of the webpage that is within the inner container without including a scrollbar in the inner container. 20. The computer system of claim 8, wherein modifying dimensions of the outer container further comprise:
determining an overflow attribute associated with the outer container, the overflow attribute indicating whether webpage content within the outer container exceeds an available display area of the outer container. | 2,100 |
5,750 | 5,750 | 15,422,862 | 2,182 | Mathematical functions are computed in a single pipeline performing a polynomial approximation (e.g. a quadratic approximation, or the like) using data tables. The single pipeline is operable for computing at least one of RCP, SQRT, EXP or LOG functions according to the one or more opcodes. SIN and COS are also computed using the pipeline according to the approximation ((−1)̂IntX)*Sin(π*Min(FracX, 1.0−FracX)/Min(FracX, 1.0−FracX). A pipeline portion approximates Sin(π*FracX) using tables and interpolation and a subsequent stage multiplies this approximation by FracX. For input arguments of x close 1.0. LOG 2(x−1)/(x−1) is computed using a first pipeline portion using tables and interpolation and subsequently multiplied by (x−1). A DIV operation may also be performed with input arguments scaled up to avoid underflow as needed. An approach for computing X̂Y is also disclosed. | 1. A method for calculating X̂Y comprising:
(i) calculating, by an electronic device, a first transcendental function taking as an input a function of X, the transcendental function outputting M1H, M1L and M2, wherein M2 has a first precision and M1H and M1L combined have a second precision greater than the first precision;
(ii) calculating, by the electronic device, KH and KL according to a product of M1H and M2 and a product of M1L and M2;
(iii) calculating, by the electronic device, a product of (a) a function of Y and (b) both KH and KL to obtain a high significance output TH and low significance output TL;
(iv) calculating, by the electronic device, a second transcendental function according to a function of TH and TL to obtain an output that is an estimation of X̂Y. 2. The method of claim 1, further comprising performing (ii) using a two element dot product (Dp2) circuit. 3. The method of claim 2, wherein the Dp2 circuit produces KH and KL such that KH and KL each have precision as great as M2. 4. The method of claim 1, wherein X if a floating point number having an exponent k and a mantissa s, the method further comprising:
calculating, by the electronic device, p=s≥0.5?(1+s)/2:(1+s); calculating, by the electronic circuit, M2 as 1−p; calculating, by the electronic circuit, {M1H, M1L} as (Log 2(1−p))/(1−p), such that M1H is a high significance portion of a result of ((Log 2(1−p))/(1−p) and M1L is a low significance portion of a result of ((Log 2(1−p))/(1−p); calculating, by the electronic circuit, n=s≥0.5?k+1:k; and calculating, by the electronic circuit, {KH, KL}=n*1.0+M1H*M2+M1L*M2 such that KH is a high significance portion of a result of n*1.0+M1H*M2+M1L*M2 and KL is a low significance portion of n*1.0+M1H*M2+M1L*M2. 5. The method of claim 4, wherein calculating (Log 2(1−p))/(1−p) is performed by the electronic circuit using a table. 6. The method of claim 5, wherein calculating n*1.0+M1H*M2+M1L*M2 is performed using a three element dot product (Dp3) circuit. 7. The method of claim 6, wherein KH and KL have precision as great as M2. 8. The method of claim 1, wherein M1L has fewer bits of precision than M1H. 9. The method of claim 1, wherein M1H has 24 bits of precision and M1L has 6 bits of precision. 10. The method of claim 1, wherein the function of Y and the function of X are defined according to Table 1. 11. The method of claim 10, further comprising determining a sign value according to X and Y as defined in Table 1, the method further comprising setting, by the external device, a sign of the output from the second transcendental function according to the sign value. 12. The method of claim 1, wherein calculating the second transcendental function according to the function of TH and TL comprises:
obtaining, by the electronic device, TH_Int as an integer portion of TH; obtaining, by the electronic device, TH_Frac as a fractional portion of TH; combining, by the electronic device, TH_Frac and TL to obtain T_All_Frac; and inputting, by the electronic device, TH_Frac and T_All_Frac into the second transcendental function to obtain the estimation of X̂Y. 13. An electronic device for calculating X̂Y comprising:
(i) a first transcendental function stage programmed to take as an input a function of X and outputting M1H, M1L and M2, wherein M2 has a first precision and M1H and M1L combined have a second precision greater than the first precision;
(ii) a first dot product stage programmed to output KH and KL according to a product of M1H and M2 and a product of M1L and M2;
(iii) a second dot product stage programmed to calculate a product of (a) a function of Y and (b) both KH and KL to obtain a high significance output TH and low significance output TL;
(iv) a second transcendental function stage programmed to take as inputs a function of TH and TL and output an estimation of X̂Y. 14. The electronic device of claim 13, wherein:
the first dot product stage comprises a two element dot product (Dp2) circuit; and the Dp2 circuit is programmed to output KH and KL such that KH and KL each have precision as great as M2. 15. The electronic device of claim 13, wherein X if a floating point number having an exponent k and a mantissa s, the electronic device is further programmed to:
calculate p=s≥0.5?(1+s)/2:(1+s); calculate M2 as 1−p; calculate {M1H, M1L} as (Log 2(1−p))/(1−p), such that M1H is a high significance portion of a result of ((Log 2(1−p))/(1−p) and M1L is a low significance portion of a result of ((Log 2(1−p))/(1−p), where Log 2(1−p) is implemented using the first transcendental function stage; calculate n=s≥0.5?k+1:k; and calculate {KH, KL}=n*1.0+M1H*M2+M1L*M2 such that KH is a high significance portion of a result of n*1.0+M1H*M2+M1L*M2 and KL is a low significance portion of n*1.0+M1H*M2+M1L*M2. 16. The electronic device of claim 15, wherein the first transcendental function is implemented using a table. 17. The electronic device of claim 13, wherein M1L has fewer bits of precision than M1H. 18. The electronic device of claim 13, wherein the first dot product stage and the second dot product stage are implemented using one or more four element dot product (Dp4) circuits. 19. The electronic device of claim 13, wherein:
the electronic device is further programmed to calculate the function of X and the function of Y according to Table 1; and the electronic device is further programmed to determine a sign value according to X and Y according to Table 1 and to set a sign of the output from the second transcendental function stage according to the sign value. 20. The electronic device of claim 13, wherein the electronic device is further programmed to calculate the function of TH and TL by:
obtaining TH_Int as an integer portion of TH; obtaining TH_Frac as a fractional portion of TH; combining TH_Frac and TL to obtain T_All_Frac; and inputting TH_Frac and T_All_Frac into the second transcendental function stage. | Mathematical functions are computed in a single pipeline performing a polynomial approximation (e.g. a quadratic approximation, or the like) using data tables. The single pipeline is operable for computing at least one of RCP, SQRT, EXP or LOG functions according to the one or more opcodes. SIN and COS are also computed using the pipeline according to the approximation ((−1)̂IntX)*Sin(π*Min(FracX, 1.0−FracX)/Min(FracX, 1.0−FracX). A pipeline portion approximates Sin(π*FracX) using tables and interpolation and a subsequent stage multiplies this approximation by FracX. For input arguments of x close 1.0. LOG 2(x−1)/(x−1) is computed using a first pipeline portion using tables and interpolation and subsequently multiplied by (x−1). A DIV operation may also be performed with input arguments scaled up to avoid underflow as needed. An approach for computing X̂Y is also disclosed.1. A method for calculating X̂Y comprising:
(i) calculating, by an electronic device, a first transcendental function taking as an input a function of X, the transcendental function outputting M1H, M1L and M2, wherein M2 has a first precision and M1H and M1L combined have a second precision greater than the first precision;
(ii) calculating, by the electronic device, KH and KL according to a product of M1H and M2 and a product of M1L and M2;
(iii) calculating, by the electronic device, a product of (a) a function of Y and (b) both KH and KL to obtain a high significance output TH and low significance output TL;
(iv) calculating, by the electronic device, a second transcendental function according to a function of TH and TL to obtain an output that is an estimation of X̂Y. 2. The method of claim 1, further comprising performing (ii) using a two element dot product (Dp2) circuit. 3. The method of claim 2, wherein the Dp2 circuit produces KH and KL such that KH and KL each have precision as great as M2. 4. The method of claim 1, wherein X if a floating point number having an exponent k and a mantissa s, the method further comprising:
calculating, by the electronic device, p=s≥0.5?(1+s)/2:(1+s); calculating, by the electronic circuit, M2 as 1−p; calculating, by the electronic circuit, {M1H, M1L} as (Log 2(1−p))/(1−p), such that M1H is a high significance portion of a result of ((Log 2(1−p))/(1−p) and M1L is a low significance portion of a result of ((Log 2(1−p))/(1−p); calculating, by the electronic circuit, n=s≥0.5?k+1:k; and calculating, by the electronic circuit, {KH, KL}=n*1.0+M1H*M2+M1L*M2 such that KH is a high significance portion of a result of n*1.0+M1H*M2+M1L*M2 and KL is a low significance portion of n*1.0+M1H*M2+M1L*M2. 5. The method of claim 4, wherein calculating (Log 2(1−p))/(1−p) is performed by the electronic circuit using a table. 6. The method of claim 5, wherein calculating n*1.0+M1H*M2+M1L*M2 is performed using a three element dot product (Dp3) circuit. 7. The method of claim 6, wherein KH and KL have precision as great as M2. 8. The method of claim 1, wherein M1L has fewer bits of precision than M1H. 9. The method of claim 1, wherein M1H has 24 bits of precision and M1L has 6 bits of precision. 10. The method of claim 1, wherein the function of Y and the function of X are defined according to Table 1. 11. The method of claim 10, further comprising determining a sign value according to X and Y as defined in Table 1, the method further comprising setting, by the external device, a sign of the output from the second transcendental function according to the sign value. 12. The method of claim 1, wherein calculating the second transcendental function according to the function of TH and TL comprises:
obtaining, by the electronic device, TH_Int as an integer portion of TH; obtaining, by the electronic device, TH_Frac as a fractional portion of TH; combining, by the electronic device, TH_Frac and TL to obtain T_All_Frac; and inputting, by the electronic device, TH_Frac and T_All_Frac into the second transcendental function to obtain the estimation of X̂Y. 13. An electronic device for calculating X̂Y comprising:
(i) a first transcendental function stage programmed to take as an input a function of X and outputting M1H, M1L and M2, wherein M2 has a first precision and M1H and M1L combined have a second precision greater than the first precision;
(ii) a first dot product stage programmed to output KH and KL according to a product of M1H and M2 and a product of M1L and M2;
(iii) a second dot product stage programmed to calculate a product of (a) a function of Y and (b) both KH and KL to obtain a high significance output TH and low significance output TL;
(iv) a second transcendental function stage programmed to take as inputs a function of TH and TL and output an estimation of X̂Y. 14. The electronic device of claim 13, wherein:
the first dot product stage comprises a two element dot product (Dp2) circuit; and the Dp2 circuit is programmed to output KH and KL such that KH and KL each have precision as great as M2. 15. The electronic device of claim 13, wherein X if a floating point number having an exponent k and a mantissa s, the electronic device is further programmed to:
calculate p=s≥0.5?(1+s)/2:(1+s); calculate M2 as 1−p; calculate {M1H, M1L} as (Log 2(1−p))/(1−p), such that M1H is a high significance portion of a result of ((Log 2(1−p))/(1−p) and M1L is a low significance portion of a result of ((Log 2(1−p))/(1−p), where Log 2(1−p) is implemented using the first transcendental function stage; calculate n=s≥0.5?k+1:k; and calculate {KH, KL}=n*1.0+M1H*M2+M1L*M2 such that KH is a high significance portion of a result of n*1.0+M1H*M2+M1L*M2 and KL is a low significance portion of n*1.0+M1H*M2+M1L*M2. 16. The electronic device of claim 15, wherein the first transcendental function is implemented using a table. 17. The electronic device of claim 13, wherein M1L has fewer bits of precision than M1H. 18. The electronic device of claim 13, wherein the first dot product stage and the second dot product stage are implemented using one or more four element dot product (Dp4) circuits. 19. The electronic device of claim 13, wherein:
the electronic device is further programmed to calculate the function of X and the function of Y according to Table 1; and the electronic device is further programmed to determine a sign value according to X and Y according to Table 1 and to set a sign of the output from the second transcendental function stage according to the sign value. 20. The electronic device of claim 13, wherein the electronic device is further programmed to calculate the function of TH and TL by:
obtaining TH_Int as an integer portion of TH; obtaining TH_Frac as a fractional portion of TH; combining TH_Frac and TL to obtain T_All_Frac; and inputting TH_Frac and T_All_Frac into the second transcendental function stage. | 2,100 |
5,751 | 5,751 | 13,161,812 | 2,166 | A new approach is proposed that contemplates systems and methods to provide a ranking of subjects or objects identified as results of a search, where “topicality specialization” and “relative topicality specialization” of the objects is computed and considered. The relative topicality specialization of an object is a function of the share of citations for the object matching the query term among all citations for all objects matching the query term. The computation of the topicality specialization and the relative topicality specialization for objects allow the identification of “specialized objects” for “topics” without any pre-defined categorization of topics or pre-computation of expertise. | 1. A system, comprising:
a citation search engine, which in operation, retrieves a plurality of citations composed by a plurality of subjects citing a plurality of objects that fit one or more search criteria; an influence evaluation engine, which in operation, computes relative topicality specialization of the plurality of objects cited by the plurality of citations; an object/subject selection engine, which in operation,
ranks the cited objects of the plurality of citations using the relative topicality specialization of the objects;
selects objects as the search result for the user based on the matching of the objects with the search criteria as well as the relative topicality specialization of the cited objects. 2. The system of claim 1, wherein:
each of the plurality of subjects has an opinion wherein expression of the opinion is explicit, expressed, implicit, or imputed through any other technique. 3. The system of claim 1, wherein:
each of the plurality of subjects is one of: representation of a person, web log, and entities representing Internet authors or users of social media services, user of microblogging services, users of social networks, reviewer who provides expressions of opinion, reviews, or other information useful for the estimation of influence. 4. The system of claim 1, wherein:
each of the plurality of objects is one of: Internet web sites, blogs, videos, books, films, music, image, video, documents, data files, objects for sale, objects that are reviewed or recommended or cited, subjects/authors, natural or legal persons, citations, or any entities that are associated with a Uniform Resource Identifier (URI). 5. The system of claim 1, wherein:
each of the plurality of citations describes an opinion by a subject on an object matching the search criteria in the search result. 6. The system of claim 1, wherein:
each of the plurality of citations includes one or more of: expression of opinions on the objects, expressions of authors in the form of Tweets, blog posts, reviews of objects on Internet web sites Wikipedia entries, postings to social media, postings to websites, postings in the form of reviews, recommendations, or any other form of citation made to mailing lists, newsgroups, discussion forums, comments to websites or any other form of Internet publication. 7. The system of claim 1, wherein:
the citation search engine enables a citation centric search process that focuses on influence of the plurality subjects that cite the plurality of objects. 8. The system of claim 1, wherein:
the citation search engine accepts and enforces a plurality of criteria on citation searching, retrieving and ranking, each of which is either be explicitly described by a user or best guessed by the system based on internal statistical data. 9. The system of claim 1, wherein:
the relative topicality specialization of an object is a function of the share of citations for the object matching the search criteria among all citations for all objects matching the search criteria. 10. The system of claim 1, wherein:
the influence evaluation engine computes relative topicality specialization of an object as a measure of the object's specialization in a topic relative to a larger population of multiple objects. 11. The system of claim 1, wherein:
the influence evaluation engine weighs the relative topicality specialization by the ratio of all citations for the object to all citations for all objects. 12. The system of claim 11, wherein:
the influence evaluation engine weighs the relative topicality specialization for the object by the influence scores for citations matching the query term. 13. The system of claim 11, wherein:
the influence evaluation engine weighs the relative topicality specialization for the object by the influence scores of subjects for all citations of the object. 14. The system of claim 1, wherein:
influence evaluation engine adopts a semantic graph of related terms, which allows the “match to query term” used for topicality specialization to be broader than a match of the query term itself. 15. The system of claim 1, wherein:
object/subject selection engine ranks the objects in the search result based on one or more of: a ranking function of the citations for the object matching the search query, the influence of the subjects of each matching citation, and the topicality specialization or relative topicality specialization on the query term for each of the objects, among other ranking criteria. 16. A system, comprising:
a citation search engine, which in operation, retrieves a plurality of citations composed by a plurality of subjects citing a plurality of objects that fit one or more search criteria; an influence evaluation engine, which in operation, computes relative topicality specialization of the plurality of objects cited by the plurality of citations; an object/subject selection engine, which in operation,
ranks the citing subjects of the plurality of citations using the relative topicality specialization of the objects;
selects subjects as the search result for the user based on influence scores of the citing subjects and/or the relative topicality specialization of the cited objects. 17. A method, comprising:
retrieving a plurality of citations composed by a plurality of subjects citing a plurality of objects that fit the search criteria; computing relative topicality specialization of the plurality of objects cited by the plurality of citations, wherein the relative topicality specialization of an object is a function of the share of citations for the object matching the search criteria among all citations for all objects matching the search criteria; ranking the cited objects of the plurality of citations using the relative topicality specialization of the objects; selecting objects as the search result for the user based on the matching of the objects with the search criteria as well as the relative topicality specialization of the cited objects. 18. The method of claim 17, further comprising:
enabling a citation centric search process that focuses on influence of the plurality subjects that cite the plurality of objects. 19. The method of claim 17, further comprising:
accepting and enforcing a plurality of criteria on citation searching, retrieving and ranking, each of which is either be explicitly described by a user or best guessed by the system based on internal statistical data. 20. The method of claim 17, further comprising:
computing relative topicality specialization of an object as a measure of the object's specialization in a topic relative to a larger population of multiple objects. 21. The method of claim 17, further comprising:
weighing the relative topicality specialization by the ratio of all citations for the object to all citations for all objects. 22. The method of claim 21, further comprising:
weighing the relative topicality specialization for the object by the influence scores for citations matching the query term. 23. The method of claim 21, further comprising:
weighing the relative topicality specialization for the object by the influence scores of subjects for all citations of the object. 24. The method of claim 17, further comprising:
adopting a semantic graph of related terms, which allows the “match to query term” used for topicality specialization to be broader than a match of the query term itself. 25. The method of claim 17, further comprising:
ranks the objects in the search result based on one or more of: a ranking function of the citations for the object matching the search query, the influence of the subjects of each matching citation, and the topicality specialization or relative topicality specialization on the query term for each of the objects, among other ranking criteria. 26. A method, comprising:
retrieving a plurality of citations composed by a plurality of subjects citing a plurality of objects that fit the search criteria; computing relative topicality specialization of the plurality of objects cited by the plurality of citations, wherein the relative topicality specialization of an object is a function of the share of citations for the object matching the search criteria among all citations for all objects matching the search criteria; ranking the citing subjects of the plurality of citations using the relative topicality specialization of the objects; selecting subjects as the search result for the user based on influence scores of the citing subjects and/or the relative topicality specialization of the cited objects. | A new approach is proposed that contemplates systems and methods to provide a ranking of subjects or objects identified as results of a search, where “topicality specialization” and “relative topicality specialization” of the objects is computed and considered. The relative topicality specialization of an object is a function of the share of citations for the object matching the query term among all citations for all objects matching the query term. The computation of the topicality specialization and the relative topicality specialization for objects allow the identification of “specialized objects” for “topics” without any pre-defined categorization of topics or pre-computation of expertise.1. A system, comprising:
a citation search engine, which in operation, retrieves a plurality of citations composed by a plurality of subjects citing a plurality of objects that fit one or more search criteria; an influence evaluation engine, which in operation, computes relative topicality specialization of the plurality of objects cited by the plurality of citations; an object/subject selection engine, which in operation,
ranks the cited objects of the plurality of citations using the relative topicality specialization of the objects;
selects objects as the search result for the user based on the matching of the objects with the search criteria as well as the relative topicality specialization of the cited objects. 2. The system of claim 1, wherein:
each of the plurality of subjects has an opinion wherein expression of the opinion is explicit, expressed, implicit, or imputed through any other technique. 3. The system of claim 1, wherein:
each of the plurality of subjects is one of: representation of a person, web log, and entities representing Internet authors or users of social media services, user of microblogging services, users of social networks, reviewer who provides expressions of opinion, reviews, or other information useful for the estimation of influence. 4. The system of claim 1, wherein:
each of the plurality of objects is one of: Internet web sites, blogs, videos, books, films, music, image, video, documents, data files, objects for sale, objects that are reviewed or recommended or cited, subjects/authors, natural or legal persons, citations, or any entities that are associated with a Uniform Resource Identifier (URI). 5. The system of claim 1, wherein:
each of the plurality of citations describes an opinion by a subject on an object matching the search criteria in the search result. 6. The system of claim 1, wherein:
each of the plurality of citations includes one or more of: expression of opinions on the objects, expressions of authors in the form of Tweets, blog posts, reviews of objects on Internet web sites Wikipedia entries, postings to social media, postings to websites, postings in the form of reviews, recommendations, or any other form of citation made to mailing lists, newsgroups, discussion forums, comments to websites or any other form of Internet publication. 7. The system of claim 1, wherein:
the citation search engine enables a citation centric search process that focuses on influence of the plurality subjects that cite the plurality of objects. 8. The system of claim 1, wherein:
the citation search engine accepts and enforces a plurality of criteria on citation searching, retrieving and ranking, each of which is either be explicitly described by a user or best guessed by the system based on internal statistical data. 9. The system of claim 1, wherein:
the relative topicality specialization of an object is a function of the share of citations for the object matching the search criteria among all citations for all objects matching the search criteria. 10. The system of claim 1, wherein:
the influence evaluation engine computes relative topicality specialization of an object as a measure of the object's specialization in a topic relative to a larger population of multiple objects. 11. The system of claim 1, wherein:
the influence evaluation engine weighs the relative topicality specialization by the ratio of all citations for the object to all citations for all objects. 12. The system of claim 11, wherein:
the influence evaluation engine weighs the relative topicality specialization for the object by the influence scores for citations matching the query term. 13. The system of claim 11, wherein:
the influence evaluation engine weighs the relative topicality specialization for the object by the influence scores of subjects for all citations of the object. 14. The system of claim 1, wherein:
influence evaluation engine adopts a semantic graph of related terms, which allows the “match to query term” used for topicality specialization to be broader than a match of the query term itself. 15. The system of claim 1, wherein:
object/subject selection engine ranks the objects in the search result based on one or more of: a ranking function of the citations for the object matching the search query, the influence of the subjects of each matching citation, and the topicality specialization or relative topicality specialization on the query term for each of the objects, among other ranking criteria. 16. A system, comprising:
a citation search engine, which in operation, retrieves a plurality of citations composed by a plurality of subjects citing a plurality of objects that fit one or more search criteria; an influence evaluation engine, which in operation, computes relative topicality specialization of the plurality of objects cited by the plurality of citations; an object/subject selection engine, which in operation,
ranks the citing subjects of the plurality of citations using the relative topicality specialization of the objects;
selects subjects as the search result for the user based on influence scores of the citing subjects and/or the relative topicality specialization of the cited objects. 17. A method, comprising:
retrieving a plurality of citations composed by a plurality of subjects citing a plurality of objects that fit the search criteria; computing relative topicality specialization of the plurality of objects cited by the plurality of citations, wherein the relative topicality specialization of an object is a function of the share of citations for the object matching the search criteria among all citations for all objects matching the search criteria; ranking the cited objects of the plurality of citations using the relative topicality specialization of the objects; selecting objects as the search result for the user based on the matching of the objects with the search criteria as well as the relative topicality specialization of the cited objects. 18. The method of claim 17, further comprising:
enabling a citation centric search process that focuses on influence of the plurality subjects that cite the plurality of objects. 19. The method of claim 17, further comprising:
accepting and enforcing a plurality of criteria on citation searching, retrieving and ranking, each of which is either be explicitly described by a user or best guessed by the system based on internal statistical data. 20. The method of claim 17, further comprising:
computing relative topicality specialization of an object as a measure of the object's specialization in a topic relative to a larger population of multiple objects. 21. The method of claim 17, further comprising:
weighing the relative topicality specialization by the ratio of all citations for the object to all citations for all objects. 22. The method of claim 21, further comprising:
weighing the relative topicality specialization for the object by the influence scores for citations matching the query term. 23. The method of claim 21, further comprising:
weighing the relative topicality specialization for the object by the influence scores of subjects for all citations of the object. 24. The method of claim 17, further comprising:
adopting a semantic graph of related terms, which allows the “match to query term” used for topicality specialization to be broader than a match of the query term itself. 25. The method of claim 17, further comprising:
ranks the objects in the search result based on one or more of: a ranking function of the citations for the object matching the search query, the influence of the subjects of each matching citation, and the topicality specialization or relative topicality specialization on the query term for each of the objects, among other ranking criteria. 26. A method, comprising:
retrieving a plurality of citations composed by a plurality of subjects citing a plurality of objects that fit the search criteria; computing relative topicality specialization of the plurality of objects cited by the plurality of citations, wherein the relative topicality specialization of an object is a function of the share of citations for the object matching the search criteria among all citations for all objects matching the search criteria; ranking the citing subjects of the plurality of citations using the relative topicality specialization of the objects; selecting subjects as the search result for the user based on influence scores of the citing subjects and/or the relative topicality specialization of the cited objects. | 2,100 |
5,752 | 5,752 | 14,531,972 | 2,122 | An apparatus, system and method for automatically evaluating a transaction request are provided. An adaptive modeling platform builds models and deploys them in a very systematic manner, without requiring much or any human intervention. This system ensures an end to end data management; encompassing variable generation, model building and evaluation of the built models, decision logic and strategy design. It guarantees deployment of these predictive models in real time, monitors performance of the portfolio and generates reports & alerts for the same. The system periodically examines the models in production and rebuilds them when their performance falls below a predefined threshold. When the human discretion so permits, the system can be interrupted at any point in time and changes can be made wherever desired in the process. From a business point of view, AMP will significantly reduce the resources and time required for the entire process, starting from raw data to building models and decision logic, to monitoring performance and reconstruction, to deployment of the final strategies. | 1. An adaptive modeling platform, comprising:
a processor and a memory; the processor configured to receive a plurality of piece of data about a transaction; the processor configured to generate a real-time decision based on a predictive model and the plurality of piece of data about the transaction; and the processor configured to automatically one of build the predictive model and rebuild the predictive model in response to a plurality of pieces of data about a plurality of transactions. 2. The platform of claim 1, wherein the processor is configured to build and update one or more decision rules triggered by the plurality of pieces of data about a plurality of transactions. 3. The platform of claim 1, wherein the transaction is one of a financial industry transaction, a consumer credit transaction, a business credit transaction, a fraud detection transaction, a targeted marketing transaction, a transaction monitoring transaction, a customer care transaction and a pricing optimization transaction. 4. The platform of claim 1, wherein the processor is configured to generate decision logic for the transaction based on the plurality of piece of data about the transaction. 5. The platform of claim 1, wherein the processor is configured to automatically generate one or more variables for the predictive model based on the plurality of pieces of data about the plurality of transactions. 6. The platform of claim 1 further comprising a champion/challenger engine that generates a test segment to test in real time the predictive model. 7. The platform of claim 4 further comprising a scoring and decision module that creates, optimizes and deploys the decision logic. 8. The platform of claim 1 further comprising a report generation module that creates reports and triggering alerts based on a real time performance of the generation of the real-time decision. 9. The platform of claim 8, wherein the report generation module triggers an alert to rebuild the predictive model. 10. The platform of claim 8, wherein the report generation module triggers an alert to deploy a new predictive model. 11. The platform of claim 4 further comprising a report generation module that triggers an alert to automatically adjust the decision logic. 12. The platform of claim 4 further comprising a report generation module that triggers an alert to automatically deploy new decision logic. 13. The platform of claim 5, wherein the one or more variables are digital filter variables. 14. The platform of claim 13, wherein the one or more variables are Bayesian adjusted digital filter variables. 15. The platform of claim 1, wherein the data is one of performance data and outcome data. 16. The platform of claim 14, wherein the processor is configured to rebuild the predictive model when a new digital filter variable is created. 17. The platform of claim 4, wherein the processor is configured to rebuild the decision logic when a new digital filter variable is created. 18. The platform of claim 5, wherein the processor is configured to generates the one or more variables based on new data about the transaction. 19. The platform of claim 5 further comprising a data manager that maintains a definition and a property of the one or more variables in a common format. 20. The platform of claim 4, wherein the decision logic is a decision strategy using the predictive model, an objective and a constraint. 21. The platform of claim 20, wherein the processor is configured to automatically update the decision strategy based on new data about the transaction. 22. The platform of claim 1 further comprising a model management model that performs one of the following: monitoring the performance of the predictive model currently deployed in real time production, triggering automatic rebuilds of the predictive model based on the performance, triggering predictive model rebuilds based on time elapsed, triggering predictive model rebuilds based on new data availability, triggering predictive model rebuilds based on availability of new variables, triggering predictive model rebuilds based on statistical distribution shifts observed in the data for the transactions and triggering predictive model rebuilds based on performance of a challenger strategy. 23. The platform of claim 20 further comprising a model management model that performs one of the following: monitoring the performance of the predictive model currently deployed in real time production, triggering automatic rebuilds of the decision strategy based on the performance, triggering decision strategy rebuilds based on time elapsed, triggering decision strategy rebuilds based on new data availability, triggering decision strategy rebuilds based on availability of new variables, triggering decision strategy rebuilds based on statistical distribution shifts observed in the data for the transactions and triggering decision strategy rebuilds based on performance of a challenger strategy. 24. The platform of claim 6, wherein the champion/challenger module performs one or more of the following: monitoring the performance of deployed champion and challenger business strategies, triggering automatic distribution updates to the overall decision strategy based on performance, automatically pruning underperforming strategies based on specified performance conditions, automatically allocating higher distribution of transactions to challenger strategies that are performing well, ultimately promoting them to champion and alerting the system to trigger rebuild if any predictive model underperforms on any of the challenger segments. 25. A method for performing adaptive modeling, comprising:
receiving, at a computer having a real time decision engine, a plurality of piece of data about a transaction; generating, by the real time decision engine, a real-time decision based on a predictive model and the plurality of piece of data about the transaction; and automatically adjusting, by the real time decision engine, the predictive model in response to a plurality of pieces of data about a plurality of transactions. 26. The method of claim 25, wherein adjusting the predictive model further comprises one of building the predictive model and rebuilding the predictive model. 27. The method of claim 25 further comprising automatically adjusting one or more decision rules triggered by the plurality of pieces of data about a plurality of transactions. 28. The method of claim 27, wherein adjusting the decision rules further comprises one of building the decision rules and rebuilding the decision rules. 29. The method of claim 25, wherein the transaction is one of a financial industry transaction, a consumer credit transaction, a business credit transaction, a fraud detection transaction, a targeted marketing transaction, a transaction monitoring transaction, a customer care transaction and a pricing optimization transaction. 30. The method of claim 25 further comprising generating decision logic for the transaction based on the plurality of piece of data about the transaction. 31. The method of claim 25 further comprising automatically generating one or more variables for the predictive model based on the plurality of pieces of data about the plurality of transactions. 32. The method of claim 25 further comprising generating a test segment to test in real time the predictive model. 33. The method of claim 30 further comprising creating, optimizes and deploying the decision logic. 34. The method of claim 25 further comprising creating reports and triggering alerts based on a real time performance of the generation of the real-time decision. 35. The method of claim 34, wherein triggering the alerts further comprises triggering an alert to rebuild the predictive model. 36. The method of claim 34, wherein triggering the alerts further comprises triggering an alert to deploy a new predictive model. 37. The method of claim 30 further comprising triggering an alert to automatically adjust the decision logic. 38. The method of claim 30 further comprising triggering an alert to automatically deploy new decision logic. 39. The method of claim 31, wherein the one or more variables are digital filter variables. 40. The method of claim 39, wherein the one or more variables are Bayesian adjusted digital filter variables. 41. The method of claim 25, wherein the data is one of performance data and outcome data. 42. The method of claim 39 further comprising rebuilding the predictive model when a new digital filter variable is created. 43. The method of claim 30 further comprising rebuilding the decision logic when a new digital filter variable is created. 44. The method of claim 31, wherein generating the one or more variables further comprises generating the one or more variables based on new data about the transaction. 45. The method of claim 30, wherein the decision logic is a decision strategy using the predictive model, an objective and a constraint. 46. The method of claim 45 further comprising automatically updating the decision strategy based on new data about the transaction. 47. The method of claim 25 further comprising monitoring the performance of the predictive model currently deployed in real time production, triggering automatic rebuilds of the predictive model based on the performance, triggering predictive model rebuilds based on time elapsed, triggering predictive model rebuilds based on new data availability, triggering predictive model rebuilds based on availability of new variables, triggering predictive model rebuilds based on statistical distribution shifts observed in the data for the transactions and triggering predictive model rebuilds based on performance of a challenger strategy. 48. The method of claim 45 further comprising monitoring the performance of the predictive model currently deployed in real time production, triggering automatic rebuilds of the decision strategy based on the performance, triggering decision strategy rebuilds based on time elapsed, triggering decision strategy rebuilds based on new data availability, triggering decision strategy rebuilds based on availability of new variables, triggering decision strategy rebuilds based on statistical distribution shifts observed in the data for the transactions and triggering decision strategy rebuilds based on performance of a challenger strategy. 49. The method of claim 32 further comprising monitoring the performance of deployed champion and challenger business strategies, triggering automatic distribution updates to the overall decision strategy based on performance, automatically pruning underperforming strategies based on specified performance conditions, automatically allocating higher distribution of transactions to challenger strategies that are performing well, ultimately promoting them to champion and alerting the system to trigger rebuild if any predictive model underperforms on any of the challenger segments. | An apparatus, system and method for automatically evaluating a transaction request are provided. An adaptive modeling platform builds models and deploys them in a very systematic manner, without requiring much or any human intervention. This system ensures an end to end data management; encompassing variable generation, model building and evaluation of the built models, decision logic and strategy design. It guarantees deployment of these predictive models in real time, monitors performance of the portfolio and generates reports & alerts for the same. The system periodically examines the models in production and rebuilds them when their performance falls below a predefined threshold. When the human discretion so permits, the system can be interrupted at any point in time and changes can be made wherever desired in the process. From a business point of view, AMP will significantly reduce the resources and time required for the entire process, starting from raw data to building models and decision logic, to monitoring performance and reconstruction, to deployment of the final strategies.1. An adaptive modeling platform, comprising:
a processor and a memory; the processor configured to receive a plurality of piece of data about a transaction; the processor configured to generate a real-time decision based on a predictive model and the plurality of piece of data about the transaction; and the processor configured to automatically one of build the predictive model and rebuild the predictive model in response to a plurality of pieces of data about a plurality of transactions. 2. The platform of claim 1, wherein the processor is configured to build and update one or more decision rules triggered by the plurality of pieces of data about a plurality of transactions. 3. The platform of claim 1, wherein the transaction is one of a financial industry transaction, a consumer credit transaction, a business credit transaction, a fraud detection transaction, a targeted marketing transaction, a transaction monitoring transaction, a customer care transaction and a pricing optimization transaction. 4. The platform of claim 1, wherein the processor is configured to generate decision logic for the transaction based on the plurality of piece of data about the transaction. 5. The platform of claim 1, wherein the processor is configured to automatically generate one or more variables for the predictive model based on the plurality of pieces of data about the plurality of transactions. 6. The platform of claim 1 further comprising a champion/challenger engine that generates a test segment to test in real time the predictive model. 7. The platform of claim 4 further comprising a scoring and decision module that creates, optimizes and deploys the decision logic. 8. The platform of claim 1 further comprising a report generation module that creates reports and triggering alerts based on a real time performance of the generation of the real-time decision. 9. The platform of claim 8, wherein the report generation module triggers an alert to rebuild the predictive model. 10. The platform of claim 8, wherein the report generation module triggers an alert to deploy a new predictive model. 11. The platform of claim 4 further comprising a report generation module that triggers an alert to automatically adjust the decision logic. 12. The platform of claim 4 further comprising a report generation module that triggers an alert to automatically deploy new decision logic. 13. The platform of claim 5, wherein the one or more variables are digital filter variables. 14. The platform of claim 13, wherein the one or more variables are Bayesian adjusted digital filter variables. 15. The platform of claim 1, wherein the data is one of performance data and outcome data. 16. The platform of claim 14, wherein the processor is configured to rebuild the predictive model when a new digital filter variable is created. 17. The platform of claim 4, wherein the processor is configured to rebuild the decision logic when a new digital filter variable is created. 18. The platform of claim 5, wherein the processor is configured to generates the one or more variables based on new data about the transaction. 19. The platform of claim 5 further comprising a data manager that maintains a definition and a property of the one or more variables in a common format. 20. The platform of claim 4, wherein the decision logic is a decision strategy using the predictive model, an objective and a constraint. 21. The platform of claim 20, wherein the processor is configured to automatically update the decision strategy based on new data about the transaction. 22. The platform of claim 1 further comprising a model management model that performs one of the following: monitoring the performance of the predictive model currently deployed in real time production, triggering automatic rebuilds of the predictive model based on the performance, triggering predictive model rebuilds based on time elapsed, triggering predictive model rebuilds based on new data availability, triggering predictive model rebuilds based on availability of new variables, triggering predictive model rebuilds based on statistical distribution shifts observed in the data for the transactions and triggering predictive model rebuilds based on performance of a challenger strategy. 23. The platform of claim 20 further comprising a model management model that performs one of the following: monitoring the performance of the predictive model currently deployed in real time production, triggering automatic rebuilds of the decision strategy based on the performance, triggering decision strategy rebuilds based on time elapsed, triggering decision strategy rebuilds based on new data availability, triggering decision strategy rebuilds based on availability of new variables, triggering decision strategy rebuilds based on statistical distribution shifts observed in the data for the transactions and triggering decision strategy rebuilds based on performance of a challenger strategy. 24. The platform of claim 6, wherein the champion/challenger module performs one or more of the following: monitoring the performance of deployed champion and challenger business strategies, triggering automatic distribution updates to the overall decision strategy based on performance, automatically pruning underperforming strategies based on specified performance conditions, automatically allocating higher distribution of transactions to challenger strategies that are performing well, ultimately promoting them to champion and alerting the system to trigger rebuild if any predictive model underperforms on any of the challenger segments. 25. A method for performing adaptive modeling, comprising:
receiving, at a computer having a real time decision engine, a plurality of piece of data about a transaction; generating, by the real time decision engine, a real-time decision based on a predictive model and the plurality of piece of data about the transaction; and automatically adjusting, by the real time decision engine, the predictive model in response to a plurality of pieces of data about a plurality of transactions. 26. The method of claim 25, wherein adjusting the predictive model further comprises one of building the predictive model and rebuilding the predictive model. 27. The method of claim 25 further comprising automatically adjusting one or more decision rules triggered by the plurality of pieces of data about a plurality of transactions. 28. The method of claim 27, wherein adjusting the decision rules further comprises one of building the decision rules and rebuilding the decision rules. 29. The method of claim 25, wherein the transaction is one of a financial industry transaction, a consumer credit transaction, a business credit transaction, a fraud detection transaction, a targeted marketing transaction, a transaction monitoring transaction, a customer care transaction and a pricing optimization transaction. 30. The method of claim 25 further comprising generating decision logic for the transaction based on the plurality of piece of data about the transaction. 31. The method of claim 25 further comprising automatically generating one or more variables for the predictive model based on the plurality of pieces of data about the plurality of transactions. 32. The method of claim 25 further comprising generating a test segment to test in real time the predictive model. 33. The method of claim 30 further comprising creating, optimizes and deploying the decision logic. 34. The method of claim 25 further comprising creating reports and triggering alerts based on a real time performance of the generation of the real-time decision. 35. The method of claim 34, wherein triggering the alerts further comprises triggering an alert to rebuild the predictive model. 36. The method of claim 34, wherein triggering the alerts further comprises triggering an alert to deploy a new predictive model. 37. The method of claim 30 further comprising triggering an alert to automatically adjust the decision logic. 38. The method of claim 30 further comprising triggering an alert to automatically deploy new decision logic. 39. The method of claim 31, wherein the one or more variables are digital filter variables. 40. The method of claim 39, wherein the one or more variables are Bayesian adjusted digital filter variables. 41. The method of claim 25, wherein the data is one of performance data and outcome data. 42. The method of claim 39 further comprising rebuilding the predictive model when a new digital filter variable is created. 43. The method of claim 30 further comprising rebuilding the decision logic when a new digital filter variable is created. 44. The method of claim 31, wherein generating the one or more variables further comprises generating the one or more variables based on new data about the transaction. 45. The method of claim 30, wherein the decision logic is a decision strategy using the predictive model, an objective and a constraint. 46. The method of claim 45 further comprising automatically updating the decision strategy based on new data about the transaction. 47. The method of claim 25 further comprising monitoring the performance of the predictive model currently deployed in real time production, triggering automatic rebuilds of the predictive model based on the performance, triggering predictive model rebuilds based on time elapsed, triggering predictive model rebuilds based on new data availability, triggering predictive model rebuilds based on availability of new variables, triggering predictive model rebuilds based on statistical distribution shifts observed in the data for the transactions and triggering predictive model rebuilds based on performance of a challenger strategy. 48. The method of claim 45 further comprising monitoring the performance of the predictive model currently deployed in real time production, triggering automatic rebuilds of the decision strategy based on the performance, triggering decision strategy rebuilds based on time elapsed, triggering decision strategy rebuilds based on new data availability, triggering decision strategy rebuilds based on availability of new variables, triggering decision strategy rebuilds based on statistical distribution shifts observed in the data for the transactions and triggering decision strategy rebuilds based on performance of a challenger strategy. 49. The method of claim 32 further comprising monitoring the performance of deployed champion and challenger business strategies, triggering automatic distribution updates to the overall decision strategy based on performance, automatically pruning underperforming strategies based on specified performance conditions, automatically allocating higher distribution of transactions to challenger strategies that are performing well, ultimately promoting them to champion and alerting the system to trigger rebuild if any predictive model underperforms on any of the challenger segments. | 2,100 |
5,753 | 5,753 | 15,393,684 | 2,152 | The present technology operates in an application layer of an operating system on a client device of a content management system to monitor for changes to shared content items that are likely unintentional—for example the change might move a content item out of a shared space, or otherwise remove the shared content item from access by other users. The present technology can detect a content item change event on a client device, compare a source file system path for the content item change event with a destination file system path for the content item change event to determine a canonical move causing the content item change event, determine that the canonical move was likely unintentional; and display a notification informing the user that a content item change that was likely unintentional was detected and then allow the user to either confirm or deny (undo) the detected change. | 1. At least one non-transitory computer readable medium comprising instructions, the instructions, when executed by a computing system, cause the computing system to:
detect a content item change event on a client device, wherein the content item change event is associated with a user account of a content management system and wherein the content item change pertains to a shared content item accessible to at least one other account of the content management system; compare a source file system path for the content item change event with a destination file system path for the content item change event to determine a canonical move causing the content item change event; determine that the canonical move causing the content item change event was unintentional based on a determination that the canonical move will result in making the shared content item unavailable to the at least one other account of the content management system; and after determining that the content item change event was unintentional, display a notification on the client device, wherein the notification informs the user account associated with the content item change event that an unintentional move was detected. 2. The at least one non-transitory computer readable medium of claim 1, wherein the instructions are executed in an application layer on the computing system. 3. The at least one non-transitory computer readable medium of claim 1, wherein the instructions to detect the content item change event, detect that the content item change event is a move event. 4. The at least one non-transitory computer readable medium of claim 1, including instructions to:
detect a file system path for a location within the file system that the content item change event occurred; determine whether the content item change description describes a source file system path or destination file system path of the content item; when the content item change description describes the source file system path, learn the destination file system path, and when the content item change description describes the destination file system path, learn the source file system path. 5. The at least one non-transitory computer readable medium of claim 4, wherein the destination file system path is learned by the computer system by executing the instructions to:
lookup the source file system path in a storage index on the client device to obtain a unique identifier for the content item that used to be stored at the source path; and query a client device file system to learn a current location of a content item having the unique identifier, the current location being the destination file system path. 6. The at least one non-transitory computer readable medium of claim 4, wherein the source file system path is learned by the computer system by executing the instructions to:
determine a unique identifier for the content item stored at the destination path; and lookup the unique identifier in a storage index on the client device to obtain the most recent known path storing a content item having the unique identifier, the most recent known path being the source path. 7. The at least one non-transitory computer readable medium of claim 1, wherein the canonical move is determined by the instructions effective to cause the system to:
evaluate the source file system path, wherein the source path may contain a plurality of levels of content items, starting with the lowest level, and determine whether the content item at the evaluated level of the source file system path is currently stored at the location identified by the source file system path; when the content item at the evaluated level of the source file system path is not currently stored at the location identified by the source file system path, iterate the evaluation of the source file system path at a progressively higher level content item in the source file system path, when the content item at the evaluated level of the source file system path is currently stored at the location identified by the source file system path, determine that the last content item that was determined to not be currently stored at the location identified by the source file system path is the content item that was moved in the canonical move. 8. (canceled) 9. The at least one non-transitory computer readable medium of claim 1, wherein the source file system path for the content item change event is associated with a shared directory and the destination file system path for the content item change event is associated with an unshared directory. 10. The at least one non-transitory computer readable medium of claim 1, wherein the notification informing that the unintentional move was detected further includes a selectable control effective to undo the move; and
after receiving a user input selecting the selectable control, undo the move, and do not synchronize the move to a content management system. 11. The at least one non-transitory computer readable medium of claim 1, wherein the content item change event is a content item addition describing an addition of the content item to the destination file system path, or content item deletion describing a deletion of a content item from the source file system path, and wherein the instructions are effective to cause the computer system to:
determine that the content item deletion or content item addition is part of a content item move when the source path does not match the destination path for the content item. 12. A system for synchronizing shared content item changes from a client device to a to a content management system, the system comprising:
a processor; a storage index configured to store a log of all content item changes synchronized to the content management system, the storage index including a unique identifier for each content item, and a system file path identifying a location in a storage of the client device that the content item is stored; an operating system of the client device having a kernel layer for managing file system events and I/O events for the storage, and an application layer for executing application instructions; and a content item synchronization service resident in the application layer and configured to:
detect a shared content item change event on a client device, wherein the content item change event is associated with a user account of a content management system and wherein the content item change pertains to a shared content item accessible to at least one other account of the content management system,
compare a source file system path for the content item change event with a destination file system path for the content item change event to determine a move causing the content item change event,
determine that the move causing the content item change event was unintentional based on a determination that the move will result in making the shared content item unavailable to the at least one other account of the content management system, and
disallow synchronizing the content item change on the client device to the content management system. 13. The system of claim 12, wherein the content item synchronization service is configured to detect a file system path for the location within the file system that the content item change event occurred, to determine whether the content item change event describes a source file system path or destination file system path of the content item, and when the content item change event describes the source file system path, learn the destination file system path, and when the when the content item change event describes the destination file system path, learn the source file system path. 14. The system of claim 12, wherein the source file system path for the content item change event is associated with a shared directory and the destination file system path for the content item change event is associated with an unshared directory. 15. The system of claim 14, herein the content item synchronization service is configured to display a notification when the content item change is determined to be unintentional, the notification further includes a selectable control effective to undo the move. 16. A method comprising:
detecting a content item change event by a content item synchronization service executing in application space on a client device, wherein the content item change event is associated with a user account of a content management system and wherein the content item change pertains to a shared content item accessible to at least one other account of the content management system; comparing a source file system path for the content item change event with a destination file system path for the content item change to determine a canonical move causing the content item change event; determining that a move causing the content item change event was unintentional based on a determination that the canonical move will result in making the shared content item unavailable to the at least one other account of the content management system; and after determining that the content item change event was unintentional, displaying a notification on the client device, wherein the notification informs the user account associated with the content item change event that the unintentional move was detected. 17. The method of claim 16, wherein the content item change event is a plurality of content item change events, the method comprising:
determining that the plurality of content item change events are related; and batching the notifications informing that the unintentional plurality of moves were unintentional into a single notification. 18. The method of claim 16, wherein the content item change event includes a first content item change event and a second content item change event, and while determining that the move causing the first content item change event was unintentional, complete comparing the source file system path for the second content item change event with a destination file system path for the second content item change, the method comprising:
queuing the second content item change to be determined whether the content item change was unintentional until the first content item change has been determined to be unintentional. 19. The method of claim 16, wherein the determining the content item that was moved is determined by:
evaluating the source file system path, wherein the source path may contain a plurality of levels of content items, starting with the lowest level, and determining whether the content item at the evaluated level of the source file system path is currently stored at the location identified by the source file system path; when the content item at the evaluated level of the source file system path is not currently stored at the location identified by the source file system path, iterating the evaluation of the source file system path at a progressively higher level content item in the source file system path, when the content item at the evaluated level of the source file system path is currently stored at the location identified by the source file system path, determining that the last content item that was determined to not be currently stored at the location identified by the source file system path is the content item that was moved; determining that any additional content item changes having the same source file system path as the last content item that was determined to not be currently stored at the location identified by the source file system path is a related move; and displaying the notification informing that the unintentional move was detected that applies to all determined related moves. 20. The method of claim 16, wherein the source file system path for the content item change event is associated with a shared directory and the destination file system path for the content item change event is associated with an unshared directory. 21. The at least one non-transitory computer readable medium of claim 1, wherein the notification is displayed only on the client device. 22. The method of claim 16, wherein the notification is displayed only on the client device. | The present technology operates in an application layer of an operating system on a client device of a content management system to monitor for changes to shared content items that are likely unintentional—for example the change might move a content item out of a shared space, or otherwise remove the shared content item from access by other users. The present technology can detect a content item change event on a client device, compare a source file system path for the content item change event with a destination file system path for the content item change event to determine a canonical move causing the content item change event, determine that the canonical move was likely unintentional; and display a notification informing the user that a content item change that was likely unintentional was detected and then allow the user to either confirm or deny (undo) the detected change.1. At least one non-transitory computer readable medium comprising instructions, the instructions, when executed by a computing system, cause the computing system to:
detect a content item change event on a client device, wherein the content item change event is associated with a user account of a content management system and wherein the content item change pertains to a shared content item accessible to at least one other account of the content management system; compare a source file system path for the content item change event with a destination file system path for the content item change event to determine a canonical move causing the content item change event; determine that the canonical move causing the content item change event was unintentional based on a determination that the canonical move will result in making the shared content item unavailable to the at least one other account of the content management system; and after determining that the content item change event was unintentional, display a notification on the client device, wherein the notification informs the user account associated with the content item change event that an unintentional move was detected. 2. The at least one non-transitory computer readable medium of claim 1, wherein the instructions are executed in an application layer on the computing system. 3. The at least one non-transitory computer readable medium of claim 1, wherein the instructions to detect the content item change event, detect that the content item change event is a move event. 4. The at least one non-transitory computer readable medium of claim 1, including instructions to:
detect a file system path for a location within the file system that the content item change event occurred; determine whether the content item change description describes a source file system path or destination file system path of the content item; when the content item change description describes the source file system path, learn the destination file system path, and when the content item change description describes the destination file system path, learn the source file system path. 5. The at least one non-transitory computer readable medium of claim 4, wherein the destination file system path is learned by the computer system by executing the instructions to:
lookup the source file system path in a storage index on the client device to obtain a unique identifier for the content item that used to be stored at the source path; and query a client device file system to learn a current location of a content item having the unique identifier, the current location being the destination file system path. 6. The at least one non-transitory computer readable medium of claim 4, wherein the source file system path is learned by the computer system by executing the instructions to:
determine a unique identifier for the content item stored at the destination path; and lookup the unique identifier in a storage index on the client device to obtain the most recent known path storing a content item having the unique identifier, the most recent known path being the source path. 7. The at least one non-transitory computer readable medium of claim 1, wherein the canonical move is determined by the instructions effective to cause the system to:
evaluate the source file system path, wherein the source path may contain a plurality of levels of content items, starting with the lowest level, and determine whether the content item at the evaluated level of the source file system path is currently stored at the location identified by the source file system path; when the content item at the evaluated level of the source file system path is not currently stored at the location identified by the source file system path, iterate the evaluation of the source file system path at a progressively higher level content item in the source file system path, when the content item at the evaluated level of the source file system path is currently stored at the location identified by the source file system path, determine that the last content item that was determined to not be currently stored at the location identified by the source file system path is the content item that was moved in the canonical move. 8. (canceled) 9. The at least one non-transitory computer readable medium of claim 1, wherein the source file system path for the content item change event is associated with a shared directory and the destination file system path for the content item change event is associated with an unshared directory. 10. The at least one non-transitory computer readable medium of claim 1, wherein the notification informing that the unintentional move was detected further includes a selectable control effective to undo the move; and
after receiving a user input selecting the selectable control, undo the move, and do not synchronize the move to a content management system. 11. The at least one non-transitory computer readable medium of claim 1, wherein the content item change event is a content item addition describing an addition of the content item to the destination file system path, or content item deletion describing a deletion of a content item from the source file system path, and wherein the instructions are effective to cause the computer system to:
determine that the content item deletion or content item addition is part of a content item move when the source path does not match the destination path for the content item. 12. A system for synchronizing shared content item changes from a client device to a to a content management system, the system comprising:
a processor; a storage index configured to store a log of all content item changes synchronized to the content management system, the storage index including a unique identifier for each content item, and a system file path identifying a location in a storage of the client device that the content item is stored; an operating system of the client device having a kernel layer for managing file system events and I/O events for the storage, and an application layer for executing application instructions; and a content item synchronization service resident in the application layer and configured to:
detect a shared content item change event on a client device, wherein the content item change event is associated with a user account of a content management system and wherein the content item change pertains to a shared content item accessible to at least one other account of the content management system,
compare a source file system path for the content item change event with a destination file system path for the content item change event to determine a move causing the content item change event,
determine that the move causing the content item change event was unintentional based on a determination that the move will result in making the shared content item unavailable to the at least one other account of the content management system, and
disallow synchronizing the content item change on the client device to the content management system. 13. The system of claim 12, wherein the content item synchronization service is configured to detect a file system path for the location within the file system that the content item change event occurred, to determine whether the content item change event describes a source file system path or destination file system path of the content item, and when the content item change event describes the source file system path, learn the destination file system path, and when the when the content item change event describes the destination file system path, learn the source file system path. 14. The system of claim 12, wherein the source file system path for the content item change event is associated with a shared directory and the destination file system path for the content item change event is associated with an unshared directory. 15. The system of claim 14, herein the content item synchronization service is configured to display a notification when the content item change is determined to be unintentional, the notification further includes a selectable control effective to undo the move. 16. A method comprising:
detecting a content item change event by a content item synchronization service executing in application space on a client device, wherein the content item change event is associated with a user account of a content management system and wherein the content item change pertains to a shared content item accessible to at least one other account of the content management system; comparing a source file system path for the content item change event with a destination file system path for the content item change to determine a canonical move causing the content item change event; determining that a move causing the content item change event was unintentional based on a determination that the canonical move will result in making the shared content item unavailable to the at least one other account of the content management system; and after determining that the content item change event was unintentional, displaying a notification on the client device, wherein the notification informs the user account associated with the content item change event that the unintentional move was detected. 17. The method of claim 16, wherein the content item change event is a plurality of content item change events, the method comprising:
determining that the plurality of content item change events are related; and batching the notifications informing that the unintentional plurality of moves were unintentional into a single notification. 18. The method of claim 16, wherein the content item change event includes a first content item change event and a second content item change event, and while determining that the move causing the first content item change event was unintentional, complete comparing the source file system path for the second content item change event with a destination file system path for the second content item change, the method comprising:
queuing the second content item change to be determined whether the content item change was unintentional until the first content item change has been determined to be unintentional. 19. The method of claim 16, wherein the determining the content item that was moved is determined by:
evaluating the source file system path, wherein the source path may contain a plurality of levels of content items, starting with the lowest level, and determining whether the content item at the evaluated level of the source file system path is currently stored at the location identified by the source file system path; when the content item at the evaluated level of the source file system path is not currently stored at the location identified by the source file system path, iterating the evaluation of the source file system path at a progressively higher level content item in the source file system path, when the content item at the evaluated level of the source file system path is currently stored at the location identified by the source file system path, determining that the last content item that was determined to not be currently stored at the location identified by the source file system path is the content item that was moved; determining that any additional content item changes having the same source file system path as the last content item that was determined to not be currently stored at the location identified by the source file system path is a related move; and displaying the notification informing that the unintentional move was detected that applies to all determined related moves. 20. The method of claim 16, wherein the source file system path for the content item change event is associated with a shared directory and the destination file system path for the content item change event is associated with an unshared directory. 21. The at least one non-transitory computer readable medium of claim 1, wherein the notification is displayed only on the client device. 22. The method of claim 16, wherein the notification is displayed only on the client device. | 2,100 |
5,754 | 5,754 | 15,496,232 | 2,184 | An apparatus includes: a semiconductor die including a first I/O (input/output) pad, a second I/O pad, a switch, and an internal processor, wherein the switch is configured to short the first I/O pad to the second I/O pad when a control signal is asserted; and a semiconductor package including a first bond pad configured to electrically connect to the first I/O pad, a second bond pad configured to electrically connect to the second I/O pad, a first port configured to electrically connect to a high-speed pin of a multi-mode connector, a second port configured to electrically connect to an external processor, a first routing path configured to electrically connect the first port to the first bond pad, and a second routing path configured to electrically connect the second port to the second bond pad, wherein the external processor is configured to process an electrical signal at the second port in accordance with a first protocol when the control signal is asserted, and the internal processor is configured to process an electrical signal at the first I/O pad when the control signal is de-asserted. | 1. An apparatus comprising:
a semiconductor die including a first I/O (input/output) pad, a second I/O pad, a switch, and an internal processor, wherein the switch is configured to short the first I/O pad to the second I/O pad when a control signal is asserted; and a semiconductor package including a first bond pad configured to electrically connect to the first I/O pad, a second bond pad configured to electrically connect to the second I/O pad, a first port configured to electrically connect to a high-speed pin of a multi-mode connector, a second port configured to electrically connect to an external processor, a first routing path configured to electrically connect the first port to the first bond pad, and a second routing path configured to electrically connect the second port to the second bond pad, wherein the external processor is configured to process an electrical signal from/to the second port in accordance with a first protocol when the control signal is asserted, and the internal processor is configured to process an electrical signal at the first I/O pad in accordance with a second protocol when the control signal is de-asserted. 2. The apparatus of claim 1, wherein the first bond pad electrically connects to the first I/O pad via a first bond wire, while the second bond pad electrically connects to the second I/O pad via a second bond wire. 3. The apparatus of claim 2, wherein the first bond wire and second bond wire are substantially parallel and adjacent to each other. 4. The apparatus of claim 1, wherein the semiconductor package is a BGA (ball grid array) package. 5. The apparatus of claim 4, wherein the first routing path includes a metal trace. 6. The apparatus of claim 5, wherein the first routing path further includes a via. 7. The apparatus of claim 4, wherein the second routing path includes a via. 8. The apparatus of claim 1, wherein the first port electrically connects to the high-speed pin of the multi-mode connector via a first metal trace laid out on a PCB (printed circuit board), while the second port electrically connects to the external processor via a second metal trace laid out on the PCB. 9. The apparatus of claim 8, wherein the first metal trace and the second metal trace are laid out on different layers of the PCB. 10. The apparatus of claim 1, wherein the first protocol is a USB (universal serial bus) protocol, while the second protocol is a DisplayPort protocol. 11. A method comprising:
electrically connecting a first port and a second port of a semiconductor package to a high-speed pin of a multi-mode connector and an external processor, respectively, wherein the external processor is configured to process an electrical signal from/to the second port in accordance with a first protocol when a control signal is asserted; electrically connecting the first port and the second port to a first bond pad and a second bond pad of the semiconductor package, respectively; electrically connecting the first bond pad and the second bond pad to a first I/O pad and a second I/O pad of a semiconductor die, respectively; checking if the control signal is asserted; if true, shorting the first I/O pad with the second I/O pad using a switch; else, processing an electrical signal at the first I/O pad using an internal processor in accordance with a second protocol. 12. The method of claim 11, wherein the first bond pad electrically connects to the first I/O pad via a first bond wire, while the second bond pad electrically connects to the second I/O pad via a second bond wire. 13. The method of claim 12, wherein the first bond wire and second bond wire are substantially parallel and adjacent to each other. 14. The method of claim 11, wherein the semiconductor package is a BGA (ball grid array) package. 15. The method of claim 14, wherein a first routing path includes a metal trace. 16. The method of claim 15, wherein the first routing path further includes a via. 17. The method of claim 14, wherein a second routing path includes a via. 18. The method of claim 11, wherein the first port electrically connects to the high-speed pin of the multi-mode connector via a first metal trace laid out on a PCB (printed circuit board), while the second port electrically connects to the external processor via a second metal trace laid out on the PCB. 19. The method of claim 18, wherein the first metal trace and the second metal trace are laid out on different layers of the PCB. 20. The method of claim 11, wherein the first protocol is a USB (universal serial bus) protocol, while the second protocol is a DisplayPort protocol. | An apparatus includes: a semiconductor die including a first I/O (input/output) pad, a second I/O pad, a switch, and an internal processor, wherein the switch is configured to short the first I/O pad to the second I/O pad when a control signal is asserted; and a semiconductor package including a first bond pad configured to electrically connect to the first I/O pad, a second bond pad configured to electrically connect to the second I/O pad, a first port configured to electrically connect to a high-speed pin of a multi-mode connector, a second port configured to electrically connect to an external processor, a first routing path configured to electrically connect the first port to the first bond pad, and a second routing path configured to electrically connect the second port to the second bond pad, wherein the external processor is configured to process an electrical signal at the second port in accordance with a first protocol when the control signal is asserted, and the internal processor is configured to process an electrical signal at the first I/O pad when the control signal is de-asserted.1. An apparatus comprising:
a semiconductor die including a first I/O (input/output) pad, a second I/O pad, a switch, and an internal processor, wherein the switch is configured to short the first I/O pad to the second I/O pad when a control signal is asserted; and a semiconductor package including a first bond pad configured to electrically connect to the first I/O pad, a second bond pad configured to electrically connect to the second I/O pad, a first port configured to electrically connect to a high-speed pin of a multi-mode connector, a second port configured to electrically connect to an external processor, a first routing path configured to electrically connect the first port to the first bond pad, and a second routing path configured to electrically connect the second port to the second bond pad, wherein the external processor is configured to process an electrical signal from/to the second port in accordance with a first protocol when the control signal is asserted, and the internal processor is configured to process an electrical signal at the first I/O pad in accordance with a second protocol when the control signal is de-asserted. 2. The apparatus of claim 1, wherein the first bond pad electrically connects to the first I/O pad via a first bond wire, while the second bond pad electrically connects to the second I/O pad via a second bond wire. 3. The apparatus of claim 2, wherein the first bond wire and second bond wire are substantially parallel and adjacent to each other. 4. The apparatus of claim 1, wherein the semiconductor package is a BGA (ball grid array) package. 5. The apparatus of claim 4, wherein the first routing path includes a metal trace. 6. The apparatus of claim 5, wherein the first routing path further includes a via. 7. The apparatus of claim 4, wherein the second routing path includes a via. 8. The apparatus of claim 1, wherein the first port electrically connects to the high-speed pin of the multi-mode connector via a first metal trace laid out on a PCB (printed circuit board), while the second port electrically connects to the external processor via a second metal trace laid out on the PCB. 9. The apparatus of claim 8, wherein the first metal trace and the second metal trace are laid out on different layers of the PCB. 10. The apparatus of claim 1, wherein the first protocol is a USB (universal serial bus) protocol, while the second protocol is a DisplayPort protocol. 11. A method comprising:
electrically connecting a first port and a second port of a semiconductor package to a high-speed pin of a multi-mode connector and an external processor, respectively, wherein the external processor is configured to process an electrical signal from/to the second port in accordance with a first protocol when a control signal is asserted; electrically connecting the first port and the second port to a first bond pad and a second bond pad of the semiconductor package, respectively; electrically connecting the first bond pad and the second bond pad to a first I/O pad and a second I/O pad of a semiconductor die, respectively; checking if the control signal is asserted; if true, shorting the first I/O pad with the second I/O pad using a switch; else, processing an electrical signal at the first I/O pad using an internal processor in accordance with a second protocol. 12. The method of claim 11, wherein the first bond pad electrically connects to the first I/O pad via a first bond wire, while the second bond pad electrically connects to the second I/O pad via a second bond wire. 13. The method of claim 12, wherein the first bond wire and second bond wire are substantially parallel and adjacent to each other. 14. The method of claim 11, wherein the semiconductor package is a BGA (ball grid array) package. 15. The method of claim 14, wherein a first routing path includes a metal trace. 16. The method of claim 15, wherein the first routing path further includes a via. 17. The method of claim 14, wherein a second routing path includes a via. 18. The method of claim 11, wherein the first port electrically connects to the high-speed pin of the multi-mode connector via a first metal trace laid out on a PCB (printed circuit board), while the second port electrically connects to the external processor via a second metal trace laid out on the PCB. 19. The method of claim 18, wherein the first metal trace and the second metal trace are laid out on different layers of the PCB. 20. The method of claim 11, wherein the first protocol is a USB (universal serial bus) protocol, while the second protocol is a DisplayPort protocol. | 2,100 |
5,755 | 5,755 | 14,633,401 | 2,199 | A system for recipe and blueprint-driven automated application deployment comprises a processor and a memory. The processor is configured to receive an environment, receive an application configuration, and deploy an application using the environment and the application configuration. The environment is provisioned using an environment template, and wherein the environment template is built using a blueprint. The application configuration comprises one or more application endpoints. The memory is coupled to the processor and is configured to provide the processor with instructions. | 1. A system for recipe and blueprint-driven automated application deployment, comprising:
a processor configured to:
receive a blueprint comprising: a description of computing resources, computing software, and computing services required for at least two virtual machines;
generate a first environment template from the blueprint using a first software tool;
instantiate a first environment from the first environment template by using a second software tool;
receive an application configuration comprising: an application package that includes a set of runtime software artifacts that can be orchestrated and executed on an ongoing basis to perform one or more desired enterprise tasks on the heterogeneous virtual environment; and a configuration of application parameters of the set of runtime software artifacts;
deploy and install the application configuration at the first environment for use by application developers;
generate a second environment template from the first version blueprint using the software tool;
instantiate a second environment from the second environment template by using the second software tool; and
deploy and install the second application configuration package at the second environment, which is different than the first environment, for use by application testers. 2. A system as in claim 1, wherein the application configuration configures connections from applications running on virtual machines in a virtual machine cluster to systems outside the virtual machine cluster. 3. A system as in claim 1, wherein the application configuration configures the application package to deploy. 4. A system as in claim 1, wherein the application configuration configures the target deployment environment. 5. A system as in claim 1, wherein one of one or more application endpoints comprises information needed for an application running in a given environment to interact with a system external to the given environment. 6. A system as in claim 5, wherein one of the one or more application endpoints comprises information related to an external database system. 7. A system as in claim 5, wherein one of the one or more application endpoints comprises information related to an email systems. 8. A system as in claim 5, wherein one of the one or more application endpoints comprises information related to a directory servers. 9. A system as in claim 5, wherein one of the one or more application endpoints comprises information related to an enterprise resource planning server. 10. A system as in claim 5, wherein one of the one or more application endpoints comprises information related to a web service server. 11. A system as in claim 1, wherein the blueprint comprises a set of system details for a given kind of environment 12. A system as in claim 11, wherein the set of details includes one or more of the following: software components intended to run in the given kind of environment, virtual machines needed to run all software components, an allocation or a binding of software components to the virtual machines, a default memory sizing of the virtual machines, a CPU sizing of the virtual machines, and a default sizing of virtual machine clusters. 13. A system as in claim 1, wherein the first environment template comprises a set of instantiated virtual machines each with software components installed as indicated in the blueprint. 14. A system as in claim 1, wherein the application comprises a set of runtime computer program artifacts orchestrated and executed on an ongoing basis to address a particular set of customer requirements. 15. A method for recipe and blueprint-driven automated application deployment, comprising:
receiving a blueprint comprising: a description of computing resources, computing software, and computing services required for at least two virtual machines; generating a first environment template from the blueprint using a first software tool; instantiating a first environment from the first environment template by using a second software tool; receiving an application configuration comprising: an application package that includes a set of runtime software artifacts that can be orchestrated and executed on an ongoing basis to perform one or more desired enterprise tasks on the heterogeneous virtual environment; and a configuration of application parameters of the set of runtime software artifacts; deploying and installing the application configuration at the first environment for use by application developers; generating a second environment template from the first version blueprint using the software tool; instantiating a second environment from the second environment template by using the second software tool, and deploying and installing the second application configuration package at the second environment, which is different than the first environment, for use by application testers. 16. A computer program product for recipe and blueprint-driven automated application deployment, the computer program product being embodied in a non-transitory computer readable storage medium and comprising computer instructions for:
receiving a blueprint comprising: a description of computing resources, computing software, and computing services required for at least two virtual machines; generating a first environment template from the blueprint using a first software tool; instantiating a first environment from the first environment template by using a second software tool; receiving an application configuration comprising: an application package that includes a set of runtime software artifacts that can be orchestrated and executed on an ongoing basis to perform one or more desired enterprise tasks on the heterogeneous virtual environment; and a configuration of application parameters of the set of runtime software artifacts; deploying and installing the application configuration at the first environment for use by application developers; generating a second environment template from the first version blueprint using the software tool; instantiating a second environment from the second environment template by using the second software tool, and deploying and installing the second application configuration package at the second environment, which is different than the first environment, for use by application testers. | A system for recipe and blueprint-driven automated application deployment comprises a processor and a memory. The processor is configured to receive an environment, receive an application configuration, and deploy an application using the environment and the application configuration. The environment is provisioned using an environment template, and wherein the environment template is built using a blueprint. The application configuration comprises one or more application endpoints. The memory is coupled to the processor and is configured to provide the processor with instructions.1. A system for recipe and blueprint-driven automated application deployment, comprising:
a processor configured to:
receive a blueprint comprising: a description of computing resources, computing software, and computing services required for at least two virtual machines;
generate a first environment template from the blueprint using a first software tool;
instantiate a first environment from the first environment template by using a second software tool;
receive an application configuration comprising: an application package that includes a set of runtime software artifacts that can be orchestrated and executed on an ongoing basis to perform one or more desired enterprise tasks on the heterogeneous virtual environment; and a configuration of application parameters of the set of runtime software artifacts;
deploy and install the application configuration at the first environment for use by application developers;
generate a second environment template from the first version blueprint using the software tool;
instantiate a second environment from the second environment template by using the second software tool; and
deploy and install the second application configuration package at the second environment, which is different than the first environment, for use by application testers. 2. A system as in claim 1, wherein the application configuration configures connections from applications running on virtual machines in a virtual machine cluster to systems outside the virtual machine cluster. 3. A system as in claim 1, wherein the application configuration configures the application package to deploy. 4. A system as in claim 1, wherein the application configuration configures the target deployment environment. 5. A system as in claim 1, wherein one of one or more application endpoints comprises information needed for an application running in a given environment to interact with a system external to the given environment. 6. A system as in claim 5, wherein one of the one or more application endpoints comprises information related to an external database system. 7. A system as in claim 5, wherein one of the one or more application endpoints comprises information related to an email systems. 8. A system as in claim 5, wherein one of the one or more application endpoints comprises information related to a directory servers. 9. A system as in claim 5, wherein one of the one or more application endpoints comprises information related to an enterprise resource planning server. 10. A system as in claim 5, wherein one of the one or more application endpoints comprises information related to a web service server. 11. A system as in claim 1, wherein the blueprint comprises a set of system details for a given kind of environment 12. A system as in claim 11, wherein the set of details includes one or more of the following: software components intended to run in the given kind of environment, virtual machines needed to run all software components, an allocation or a binding of software components to the virtual machines, a default memory sizing of the virtual machines, a CPU sizing of the virtual machines, and a default sizing of virtual machine clusters. 13. A system as in claim 1, wherein the first environment template comprises a set of instantiated virtual machines each with software components installed as indicated in the blueprint. 14. A system as in claim 1, wherein the application comprises a set of runtime computer program artifacts orchestrated and executed on an ongoing basis to address a particular set of customer requirements. 15. A method for recipe and blueprint-driven automated application deployment, comprising:
receiving a blueprint comprising: a description of computing resources, computing software, and computing services required for at least two virtual machines; generating a first environment template from the blueprint using a first software tool; instantiating a first environment from the first environment template by using a second software tool; receiving an application configuration comprising: an application package that includes a set of runtime software artifacts that can be orchestrated and executed on an ongoing basis to perform one or more desired enterprise tasks on the heterogeneous virtual environment; and a configuration of application parameters of the set of runtime software artifacts; deploying and installing the application configuration at the first environment for use by application developers; generating a second environment template from the first version blueprint using the software tool; instantiating a second environment from the second environment template by using the second software tool, and deploying and installing the second application configuration package at the second environment, which is different than the first environment, for use by application testers. 16. A computer program product for recipe and blueprint-driven automated application deployment, the computer program product being embodied in a non-transitory computer readable storage medium and comprising computer instructions for:
receiving a blueprint comprising: a description of computing resources, computing software, and computing services required for at least two virtual machines; generating a first environment template from the blueprint using a first software tool; instantiating a first environment from the first environment template by using a second software tool; receiving an application configuration comprising: an application package that includes a set of runtime software artifacts that can be orchestrated and executed on an ongoing basis to perform one or more desired enterprise tasks on the heterogeneous virtual environment; and a configuration of application parameters of the set of runtime software artifacts; deploying and installing the application configuration at the first environment for use by application developers; generating a second environment template from the first version blueprint using the software tool; instantiating a second environment from the second environment template by using the second software tool, and deploying and installing the second application configuration package at the second environment, which is different than the first environment, for use by application testers. | 2,100 |
5,756 | 5,756 | 15,574,370 | 2,193 | Example implementations relate to determining potential test actions. Some implementations may include a data capture engine to capture data points during test executions of the application under test. The data points may include, for example, test action data and application action data. Additionally, some implementations may include a data correlation engine to correlate each of the data points with a particular test execution of the test executions, and each of the data points may be correlated based on a sequence of events that occurred during the particular test execution. Furthermore, some implementations may also include a test verification engine to determine, based on the correlation of the data points, a potential test action to perform during a future test execution of the application under test. | 1. A system for determining potential test actions comprising:
a data capture engine to capture data points during test executions of an application under test, the data points including test action data and application action data; a data correlation engine to correlate each of the data points with a particular test execution of the test executions, each of the data points being correlated based on a sequence of events that occurred during the particular test execution; and a test verification engine to determine, based on the correlation of the data points, a potential test action to perform during a future test execution of the application under test. 2. The system of claim 1, wherein the data correlation engine correlates each of the data points by:
categorizing each of the data points into at least one of a plurality of types, the at least one of a plurality of types including a first type; assigning data points categorized as the first type as a backbone of a directed acyclic graph; connecting remaining data points to the backbone via directed edges based on timestamps associated with the remaining data points, the remaining data points being a set of the data points not categorized as the first type; assigning metadata as vertices connected to the backbone; and assigning tags to the directed edges to identify a type of relation between the vertices. 3. The system of claim 1, wherein:
the data correlation engine correlates each of the data points by generating a directed acyclic graph, the directed acyclic graph being generated based on timestamps associated with the data points and including a plurality of test action nodes and a plurality of application action nodes; and the test verification engine:
accesses a verification input of a verification execution sequence; and
determines the potential test action by:
querying the directed acyclic graph based on the verification input; and
receiving, in response to the query, data indicating that at least one of a test action and an application action represented by the verification input is not included in the directed acyclic graph. 4. The system of claim 3, wherein:
the verification input includes at least one of test action verification information and application action verification information. 5. The system of claim 4, wherein the test verification engine determines the potential test action by:
identifying, based on the test action verification information, a matching test action node in the directed acyclic graph; determining, based on the application action verification information, if the matching test action node includes a corresponding matching application action node in the directed acyclic graph; and identifying the potential test action based on the verification input if the directed acyclic graph does not include at least one of the matching test action node and the corresponding matching application action node. 6. The system of claim 5, wherein the matching test action node is identified based on a sequence of events in the verification execution sequence. 7. The system of claim 3, wherein the test verification engine causes a generation of a visualization of the potential test action, the visualization including a representation of the verification execution sequence and the potential test action within the verification execution sequence. 8. The system of claim 3, wherein:
the test verification engine causes storage of the verification execution sequence as a potential test action verification; and the test verification engine causes the automatic execution of the potential test action verification after the future test execution. 9. The system of claim 8, wherein the test verification engine causes the generation of a notification if the potential test action is performed during the future test execution. 10. The system of claim 8, wherein the potential test action verification is stored before the future test execution is executed. 11. A method comprising:
identifying, using a test verification engine and based on correlated data, an absence of at least one of a test action performed in a verification execution sequence and a corresponding application action performed in response to the test action, the correlated data being captured during historical test executions of an application under test; identifying, using the test verification engine and based on the absence, a potential test action to perform during a future test execution of the application under test; and generating, using the test verification engine and based on the identified potential test action, a potential test action verification to be executed during a future test execution of the application under test. 12. The method of claim 11, wherein generating the potential test action verification includes automatically generating code to automatically verify the potential test action during the future test execution. 13. The method of claim 11, wherein:
the code includes instructions to generate, in response to automatically verifying the potential test action, a notification that the potential test action has been performed during the future test execution. 14. A non-transitory machine-readable storage medium including instructions which, when executed by a processor, cause the processor to:
cause a display of a visualization of a potential test action to perform during a future test execution of an application under test, the visualization including a representation of a verification execution sequence and a representation of the potential test action within the verification execution sequence, wherein the potential test action is identified based on identifying an absence of at least one of a test action data point and a corresponding application action data point that match a verification input, and wherein the at least one of the test action data point and the corresponding application action data point were captured during historical test executions of the application under test and correlated based on sequences of events that occurred during the historical test executions. 15. The non-transitory machine-readable storage medium of claim 14, wherein the instructions cause the processor to modify the visualization if the potential test action is performed during the future test execution. | Example implementations relate to determining potential test actions. Some implementations may include a data capture engine to capture data points during test executions of the application under test. The data points may include, for example, test action data and application action data. Additionally, some implementations may include a data correlation engine to correlate each of the data points with a particular test execution of the test executions, and each of the data points may be correlated based on a sequence of events that occurred during the particular test execution. Furthermore, some implementations may also include a test verification engine to determine, based on the correlation of the data points, a potential test action to perform during a future test execution of the application under test.1. A system for determining potential test actions comprising:
a data capture engine to capture data points during test executions of an application under test, the data points including test action data and application action data; a data correlation engine to correlate each of the data points with a particular test execution of the test executions, each of the data points being correlated based on a sequence of events that occurred during the particular test execution; and a test verification engine to determine, based on the correlation of the data points, a potential test action to perform during a future test execution of the application under test. 2. The system of claim 1, wherein the data correlation engine correlates each of the data points by:
categorizing each of the data points into at least one of a plurality of types, the at least one of a plurality of types including a first type; assigning data points categorized as the first type as a backbone of a directed acyclic graph; connecting remaining data points to the backbone via directed edges based on timestamps associated with the remaining data points, the remaining data points being a set of the data points not categorized as the first type; assigning metadata as vertices connected to the backbone; and assigning tags to the directed edges to identify a type of relation between the vertices. 3. The system of claim 1, wherein:
the data correlation engine correlates each of the data points by generating a directed acyclic graph, the directed acyclic graph being generated based on timestamps associated with the data points and including a plurality of test action nodes and a plurality of application action nodes; and the test verification engine:
accesses a verification input of a verification execution sequence; and
determines the potential test action by:
querying the directed acyclic graph based on the verification input; and
receiving, in response to the query, data indicating that at least one of a test action and an application action represented by the verification input is not included in the directed acyclic graph. 4. The system of claim 3, wherein:
the verification input includes at least one of test action verification information and application action verification information. 5. The system of claim 4, wherein the test verification engine determines the potential test action by:
identifying, based on the test action verification information, a matching test action node in the directed acyclic graph; determining, based on the application action verification information, if the matching test action node includes a corresponding matching application action node in the directed acyclic graph; and identifying the potential test action based on the verification input if the directed acyclic graph does not include at least one of the matching test action node and the corresponding matching application action node. 6. The system of claim 5, wherein the matching test action node is identified based on a sequence of events in the verification execution sequence. 7. The system of claim 3, wherein the test verification engine causes a generation of a visualization of the potential test action, the visualization including a representation of the verification execution sequence and the potential test action within the verification execution sequence. 8. The system of claim 3, wherein:
the test verification engine causes storage of the verification execution sequence as a potential test action verification; and the test verification engine causes the automatic execution of the potential test action verification after the future test execution. 9. The system of claim 8, wherein the test verification engine causes the generation of a notification if the potential test action is performed during the future test execution. 10. The system of claim 8, wherein the potential test action verification is stored before the future test execution is executed. 11. A method comprising:
identifying, using a test verification engine and based on correlated data, an absence of at least one of a test action performed in a verification execution sequence and a corresponding application action performed in response to the test action, the correlated data being captured during historical test executions of an application under test; identifying, using the test verification engine and based on the absence, a potential test action to perform during a future test execution of the application under test; and generating, using the test verification engine and based on the identified potential test action, a potential test action verification to be executed during a future test execution of the application under test. 12. The method of claim 11, wherein generating the potential test action verification includes automatically generating code to automatically verify the potential test action during the future test execution. 13. The method of claim 11, wherein:
the code includes instructions to generate, in response to automatically verifying the potential test action, a notification that the potential test action has been performed during the future test execution. 14. A non-transitory machine-readable storage medium including instructions which, when executed by a processor, cause the processor to:
cause a display of a visualization of a potential test action to perform during a future test execution of an application under test, the visualization including a representation of a verification execution sequence and a representation of the potential test action within the verification execution sequence, wherein the potential test action is identified based on identifying an absence of at least one of a test action data point and a corresponding application action data point that match a verification input, and wherein the at least one of the test action data point and the corresponding application action data point were captured during historical test executions of the application under test and correlated based on sequences of events that occurred during the historical test executions. 15. The non-transitory machine-readable storage medium of claim 14, wherein the instructions cause the processor to modify the visualization if the potential test action is performed during the future test execution. | 2,100 |
5,757 | 5,757 | 12,964,292 | 2,156 | A system and method for media asset management. An original media asset for a media project is identified and a plurality of versions of the original media asset is also identified. The plurality of versions of the media asset include at least one modified version of the original media asset. Typically each of the plurality of versions of the original media asset includes a plurality of components, and the modified versions of the original media asset include at least one modified component. The component being modified is based on a corresponding component of the original media asset. Metadata for each of the plurality of components is generated that indicates whether each component is a modified component, and the metadata of the modified component indicates a type of modification made to the modified component. | 1. A method for generating metadata of a media project comprising:
accessing one or more criterion related to a predetermined result of the media project; identifying an original media asset for the media project; identifying a plurality of versions of the original media asset, the plurality of versions of the media asset including at least one modified version of the original media asset,
wherein each of the plurality of versions of the original media asset includes a plurality of components, and the modified versions of the original media asset includes at least one modified component which is modified based on a corresponding component of the original media asset;
generating metadata for each of the plurality of components that indicates whether each component is a modified component, and the metadata of the modified component indicates a type of modification made to the modified component; and associating the metadata with the original media asset. 2. The method as recited in claim 1 wherein the original media asset includes a movie. 3. The method as recited in claim 1 wherein the original media asset includes a television program. 4. The method as recited in claim 1 wherein the original media asset includes audio data. 5. The method as recited in claim 1 wherein the original media asset includes software. 6. The method as recited in claim 1, wherein the plurality of components include media type, territory, picture, audio, content and color. 7. The method as recited in claim 1, wherein the metadata of the modified component includes indicia describing variances between the modified component and the corresponding component of the original media asset. 8. The method as recited in claim 7, wherein the variances include component addition, component deletion and component substitution. 9. The method as recited in claim 1, further comprising:
displaying the metadata. 10. A non-transitory computer-readable medium storing program code that when executed by a processor generates metadata of a media project by performing steps comprising:
accessing one or more criterion related to a predetermined result of the media project; identifying an original media asset for the media project; identifying a plurality of versions of the original media asset, the plurality of versions of the media asset including at least one modified version of the original media asset,
wherein each of the plurality of versions of the original media asset includes a plurality of components, and the modified versions of the original media asset includes at least one modified component which is modified based on a corresponding component of the original media asset;
generating metadata for each of the plurality of components that indicates whether each component is a modified component, and the metadata of the modified component indicates a type of modification made to the modified component; and associating the metadata with the original media asset. 11. The program code as recited in claim 10 wherein the original media asset includes a movie. 12. The program code as recited in claim 10 wherein the original media asset includes a television program. 13. The program code as recited in claim 10 wherein the original media asset includes audio data. 14. The program code as recited in claim 10 wherein the original media asset includes software. 15. The program code recited in claim 10, wherein the plurality of components include media type, territory, picture, audio, content and color. 16. The program code as recited in claim 10, wherein the metadata of the modified component includes indicia describing variances between the modified component and the corresponding component of the original media asset. 17. The program code as recited in claim 16, wherein the variances include component addition, component deletion and component substitution. 18. The program code as recited in claim 10, further comprising the step of:
displaying the metadata. | A system and method for media asset management. An original media asset for a media project is identified and a plurality of versions of the original media asset is also identified. The plurality of versions of the media asset include at least one modified version of the original media asset. Typically each of the plurality of versions of the original media asset includes a plurality of components, and the modified versions of the original media asset include at least one modified component. The component being modified is based on a corresponding component of the original media asset. Metadata for each of the plurality of components is generated that indicates whether each component is a modified component, and the metadata of the modified component indicates a type of modification made to the modified component.1. A method for generating metadata of a media project comprising:
accessing one or more criterion related to a predetermined result of the media project; identifying an original media asset for the media project; identifying a plurality of versions of the original media asset, the plurality of versions of the media asset including at least one modified version of the original media asset,
wherein each of the plurality of versions of the original media asset includes a plurality of components, and the modified versions of the original media asset includes at least one modified component which is modified based on a corresponding component of the original media asset;
generating metadata for each of the plurality of components that indicates whether each component is a modified component, and the metadata of the modified component indicates a type of modification made to the modified component; and associating the metadata with the original media asset. 2. The method as recited in claim 1 wherein the original media asset includes a movie. 3. The method as recited in claim 1 wherein the original media asset includes a television program. 4. The method as recited in claim 1 wherein the original media asset includes audio data. 5. The method as recited in claim 1 wherein the original media asset includes software. 6. The method as recited in claim 1, wherein the plurality of components include media type, territory, picture, audio, content and color. 7. The method as recited in claim 1, wherein the metadata of the modified component includes indicia describing variances between the modified component and the corresponding component of the original media asset. 8. The method as recited in claim 7, wherein the variances include component addition, component deletion and component substitution. 9. The method as recited in claim 1, further comprising:
displaying the metadata. 10. A non-transitory computer-readable medium storing program code that when executed by a processor generates metadata of a media project by performing steps comprising:
accessing one or more criterion related to a predetermined result of the media project; identifying an original media asset for the media project; identifying a plurality of versions of the original media asset, the plurality of versions of the media asset including at least one modified version of the original media asset,
wherein each of the plurality of versions of the original media asset includes a plurality of components, and the modified versions of the original media asset includes at least one modified component which is modified based on a corresponding component of the original media asset;
generating metadata for each of the plurality of components that indicates whether each component is a modified component, and the metadata of the modified component indicates a type of modification made to the modified component; and associating the metadata with the original media asset. 11. The program code as recited in claim 10 wherein the original media asset includes a movie. 12. The program code as recited in claim 10 wherein the original media asset includes a television program. 13. The program code as recited in claim 10 wherein the original media asset includes audio data. 14. The program code as recited in claim 10 wherein the original media asset includes software. 15. The program code recited in claim 10, wherein the plurality of components include media type, territory, picture, audio, content and color. 16. The program code as recited in claim 10, wherein the metadata of the modified component includes indicia describing variances between the modified component and the corresponding component of the original media asset. 17. The program code as recited in claim 16, wherein the variances include component addition, component deletion and component substitution. 18. The program code as recited in claim 10, further comprising the step of:
displaying the metadata. | 2,100 |
5,758 | 5,758 | 14,504,121 | 2,154 | This document describes techniques and devices for a radar recognition-aided search. Through use of a radar-based recognition system, gestures made by, and physiological information about, persons can be determined. In the case of physiological information, the techniques can use this information to refine a search. For example, if a person requests a search for a coffee shop, the techniques may refine the search to coffee shops in the direction that the person is walking. In the case of a gesture, the techniques may refine or base a search solely on the gesture. Thus, a search for information about a store, car, or tree can be made responsive to a gesture pointing at the store, car, or tree with or without explicit entry of a search query. | 1. A computer-implemented method comprising:
receiving, from a computing device, a search request having a search query; recognizing a gesture received through a radar-based recognition system; determining information about the gesture that is relevant to the search request; causing a search to be performed using the search query and the determined information; and providing information responsive to the search request. 2. The computer-implemented method as described in claim 1, wherein providing the provided information: presents results of the search in a list; presents a map displaying visual elements; or presents audio or visual media. 3. The computer-implemented method as described in claim 1, wherein receiving the search request receives the search request through a mobile computing device, determining information about the gesture determines that the gesture indicates a geographic direction to refine the search, causing the search to be performed performs the requested search by refining the search using the geographic direction, and providing the provided information provides results according to the search query and within the geographic direction. 4. The computer-implemented method as described in claim 3, wherein receiving the search request receives the search request through an audio communication system and determining information is responsive to and based on the gesture being received commensurate with receiving the search request through the audio communication system. 5. The computer-implemented method as described in claim 3, wherein the geographic direction indicates a street and performing the requested search refines the search to search results having an address on the street. 6. The computer-implemented method as described in claim 3, wherein the geographic direction indicates a building and causing the requested search to be performed performs the requested search by refining the search to search results having an address within the building. 7. The computer-implemented method as described in claim 1, wherein determining information about the gesture determines that the gesture indicates an intended path to refine the search, causing the requested search to be performed refines the search using the intended path, and providing the provided information provides results of the search along the intended path. 8. The computer-implemented method as described in claim 1, wherein determining information about the gesture that is relevant to the search request compares a meaning associated with the gesture and refines the search with the associated meaning. 9. The computer-implemented method as described in claim 1, wherein causing the requested search to be performed uses the search query and refines, based on the determined information, a prior search performed using the search query. 10. The computer-implemented method as described in claim 1, wherein determining information about the gesture that is relevant to the search request determines an object to which the gesture is directed, the determined information being information about the object, and wherein performing the requested search uses the information about the object. 11. The computer-implemented method as described in claim 10, wherein the object is determined to be currently presented as part of a media presentation and further comprising determining the information about the object by analyzing the media presentation. 12. A computer-implemented method comprising:
receiving an indication that a person is requesting a search; recognizing a gesture received through a radar-based recognition system; determining information about the gesture sufficient to perform a search; performing, or causing performance of, the requested search using the determined information; and providing the search results resulting from performing the requested search using the determined information. 13. The computer-implemented method as described in claim 12, wherein performing the requested search using the determined information uses only the determined information. 14. The computer-implemented method as described in claim 12, wherein receiving the indication that the person is requesting a search receives the indication responsive to recognizing another gesture through the radar-based recognition system prior to recognizing the gesture. 15. The computer-implemented method as described in claim 12, further comprising, prior to performing the search using the determined information, prompting selection of additional information, receiving the additional information, and wherein performing the search is responsive to receiving the additional information. 16. The computer-implemented method as described in claim 12, further comprising, prior to performing the search using the determined information, determining context for the gesture, the context indicating that media is presented, and using information about the media to refine the search. 17. The computer-implemented method as described in claim 12, wherein determining the information about the gesture determines that the gesture is directed to an entity that is currently presented as part of a media presentation and further comprising determining the information about the entity by analyzing the media presentation. 18. A computer-implemented method comprising:
receiving, from an input device, a search request having a search query; determining, through a radar-based recognition system, physiological information about a person associated with the input device; performing, or causing performance of, the requested search using the search query and the determined physiological information about the person; and providing the search results resulting from performing the requested search using the search query and the determined physiological information. 19. The computer-implemented method as described in claim 18, wherein determining the physiological information about the person determines the person's heart rate, hydration level, body temperature, or stress level. 20. The computer-implemented method as described in claim 18, wherein determining the physiological information about the person determines the person physical orientation. | This document describes techniques and devices for a radar recognition-aided search. Through use of a radar-based recognition system, gestures made by, and physiological information about, persons can be determined. In the case of physiological information, the techniques can use this information to refine a search. For example, if a person requests a search for a coffee shop, the techniques may refine the search to coffee shops in the direction that the person is walking. In the case of a gesture, the techniques may refine or base a search solely on the gesture. Thus, a search for information about a store, car, or tree can be made responsive to a gesture pointing at the store, car, or tree with or without explicit entry of a search query.1. A computer-implemented method comprising:
receiving, from a computing device, a search request having a search query; recognizing a gesture received through a radar-based recognition system; determining information about the gesture that is relevant to the search request; causing a search to be performed using the search query and the determined information; and providing information responsive to the search request. 2. The computer-implemented method as described in claim 1, wherein providing the provided information: presents results of the search in a list; presents a map displaying visual elements; or presents audio or visual media. 3. The computer-implemented method as described in claim 1, wherein receiving the search request receives the search request through a mobile computing device, determining information about the gesture determines that the gesture indicates a geographic direction to refine the search, causing the search to be performed performs the requested search by refining the search using the geographic direction, and providing the provided information provides results according to the search query and within the geographic direction. 4. The computer-implemented method as described in claim 3, wherein receiving the search request receives the search request through an audio communication system and determining information is responsive to and based on the gesture being received commensurate with receiving the search request through the audio communication system. 5. The computer-implemented method as described in claim 3, wherein the geographic direction indicates a street and performing the requested search refines the search to search results having an address on the street. 6. The computer-implemented method as described in claim 3, wherein the geographic direction indicates a building and causing the requested search to be performed performs the requested search by refining the search to search results having an address within the building. 7. The computer-implemented method as described in claim 1, wherein determining information about the gesture determines that the gesture indicates an intended path to refine the search, causing the requested search to be performed refines the search using the intended path, and providing the provided information provides results of the search along the intended path. 8. The computer-implemented method as described in claim 1, wherein determining information about the gesture that is relevant to the search request compares a meaning associated with the gesture and refines the search with the associated meaning. 9. The computer-implemented method as described in claim 1, wherein causing the requested search to be performed uses the search query and refines, based on the determined information, a prior search performed using the search query. 10. The computer-implemented method as described in claim 1, wherein determining information about the gesture that is relevant to the search request determines an object to which the gesture is directed, the determined information being information about the object, and wherein performing the requested search uses the information about the object. 11. The computer-implemented method as described in claim 10, wherein the object is determined to be currently presented as part of a media presentation and further comprising determining the information about the object by analyzing the media presentation. 12. A computer-implemented method comprising:
receiving an indication that a person is requesting a search; recognizing a gesture received through a radar-based recognition system; determining information about the gesture sufficient to perform a search; performing, or causing performance of, the requested search using the determined information; and providing the search results resulting from performing the requested search using the determined information. 13. The computer-implemented method as described in claim 12, wherein performing the requested search using the determined information uses only the determined information. 14. The computer-implemented method as described in claim 12, wherein receiving the indication that the person is requesting a search receives the indication responsive to recognizing another gesture through the radar-based recognition system prior to recognizing the gesture. 15. The computer-implemented method as described in claim 12, further comprising, prior to performing the search using the determined information, prompting selection of additional information, receiving the additional information, and wherein performing the search is responsive to receiving the additional information. 16. The computer-implemented method as described in claim 12, further comprising, prior to performing the search using the determined information, determining context for the gesture, the context indicating that media is presented, and using information about the media to refine the search. 17. The computer-implemented method as described in claim 12, wherein determining the information about the gesture determines that the gesture is directed to an entity that is currently presented as part of a media presentation and further comprising determining the information about the entity by analyzing the media presentation. 18. A computer-implemented method comprising:
receiving, from an input device, a search request having a search query; determining, through a radar-based recognition system, physiological information about a person associated with the input device; performing, or causing performance of, the requested search using the search query and the determined physiological information about the person; and providing the search results resulting from performing the requested search using the search query and the determined physiological information. 19. The computer-implemented method as described in claim 18, wherein determining the physiological information about the person determines the person's heart rate, hydration level, body temperature, or stress level. 20. The computer-implemented method as described in claim 18, wherein determining the physiological information about the person determines the person physical orientation. | 2,100 |
5,759 | 5,759 | 14,879,110 | 2,191 | A system for circulating a volatile composition throughout at least one room is provided. The system includes a central communication unit capable of receiving incoming signals and sending outgoing instructions. The central communication unit comprises a memory configured to store settings. The system includes a volatile composition dispenser capable of delivering the volatile composition into the air. The volatile composition dispenser is communicably connectable with the central communication unit through a wireless communication link. The system includes an air handling device communicably connectable with the central communication unit and configured to move air throughout the at least one room upon receipt of an outgoing instruction from the central communication unit. | 1. A system for circulating a volatile composition throughout at least one room, the system comprising:
a central communication unit capable of receiving incoming signals and sending outgoing instructions, the central communication unit comprising a memory configured to store settings; a volatile composition dispenser capable of delivering the volatile composition into the air, wherein the volatile composition dispenser is communicably connectable with the central communication unit through a wireless communication link; and an air handling device communicably connectable with the central communication unit and configured to move air throughout the at least one room upon receipt of an outgoing instruction from the central communication unit. 2. The system of claim 1, wherein the central communication unit sends an outgoing instruction to the air handling device to turn on after the volatile composition dispenser sends a signal to the central communication unit that the volatile composition dispenser is turned off. 3. The system of claim 1, wherein the central communication unit sends a first outgoing instruction to the volatile composition dispenser to turn off the volatile composition after a first set point is reached, wherein the central communication unit sends a second outgoing instruction to the air handling device to turn on the air handling device after a second set point is reached, wherein the second set point is spaced from the first set point. 4. The system of claim 1, wherein the wireless communication link is selected from the group consisting of: Wi-Fi; Bluetooth; ZigBee, 6LoWPAN, Thread, Mesh Network, or combinations thereof. 5. The system of claim 1, wherein the volatile composition dispenser comprises a sensor for measuring temperature or level of volatiles in the air. 6. The system of claim 1, wherein the volatile composition dispenser is configured with mesh network border router functionality. 7. The system of claim 1, wherein the volatile composition dispenser is a heating, ventilation, and air conditioning system. 8. The system of claim 1, wherein the volatile composition dispenser is communicably connectable with an ad hoc wireless mesh network. 9. The system of claim 1, wherein at least two volatile composition dispensers are communicably connectable with the central communication unit. 10. The system of claim 1, wherein the central communication unit uses an algorithm to determine the optimal volatile composition levels and air handling device operation profiles. 11. The system of claim 1, wherein the algorithm is a machine learning algorithm. 12. A method of circulating a volatile composition throughout at least one room using an air handling device, the volatile composition being delivered into the room from a volatile composition dispenser, wherein the air handling device and the volatile composition dispenser are each communicably connectable with a central control unit, the method comprising the steps of:
(a) sending a first outgoing instruction from the central control unit to the volatile composition dispenser to turn on the volatile composition dispenser; (b) sending a second outgoing instruction from the central control unit to the volatile composition dispenser to turn off the volatile composition dispenser after a first set point is reached; (c) sending a third outgoing instruction from the central control unit to the air handling device to turn on the air handling device at a second set point, wherein the second set point is a predetermined time relative to when the first set point is reached; (d) sending a fourth outgoing instruction from the central control unit to the air handling device to turn off the air handling device after a third set point is reached; and (e) optionally repeating steps (a) through (d). 13. The method of claim 12, wherein the first and third set points are durations of time. 14. The method of claim 12, wherein the first set point is a time duration in the range of about 5 minutes to about 60 minutes. 15. The method of claim 12, wherein the second set point is before the first set point, at the same time as the first set point, or after the first set point. 16. The method of claim 12, wherein the third set point is a time duration in the range of about 5 minutes to about 20 minutes. 17. The method of claim 12 further comprising the step of modifying the first, second, or third set point from a user interface. 18. The method of claim 12, wherein the air handling device is a heating, ventilation, and air conditioning system. 19. The method of claim 12, wherein the volatile composition dispenser is communicably connectable with the central communication unit through a wireless communication link. 20. The method of claim 12, wherein the central communication unit uses an algorithm to determine the optimal volatile composition emission and air handling device profile. 21.-35. (canceled) | A system for circulating a volatile composition throughout at least one room is provided. The system includes a central communication unit capable of receiving incoming signals and sending outgoing instructions. The central communication unit comprises a memory configured to store settings. The system includes a volatile composition dispenser capable of delivering the volatile composition into the air. The volatile composition dispenser is communicably connectable with the central communication unit through a wireless communication link. The system includes an air handling device communicably connectable with the central communication unit and configured to move air throughout the at least one room upon receipt of an outgoing instruction from the central communication unit.1. A system for circulating a volatile composition throughout at least one room, the system comprising:
a central communication unit capable of receiving incoming signals and sending outgoing instructions, the central communication unit comprising a memory configured to store settings; a volatile composition dispenser capable of delivering the volatile composition into the air, wherein the volatile composition dispenser is communicably connectable with the central communication unit through a wireless communication link; and an air handling device communicably connectable with the central communication unit and configured to move air throughout the at least one room upon receipt of an outgoing instruction from the central communication unit. 2. The system of claim 1, wherein the central communication unit sends an outgoing instruction to the air handling device to turn on after the volatile composition dispenser sends a signal to the central communication unit that the volatile composition dispenser is turned off. 3. The system of claim 1, wherein the central communication unit sends a first outgoing instruction to the volatile composition dispenser to turn off the volatile composition after a first set point is reached, wherein the central communication unit sends a second outgoing instruction to the air handling device to turn on the air handling device after a second set point is reached, wherein the second set point is spaced from the first set point. 4. The system of claim 1, wherein the wireless communication link is selected from the group consisting of: Wi-Fi; Bluetooth; ZigBee, 6LoWPAN, Thread, Mesh Network, or combinations thereof. 5. The system of claim 1, wherein the volatile composition dispenser comprises a sensor for measuring temperature or level of volatiles in the air. 6. The system of claim 1, wherein the volatile composition dispenser is configured with mesh network border router functionality. 7. The system of claim 1, wherein the volatile composition dispenser is a heating, ventilation, and air conditioning system. 8. The system of claim 1, wherein the volatile composition dispenser is communicably connectable with an ad hoc wireless mesh network. 9. The system of claim 1, wherein at least two volatile composition dispensers are communicably connectable with the central communication unit. 10. The system of claim 1, wherein the central communication unit uses an algorithm to determine the optimal volatile composition levels and air handling device operation profiles. 11. The system of claim 1, wherein the algorithm is a machine learning algorithm. 12. A method of circulating a volatile composition throughout at least one room using an air handling device, the volatile composition being delivered into the room from a volatile composition dispenser, wherein the air handling device and the volatile composition dispenser are each communicably connectable with a central control unit, the method comprising the steps of:
(a) sending a first outgoing instruction from the central control unit to the volatile composition dispenser to turn on the volatile composition dispenser; (b) sending a second outgoing instruction from the central control unit to the volatile composition dispenser to turn off the volatile composition dispenser after a first set point is reached; (c) sending a third outgoing instruction from the central control unit to the air handling device to turn on the air handling device at a second set point, wherein the second set point is a predetermined time relative to when the first set point is reached; (d) sending a fourth outgoing instruction from the central control unit to the air handling device to turn off the air handling device after a third set point is reached; and (e) optionally repeating steps (a) through (d). 13. The method of claim 12, wherein the first and third set points are durations of time. 14. The method of claim 12, wherein the first set point is a time duration in the range of about 5 minutes to about 60 minutes. 15. The method of claim 12, wherein the second set point is before the first set point, at the same time as the first set point, or after the first set point. 16. The method of claim 12, wherein the third set point is a time duration in the range of about 5 minutes to about 20 minutes. 17. The method of claim 12 further comprising the step of modifying the first, second, or third set point from a user interface. 18. The method of claim 12, wherein the air handling device is a heating, ventilation, and air conditioning system. 19. The method of claim 12, wherein the volatile composition dispenser is communicably connectable with the central communication unit through a wireless communication link. 20. The method of claim 12, wherein the central communication unit uses an algorithm to determine the optimal volatile composition emission and air handling device profile. 21.-35. (canceled) | 2,100 |
5,760 | 5,760 | 14,519,778 | 2,159 | An electronic search evaluation system and method are disclosed. The system includes an application loadable onto a user device including a display and an input, and a server in communication with the user device. The application, when loaded onto the user device, permits the user device to communicate with the server to send to the server baseline and candidate search configurations, and a plurality of search terms, and to receive from the server, baseline and candidate search results for the search terms, and to cause display of the search results on the display. The server configured to receive the search configurations and search terms, identify the search results, compare the search results, and send the search results to the application. The search results sent to the application including a comparison marker to indicate whether the search results are matching. | 1. An electronic search evaluation system, comprising:
an application that is loadable onto a user device, the user device including a display and an input; a server in communication with the user device, wherein the application, when loaded onto the user device, permits the user device to communicate with the server to send to the server a baseline search configuration, a candidate search configuration, and a plurality of search terms, and to receive from the server baseline search results and candidate search results for the plurality of search terms, and to cause display of the baseline search results and candidate search results on the display, the server being communicable with the user device and configured to receive the baseline and candidate search configurations and search terms, identify the baseline and candidate search results, compare the baseline and candidate search results, and send the baseline and candidate search results to the application, wherein the baseline and candidate search results sent to the application include a comparison marker to indicate whether the baseline and candidate search results are matching. 2. The electronic search evaluation system according to claim 1, wherein the server is communicable with one or more search engines, such that the server requests a search from the one or more search engines for the baseline search configuration and the candidate search configuration for each of the plurality of search terms, and receives the search results for each of the plurality of search terms from the one or more search engines. 3. The electronic search evaluation system according to claim 1, wherein the application makes available a configuration user interface which permits the user to create and/or modify one or more search configurations. 4. The electronic search evaluation system according to claim 1, wherein the application is configured to receive a search term list having a plurality of search terms therein. 5. The electronic search evaluation system according to claim 1, wherein the application makes available a detailed comparison user interface configured to display a side-by-side comparison of the baseline search results and the candidate search results for each of the plurality of search terms, and wherein the comparison marker indicates the baseline search results and the candidate search results are not matching. 6. The electronic search evaluation system according to claim 5, wherein the detailed comparison user interface includes an input means for receiving a candidate score for the candidate search results. 7. A method of evaluating a search configuration, the method comprising:
providing a search evaluation system that is loadable onto a user device having an input and a display, the search evaluation system permitting a user to create and/or modify search configurations, configure search evaluation parameters, execute search evaluations for a plurality of search terms, and review and score search results for the search configurations and the plurality of search terms; receiving, by a server, the plurality of search terms, a baseline search configuration, and a candidate search configuration from the search evaluation system; obtaining a baseline search results list and a candidate search results list for each of the plurality of search terms, wherein the baseline search results lists correspond to the baseline search configuration and the candidate search results lists correspond to the candidate search configuration; comparing the baseline search results list with the candidate search results list for each of the plurality of search terms; based on the comparing, generating a discrepancy list of search terms wherein the baseline search results list and the candidate search results lists are not the same; and sending the discrepancy list and search details associated with the search terms in the discrepancy list to the user device for display on the display in a side-by-side breakdown. 8. The method according to claim 7, further comprising:
receiving baseline scores for the baseline search results list from the search evaluation system. 9. The method according to claim 7, wherein receiving the plurality of search terms includes receiving a search term list file. 10. The method according to claim 7, wherein receiving the plurality of search terms includes receiving an indication to use a plurality of stored search terms, wherein the plurality of stored search terms are stored in a search term database. 11. The method according to claim 7, wherein obtaining the baseline and candidate search results lists includes submitting a query to a search engine. 12. The method according to claim 7, wherein providing the baseline and candidate search results lists includes:
displaying, on the user device, a side-by-side breakdown of each of the baseline and candidate search results, the displaying including search details indicating how a search result was identified. 13. The method according to claim 7, further comprising providing scoring summaries that include providing scoring breakdowns for each of a plurality of candidate scores. 14. A graphical user interface (GUI) for a search evaluation system displayed on a display of a user device, the GUI comprising:
one or more servers connectable to a network and configured to provide a search evaluation system interface for evaluating a plurality of search configurations, the search evaluation system interface viewable on a user device and displaying a plurality of search results lists for a plurality of search terms and the plurality of search configurations, the plurality of search configurations including a baseline search configuration and a candidate search configuration, the plurality of search results lists including a baseline search result list and a candidate search result list for each of the plurality of search terms. 15. The GUI according to claim 14, wherein the baseline search result list and the candidate search result list are displayed side-by-side for each of the plurality of search terms. 16. The GUI according to claim 15, wherein the baseline search result list and the candidate search result list include search details identifying how a search term was ranked. 17. The GUI according to claim 14, wherein the GUI is configured to receive a candidate score associated with the candidate search result list. 18. The GUI according to claim 17, the GUI being further configured to display a score summary for each of the plurality of search terms, the score summary including the candidate score and a baseline score. 19. The GUI according to claim 17, wherein the GUI is configured to receive comments associated with the candidate score. 20. The GUI according to claim 17, wherein the GUI is accessible to a plurality of users, and the GUI displays a score summary including the candidate scale and a baseline score for each of the plurality of search terms for each of the plurality of users. | An electronic search evaluation system and method are disclosed. The system includes an application loadable onto a user device including a display and an input, and a server in communication with the user device. The application, when loaded onto the user device, permits the user device to communicate with the server to send to the server baseline and candidate search configurations, and a plurality of search terms, and to receive from the server, baseline and candidate search results for the search terms, and to cause display of the search results on the display. The server configured to receive the search configurations and search terms, identify the search results, compare the search results, and send the search results to the application. The search results sent to the application including a comparison marker to indicate whether the search results are matching.1. An electronic search evaluation system, comprising:
an application that is loadable onto a user device, the user device including a display and an input; a server in communication with the user device, wherein the application, when loaded onto the user device, permits the user device to communicate with the server to send to the server a baseline search configuration, a candidate search configuration, and a plurality of search terms, and to receive from the server baseline search results and candidate search results for the plurality of search terms, and to cause display of the baseline search results and candidate search results on the display, the server being communicable with the user device and configured to receive the baseline and candidate search configurations and search terms, identify the baseline and candidate search results, compare the baseline and candidate search results, and send the baseline and candidate search results to the application, wherein the baseline and candidate search results sent to the application include a comparison marker to indicate whether the baseline and candidate search results are matching. 2. The electronic search evaluation system according to claim 1, wherein the server is communicable with one or more search engines, such that the server requests a search from the one or more search engines for the baseline search configuration and the candidate search configuration for each of the plurality of search terms, and receives the search results for each of the plurality of search terms from the one or more search engines. 3. The electronic search evaluation system according to claim 1, wherein the application makes available a configuration user interface which permits the user to create and/or modify one or more search configurations. 4. The electronic search evaluation system according to claim 1, wherein the application is configured to receive a search term list having a plurality of search terms therein. 5. The electronic search evaluation system according to claim 1, wherein the application makes available a detailed comparison user interface configured to display a side-by-side comparison of the baseline search results and the candidate search results for each of the plurality of search terms, and wherein the comparison marker indicates the baseline search results and the candidate search results are not matching. 6. The electronic search evaluation system according to claim 5, wherein the detailed comparison user interface includes an input means for receiving a candidate score for the candidate search results. 7. A method of evaluating a search configuration, the method comprising:
providing a search evaluation system that is loadable onto a user device having an input and a display, the search evaluation system permitting a user to create and/or modify search configurations, configure search evaluation parameters, execute search evaluations for a plurality of search terms, and review and score search results for the search configurations and the plurality of search terms; receiving, by a server, the plurality of search terms, a baseline search configuration, and a candidate search configuration from the search evaluation system; obtaining a baseline search results list and a candidate search results list for each of the plurality of search terms, wherein the baseline search results lists correspond to the baseline search configuration and the candidate search results lists correspond to the candidate search configuration; comparing the baseline search results list with the candidate search results list for each of the plurality of search terms; based on the comparing, generating a discrepancy list of search terms wherein the baseline search results list and the candidate search results lists are not the same; and sending the discrepancy list and search details associated with the search terms in the discrepancy list to the user device for display on the display in a side-by-side breakdown. 8. The method according to claim 7, further comprising:
receiving baseline scores for the baseline search results list from the search evaluation system. 9. The method according to claim 7, wherein receiving the plurality of search terms includes receiving a search term list file. 10. The method according to claim 7, wherein receiving the plurality of search terms includes receiving an indication to use a plurality of stored search terms, wherein the plurality of stored search terms are stored in a search term database. 11. The method according to claim 7, wherein obtaining the baseline and candidate search results lists includes submitting a query to a search engine. 12. The method according to claim 7, wherein providing the baseline and candidate search results lists includes:
displaying, on the user device, a side-by-side breakdown of each of the baseline and candidate search results, the displaying including search details indicating how a search result was identified. 13. The method according to claim 7, further comprising providing scoring summaries that include providing scoring breakdowns for each of a plurality of candidate scores. 14. A graphical user interface (GUI) for a search evaluation system displayed on a display of a user device, the GUI comprising:
one or more servers connectable to a network and configured to provide a search evaluation system interface for evaluating a plurality of search configurations, the search evaluation system interface viewable on a user device and displaying a plurality of search results lists for a plurality of search terms and the plurality of search configurations, the plurality of search configurations including a baseline search configuration and a candidate search configuration, the plurality of search results lists including a baseline search result list and a candidate search result list for each of the plurality of search terms. 15. The GUI according to claim 14, wherein the baseline search result list and the candidate search result list are displayed side-by-side for each of the plurality of search terms. 16. The GUI according to claim 15, wherein the baseline search result list and the candidate search result list include search details identifying how a search term was ranked. 17. The GUI according to claim 14, wherein the GUI is configured to receive a candidate score associated with the candidate search result list. 18. The GUI according to claim 17, the GUI being further configured to display a score summary for each of the plurality of search terms, the score summary including the candidate score and a baseline score. 19. The GUI according to claim 17, wherein the GUI is configured to receive comments associated with the candidate score. 20. The GUI according to claim 17, wherein the GUI is accessible to a plurality of users, and the GUI displays a score summary including the candidate scale and a baseline score for each of the plurality of search terms for each of the plurality of users. | 2,100 |
5,761 | 5,761 | 14,931,033 | 2,177 | A method of dynamically creating a change template based on a change request received from a user. A change request is assigned a category based on the specifics of the request. If at least one existing template for the category the change request is assigned does not exist, historical change requests are analyzed to identify similar changes in historical change requests to the change request and data is copied from a template used for a historical change that was similar to the change requested to create a draft template. The draft template is altered to remove information which is not relevant to the change request and is stored in a repository. The altered draft template is sent to a reviewer as a proposed template; and approved proposed templates from the reviewer are stored in the repository by category. | 1. A method of dynamically creating a change template based on a change request received from a user, comprising the steps of:
a computer assigning the change request to a category based on specifics of the change request; the computer looking up the category assigned to the change request, to find one or more existing change templates for the category; if the computer finds at least one existing change template for the category, the computer assigning a template to the change request; and if the computer does not find at least one existing template for the category, the method comprising the steps of:
the computer analyzing historical change requests to identify similar changes in historical change requests to the change request;
the computer copying data from a template used for a historical change that was similar to the change requested to create a draft template;
the computer altering the draft template to remove information which is not relevant to the change request and storing the altered draft template in a repository;
the computer sending the altered draft template to a reviewer as a proposed template; and
the computer storing the approved proposed template from the reviewer in the repository. 2. The method of claim 1, wherein prior to categorization, the specifics of the change request are identified and reviewed using text analytics. 3. The method of claim 1, wherein the successful historical changes are analyzed using text analytics 4. The method of claim 1, wherein the data copied is comprised of tasks to be completed to implement the historical change request. 5. The method of claim 1, wherein the information removed from the draft templates is information regarding specific dates. 6. The method of claim 1, wherein the data copied is comprised of a duration of time needed to implement the historical change. 7. A computer program product for dynamically creating a change template based on a change request received from a user using a computer comprising at least one processor, one or more memories, one or more computer readable storage media, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions executable by the computer to perform a method comprising:
assigning, by the computer, the change request to a category based on specifics of the change request; looking up, by the computer, the category assigned to the change request, to find one or more existing change templates for the category; if the computer finds at least one existing change template for the category, the assigning, by the computer, a template to the change request; and if the computer does not find at least one existing template for the category, the program instructions comprising:
analyzing, by the computer, historical change requests to identify similar changes in historical change requests to the change request;
copying, by the computer, data from a template used for a historical change that was similar to the change requested to create a draft template;
altering, by the computer, the draft template to remove information which is not relevant to the change request and storing the altered draft template in a repository;
sending, by the computer, the altered draft template to a reviewer as a proposed template; and
storing, by the computer, the approved proposed template from the reviewer in the repository. 8. The computer program product of claim 7, wherein prior to categorization, the specifics of the change request are identified and reviewed using text analytics. 9. The computer program product of claim 7, wherein the successful historical changes are analyzed using text analytics. 10. The computer program product of claim 7, wherein the data copied is comprised of tasks to be completed to implement the historical change request. 11. The computer program product of claim 7, wherein the information removed from the draft templates is information regarding specific dates. 12. The computer program product of claim 7, wherein the data copied is comprised of a duration of time needed to implement the historical change. 13. A computer system for dynamically creating a change template based on a change request received from a user comprising a computer comprising at least one processor, one or more memories, one or more computer readable storage media having program instructions executable by the computer to perform the program instructions comprising:
assigning, by the computer, the change request to a category based on specifics of the change request; looking up, by the computer, the category assigned to the change request, to find one or more existing change templates for the category; if the computer finds at least one existing change template for the category, the assigning, by the computer, a template to the change request; and if the computer does not find at least one existing template for the category, the program instructions comprising:
analyzing, by the computer, historical change requests to identify similar changes in historical change requests to the change request;
copying, by the computer, data from a template used for a historical change that was similar to the change requested to create a draft template;
altering, by the computer, the draft template to remove information which is not relevant to the change request and storing the altered draft template in a repository;
sending, by the computer, the altered draft template to a reviewer as a proposed template; and
storing, by the computer, the approved proposed template from the reviewer in the repository. 14. The computer system of claim 13, wherein prior to categorization, the specifics of the change request are identified and reviewed using text analytics. 15. The computer system of claim 13, wherein the successful historical changes are analyzed using text analytics. 16. The computer system of claim 13, wherein the data copied is comprised of tasks to be completed to implement the historical change request. 17. The computer system of claim 13, wherein the information removed from the draft templates is information regarding specific dates. 18. The computer system of claim 13, wherein the data copied is comprised of a duration of time needed to implement the historical change. | A method of dynamically creating a change template based on a change request received from a user. A change request is assigned a category based on the specifics of the request. If at least one existing template for the category the change request is assigned does not exist, historical change requests are analyzed to identify similar changes in historical change requests to the change request and data is copied from a template used for a historical change that was similar to the change requested to create a draft template. The draft template is altered to remove information which is not relevant to the change request and is stored in a repository. The altered draft template is sent to a reviewer as a proposed template; and approved proposed templates from the reviewer are stored in the repository by category.1. A method of dynamically creating a change template based on a change request received from a user, comprising the steps of:
a computer assigning the change request to a category based on specifics of the change request; the computer looking up the category assigned to the change request, to find one or more existing change templates for the category; if the computer finds at least one existing change template for the category, the computer assigning a template to the change request; and if the computer does not find at least one existing template for the category, the method comprising the steps of:
the computer analyzing historical change requests to identify similar changes in historical change requests to the change request;
the computer copying data from a template used for a historical change that was similar to the change requested to create a draft template;
the computer altering the draft template to remove information which is not relevant to the change request and storing the altered draft template in a repository;
the computer sending the altered draft template to a reviewer as a proposed template; and
the computer storing the approved proposed template from the reviewer in the repository. 2. The method of claim 1, wherein prior to categorization, the specifics of the change request are identified and reviewed using text analytics. 3. The method of claim 1, wherein the successful historical changes are analyzed using text analytics 4. The method of claim 1, wherein the data copied is comprised of tasks to be completed to implement the historical change request. 5. The method of claim 1, wherein the information removed from the draft templates is information regarding specific dates. 6. The method of claim 1, wherein the data copied is comprised of a duration of time needed to implement the historical change. 7. A computer program product for dynamically creating a change template based on a change request received from a user using a computer comprising at least one processor, one or more memories, one or more computer readable storage media, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions executable by the computer to perform a method comprising:
assigning, by the computer, the change request to a category based on specifics of the change request; looking up, by the computer, the category assigned to the change request, to find one or more existing change templates for the category; if the computer finds at least one existing change template for the category, the assigning, by the computer, a template to the change request; and if the computer does not find at least one existing template for the category, the program instructions comprising:
analyzing, by the computer, historical change requests to identify similar changes in historical change requests to the change request;
copying, by the computer, data from a template used for a historical change that was similar to the change requested to create a draft template;
altering, by the computer, the draft template to remove information which is not relevant to the change request and storing the altered draft template in a repository;
sending, by the computer, the altered draft template to a reviewer as a proposed template; and
storing, by the computer, the approved proposed template from the reviewer in the repository. 8. The computer program product of claim 7, wherein prior to categorization, the specifics of the change request are identified and reviewed using text analytics. 9. The computer program product of claim 7, wherein the successful historical changes are analyzed using text analytics. 10. The computer program product of claim 7, wherein the data copied is comprised of tasks to be completed to implement the historical change request. 11. The computer program product of claim 7, wherein the information removed from the draft templates is information regarding specific dates. 12. The computer program product of claim 7, wherein the data copied is comprised of a duration of time needed to implement the historical change. 13. A computer system for dynamically creating a change template based on a change request received from a user comprising a computer comprising at least one processor, one or more memories, one or more computer readable storage media having program instructions executable by the computer to perform the program instructions comprising:
assigning, by the computer, the change request to a category based on specifics of the change request; looking up, by the computer, the category assigned to the change request, to find one or more existing change templates for the category; if the computer finds at least one existing change template for the category, the assigning, by the computer, a template to the change request; and if the computer does not find at least one existing template for the category, the program instructions comprising:
analyzing, by the computer, historical change requests to identify similar changes in historical change requests to the change request;
copying, by the computer, data from a template used for a historical change that was similar to the change requested to create a draft template;
altering, by the computer, the draft template to remove information which is not relevant to the change request and storing the altered draft template in a repository;
sending, by the computer, the altered draft template to a reviewer as a proposed template; and
storing, by the computer, the approved proposed template from the reviewer in the repository. 14. The computer system of claim 13, wherein prior to categorization, the specifics of the change request are identified and reviewed using text analytics. 15. The computer system of claim 13, wherein the successful historical changes are analyzed using text analytics. 16. The computer system of claim 13, wherein the data copied is comprised of tasks to be completed to implement the historical change request. 17. The computer system of claim 13, wherein the information removed from the draft templates is information regarding specific dates. 18. The computer system of claim 13, wherein the data copied is comprised of a duration of time needed to implement the historical change. | 2,100 |
5,762 | 5,762 | 15,203,470 | 2,113 | Methods and maintenance systems for use in analyzing data related to maintenance of at least one vehicle are disclosed. One example method includes retrieving, by a computing device, a plurality of diagnostic entries associated with at least one fault message from a database of diagnostic entries, each diagnostic entry including an identified corrective action and a date on which the identified corrective action was taken; identifying a plurality of groups of diagnostic entries, wherein the diagnostic entries in a group have a same corrective action, and each group has a confidence level associated with its corrective action; and weighting the confidence level for each group based on an age of the plurality of diagnostic entries in the group. | 1-20. (canceled) 21. A method for use in analyzing data related to maintenance of at least one vehicle, said method comprising:
retrieving, by a computing device, a plurality of diagnostic entries associated with at least one fault message from a database of diagnostic entries, each diagnostic entry including an identified corrective action and a date on which the identified corrective action was taken; identifying a plurality of groups of diagnostic entries, wherein the diagnostic entries in a group have a same corrective action; weighting a confidence level associated with each group's corrective action based on an age of the plurality of diagnostic entries in the group using a decay function; determining a suggested corrective action based at least in part on the weighted confidence levels associated with the corrective actions; and displaying, to a user, the suggested corrective action to facilitate the user remedying the at least one fault message by performing the suggested corrective action. 22. The method of claim 21, wherein weighting the confidence level associated with each group's corrective action based on an age of the plurality of diagnostic entries in the group using a decay function comprises weighting the confidence level associated with each group's corrective action based on an average age of the plurality of diagnostic entries in the group using a decay function. 23. The method of claim 22, wherein weighting the confidence level associated with each group's corrective action based on an average age of the plurality of diagnostic entries in the group using a decay function comprises weighting the confidence level associated with each group's corrective action based on an average age of the plurality of diagnostic entries in the group using a linear decay function. 24. The method of claim 22, wherein weighting the confidence level associated with each group's corrective action based on an average age of the plurality of diagnostic entries in the group using a decay function comprises weighting the confidence level associated with each group's corrective action based on an average age of the plurality of diagnostic entries in the group using a Gaussian function. 25. The method of claim 24, wherein weighting the confidence level associated with each group's corrective action based on an average age of the plurality of diagnostic entries in the group using a Gaussian function comprises weighting the confidence level associated with each group's corrective action based on an average age of the plurality of diagnostic entries in the group to produce a weighted confidence level by multiplying the confidence level for the group by a weighting factor determined for that group by
f
(
x
)
=
a
-
(
x
-
b
)
2
2
c
2
where “f(x)” is the weighting factor, “x” is the average age, “a” is the maximum value of the weighting factor, “b” is the age in years at which to apply the maximum value of the weighting factor, “c” controls how quickly the weight decreases as age increases, and “e” is Euler's number. 26. The method of claim 25, wherein “a” has a value of 21 and “b” has a value of 0. 27. The method of claim 26, wherein “c” has a value of about 4.25. 28. The method of claim 21, further comprising determining a confidence indicator for each group as a product of the weighted confidence level for the group and a number of diagnostic entries in the group. 29. A maintenance system for use in analyzing data related to maintenance of at least one vehicle, said maintenance system comprising:
a display device; a memory device storing a plurality of diagnostic entries, each diagnostic entry including at least one fault message, an identified corrective action, and a date; and a processor coupled to said memory device and said display device, said processor configured to:
determine a weighting factor for each group of a plurality of groups of diagnostic entries based on an age of the diagnostic entries in the group using a decay function, wherein the diagnostic entries in a group have a same corrective action;
apply the weighting factor for each group to a confidence level associated with the corrective action of the group to determine a weighted confidence level for the corrective action;
determine a suggested corrective action based at least in part on the weighted confidence levels for the corrective actions; and
display, on the display device, the suggested corrective action to facilitate a user remedying the at least one fault message by performing the suggested corrective action. 30. The maintenance system of claim 29, wherein said processor is configured to determine the weighting factor for each group of the plurality of groups of diagnostic entries based on an average age of the diagnostic entries in the group. 31. The maintenance system of claim 30, wherein said processor is configured to determine the weighting factor for each group of the plurality of groups of diagnostic entries based on an average age of the diagnostic entries in the group using a linear decay function. 32. The maintenance system of claim 30, wherein said processor is configured to determine the weighting factor for each group of the plurality of groups of diagnostic entries based on an average age of the diagnostic entries in the group using a Gaussian function. 33. The maintenance system of claim 32, wherein said processor is configured to determine the weighting factor for each group by
f
(
x
)
=
a
-
(
x
-
b
)
2
2
c
2
where “f(x)” is the weighting factor, “x” is the average age, “a” is the maximum value of the weighting factor, “b” is the age in years at which to apply the maximum value of the weighting factor, “c” controls how quickly the weight decreases as age increases, and “e” is Euler's number. 34. The maintenance system of claim 29, wherein the vehicle is an aircraft. 35. The maintenance system of claim 29, further comprising determining a confidence indicator for each groups corrective action as a product of the weighted confidence level for the group's corrective action and a number of diagnostic entries in the group. 36. One or more non-transitory computer-readable storage media having computer-executable instructions embodied thereon, wherein when executed by at least one processor, the computer-executable instructions cause the processor to:
determine a weighting factor for each group of a plurality of groups of diagnostic entries based on an age of the diagnostic entries in the group using a decay function, wherein the diagnostic entries in a group have a same corrective action; determine a confidence level associated with the corrective action of each group of diagnostic entries; apply the weighting factor for each group to the confidence level associated with the corrective action of the group to determine a weighted confidence level for the corrective action; determine a suggested corrective action based at least in part on the weighted confidence levels for the corrective actions; and display, on a display device, the suggested corrective action to facilitate a user remedying the at least one fault message by performing the suggested corrective action. 37. The one or more non-transitory computer-readable storage media of claim 36, wherein when executed by the at least one processor, the computer-executable instructions further cause the processor to determine the weighting factor for each group of the plurality of groups of diagnostic entries based on an average age of the diagnostic entries in the group. 38. The one or more non-transitory computer-readable storage media of claim 37, wherein when executed by the at least one processor, the computer-executable instructions further cause the processor to determine the weighting factor for each group of the plurality of groups of diagnostic entries based on an average age of the diagnostic entries in the group using a linear decay function. 39. The one or more non-transitory computer-readable storage media of claim 37, wherein when executed by the at least one processor, the computer-executable instructions further cause the processor to determine the weighting factor for each group of the plurality of groups of diagnostic entries based on an average age of the diagnostic entries in the group using a Gaussian function. 40. The one or more non-transitory computer-readable storage media of claim 39, wherein when executed by the at least one processor, the computer-executable instructions further cause the processor to determine the weighting factor for each group by
f
(
x
)
=
a
-
(
x
-
b
)
2
2
c
2
where “f(x)” is the weighting factor, “x” is the average age, “a” is the maximum value of the weighting factor, “b” is the age in years at which to apply the maximum value of the weighting factor, “c” controls how quickly the weight decreases as age increases, and “e” is Euler's number. | Methods and maintenance systems for use in analyzing data related to maintenance of at least one vehicle are disclosed. One example method includes retrieving, by a computing device, a plurality of diagnostic entries associated with at least one fault message from a database of diagnostic entries, each diagnostic entry including an identified corrective action and a date on which the identified corrective action was taken; identifying a plurality of groups of diagnostic entries, wherein the diagnostic entries in a group have a same corrective action, and each group has a confidence level associated with its corrective action; and weighting the confidence level for each group based on an age of the plurality of diagnostic entries in the group.1-20. (canceled) 21. A method for use in analyzing data related to maintenance of at least one vehicle, said method comprising:
retrieving, by a computing device, a plurality of diagnostic entries associated with at least one fault message from a database of diagnostic entries, each diagnostic entry including an identified corrective action and a date on which the identified corrective action was taken; identifying a plurality of groups of diagnostic entries, wherein the diagnostic entries in a group have a same corrective action; weighting a confidence level associated with each group's corrective action based on an age of the plurality of diagnostic entries in the group using a decay function; determining a suggested corrective action based at least in part on the weighted confidence levels associated with the corrective actions; and displaying, to a user, the suggested corrective action to facilitate the user remedying the at least one fault message by performing the suggested corrective action. 22. The method of claim 21, wherein weighting the confidence level associated with each group's corrective action based on an age of the plurality of diagnostic entries in the group using a decay function comprises weighting the confidence level associated with each group's corrective action based on an average age of the plurality of diagnostic entries in the group using a decay function. 23. The method of claim 22, wherein weighting the confidence level associated with each group's corrective action based on an average age of the plurality of diagnostic entries in the group using a decay function comprises weighting the confidence level associated with each group's corrective action based on an average age of the plurality of diagnostic entries in the group using a linear decay function. 24. The method of claim 22, wherein weighting the confidence level associated with each group's corrective action based on an average age of the plurality of diagnostic entries in the group using a decay function comprises weighting the confidence level associated with each group's corrective action based on an average age of the plurality of diagnostic entries in the group using a Gaussian function. 25. The method of claim 24, wherein weighting the confidence level associated with each group's corrective action based on an average age of the plurality of diagnostic entries in the group using a Gaussian function comprises weighting the confidence level associated with each group's corrective action based on an average age of the plurality of diagnostic entries in the group to produce a weighted confidence level by multiplying the confidence level for the group by a weighting factor determined for that group by
f
(
x
)
=
a
-
(
x
-
b
)
2
2
c
2
where “f(x)” is the weighting factor, “x” is the average age, “a” is the maximum value of the weighting factor, “b” is the age in years at which to apply the maximum value of the weighting factor, “c” controls how quickly the weight decreases as age increases, and “e” is Euler's number. 26. The method of claim 25, wherein “a” has a value of 21 and “b” has a value of 0. 27. The method of claim 26, wherein “c” has a value of about 4.25. 28. The method of claim 21, further comprising determining a confidence indicator for each group as a product of the weighted confidence level for the group and a number of diagnostic entries in the group. 29. A maintenance system for use in analyzing data related to maintenance of at least one vehicle, said maintenance system comprising:
a display device; a memory device storing a plurality of diagnostic entries, each diagnostic entry including at least one fault message, an identified corrective action, and a date; and a processor coupled to said memory device and said display device, said processor configured to:
determine a weighting factor for each group of a plurality of groups of diagnostic entries based on an age of the diagnostic entries in the group using a decay function, wherein the diagnostic entries in a group have a same corrective action;
apply the weighting factor for each group to a confidence level associated with the corrective action of the group to determine a weighted confidence level for the corrective action;
determine a suggested corrective action based at least in part on the weighted confidence levels for the corrective actions; and
display, on the display device, the suggested corrective action to facilitate a user remedying the at least one fault message by performing the suggested corrective action. 30. The maintenance system of claim 29, wherein said processor is configured to determine the weighting factor for each group of the plurality of groups of diagnostic entries based on an average age of the diagnostic entries in the group. 31. The maintenance system of claim 30, wherein said processor is configured to determine the weighting factor for each group of the plurality of groups of diagnostic entries based on an average age of the diagnostic entries in the group using a linear decay function. 32. The maintenance system of claim 30, wherein said processor is configured to determine the weighting factor for each group of the plurality of groups of diagnostic entries based on an average age of the diagnostic entries in the group using a Gaussian function. 33. The maintenance system of claim 32, wherein said processor is configured to determine the weighting factor for each group by
f
(
x
)
=
a
-
(
x
-
b
)
2
2
c
2
where “f(x)” is the weighting factor, “x” is the average age, “a” is the maximum value of the weighting factor, “b” is the age in years at which to apply the maximum value of the weighting factor, “c” controls how quickly the weight decreases as age increases, and “e” is Euler's number. 34. The maintenance system of claim 29, wherein the vehicle is an aircraft. 35. The maintenance system of claim 29, further comprising determining a confidence indicator for each groups corrective action as a product of the weighted confidence level for the group's corrective action and a number of diagnostic entries in the group. 36. One or more non-transitory computer-readable storage media having computer-executable instructions embodied thereon, wherein when executed by at least one processor, the computer-executable instructions cause the processor to:
determine a weighting factor for each group of a plurality of groups of diagnostic entries based on an age of the diagnostic entries in the group using a decay function, wherein the diagnostic entries in a group have a same corrective action; determine a confidence level associated with the corrective action of each group of diagnostic entries; apply the weighting factor for each group to the confidence level associated with the corrective action of the group to determine a weighted confidence level for the corrective action; determine a suggested corrective action based at least in part on the weighted confidence levels for the corrective actions; and display, on a display device, the suggested corrective action to facilitate a user remedying the at least one fault message by performing the suggested corrective action. 37. The one or more non-transitory computer-readable storage media of claim 36, wherein when executed by the at least one processor, the computer-executable instructions further cause the processor to determine the weighting factor for each group of the plurality of groups of diagnostic entries based on an average age of the diagnostic entries in the group. 38. The one or more non-transitory computer-readable storage media of claim 37, wherein when executed by the at least one processor, the computer-executable instructions further cause the processor to determine the weighting factor for each group of the plurality of groups of diagnostic entries based on an average age of the diagnostic entries in the group using a linear decay function. 39. The one or more non-transitory computer-readable storage media of claim 37, wherein when executed by the at least one processor, the computer-executable instructions further cause the processor to determine the weighting factor for each group of the plurality of groups of diagnostic entries based on an average age of the diagnostic entries in the group using a Gaussian function. 40. The one or more non-transitory computer-readable storage media of claim 39, wherein when executed by the at least one processor, the computer-executable instructions further cause the processor to determine the weighting factor for each group by
f
(
x
)
=
a
-
(
x
-
b
)
2
2
c
2
where “f(x)” is the weighting factor, “x” is the average age, “a” is the maximum value of the weighting factor, “b” is the age in years at which to apply the maximum value of the weighting factor, “c” controls how quickly the weight decreases as age increases, and “e” is Euler's number. | 2,100 |
5,763 | 5,763 | 14,784,302 | 2,128 | So as to make the co-simulation of subsystems of an overall system ( 1 ), which are reciprocally coupled by way of coupling variables (y 1 , y 2 ), real-time capable, a mathematical model (M) of the subsystems (TS 1, TS 2 ) which is valid at the current operating point of the overall system ( 1 ) is ascertained from input variables (x 1 , x 2 ) and/or measured variables (w 1 , w 2 ) of the subsystems (TS 1, TS 2 ) based on a method of data-based model identification and, from this model (M), the coupling variables (y 1 , y 2 ) are extrapolated for a subsequent coupling time step and made available to the subsystems (TS 1, TS 2 ). | 1. A method for co-simulating two subsystems (TS1, TS2) of an overall system (1), which are reciprocally coupled by way of coupling variables (y1, y2), characterized in that a mathematical model (M) of the subsystems (TS1, TS2) which is valid at the current operating point of the overall system (1) is ascertained from input variables (x1, x2) and/or measured variables (w1, w2) of the subsystems (TS1, TS2) with on a method of data-based model identification and, from this model (M), the coupling variables (y1, y2) are extrapolated for a subsequent coupling time step and made available to the subsystems (TS1, TS2). 2. The method according to claim 1, characterized in that the real and the virtual dead time is compensated for by calculating coupling variables (y1, y2) that lie further ahead in the future by the dead time from the model (M) by way of the extrapolation. 3. The method according to claim 1, characterized in that a coupling error is ascertained in the extrapolation, and method steps for treating the coupling error are initiated in dependency thereof. 4. The method according to claim 1, characterized in that methods for error compensation are used in the extrapolation. 5. The method according to claim 1, characterized in that signal-based coupling is used to ascertain the coupling variables (y1, y2) until the identified model (M) is available. 6. A simulation device for the co-simulation of at least two subsystems (TS1, TS2) of an overall system (1), which are reciprocally coupled by way of coupling variables (y1, y2), characterized in that at least one extrapolation unit (2) is provided, which receives input variables (x1, x2) and/or measured variables (w1, w2) of the subsystems (TS1, TS2) and, based thereon, identifies a mathematical model (M) of the subsystems which is valid at the current operating point of the overall system (1) based on a method of data-based model identification in order to calculate the coupling variables using the model (M). 7. The simulation device according to claim 6, characterized in that at least one subsystem (TS1, TS2) and at least one extrapolation unit (2) are connected by at least one real-time bus system (4). | So as to make the co-simulation of subsystems of an overall system ( 1 ), which are reciprocally coupled by way of coupling variables (y 1 , y 2 ), real-time capable, a mathematical model (M) of the subsystems (TS 1, TS 2 ) which is valid at the current operating point of the overall system ( 1 ) is ascertained from input variables (x 1 , x 2 ) and/or measured variables (w 1 , w 2 ) of the subsystems (TS 1, TS 2 ) based on a method of data-based model identification and, from this model (M), the coupling variables (y 1 , y 2 ) are extrapolated for a subsequent coupling time step and made available to the subsystems (TS 1, TS 2 ).1. A method for co-simulating two subsystems (TS1, TS2) of an overall system (1), which are reciprocally coupled by way of coupling variables (y1, y2), characterized in that a mathematical model (M) of the subsystems (TS1, TS2) which is valid at the current operating point of the overall system (1) is ascertained from input variables (x1, x2) and/or measured variables (w1, w2) of the subsystems (TS1, TS2) with on a method of data-based model identification and, from this model (M), the coupling variables (y1, y2) are extrapolated for a subsequent coupling time step and made available to the subsystems (TS1, TS2). 2. The method according to claim 1, characterized in that the real and the virtual dead time is compensated for by calculating coupling variables (y1, y2) that lie further ahead in the future by the dead time from the model (M) by way of the extrapolation. 3. The method according to claim 1, characterized in that a coupling error is ascertained in the extrapolation, and method steps for treating the coupling error are initiated in dependency thereof. 4. The method according to claim 1, characterized in that methods for error compensation are used in the extrapolation. 5. The method according to claim 1, characterized in that signal-based coupling is used to ascertain the coupling variables (y1, y2) until the identified model (M) is available. 6. A simulation device for the co-simulation of at least two subsystems (TS1, TS2) of an overall system (1), which are reciprocally coupled by way of coupling variables (y1, y2), characterized in that at least one extrapolation unit (2) is provided, which receives input variables (x1, x2) and/or measured variables (w1, w2) of the subsystems (TS1, TS2) and, based thereon, identifies a mathematical model (M) of the subsystems which is valid at the current operating point of the overall system (1) based on a method of data-based model identification in order to calculate the coupling variables using the model (M). 7. The simulation device according to claim 6, characterized in that at least one subsystem (TS1, TS2) and at least one extrapolation unit (2) are connected by at least one real-time bus system (4). | 2,100 |
5,764 | 5,764 | 14,965,957 | 2,183 | In an approach for decreasing a rate of logic voltage level transitions in a multiplexor, one of a plurality of inputs to a multiplexor is selected with a first multiplexor select value at a first clock, wherein each input to the multiplexor is identified as one of i) valid and ii) invalid and the first multiplexor select value is latched in a latch until the first multiplexor select value is replaced by a second multiplexor select value. The second multiplexor select value is determined. The second multiplexor select value is applied to the multiplexor at a second clock if and only if the second multiplexor select value is different from the first multiplexor select value and the second multiplexor select value selects a valid input, wherein the second clock follows the first clock. Subsequent to applying the second multiplexor select value, the second multiplexor value is latched in the latch. | 1. A method for decreasing a rate of logic voltage level transitions in a multiplexor, the method comprising:
selecting, by one or more processors, one of a plurality of inputs to a multiplexor with a first multiplexor select value at a first clock, wherein each input to the multiplexor is identified as one of i) valid and ii) invalid and the first multiplexor select value is latched in a latch until the first multiplexor select value is replaced by a second multiplexor select value; determining, by one or more processors, the second multiplexor select value; applying, by one or more processors, the second multiplexor select value to the multiplexor at a second clock if and only if the second multiplexor select value is different from the first multiplexor select value and the second multiplexor select value selects a valid input, wherein the second clock occurs after the first clock; and subsequent to applying the second multiplexor select value, latching, by one or more processors, the second multiplexor value in the latch. 2. The method of claim 1, wherein the multiplexor is a part of an instruction issue unit in a processor. 3. The method of claim 2, wherein the plurality of inputs to the multiplexer are instruction source operands. 4. The method of claim 2, wherein the instruction issue unit can select one of up to eight instructions to issue. 5. The method of claim 4, wherein an instruction can have up to three source operands. 6. The method of claim 5, wherein the instruction table identifies one or more entries in the instruction table that each contain an instruction that is ready to execute. 7. The method of claim 6, wherein an instruction is ready to execute if the instruction is the oldest instruction in the instruction table and the source operands of the instruction are valid. 8. A computer program product for selecting and issuing an oldest ready instruction in an issue queue, the computer program product comprising:
one or more computer readable storage media and program instructions stored on the one or more computer readable storage media, the program instructions comprising: program instructions to select one of a plurality of inputs to a multiplexor with a first multiplexor select value at a first clock, wherein each input to the multiplexor is identified as one of i) valid and ii) invalid and the first multiplexor select value is latched in a latch until the first multiplexor select value is replaced by a second multiplexor select value; program instructions to determine the second multiplexor select value; program instructions to represent an age of each of the one or more instructions in the issue queue in a first age array wherein an age of an instruction is an age that is relative to each of the one or more instructions in the first age array; program instructions to apply the second multiplexor select value to the multiplexor at a second clock if and only if the second multiplexor select value is different from the first multiplexor select value and the second multiplexor select value selects a valid input, wherein the second clock occurs after the first clock; and program instructions to, subsequent to applying the second multiplexor select value, latch the second multiplexor value in the latch. 9. The computer program product of claim 8, wherein the multiplexor is a part of an instruction issue unit in a processor. 10. The computer program product of claim 9, wherein the plurality of inputs to the multiplexer are instruction source operands. 11. The computer program product of claim 9, wherein the instruction issue unit can select one of up to eight instructions to issue. 12. The computer program product of claim 11, wherein an instruction can have up to three source operands. 13. The computer program product of claim 12, wherein the instruction table identifies one or more entries in the instruction table that each contain an instruction that is ready to execute. 14. The computer program product of claim 13, wherein an instruction is ready to execute if the instruction is the oldest instruction in the instruction table and the source operands of the instruction are valid. 15. A computer system product for selecting and issuing an oldest ready instruction in an issue queue, the computer program product comprising:
one or more computer processors, one or more computer readable storage media, and program instructions stored on the computer readable storage media for execution by at least one of the one or more processors, the program instructions comprising: program instructions to select one of a plurality of inputs to a multiplexor with a first multiplexor select value at a first clock, wherein each input to the multiplexor is identified as one of i) valid and ii) invalid and the first multiplexor select value is latched in a latch until the first multiplexor select value is replaced by a second multiplexor select value; program instructions to determine the second multiplexor select value; program instructions to represent an age of each of the one or more instructions in the issue queue in a first age array wherein an age of an instruction is an age that is relative to each of the one or more instructions in the first age array; program instructions to apply the second multiplexor select value to the multiplexor at a second clock if and only if the second multiplexor select value is different from the first multiplexor select value and the second multiplexor select value selects a valid input, wherein the second clock occurs after the first clock; and program instructions to, subsequent to applying the second multiplexor select value, latch the second multiplexor value in the latch. 16. The computer system product of claim 15, wherein the multiplexor is a part of an instruction issue unit in a processor. 17. The computer system product of claim 16, wherein the plurality of inputs to the multiplexer are instruction source operands. 18. The computer system product of claim 16, wherein the instruction issue unit can select one of up to eight instructions to issue. 19. The computer system product of claim 18, wherein an instruction can have up to three source operands. 20. The computer system product of claim 19, wherein the instruction table identifies one or more entries in the instruction table that each contain an instruction that is ready to execute. | In an approach for decreasing a rate of logic voltage level transitions in a multiplexor, one of a plurality of inputs to a multiplexor is selected with a first multiplexor select value at a first clock, wherein each input to the multiplexor is identified as one of i) valid and ii) invalid and the first multiplexor select value is latched in a latch until the first multiplexor select value is replaced by a second multiplexor select value. The second multiplexor select value is determined. The second multiplexor select value is applied to the multiplexor at a second clock if and only if the second multiplexor select value is different from the first multiplexor select value and the second multiplexor select value selects a valid input, wherein the second clock follows the first clock. Subsequent to applying the second multiplexor select value, the second multiplexor value is latched in the latch.1. A method for decreasing a rate of logic voltage level transitions in a multiplexor, the method comprising:
selecting, by one or more processors, one of a plurality of inputs to a multiplexor with a first multiplexor select value at a first clock, wherein each input to the multiplexor is identified as one of i) valid and ii) invalid and the first multiplexor select value is latched in a latch until the first multiplexor select value is replaced by a second multiplexor select value; determining, by one or more processors, the second multiplexor select value; applying, by one or more processors, the second multiplexor select value to the multiplexor at a second clock if and only if the second multiplexor select value is different from the first multiplexor select value and the second multiplexor select value selects a valid input, wherein the second clock occurs after the first clock; and subsequent to applying the second multiplexor select value, latching, by one or more processors, the second multiplexor value in the latch. 2. The method of claim 1, wherein the multiplexor is a part of an instruction issue unit in a processor. 3. The method of claim 2, wherein the plurality of inputs to the multiplexer are instruction source operands. 4. The method of claim 2, wherein the instruction issue unit can select one of up to eight instructions to issue. 5. The method of claim 4, wherein an instruction can have up to three source operands. 6. The method of claim 5, wherein the instruction table identifies one or more entries in the instruction table that each contain an instruction that is ready to execute. 7. The method of claim 6, wherein an instruction is ready to execute if the instruction is the oldest instruction in the instruction table and the source operands of the instruction are valid. 8. A computer program product for selecting and issuing an oldest ready instruction in an issue queue, the computer program product comprising:
one or more computer readable storage media and program instructions stored on the one or more computer readable storage media, the program instructions comprising: program instructions to select one of a plurality of inputs to a multiplexor with a first multiplexor select value at a first clock, wherein each input to the multiplexor is identified as one of i) valid and ii) invalid and the first multiplexor select value is latched in a latch until the first multiplexor select value is replaced by a second multiplexor select value; program instructions to determine the second multiplexor select value; program instructions to represent an age of each of the one or more instructions in the issue queue in a first age array wherein an age of an instruction is an age that is relative to each of the one or more instructions in the first age array; program instructions to apply the second multiplexor select value to the multiplexor at a second clock if and only if the second multiplexor select value is different from the first multiplexor select value and the second multiplexor select value selects a valid input, wherein the second clock occurs after the first clock; and program instructions to, subsequent to applying the second multiplexor select value, latch the second multiplexor value in the latch. 9. The computer program product of claim 8, wherein the multiplexor is a part of an instruction issue unit in a processor. 10. The computer program product of claim 9, wherein the plurality of inputs to the multiplexer are instruction source operands. 11. The computer program product of claim 9, wherein the instruction issue unit can select one of up to eight instructions to issue. 12. The computer program product of claim 11, wherein an instruction can have up to three source operands. 13. The computer program product of claim 12, wherein the instruction table identifies one or more entries in the instruction table that each contain an instruction that is ready to execute. 14. The computer program product of claim 13, wherein an instruction is ready to execute if the instruction is the oldest instruction in the instruction table and the source operands of the instruction are valid. 15. A computer system product for selecting and issuing an oldest ready instruction in an issue queue, the computer program product comprising:
one or more computer processors, one or more computer readable storage media, and program instructions stored on the computer readable storage media for execution by at least one of the one or more processors, the program instructions comprising: program instructions to select one of a plurality of inputs to a multiplexor with a first multiplexor select value at a first clock, wherein each input to the multiplexor is identified as one of i) valid and ii) invalid and the first multiplexor select value is latched in a latch until the first multiplexor select value is replaced by a second multiplexor select value; program instructions to determine the second multiplexor select value; program instructions to represent an age of each of the one or more instructions in the issue queue in a first age array wherein an age of an instruction is an age that is relative to each of the one or more instructions in the first age array; program instructions to apply the second multiplexor select value to the multiplexor at a second clock if and only if the second multiplexor select value is different from the first multiplexor select value and the second multiplexor select value selects a valid input, wherein the second clock occurs after the first clock; and program instructions to, subsequent to applying the second multiplexor select value, latch the second multiplexor value in the latch. 16. The computer system product of claim 15, wherein the multiplexor is a part of an instruction issue unit in a processor. 17. The computer system product of claim 16, wherein the plurality of inputs to the multiplexer are instruction source operands. 18. The computer system product of claim 16, wherein the instruction issue unit can select one of up to eight instructions to issue. 19. The computer system product of claim 18, wherein an instruction can have up to three source operands. 20. The computer system product of claim 19, wherein the instruction table identifies one or more entries in the instruction table that each contain an instruction that is ready to execute. | 2,100 |
5,765 | 5,765 | 14,194,063 | 2,154 | A scanner scans a group of documents. For example, the documents can be a group of invoices. The documents are received and processed. Objects (e.g., a text object, such as a word) and their locations are identified in each of the documents. Occurrences of similar objects in the identified locations between the documents are determined. A document sorting algorithm is applied to generate a score for each of the documents. The score for each of the documents is generated based on a number of occurrences of similar objects between the documents. The generated score of each of the documents is used to identify a template document. The template document is then used to cluster the documents. | 1. A method comprising:
receiving a plurality of documents; for each of the plurality of documents, identifying a plurality of objects and locations of each of the plurality of objects; determining occurrences of similar objects in the identified locations of the plurality of objects between the plurality of documents; applying a document sorting algorithm to generate a score for each of the plurality of documents, wherein the score for each of the plurality of documents is generated based on a number of occurrences of similar objects between the plurality of documents; and comparing the generated score of each of the plurality of documents to identify a template document. 2. The method of claim 1, further comprising:
determining an amount of certainty for an occurrence of similar objects in a common object document location between the plurality of documents; identifying the common object document location based on a minimum certainty threshold value; determining that the template document contains an error for an individual object in the common object document location in the template document; and in response to determining that the template document contains an error for the individual object in the common object document location in the template document, replacing the individual object in the common object document location in the template document with a second object, wherein the second object is from the common object location in a second one of the plurality of documents that has been determined to be correct. 3. The method of claim 2, wherein the error for the individual object in the template document is determined based on a number of occurrences of the similar objects in the common document location in the plurality of documents. 4. The method of claim 2, wherein each of the plurality of documents comprises at least two separate similar objects that are at different common locations between the plurality of documents and wherein the amount of certainty is determined based on one of:
the two separate objects; or a single one of the two separate objects. 5. The method of claim 1, wherein the similar objects comprises at least one of: a text object in an unknown language, an object that is part of a computer programming language, a phrase, a number, a punctuation mark, a text object, a graphical object, a logo, and a picture. 6. The method of claim 1, wherein the common locations are determined based on at one or more of a distance, a relative distance, a relative angle, a character distance, a word distance, and line distance. 7. The method of claim 1, wherein the similar objects are text objects and wherein the plurality of documents are received from a scanner. 8. The method of claim 1, wherein the document sorting algorithm generates the score for each of the plurality of documents by at least one of:
summing the number of occurrences of similar objects between the plurality of documents; and multiplying the number of occurrences of similar objects between the plurality of documents. 9. The method of claim 1, wherein the template document is used to cluster the plurality of documents based on the template document. 10. The method of claim 1, wherein determining occurrences of the similar objects in the identified locations of the plurality of objects between the documents further comprises recalculating the identified locations based on a misalignment of the identified locations due to a use of at least one of a different font and a different font size. 11. A system comprising:
a document processor configured to receive a plurality of documents, for each of the plurality of documents, identify a plurality of objects and locations of each of the plurality of objects, determining occurrences of similar objects in the identified locations of the plurality of objects between the plurality of documents, and apply a document sorting algorithm to generate a score for each of the plurality of documents, wherein the score for each of the plurality of documents is generated based on a number of occurrences of similar objects between the plurality of documents; and a document classifier configured to compare the generated score of each of the plurality of documents to identify a template document. 12. The system of claim 11, wherein the document processor is further configured to determine an amount of certainty for an occurrence of similar objects in a common object document location between the plurality of documents, identify the common object document location based on a minimum certainty threshold value, determine that the template document contains an error for an individual object in the common object document location in the template document, and replace the individual object in the common object document location in the template document with a second object in response to determining that the template document contains an error for the individual object in the common object document location in the template document, wherein the second object is from the common object location in a second one of the plurality of documents that has been determined to be correct. 13. The system of claim 12, wherein the error for the individual object in the template document is determined based on a number of occurrences of the similar objects in the common document location in the plurality of documents. 14. The system of claim 12, wherein each of the plurality of documents comprises at least two separate similar objects that are at different common locations between the plurality of documents and wherein the amount of certainty is determined based on one of:
the two separate objects; or a single one of the two separate objects. 15. The system of claim 11, wherein the similar objects comprises at least one of: a text object in an unknown language, an object that is part of a computer programming language, a phrase, a number, a punctuation mark, a text object, a graphical object, a logo, and a picture. 16. The method of claim 11, further comprising a scanner that generates the plurality of documents and wherein the similar objects are text objects. 17. The system of claim 11, wherein the document sorting algorithm generates the score for each of the plurality of documents by at least one of:
summing the number of occurrences of similar objects between the plurality of documents; and multiplying the number of occurrences of similar objects between the plurality of documents. 18. The system of claim 11, wherein the template document is used to cluster the plurality of documents based on the template document. 19. The system of claim 11, wherein document processor is further configured to recalculate the identified locations based on a misalignment of the identified locations due to a use of at least one of a different font and a different font size. 20. A system comprising:
a scanner configured to scan a plurality of documents; a document processor configured to receive the plurality of documents, for each of the plurality of documents, identify a plurality of objects and locations of each of the plurality of objects, determine occurrences of similar objects in the identified locations of the plurality of objects between the plurality of documents, apply a document sorting algorithm to generate a score for each of the plurality of documents, wherein the score for each of the plurality of documents is generated based on a number of occurrences of similar objects between the plurality of documents, determine an amount of certainty for an occurrence of similar objects in a common object document location between the plurality of documents, identify the common object document location based on a minimum certainty threshold value, determine that the template document contains an error for an individual object in the common object document location in the template document, and replace the individual object in the common object document location in the template document with a second object in response to determining that the template document contains an error for the individual object in the common object document location in the template document, wherein the second object is from the common object location in a second one of the plurality of documents that has been determined to be correct; and a document classifier configured to compare the generated score of each of the plurality of documents to identify a template document and cluster the plurality of documents based on the template document. | A scanner scans a group of documents. For example, the documents can be a group of invoices. The documents are received and processed. Objects (e.g., a text object, such as a word) and their locations are identified in each of the documents. Occurrences of similar objects in the identified locations between the documents are determined. A document sorting algorithm is applied to generate a score for each of the documents. The score for each of the documents is generated based on a number of occurrences of similar objects between the documents. The generated score of each of the documents is used to identify a template document. The template document is then used to cluster the documents.1. A method comprising:
receiving a plurality of documents; for each of the plurality of documents, identifying a plurality of objects and locations of each of the plurality of objects; determining occurrences of similar objects in the identified locations of the plurality of objects between the plurality of documents; applying a document sorting algorithm to generate a score for each of the plurality of documents, wherein the score for each of the plurality of documents is generated based on a number of occurrences of similar objects between the plurality of documents; and comparing the generated score of each of the plurality of documents to identify a template document. 2. The method of claim 1, further comprising:
determining an amount of certainty for an occurrence of similar objects in a common object document location between the plurality of documents; identifying the common object document location based on a minimum certainty threshold value; determining that the template document contains an error for an individual object in the common object document location in the template document; and in response to determining that the template document contains an error for the individual object in the common object document location in the template document, replacing the individual object in the common object document location in the template document with a second object, wherein the second object is from the common object location in a second one of the plurality of documents that has been determined to be correct. 3. The method of claim 2, wherein the error for the individual object in the template document is determined based on a number of occurrences of the similar objects in the common document location in the plurality of documents. 4. The method of claim 2, wherein each of the plurality of documents comprises at least two separate similar objects that are at different common locations between the plurality of documents and wherein the amount of certainty is determined based on one of:
the two separate objects; or a single one of the two separate objects. 5. The method of claim 1, wherein the similar objects comprises at least one of: a text object in an unknown language, an object that is part of a computer programming language, a phrase, a number, a punctuation mark, a text object, a graphical object, a logo, and a picture. 6. The method of claim 1, wherein the common locations are determined based on at one or more of a distance, a relative distance, a relative angle, a character distance, a word distance, and line distance. 7. The method of claim 1, wherein the similar objects are text objects and wherein the plurality of documents are received from a scanner. 8. The method of claim 1, wherein the document sorting algorithm generates the score for each of the plurality of documents by at least one of:
summing the number of occurrences of similar objects between the plurality of documents; and multiplying the number of occurrences of similar objects between the plurality of documents. 9. The method of claim 1, wherein the template document is used to cluster the plurality of documents based on the template document. 10. The method of claim 1, wherein determining occurrences of the similar objects in the identified locations of the plurality of objects between the documents further comprises recalculating the identified locations based on a misalignment of the identified locations due to a use of at least one of a different font and a different font size. 11. A system comprising:
a document processor configured to receive a plurality of documents, for each of the plurality of documents, identify a plurality of objects and locations of each of the plurality of objects, determining occurrences of similar objects in the identified locations of the plurality of objects between the plurality of documents, and apply a document sorting algorithm to generate a score for each of the plurality of documents, wherein the score for each of the plurality of documents is generated based on a number of occurrences of similar objects between the plurality of documents; and a document classifier configured to compare the generated score of each of the plurality of documents to identify a template document. 12. The system of claim 11, wherein the document processor is further configured to determine an amount of certainty for an occurrence of similar objects in a common object document location between the plurality of documents, identify the common object document location based on a minimum certainty threshold value, determine that the template document contains an error for an individual object in the common object document location in the template document, and replace the individual object in the common object document location in the template document with a second object in response to determining that the template document contains an error for the individual object in the common object document location in the template document, wherein the second object is from the common object location in a second one of the plurality of documents that has been determined to be correct. 13. The system of claim 12, wherein the error for the individual object in the template document is determined based on a number of occurrences of the similar objects in the common document location in the plurality of documents. 14. The system of claim 12, wherein each of the plurality of documents comprises at least two separate similar objects that are at different common locations between the plurality of documents and wherein the amount of certainty is determined based on one of:
the two separate objects; or a single one of the two separate objects. 15. The system of claim 11, wherein the similar objects comprises at least one of: a text object in an unknown language, an object that is part of a computer programming language, a phrase, a number, a punctuation mark, a text object, a graphical object, a logo, and a picture. 16. The method of claim 11, further comprising a scanner that generates the plurality of documents and wherein the similar objects are text objects. 17. The system of claim 11, wherein the document sorting algorithm generates the score for each of the plurality of documents by at least one of:
summing the number of occurrences of similar objects between the plurality of documents; and multiplying the number of occurrences of similar objects between the plurality of documents. 18. The system of claim 11, wherein the template document is used to cluster the plurality of documents based on the template document. 19. The system of claim 11, wherein document processor is further configured to recalculate the identified locations based on a misalignment of the identified locations due to a use of at least one of a different font and a different font size. 20. A system comprising:
a scanner configured to scan a plurality of documents; a document processor configured to receive the plurality of documents, for each of the plurality of documents, identify a plurality of objects and locations of each of the plurality of objects, determine occurrences of similar objects in the identified locations of the plurality of objects between the plurality of documents, apply a document sorting algorithm to generate a score for each of the plurality of documents, wherein the score for each of the plurality of documents is generated based on a number of occurrences of similar objects between the plurality of documents, determine an amount of certainty for an occurrence of similar objects in a common object document location between the plurality of documents, identify the common object document location based on a minimum certainty threshold value, determine that the template document contains an error for an individual object in the common object document location in the template document, and replace the individual object in the common object document location in the template document with a second object in response to determining that the template document contains an error for the individual object in the common object document location in the template document, wherein the second object is from the common object location in a second one of the plurality of documents that has been determined to be correct; and a document classifier configured to compare the generated score of each of the plurality of documents to identify a template document and cluster the plurality of documents based on the template document. | 2,100 |
5,766 | 5,766 | 13,768,630 | 2,158 | Transferring an application from a first site to a second site includes determining that the second site is a destination site for the application, causing writes by the application at the first site to be propagated synchronously to the second site, transferring storage data from the first site to the second site, suspending operation of the application on the first site, and resuming operation of the application on the second site. The application may be a virtual machine or a host cluster capable of transitioning applications between cluster nodes. The virtual machine may be transferred from the first site to the second site by transferring an image of the virtual machine from the first site to the second site. The destination site may be selected by a user. The second site may be located remotely from the first site across an asynchronous distance. | 1. A method of transferring a virtual machine from a first site to a second site, comprising:
determining that the second site is a destination site for the virtual machine; transferring to the second site data corresponding to the virtual machine in an asynchronous mode in which write operations by the virtual machine at the first site for the transferred data are acknowledged on the first site prior to acknowledgement from the second site of completion of the write operation at the second site, while asynchronously copying an image of the virtual machine from the first site to the second site; transitioning from the asynchronous mode into a synchronous mode to cause the data corresponding to writes by the virtual machine at the first site to be propagated synchronously to the second site while the image of the virtual machine operating at the first site is accepting the writes thereto and while asynchronously copying the image of the virtual machine from the first site to the second site; after performing the transitioning, performing a cache synchronization operation that transfers modified portions of the data from the first site to the second site; responsive to completing the cache synchronization operation, suspending operation of the virtual machine on the first site; and resuming operation of the virtual machine on the second site. 2.-3. (canceled) 4. The method according to claim 1, wherein the destination site is selected by a user. 5. The method according to claim 1, wherein each of the first site and second site include at least one host cluster, at least one director cluster and at least one storage array. 6. The method according to claim 1, wherein the second site is located remotely from the first site across an asynchronous distance. 7. The method according to claim 1, further comprising:
combining data from a cache at the source site with data being written by the virtual machine at the source site in response to writing application data when the cache at the source site contains data awaiting transfer to the destination site and the data from the cache corresponds to the application data. 8. A non-transitory computer-readable medium containing software that transfers a virtual machine from a first site to a second site, the software comprising:
executable code that transfers to the second site data corresponding to the virtual machine in an asynchronous mode in which write operations by the virtual machine at the first site for the transferred data are acknowledged on the first site prior to acknowledgement from the second site of completion of the write operation at the second site, while asynchronously copying an image of the virtual machine from the first site to the second site; executable code that transitions from the asynchronous mode into a synchronous mode to cause the data corresponding to writes by the virtual machine at the first site to be propagated synchronously to the second site while the image of the virtual machine operating at the first site is accepting the writes thereto and while asynchronously copying the image of the virtual machine from the first site to the second site; executable code that, after transitioning to the synchronous mode, performs a cache synchronization operation that transfers modified portions of the data from the first site to the second site; executable code that, after completing the cache synchronization operation, suspends operation of the virtual machine on the first site; and executable code that resumes operation of the virtual machine on the second site. 9.-10. (canceled) 11. The non-transitory computer-readable medium according to claim 8, wherein the second site is selected by a user. 12. The non-transitory computer-readable medium according to claim 8, wherein each of the first site and second site include at least one host cluster, at least one director cluster and at least one storage array. 13. The non-transitory computer-readable medium according to claim 8, wherein the second site is located remotely from the first site across an asynchronous distance. 14. The non-transitory computer-readable medium according to claim 8, further comprising:
executable code that combines data from a cache at the source site with data being written by the virtual machine at the source site in response to writing application data when the cache at the source site contains data awaiting transfer to the second site and the data from the cache corresponds to the application data. 15. An active/active system, comprising:
a first site; a second site located remotely from the first site, wherein each of the first site and the second site include at least one host cluster, at least one director cluster, and at least one storage array; and a computer readable medium of at least one of: the host cluster or the director cluster that stores software for providing mobility of a virtual machine between the first site and the second site, the software including:
executable code that transfers to the second site data corresponding to the virtual machine in an asynchronous mode in which write operations by the virtual machine at the first site for the transferred data are acknowledged on the first site prior to acknowledgement from the second site of completion of the write operation at the second site, while asynchronously copying an image of the virtual machine from the first site to the second site;
executable code that transitions from the asynchronous mode into a synchronous mode to cause the data corresponding to writes by the virtual machine at the first site to be propagated synchronously to the second site while the image of the virtual machine operating at the first site is accepting the writes thereto and while asynchronously copying the image of the virtual machine from the first site to the second site;
executable code that, after transitioning to the synchronous mode, performs a cache synchronization operation that transfers modified portions of the data from the first site to the second site;
executable code that, after completing the cache synchronization operation, suspends operation of the virtual machine on the first site; and
executable code that resumes operation of the virtual machine on the second site. 16.-17. (canceled) 18. The active/active system according to claim 15, wherein the second site is selected by a user. 19. The active/active system according to claim 15, wherein the second site is located remotely from the first site across an asynchronous distance. 20. The active/active system according to claim 15, wherein the software further includes executable code that combines data from a cache at the source site with data being written by the virtual machine at the source site in response to writing application data when the cache at the source site contains data awaiting transfer to the second site and the data from the cache corresponds to the application data. | Transferring an application from a first site to a second site includes determining that the second site is a destination site for the application, causing writes by the application at the first site to be propagated synchronously to the second site, transferring storage data from the first site to the second site, suspending operation of the application on the first site, and resuming operation of the application on the second site. The application may be a virtual machine or a host cluster capable of transitioning applications between cluster nodes. The virtual machine may be transferred from the first site to the second site by transferring an image of the virtual machine from the first site to the second site. The destination site may be selected by a user. The second site may be located remotely from the first site across an asynchronous distance.1. A method of transferring a virtual machine from a first site to a second site, comprising:
determining that the second site is a destination site for the virtual machine; transferring to the second site data corresponding to the virtual machine in an asynchronous mode in which write operations by the virtual machine at the first site for the transferred data are acknowledged on the first site prior to acknowledgement from the second site of completion of the write operation at the second site, while asynchronously copying an image of the virtual machine from the first site to the second site; transitioning from the asynchronous mode into a synchronous mode to cause the data corresponding to writes by the virtual machine at the first site to be propagated synchronously to the second site while the image of the virtual machine operating at the first site is accepting the writes thereto and while asynchronously copying the image of the virtual machine from the first site to the second site; after performing the transitioning, performing a cache synchronization operation that transfers modified portions of the data from the first site to the second site; responsive to completing the cache synchronization operation, suspending operation of the virtual machine on the first site; and resuming operation of the virtual machine on the second site. 2.-3. (canceled) 4. The method according to claim 1, wherein the destination site is selected by a user. 5. The method according to claim 1, wherein each of the first site and second site include at least one host cluster, at least one director cluster and at least one storage array. 6. The method according to claim 1, wherein the second site is located remotely from the first site across an asynchronous distance. 7. The method according to claim 1, further comprising:
combining data from a cache at the source site with data being written by the virtual machine at the source site in response to writing application data when the cache at the source site contains data awaiting transfer to the destination site and the data from the cache corresponds to the application data. 8. A non-transitory computer-readable medium containing software that transfers a virtual machine from a first site to a second site, the software comprising:
executable code that transfers to the second site data corresponding to the virtual machine in an asynchronous mode in which write operations by the virtual machine at the first site for the transferred data are acknowledged on the first site prior to acknowledgement from the second site of completion of the write operation at the second site, while asynchronously copying an image of the virtual machine from the first site to the second site; executable code that transitions from the asynchronous mode into a synchronous mode to cause the data corresponding to writes by the virtual machine at the first site to be propagated synchronously to the second site while the image of the virtual machine operating at the first site is accepting the writes thereto and while asynchronously copying the image of the virtual machine from the first site to the second site; executable code that, after transitioning to the synchronous mode, performs a cache synchronization operation that transfers modified portions of the data from the first site to the second site; executable code that, after completing the cache synchronization operation, suspends operation of the virtual machine on the first site; and executable code that resumes operation of the virtual machine on the second site. 9.-10. (canceled) 11. The non-transitory computer-readable medium according to claim 8, wherein the second site is selected by a user. 12. The non-transitory computer-readable medium according to claim 8, wherein each of the first site and second site include at least one host cluster, at least one director cluster and at least one storage array. 13. The non-transitory computer-readable medium according to claim 8, wherein the second site is located remotely from the first site across an asynchronous distance. 14. The non-transitory computer-readable medium according to claim 8, further comprising:
executable code that combines data from a cache at the source site with data being written by the virtual machine at the source site in response to writing application data when the cache at the source site contains data awaiting transfer to the second site and the data from the cache corresponds to the application data. 15. An active/active system, comprising:
a first site; a second site located remotely from the first site, wherein each of the first site and the second site include at least one host cluster, at least one director cluster, and at least one storage array; and a computer readable medium of at least one of: the host cluster or the director cluster that stores software for providing mobility of a virtual machine between the first site and the second site, the software including:
executable code that transfers to the second site data corresponding to the virtual machine in an asynchronous mode in which write operations by the virtual machine at the first site for the transferred data are acknowledged on the first site prior to acknowledgement from the second site of completion of the write operation at the second site, while asynchronously copying an image of the virtual machine from the first site to the second site;
executable code that transitions from the asynchronous mode into a synchronous mode to cause the data corresponding to writes by the virtual machine at the first site to be propagated synchronously to the second site while the image of the virtual machine operating at the first site is accepting the writes thereto and while asynchronously copying the image of the virtual machine from the first site to the second site;
executable code that, after transitioning to the synchronous mode, performs a cache synchronization operation that transfers modified portions of the data from the first site to the second site;
executable code that, after completing the cache synchronization operation, suspends operation of the virtual machine on the first site; and
executable code that resumes operation of the virtual machine on the second site. 16.-17. (canceled) 18. The active/active system according to claim 15, wherein the second site is selected by a user. 19. The active/active system according to claim 15, wherein the second site is located remotely from the first site across an asynchronous distance. 20. The active/active system according to claim 15, wherein the software further includes executable code that combines data from a cache at the source site with data being written by the virtual machine at the source site in response to writing application data when the cache at the source site contains data awaiting transfer to the second site and the data from the cache corresponds to the application data. | 2,100 |
5,767 | 5,767 | 13,670,307 | 2,152 | Recurring search automation with search event detection is enabled. Responsive to detection of search events and/or user triggering, a recurring search may be generated. The recurring search may be based on the detected search event, for example, based on search parameters of the detected search event. The recurring search may be associated with a recurrence schedule. Search results may be generated by performing the recurring search in accordance with the recurrence schedule. Data corresponding to the generated search results may be provided. For example, the results may be provided for presentation in accordance with user preferences. The relevant search events may be detected by a search detection module. For example, the search detection module may be incorporated into a user client such as a web browser. The recurring searches may be maintained by a recurring search service. | 1. A method for recurring search automation, the method comprising:
detecting a search event; responsive to the detection of the search event, generating a recurring search based at least in part on the detected search event, the recurring search being associated with a recurrence schedule; generating search results at least in part by performing the recurring search according to the associated recurrence schedule; and providing data corresponding to at least a portion of the generated search results for presentation. 2. A method in accordance with claim 1, wherein detecting the search event comprises identifying a search element of a user interface and detecting user interaction with the identified search element. 3. A method in accordance with claim 2, wherein the user interface comprises a web-based graphical user interface. 4. A method in accordance with claim 2, wherein the search element of the user interface is not explicitly identified as such and identifying the search element of the user interface comprises automatically identifying the search element of the user interface in accordance with a search element identification heuristic. 5. A method in accordance with claim 4, wherein automatically identifying the search element of the user interface in accordance with the search element identification heuristic comprises automatically identifying the search element of the user interface based at least in part on a pattern of user input. 6. A method in accordance with claim 5, wherein automatically identifying the search element of the user interface based at least in part on the pattern of user input comprises determining at least one correlation between current user input and previous user input. 7. A method in accordance with claim 5, wherein automatically identifying the search element of the user interface based at least in part on the pattern of user input comprises detecting input, by a user, of at least one search term that was previously used in at least one search by the user. 8. A method in accordance with claim 4, wherein automatically identifying the search element of the user interface in accordance with the search element identification heuristic comprises automatically identifying the search element of the user interface based at least in part on one or more structural aspects of the user interface. 9. A method in accordance with claim 8, wherein the user interface comprises a graphical user interface specified at least in part with a hypertext markup language and automatically identifying the search element of the user interface based at least in part on one or more structural aspects of the user interface comprises identifying the search element of the user interface based at least in part on one or more structural aspects of the hypertext markup language specifying the graphical user interface. 10. A method in accordance with claim 8, wherein the user interface comprises a graphical user interface and automatically identifying the search element of the user interface based at least in part on one or more structural aspects of the user interface comprises identifying the search element of the user interface based at least in part on one or more interrelationships between graphical elements of the graphical user interface. 11. A method in accordance with claim 1, wherein detecting the search event comprises detecting a search request sent responsive to user interaction with a user interface. 12. A method in accordance with claim 11, wherein the search request is not explicitly identified as such and detecting the search request comprises automatically identifying the search request in accordance with a search request identification heuristic. 13. A method in accordance with claim 12, wherein automatically identifying the search request in accordance with the search request identification heuristic comprises automatically identifying the search request based at least in part on one or more structural aspects of contents of the search request. 14. A method in accordance with claim 13, wherein the search request comprises a message of a hypertext transfer protocol and automatically identifying the search request in accordance with the search request identification heuristic comprises automatically identifying the search request based at least in part on one or more interrelationships between elements of the message of the hypertext transfer protocol. 15. A method in accordance with claim 1, wherein the search event occurs responsive to interaction with a user interface by a user and the recurring search is further based at least in part on one or more recurring search parameters specified by the user distinct from search event parameters. 16. A method in accordance with claim 15, wherein the one or more recurring search parameters specified by the user include at least one of: the recurrence schedule and one or more search result delivery options. 17. A system for recurring search automation, the system comprising:
a search detection module configured at least to detect search events; a recurring search management module communicatively coupled with the search detection module, the recurring search management module configured to, at least:
generate a recurring search responsive to detection of a search event by the search detection module, the recurring search being based at least in part on the detected search event and associated with a recurrence schedule;
generate search results at least in part by performing the recurring search according to the recurrence schedule; and
provide data corresponding to at least a portion of the generated search results for presentation; and
at least one processor configured to collectively facilitate at least the search detection module and the recurring search management module. 18. A system in accordance with claim 17, wherein the search detection module is incorporated in a web browser. 19. A system in accordance with claim 18, wherein the recurring search management module is implemented at least in part by at least one server remote from the web browser. 20. One or more computer-readable media collectively having thereon computer-executable instructions that configure one or more computers to collectively, at least:
detect a search event; generate a recurring search object based at least in part on the detected search event, the recurring search object including a specification of a recurrence schedule; generate search results at least in part by performing at least one search in accordance with the recurring search object; and provide data corresponding to at least a portion of the generated search results for presentation. | Recurring search automation with search event detection is enabled. Responsive to detection of search events and/or user triggering, a recurring search may be generated. The recurring search may be based on the detected search event, for example, based on search parameters of the detected search event. The recurring search may be associated with a recurrence schedule. Search results may be generated by performing the recurring search in accordance with the recurrence schedule. Data corresponding to the generated search results may be provided. For example, the results may be provided for presentation in accordance with user preferences. The relevant search events may be detected by a search detection module. For example, the search detection module may be incorporated into a user client such as a web browser. The recurring searches may be maintained by a recurring search service.1. A method for recurring search automation, the method comprising:
detecting a search event; responsive to the detection of the search event, generating a recurring search based at least in part on the detected search event, the recurring search being associated with a recurrence schedule; generating search results at least in part by performing the recurring search according to the associated recurrence schedule; and providing data corresponding to at least a portion of the generated search results for presentation. 2. A method in accordance with claim 1, wherein detecting the search event comprises identifying a search element of a user interface and detecting user interaction with the identified search element. 3. A method in accordance with claim 2, wherein the user interface comprises a web-based graphical user interface. 4. A method in accordance with claim 2, wherein the search element of the user interface is not explicitly identified as such and identifying the search element of the user interface comprises automatically identifying the search element of the user interface in accordance with a search element identification heuristic. 5. A method in accordance with claim 4, wherein automatically identifying the search element of the user interface in accordance with the search element identification heuristic comprises automatically identifying the search element of the user interface based at least in part on a pattern of user input. 6. A method in accordance with claim 5, wherein automatically identifying the search element of the user interface based at least in part on the pattern of user input comprises determining at least one correlation between current user input and previous user input. 7. A method in accordance with claim 5, wherein automatically identifying the search element of the user interface based at least in part on the pattern of user input comprises detecting input, by a user, of at least one search term that was previously used in at least one search by the user. 8. A method in accordance with claim 4, wherein automatically identifying the search element of the user interface in accordance with the search element identification heuristic comprises automatically identifying the search element of the user interface based at least in part on one or more structural aspects of the user interface. 9. A method in accordance with claim 8, wherein the user interface comprises a graphical user interface specified at least in part with a hypertext markup language and automatically identifying the search element of the user interface based at least in part on one or more structural aspects of the user interface comprises identifying the search element of the user interface based at least in part on one or more structural aspects of the hypertext markup language specifying the graphical user interface. 10. A method in accordance with claim 8, wherein the user interface comprises a graphical user interface and automatically identifying the search element of the user interface based at least in part on one or more structural aspects of the user interface comprises identifying the search element of the user interface based at least in part on one or more interrelationships between graphical elements of the graphical user interface. 11. A method in accordance with claim 1, wherein detecting the search event comprises detecting a search request sent responsive to user interaction with a user interface. 12. A method in accordance with claim 11, wherein the search request is not explicitly identified as such and detecting the search request comprises automatically identifying the search request in accordance with a search request identification heuristic. 13. A method in accordance with claim 12, wherein automatically identifying the search request in accordance with the search request identification heuristic comprises automatically identifying the search request based at least in part on one or more structural aspects of contents of the search request. 14. A method in accordance with claim 13, wherein the search request comprises a message of a hypertext transfer protocol and automatically identifying the search request in accordance with the search request identification heuristic comprises automatically identifying the search request based at least in part on one or more interrelationships between elements of the message of the hypertext transfer protocol. 15. A method in accordance with claim 1, wherein the search event occurs responsive to interaction with a user interface by a user and the recurring search is further based at least in part on one or more recurring search parameters specified by the user distinct from search event parameters. 16. A method in accordance with claim 15, wherein the one or more recurring search parameters specified by the user include at least one of: the recurrence schedule and one or more search result delivery options. 17. A system for recurring search automation, the system comprising:
a search detection module configured at least to detect search events; a recurring search management module communicatively coupled with the search detection module, the recurring search management module configured to, at least:
generate a recurring search responsive to detection of a search event by the search detection module, the recurring search being based at least in part on the detected search event and associated with a recurrence schedule;
generate search results at least in part by performing the recurring search according to the recurrence schedule; and
provide data corresponding to at least a portion of the generated search results for presentation; and
at least one processor configured to collectively facilitate at least the search detection module and the recurring search management module. 18. A system in accordance with claim 17, wherein the search detection module is incorporated in a web browser. 19. A system in accordance with claim 18, wherein the recurring search management module is implemented at least in part by at least one server remote from the web browser. 20. One or more computer-readable media collectively having thereon computer-executable instructions that configure one or more computers to collectively, at least:
detect a search event; generate a recurring search object based at least in part on the detected search event, the recurring search object including a specification of a recurrence schedule; generate search results at least in part by performing at least one search in accordance with the recurring search object; and provide data corresponding to at least a portion of the generated search results for presentation. | 2,100 |
5,768 | 5,768 | 15,293,541 | 2,182 | Methods and systems for determining whether an infinitely precise result of a reciprocal square root operation performed on an input floating point number is greater than a particular number in a first floating point precision. The method includes calculating the square of the particular number in a second lower floating point precision; calculating an error in the calculated square due to the second floating point precision; calculating a first delta value in the first floating point precision by calculating the square multiplied by the input floating point number less one; calculating a second delta value by calculating the error multiplied by the input floating point number plus the first delta value; and outputting an indication of whether the infinitely precise result of the reciprocal square root operation is greater than the particular number based on the second delta term. | 1. A system configured to determine whether an infinitely precise result of a reciprocal square root operation performed on an input floating point number is greater than, less than, or equal to a particular number in a first floating point precision, the system comprising:
one or more fused multiply add components configured to:
(a) calculate a square of the particular number in a second floating point precision that is less than the first floating point precision;
(b) calculate a rounding error in the calculated square;
(c) calculate a first delta value in the first floating point precision by calculating the square multiplied by the input floating point number less one; and
(d) calculate a second delta value in the first floating point precision by calculating the rounding error multiplied by the input floating point number plus the first delta value; and
an output module configured to output an indication of whether the infinitely precise result of the reciprocal square root operation is greater than, less than or equal to the particular number based on a sign of the second delta value. 2. The system of claim 1, wherein the system comprises only one fused multiply add component that is configured to perform each of (a), (b), (c) and (d) in a different cycle. 3. The system of claim 1, further comprising decision logic configured to determine whether a calculated result of the reciprocal square root operation in the first precision is within a predetermined range of the particular number by determining whether the calculated result comprises one of one or more predetermined bit patterns; and, only invoking the one or more fused multiply add components in response to determining that the calculated result is within the predetermined range. 4. The system of claim 3, wherein the first floating point precision comprises at least two guard bits and the decision logic is configured to determine whether the calculated result is within the predetermined range of the particular number by determining whether the at least two guard bits of the calculated result comprise one of one or more predetermined bit patterns. 5. The system of claim 1, further comprising a particular number generation logic unit configured to generate the particular number in the first floating point precision based on a received calculated result of the reciprocal square root calculation in the first floating point precision. 6. The system of claim 5, wherein the particular number is a number in the first floating point precision that lies half way between two consecutive representable numbers in the second floating point precision on either side of the calculated result. 7. The system of claim 6, wherein the first floating point precision comprises at least two guard bits and the particular number generation logic is configured to generate the particular number by setting the particular number to the calculated result and then setting the most significant bit of the at least two guard bits to one and setting the remainder of the guard bits to zero. 8. A system to generate an accurately rounded result of a reciprocal square root calculation performed on an input floating point number, the system comprising:
a reciprocal square root calculation module configured to generate a calculated result of the reciprocal square root calculation in a first floating point precision; the system as set forth in claim 1; and rounding logic configured to round the calculated result to the second floating point precision according to a particular rounding method based on the output indication. 9. The system of claim 8, wherein the rounding logic is configured to, in response to the output indication indicating that the infinitely precise result is greater than the particular number, round the calculated result in one direction; and in response to the output indication indicating that the infinitely precise result is less than the particular number, round the calculated result in another direction. 10. The system of claim 8, wherein the particular rounding method is a round to nearest rounding method so that the rounding logic is configured to, in response to the output indication indicating that the infinitely precise result is greater than the particular number, round up the calculated result; and in response to the output indication indicating that the infinitely precise result is less than the half way number, round down the calculated result. 11. The system of claim 1, wherein the system is embodied in hardware on an integrated circuit. 12. A method of determining whether an infinitely precise result of a reciprocal square root operation performed on an input floating point number is greater than, less than, or equal to a particular number in a first floating point precision, the method comprising:
(a) calculating, at a fused multiply add component, a square of the particular number in a second floating point precision that is less than the first floating point precision; (b) calculating, at a fused multiply add component, a rounding error in the calculated square; (c) calculating, at a fused multiply add component, a first delta value in the first floating point precision by calculating the square multiplied by the input floating point number less one; and (d) calculating, at a fused multiply add component, a second delta value in the first floating point precision by calculating the rounding error multiplied by the input floating point number plus the first delta value; and (e) outputting an indication of whether the infinitely precise result of the reciprocal square root operation is greater than, less than or equal to the particular number based on a sign of the second delta value. 13. The method of claim 12, wherein each of (a), (b), (c) and (d) is performed in a different cycle by the same fused multiply add component. 14. The method of claim 12, further comprising determining whether a calculated result of the reciprocal square root operation in the first precision is within a predetermined range of the particular number by determining whether the calculated result comprises one of one or more predetermined bit patterns; and, only executing (a) to (e) in response to determining that the calculated result is within the predetermined range. 15. The method of claim 12, further comprising generating the particular number in the first floating point precision based on a received calculated result of the reciprocal square root calculation in the first floating point precision by selecting a number in the first floating point precision that lies half way between two consecutive representable numbers in the second floating point precision on either side of the calculated result. 16. A method of generating an accurately rounded result of a reciprocal square root calculation performed on an input floating point number, the method comprising:
generating a calculated result of the reciprocal square root calculation in a first floating point precision; performing the method as set forth in claim 12; and rounding the calculated result to the second floating point precision according to a particular rounding method based on the output indication. 17. The method of claim 16, wherein rounding the calculated result comprises, in response to the output indication indicating that the infinitely precise result is greater than the particular number, rounding the calculated result in one direction; and in response to the output indication indicating that the infinitely precise result is less than the particular number, rounding the calculated result in another direction. 18. The method of claim 16, wherein the particular rounding method is a round to nearest rounding method so that rounding the calculated result comprises, in response to the output indication indicating that the infinitely precise result is greater than the particular number, rounding up the calculated result; and in response to the output indication indicating that the infinitely precise result is less than the half way number, rounding down the calculated result. 19. A method of generating the system as set forth in claim 11. 20. A non-transitory computer readable storage medium having encoded thereon computer readable code configured to cause the method as set forth in claim 19 to be performed when the code is run. | Methods and systems for determining whether an infinitely precise result of a reciprocal square root operation performed on an input floating point number is greater than a particular number in a first floating point precision. The method includes calculating the square of the particular number in a second lower floating point precision; calculating an error in the calculated square due to the second floating point precision; calculating a first delta value in the first floating point precision by calculating the square multiplied by the input floating point number less one; calculating a second delta value by calculating the error multiplied by the input floating point number plus the first delta value; and outputting an indication of whether the infinitely precise result of the reciprocal square root operation is greater than the particular number based on the second delta term.1. A system configured to determine whether an infinitely precise result of a reciprocal square root operation performed on an input floating point number is greater than, less than, or equal to a particular number in a first floating point precision, the system comprising:
one or more fused multiply add components configured to:
(a) calculate a square of the particular number in a second floating point precision that is less than the first floating point precision;
(b) calculate a rounding error in the calculated square;
(c) calculate a first delta value in the first floating point precision by calculating the square multiplied by the input floating point number less one; and
(d) calculate a second delta value in the first floating point precision by calculating the rounding error multiplied by the input floating point number plus the first delta value; and
an output module configured to output an indication of whether the infinitely precise result of the reciprocal square root operation is greater than, less than or equal to the particular number based on a sign of the second delta value. 2. The system of claim 1, wherein the system comprises only one fused multiply add component that is configured to perform each of (a), (b), (c) and (d) in a different cycle. 3. The system of claim 1, further comprising decision logic configured to determine whether a calculated result of the reciprocal square root operation in the first precision is within a predetermined range of the particular number by determining whether the calculated result comprises one of one or more predetermined bit patterns; and, only invoking the one or more fused multiply add components in response to determining that the calculated result is within the predetermined range. 4. The system of claim 3, wherein the first floating point precision comprises at least two guard bits and the decision logic is configured to determine whether the calculated result is within the predetermined range of the particular number by determining whether the at least two guard bits of the calculated result comprise one of one or more predetermined bit patterns. 5. The system of claim 1, further comprising a particular number generation logic unit configured to generate the particular number in the first floating point precision based on a received calculated result of the reciprocal square root calculation in the first floating point precision. 6. The system of claim 5, wherein the particular number is a number in the first floating point precision that lies half way between two consecutive representable numbers in the second floating point precision on either side of the calculated result. 7. The system of claim 6, wherein the first floating point precision comprises at least two guard bits and the particular number generation logic is configured to generate the particular number by setting the particular number to the calculated result and then setting the most significant bit of the at least two guard bits to one and setting the remainder of the guard bits to zero. 8. A system to generate an accurately rounded result of a reciprocal square root calculation performed on an input floating point number, the system comprising:
a reciprocal square root calculation module configured to generate a calculated result of the reciprocal square root calculation in a first floating point precision; the system as set forth in claim 1; and rounding logic configured to round the calculated result to the second floating point precision according to a particular rounding method based on the output indication. 9. The system of claim 8, wherein the rounding logic is configured to, in response to the output indication indicating that the infinitely precise result is greater than the particular number, round the calculated result in one direction; and in response to the output indication indicating that the infinitely precise result is less than the particular number, round the calculated result in another direction. 10. The system of claim 8, wherein the particular rounding method is a round to nearest rounding method so that the rounding logic is configured to, in response to the output indication indicating that the infinitely precise result is greater than the particular number, round up the calculated result; and in response to the output indication indicating that the infinitely precise result is less than the half way number, round down the calculated result. 11. The system of claim 1, wherein the system is embodied in hardware on an integrated circuit. 12. A method of determining whether an infinitely precise result of a reciprocal square root operation performed on an input floating point number is greater than, less than, or equal to a particular number in a first floating point precision, the method comprising:
(a) calculating, at a fused multiply add component, a square of the particular number in a second floating point precision that is less than the first floating point precision; (b) calculating, at a fused multiply add component, a rounding error in the calculated square; (c) calculating, at a fused multiply add component, a first delta value in the first floating point precision by calculating the square multiplied by the input floating point number less one; and (d) calculating, at a fused multiply add component, a second delta value in the first floating point precision by calculating the rounding error multiplied by the input floating point number plus the first delta value; and (e) outputting an indication of whether the infinitely precise result of the reciprocal square root operation is greater than, less than or equal to the particular number based on a sign of the second delta value. 13. The method of claim 12, wherein each of (a), (b), (c) and (d) is performed in a different cycle by the same fused multiply add component. 14. The method of claim 12, further comprising determining whether a calculated result of the reciprocal square root operation in the first precision is within a predetermined range of the particular number by determining whether the calculated result comprises one of one or more predetermined bit patterns; and, only executing (a) to (e) in response to determining that the calculated result is within the predetermined range. 15. The method of claim 12, further comprising generating the particular number in the first floating point precision based on a received calculated result of the reciprocal square root calculation in the first floating point precision by selecting a number in the first floating point precision that lies half way between two consecutive representable numbers in the second floating point precision on either side of the calculated result. 16. A method of generating an accurately rounded result of a reciprocal square root calculation performed on an input floating point number, the method comprising:
generating a calculated result of the reciprocal square root calculation in a first floating point precision; performing the method as set forth in claim 12; and rounding the calculated result to the second floating point precision according to a particular rounding method based on the output indication. 17. The method of claim 16, wherein rounding the calculated result comprises, in response to the output indication indicating that the infinitely precise result is greater than the particular number, rounding the calculated result in one direction; and in response to the output indication indicating that the infinitely precise result is less than the particular number, rounding the calculated result in another direction. 18. The method of claim 16, wherein the particular rounding method is a round to nearest rounding method so that rounding the calculated result comprises, in response to the output indication indicating that the infinitely precise result is greater than the particular number, rounding up the calculated result; and in response to the output indication indicating that the infinitely precise result is less than the half way number, rounding down the calculated result. 19. A method of generating the system as set forth in claim 11. 20. A non-transitory computer readable storage medium having encoded thereon computer readable code configured to cause the method as set forth in claim 19 to be performed when the code is run. | 2,100 |
5,769 | 5,769 | 15,412,659 | 2,184 | A circuit is provide comprising a first input coupled to a transmit data input of a bus transceiver; and a first output coupled to a bus. The circuit is configured to be coupled in parallel with the bus transceiver. The circuit is further configured to, in response to a dominant to recessive transition on the transmit data input, lower an impedance of the bus. | 1. A circuit comprising:
a first input coupled to a transmit data input of a bus transceiver; and a first output coupled to a bus; wherein the circuit is configured to be coupled in parallel with the bus transceiver and configured to, in response to a dominant to recessive transition on the transmit data input, lower an impedance of the bus by outputting a negative drive current to the bus. 2. The circuit of claim 1 wherein the negative drive current is a first drive signal to drive the bus to a low impedance state. 3. The circuit of any preceding claim comprising:
a controller configured to detect the transition on the transmit data input; and a transmitter configured to output a first drive signal in response to the detected transition. 4. The circuit of claim 3 wherein the transmitter is coupled to the bus in anti-phase to the coupling of a transmitter of the bus transceiver to the bus. 5. The circuit of claim 3, wherein the transmitter is configured to drive the bus in an opposite polarity to a transmitter of the bus transceiver circuit. 6. The circuit of claim 3 wherein the first drive signal corresponds to a drive current output by the transmitter. 7. The circuit of claim 3 wherein in response to the transition on the transmit data input, the controller is configured to control the transmitter to transition the first drive signal between a first value and a second value. 8. The circuit of claim 7 wherein the first value corresponds to a value of a second drive signal output by the bus transceiver when the bus is in a passive recessive state. 9. The circuit of claim 7 where the second value corresponds to a third value that is the value of the second drive signal output by the bus transceiver when the bus is in a dominant state, where the second and third values have equal magnitude but opposite polarity. 10. The circuit of claim 7 wherein the controller is configured to control the transmitter to transition the first drive signal between the first value and the second value for a first period of time in response to the transition. 11. The circuit of claim 10 wherein the first period of time corresponds to a period of time taken for the second drive signal to transition between the third value and the first value in response to the transition on the transmit data input. 12. The circuit of claim 7 wherein the controller is further configured to control the transmitter to output the first drive signal at the second value for a second period of time. 13. The circuit of claim 7 wherein the controller is further configured to control the first drive signal to transition from the second value towards the first value at a first rate of change. 14. The circuit of claim 13 wherein the first rate of change is configured to be less than a rate of change that would cause ringing. 15. An apparatus comprising:
a bus transceiver coupled to receive a transmit data input and to provide a drive signal to a bus; and a circuit including:
a first input coupled to a transmit data input of a bus transceiver; and
a first output coupled to a bus;
wherein the circuit is configured to be coupled in parallel with the bus transceiver and configured to, in response to a dominant to recessive transition on the transmit data input, lower an impedance of the bus by outputting a negative drive current to the bus. 16. The circuit of claim 15 wherein the negative drive current is a first drive signal to drive the bus to a low impedance state. 17. The circuit of claim 15 further comprising:
a controller configured to detect the transition on the transmit data input; and
a transmitter configured to output a first drive signal in response to the detected transition. 18. The circuit of claim 17 wherein the transmitter is coupled to the bus in anti-phase to the coupling of a transmitter of the bus transceiver to the bus. 19. The circuit of claim 17, wherein the transmitter is configured to drive the bus in an opposite polarity to a transmitter of the bus transceiver circuit. 20. The circuit of claim 17 wherein the first drive signal corresponds to a drive current output by the transmitter. | A circuit is provide comprising a first input coupled to a transmit data input of a bus transceiver; and a first output coupled to a bus. The circuit is configured to be coupled in parallel with the bus transceiver. The circuit is further configured to, in response to a dominant to recessive transition on the transmit data input, lower an impedance of the bus.1. A circuit comprising:
a first input coupled to a transmit data input of a bus transceiver; and a first output coupled to a bus; wherein the circuit is configured to be coupled in parallel with the bus transceiver and configured to, in response to a dominant to recessive transition on the transmit data input, lower an impedance of the bus by outputting a negative drive current to the bus. 2. The circuit of claim 1 wherein the negative drive current is a first drive signal to drive the bus to a low impedance state. 3. The circuit of any preceding claim comprising:
a controller configured to detect the transition on the transmit data input; and a transmitter configured to output a first drive signal in response to the detected transition. 4. The circuit of claim 3 wherein the transmitter is coupled to the bus in anti-phase to the coupling of a transmitter of the bus transceiver to the bus. 5. The circuit of claim 3, wherein the transmitter is configured to drive the bus in an opposite polarity to a transmitter of the bus transceiver circuit. 6. The circuit of claim 3 wherein the first drive signal corresponds to a drive current output by the transmitter. 7. The circuit of claim 3 wherein in response to the transition on the transmit data input, the controller is configured to control the transmitter to transition the first drive signal between a first value and a second value. 8. The circuit of claim 7 wherein the first value corresponds to a value of a second drive signal output by the bus transceiver when the bus is in a passive recessive state. 9. The circuit of claim 7 where the second value corresponds to a third value that is the value of the second drive signal output by the bus transceiver when the bus is in a dominant state, where the second and third values have equal magnitude but opposite polarity. 10. The circuit of claim 7 wherein the controller is configured to control the transmitter to transition the first drive signal between the first value and the second value for a first period of time in response to the transition. 11. The circuit of claim 10 wherein the first period of time corresponds to a period of time taken for the second drive signal to transition between the third value and the first value in response to the transition on the transmit data input. 12. The circuit of claim 7 wherein the controller is further configured to control the transmitter to output the first drive signal at the second value for a second period of time. 13. The circuit of claim 7 wherein the controller is further configured to control the first drive signal to transition from the second value towards the first value at a first rate of change. 14. The circuit of claim 13 wherein the first rate of change is configured to be less than a rate of change that would cause ringing. 15. An apparatus comprising:
a bus transceiver coupled to receive a transmit data input and to provide a drive signal to a bus; and a circuit including:
a first input coupled to a transmit data input of a bus transceiver; and
a first output coupled to a bus;
wherein the circuit is configured to be coupled in parallel with the bus transceiver and configured to, in response to a dominant to recessive transition on the transmit data input, lower an impedance of the bus by outputting a negative drive current to the bus. 16. The circuit of claim 15 wherein the negative drive current is a first drive signal to drive the bus to a low impedance state. 17. The circuit of claim 15 further comprising:
a controller configured to detect the transition on the transmit data input; and
a transmitter configured to output a first drive signal in response to the detected transition. 18. The circuit of claim 17 wherein the transmitter is coupled to the bus in anti-phase to the coupling of a transmitter of the bus transceiver to the bus. 19. The circuit of claim 17, wherein the transmitter is configured to drive the bus in an opposite polarity to a transmitter of the bus transceiver circuit. 20. The circuit of claim 17 wherein the first drive signal corresponds to a drive current output by the transmitter. | 2,100 |
5,770 | 5,770 | 15,211,917 | 2,167 | The present inventive subject matter relates to prior art analysis. Various embodiments of the present inventive subject matter include systems and methods for analyzing prior art in a patent portfolio and annuity management system. In an example embodiment, a method comprises maintaining a patent matter database. The database includes data about the patent matters including for at least one patent matter a claim set or statement of invention and a priority date for the claim set or statement of invention. A database of prior art documents is maintained including data about the prior art documents. The data may include for at least one prior art document a priority date or publication date of the document. A keyword analysis is performed on a given patent matter and associated prior art documents to identify keywords occurring uniquely in the first patent matter as potential claim elements differentiating the patent matter over the disclosures contained in the one or more prior art documents. | 1. (canceled) 2. A system comprising:
at least one processor; and a memory comprising instructions that, when executed by the at least one processor, cause the at least one processor to perform operations to:
maintain a patent matter database and a prior art document database;
associate a set of prior art documents in the prior art database with a patent matter in the patent matter database;
perform an automatic keyword analysis on both the patent matter and the set of prior art documents to derive a keyword differentiation score for each prior art document of the set of prior art documents, the keyword differentiation score indicating potential relevance of the prior art document to the patent matter;
rank the set of prior art documents based the respective keyword differentiation score for each prior art document; and
combine, at a user interface, information including at least:
identification of the patent matter;
one or more keywords used in performance of the keyword analysis; and
a timeline representing the priority date of the patent matter and the priority or publication date of the prior art document, the timeline including a visual indication of the ranking of the set of prior art documents. 3. The system of claim 2, wherein a prior art document of the set of prior art documents with a highest degree of keyword differentiation is lowest ranked in potential relevance to the patent matter. 4. The system of claim 2, wherein a prior art document of the set of prior art documents with a lowest degree of keyword differentiation is highest ranked in potential relevance to the patent matter. 5. The system of claim 2, further comprising operations to provide, in the user interface, a visual indication of the technology class and/or subclass of the patent matter and the prior art document. 6. The system of claim 2, the automatic keyword analysis further comprising operations to:
identify a keyword pool for the patent matter and each prior art document of the set of prior an documents based on occurrences of one or more keywords in the patent matter and each prior art document of the set of prior art documents; and derive the keyword differentiation score for each prior art document of the set of prior art documents using the keyword pool. 7. The system of claim 6, further comprising operations to identify a cited inventor or assignee of the prior art document of the set of prior art documents and provide, in the user interface, a visual indication of the cited inventor or assignee. 8. The system of claim 6, further comprising operations to provide, in the user interface, the keyword pool. 9. The system of claim 6, further comprising operations to provide, in the user interface, an indication on the timeline of when one or more of the keywords in the keyword pool appeared in the set of prior art documents. 10. At least one computer readable memory comprising instructions that, when executed by a computer, cause the computer to perform operations to:
maintain a patent matter database and a prior art document database; associate a set of prior art documents in the prior art database with a patent matter in the patent matter database; perform an automatic keyword analysis on both the patent matter and the set of prior art documents to derive a keyword differentiation score for each prior art document of the set of prior art documents, the keyword differentiation score indicating potential relevance of the prior art document to the patent matter; rank the set of prior art documents based the respective keyword differentiation score for each prior art document; and combine, at a user interface, information including at least:
identification of the patent matter;
one or more keywords used in performance of the keyword analysis; and
a timeline representing the priority date of the patent matter and the priority or publication date of the prior art document, the timeline including a visual indication of the ranking of the set of prior art documents. 11. The at least one computer readable memory of claim 10, wherein a prior art document of the set of prior art documents with a highest degree of keyword differentiation is lowest ranked in potential relevance to the patent matter. 12. The at least one computer readable memory of claim 10, wherein a prior art document of the set of prior art documents with a lowest degree of keyword differentiation is highest ranked in potential relevance to the patent matter. 13. The at least one computer readable memory of claim 10, further comprising operations to provide, in the user interface, a visual indication of the technology class and/or subclass of the patent matter and the prior art document. 14. The at least one computer readable memory of claim 10, the automatic keyword analysis further comprising operations to:
identify a keyword pool for the patent matter and each prior art document of the set of prior art documents based on occurrences of one or more keywords in the patent matter and each prior art document of the set of prior art documents; and derive the keyword differentiation score for each prior art document of the set of prior art documents using the keyword pool. 15. The at least one computer readable memory of claim 14, further comprising operations to identify a cited inventor or assignee of the prior art document of the set of prior art documents and provide, in the user interface, a visual indication of the cited inventor or assignee. 16. The at least one computer readable memory of claim 14, further comprising operations to provide, in the user interface, the keyword pool. 17. The at least one computer readable memory of claim 14, further comprising operations to provide, in the user interface, an indication on the time line of when one or more of the keywords in the keyword pool appeared in the set of prior art documents. 18. A method comprising:
maintaining a patent matter database and a prior art document database; associating a set of prior art documents in the prior art database with a patent matter in the patent matter database; performing an automatic keyword analysis on both the patent matter and the set of prior art documents to derive a keyword differentiation score for each prior art document of the set of prior art documents, the keyword differentiation score indicating potential relevance of the prior art document to the patent matter; ranking the set of prior art documents based the respective keyword differentiation score for each prior art document; and combining, at a user interface, information including at least:
identification of the patent matter;
one or more keywords used in performing the keyword analysis; and
a timeline representing the priority date of the patent matter and the priority or publication date of the prior art document, the timeline including a visual indication of the ranking of the set of prior art documents. 19. The method of claim 18, wherein a prior art document of the set of prior art documents with a highest degree of keyword differentiation is lowest ranked in potential relevance to the patent matter. 20. The method of claim 18, wherein a prior art document of the set of prior art documents with a lowest degree of keyword differentiation is highest ranked in potential relevance to the patent matter. 21. The method of claim 18, further comprising providing, in the user interface, a visual indication of the technology class and/or subclass of the patent matter and the prior art document. 22. The method of claim 18, the automatic keyword analysis further comprising:
identifying a keyword pool for the patent matter and each prior art document of the set of prior art documents based on occurrences of one or more keywords in the patent matter and each prior art document of the set of prior art documents; and deriving the keyword differentiation score for each prior art document of the set of prior art documents using the keyword pool. 23. The method of claim further comprising identifying a cited inventor or assignee of the prior art document of the set of prior art documents and provide, in the user interface, a visual indication of the cited inventor or assignee. 24. The method of claim 22, further comprising providing, in the user interface, the keyword pool. 25. The method of claim 22, further comprising providing, in the user interface, an indication on the time line of when one or more of the keywords in the keyword pool appeared in the set of prior art documents. | The present inventive subject matter relates to prior art analysis. Various embodiments of the present inventive subject matter include systems and methods for analyzing prior art in a patent portfolio and annuity management system. In an example embodiment, a method comprises maintaining a patent matter database. The database includes data about the patent matters including for at least one patent matter a claim set or statement of invention and a priority date for the claim set or statement of invention. A database of prior art documents is maintained including data about the prior art documents. The data may include for at least one prior art document a priority date or publication date of the document. A keyword analysis is performed on a given patent matter and associated prior art documents to identify keywords occurring uniquely in the first patent matter as potential claim elements differentiating the patent matter over the disclosures contained in the one or more prior art documents.1. (canceled) 2. A system comprising:
at least one processor; and a memory comprising instructions that, when executed by the at least one processor, cause the at least one processor to perform operations to:
maintain a patent matter database and a prior art document database;
associate a set of prior art documents in the prior art database with a patent matter in the patent matter database;
perform an automatic keyword analysis on both the patent matter and the set of prior art documents to derive a keyword differentiation score for each prior art document of the set of prior art documents, the keyword differentiation score indicating potential relevance of the prior art document to the patent matter;
rank the set of prior art documents based the respective keyword differentiation score for each prior art document; and
combine, at a user interface, information including at least:
identification of the patent matter;
one or more keywords used in performance of the keyword analysis; and
a timeline representing the priority date of the patent matter and the priority or publication date of the prior art document, the timeline including a visual indication of the ranking of the set of prior art documents. 3. The system of claim 2, wherein a prior art document of the set of prior art documents with a highest degree of keyword differentiation is lowest ranked in potential relevance to the patent matter. 4. The system of claim 2, wherein a prior art document of the set of prior art documents with a lowest degree of keyword differentiation is highest ranked in potential relevance to the patent matter. 5. The system of claim 2, further comprising operations to provide, in the user interface, a visual indication of the technology class and/or subclass of the patent matter and the prior art document. 6. The system of claim 2, the automatic keyword analysis further comprising operations to:
identify a keyword pool for the patent matter and each prior art document of the set of prior an documents based on occurrences of one or more keywords in the patent matter and each prior art document of the set of prior art documents; and derive the keyword differentiation score for each prior art document of the set of prior art documents using the keyword pool. 7. The system of claim 6, further comprising operations to identify a cited inventor or assignee of the prior art document of the set of prior art documents and provide, in the user interface, a visual indication of the cited inventor or assignee. 8. The system of claim 6, further comprising operations to provide, in the user interface, the keyword pool. 9. The system of claim 6, further comprising operations to provide, in the user interface, an indication on the timeline of when one or more of the keywords in the keyword pool appeared in the set of prior art documents. 10. At least one computer readable memory comprising instructions that, when executed by a computer, cause the computer to perform operations to:
maintain a patent matter database and a prior art document database; associate a set of prior art documents in the prior art database with a patent matter in the patent matter database; perform an automatic keyword analysis on both the patent matter and the set of prior art documents to derive a keyword differentiation score for each prior art document of the set of prior art documents, the keyword differentiation score indicating potential relevance of the prior art document to the patent matter; rank the set of prior art documents based the respective keyword differentiation score for each prior art document; and combine, at a user interface, information including at least:
identification of the patent matter;
one or more keywords used in performance of the keyword analysis; and
a timeline representing the priority date of the patent matter and the priority or publication date of the prior art document, the timeline including a visual indication of the ranking of the set of prior art documents. 11. The at least one computer readable memory of claim 10, wherein a prior art document of the set of prior art documents with a highest degree of keyword differentiation is lowest ranked in potential relevance to the patent matter. 12. The at least one computer readable memory of claim 10, wherein a prior art document of the set of prior art documents with a lowest degree of keyword differentiation is highest ranked in potential relevance to the patent matter. 13. The at least one computer readable memory of claim 10, further comprising operations to provide, in the user interface, a visual indication of the technology class and/or subclass of the patent matter and the prior art document. 14. The at least one computer readable memory of claim 10, the automatic keyword analysis further comprising operations to:
identify a keyword pool for the patent matter and each prior art document of the set of prior art documents based on occurrences of one or more keywords in the patent matter and each prior art document of the set of prior art documents; and derive the keyword differentiation score for each prior art document of the set of prior art documents using the keyword pool. 15. The at least one computer readable memory of claim 14, further comprising operations to identify a cited inventor or assignee of the prior art document of the set of prior art documents and provide, in the user interface, a visual indication of the cited inventor or assignee. 16. The at least one computer readable memory of claim 14, further comprising operations to provide, in the user interface, the keyword pool. 17. The at least one computer readable memory of claim 14, further comprising operations to provide, in the user interface, an indication on the time line of when one or more of the keywords in the keyword pool appeared in the set of prior art documents. 18. A method comprising:
maintaining a patent matter database and a prior art document database; associating a set of prior art documents in the prior art database with a patent matter in the patent matter database; performing an automatic keyword analysis on both the patent matter and the set of prior art documents to derive a keyword differentiation score for each prior art document of the set of prior art documents, the keyword differentiation score indicating potential relevance of the prior art document to the patent matter; ranking the set of prior art documents based the respective keyword differentiation score for each prior art document; and combining, at a user interface, information including at least:
identification of the patent matter;
one or more keywords used in performing the keyword analysis; and
a timeline representing the priority date of the patent matter and the priority or publication date of the prior art document, the timeline including a visual indication of the ranking of the set of prior art documents. 19. The method of claim 18, wherein a prior art document of the set of prior art documents with a highest degree of keyword differentiation is lowest ranked in potential relevance to the patent matter. 20. The method of claim 18, wherein a prior art document of the set of prior art documents with a lowest degree of keyword differentiation is highest ranked in potential relevance to the patent matter. 21. The method of claim 18, further comprising providing, in the user interface, a visual indication of the technology class and/or subclass of the patent matter and the prior art document. 22. The method of claim 18, the automatic keyword analysis further comprising:
identifying a keyword pool for the patent matter and each prior art document of the set of prior art documents based on occurrences of one or more keywords in the patent matter and each prior art document of the set of prior art documents; and deriving the keyword differentiation score for each prior art document of the set of prior art documents using the keyword pool. 23. The method of claim further comprising identifying a cited inventor or assignee of the prior art document of the set of prior art documents and provide, in the user interface, a visual indication of the cited inventor or assignee. 24. The method of claim 22, further comprising providing, in the user interface, the keyword pool. 25. The method of claim 22, further comprising providing, in the user interface, an indication on the time line of when one or more of the keywords in the keyword pool appeared in the set of prior art documents. | 2,100 |
5,771 | 5,771 | 15,073,242 | 2,143 | A display apparatus for a user interface of a medical instrument avoids erroneous input of numerical values when a user inputs information. A display apparatus includes a numerical value information input section, a selectable target information display section, and a target selection section. A plurality of the setting information selection sections are displayed to be associated with corresponding selectable target information, and a plurality of pieces of selectable target information are arranged so as to be adjacent to each other based on a same standard. The numerical value information input section corresponding to the selected target selection section is displayed simultaneously on a same screen. A range of the selectable target information is changed visually and displayed in response to the numerical value information which is input to the numerical value information input section. | 1. A display apparatus for a medical instrument monitoring various types of information and configured to accept user input for controlling operation of the medical instrument, the display apparatus comprising:
a numerical value information input section through which numerical value information can be input; a selectable target information display section that displays a plurality of pieces of selectable target information; and target selection sections that are used to select any one of the plurality of pieces of selectable target information, wherein the plurality of target selection sections are displayed to be associated with the corresponding selectable target information, wherein the plurality of pieces of selectable target information are arranged so as to be adjacent to each other based on a same standard, wherein when any one of the plurality of target selection sections is selected, the numerical value information input section corresponding to the selected target selection section is displayed simultaneously on a same screen together with the selected selectable target information, and wherein a range of the selectable target information which is displayed simultaneously on the same screen is changed visually and displayed in response to the numerical value information which is input to the numerical value information input section. 2. The display apparatus according to claim 1,
wherein the selectable target information display section is displayed in a form of a bar shape, and the pieces of selectable target information are displayed in colors different from each other. 3. The display apparatus according to claim 1, further comprising:
a setting range information storage unit that stores setting range information on each piece of the selectable target information; and a permissible range determination unit that determines whether or not the numerical value information which is input to the numerical value information input section is within a permissible range of the setting range information, wherein when the numerical value information is not within the permissible range of the setting range information, inputting of the numerical value information is configured to be refused. 4. The display apparatus according to claim 3,
wherein the setting range information is configured to be changeable based on the numerical value information which is input to the numerical value information input section. 5. The display apparatus according to claim 1,
wherein the selectable target information includes information on a normal range, an alarm range, and a warning range of a pressure, a temperature, and a flow rate which are measured by the medical instrument. 6. The display apparatus according to claim 1,
wherein the selectable target information has a relationship of an upper limit and a lower limit in numerical value with the corresponding selectable target information. 7. A display method of a display apparatus for a medical instrument monitoring various types of information and configured to accept user input for controlling operation of the medical instrument, wherein the display apparatus includes a numerical value information input section through which numerical value information can be input, selectable target information display sections that display a plurality of pieces of selectable target information, and a target selection section that is used in order to select any one of the plurality of pieces of selectable target information, the method comprising the steps of:
displaying the plurality of setting information selection sections to be associated with the corresponding selectable target information; arranging the plurality of pieces of selectable target information so as to be adjacent to each other based on a same standard; when any one of the plurality of target selection sections is selected, displaying the numerical value information input section corresponding to the selected target selection section simultaneously on a same screen together with the selected selectable target information; and visually changing the display of a range of the selectable target information which is displayed on the same screen in response to the numerical value information which is input to the numerical value information input section. 8. The display method according to claim 7,
wherein the selectable target information has a relationship of an upper limit and a lower limit in numerical value with the corresponding selectable target information. | A display apparatus for a user interface of a medical instrument avoids erroneous input of numerical values when a user inputs information. A display apparatus includes a numerical value information input section, a selectable target information display section, and a target selection section. A plurality of the setting information selection sections are displayed to be associated with corresponding selectable target information, and a plurality of pieces of selectable target information are arranged so as to be adjacent to each other based on a same standard. The numerical value information input section corresponding to the selected target selection section is displayed simultaneously on a same screen. A range of the selectable target information is changed visually and displayed in response to the numerical value information which is input to the numerical value information input section.1. A display apparatus for a medical instrument monitoring various types of information and configured to accept user input for controlling operation of the medical instrument, the display apparatus comprising:
a numerical value information input section through which numerical value information can be input; a selectable target information display section that displays a plurality of pieces of selectable target information; and target selection sections that are used to select any one of the plurality of pieces of selectable target information, wherein the plurality of target selection sections are displayed to be associated with the corresponding selectable target information, wherein the plurality of pieces of selectable target information are arranged so as to be adjacent to each other based on a same standard, wherein when any one of the plurality of target selection sections is selected, the numerical value information input section corresponding to the selected target selection section is displayed simultaneously on a same screen together with the selected selectable target information, and wherein a range of the selectable target information which is displayed simultaneously on the same screen is changed visually and displayed in response to the numerical value information which is input to the numerical value information input section. 2. The display apparatus according to claim 1,
wherein the selectable target information display section is displayed in a form of a bar shape, and the pieces of selectable target information are displayed in colors different from each other. 3. The display apparatus according to claim 1, further comprising:
a setting range information storage unit that stores setting range information on each piece of the selectable target information; and a permissible range determination unit that determines whether or not the numerical value information which is input to the numerical value information input section is within a permissible range of the setting range information, wherein when the numerical value information is not within the permissible range of the setting range information, inputting of the numerical value information is configured to be refused. 4. The display apparatus according to claim 3,
wherein the setting range information is configured to be changeable based on the numerical value information which is input to the numerical value information input section. 5. The display apparatus according to claim 1,
wherein the selectable target information includes information on a normal range, an alarm range, and a warning range of a pressure, a temperature, and a flow rate which are measured by the medical instrument. 6. The display apparatus according to claim 1,
wherein the selectable target information has a relationship of an upper limit and a lower limit in numerical value with the corresponding selectable target information. 7. A display method of a display apparatus for a medical instrument monitoring various types of information and configured to accept user input for controlling operation of the medical instrument, wherein the display apparatus includes a numerical value information input section through which numerical value information can be input, selectable target information display sections that display a plurality of pieces of selectable target information, and a target selection section that is used in order to select any one of the plurality of pieces of selectable target information, the method comprising the steps of:
displaying the plurality of setting information selection sections to be associated with the corresponding selectable target information; arranging the plurality of pieces of selectable target information so as to be adjacent to each other based on a same standard; when any one of the plurality of target selection sections is selected, displaying the numerical value information input section corresponding to the selected target selection section simultaneously on a same screen together with the selected selectable target information; and visually changing the display of a range of the selectable target information which is displayed on the same screen in response to the numerical value information which is input to the numerical value information input section. 8. The display method according to claim 7,
wherein the selectable target information has a relationship of an upper limit and a lower limit in numerical value with the corresponding selectable target information. | 2,100 |
5,772 | 5,772 | 13,190,152 | 2,171 | Integrated profile simulation techniques for dynamic content are disclosed. In some embodiments, integrated profile simulation for dynamic content includes providing an authoring tool for developing web content that varies based on a user context, and provides for the following: receiving a request to change from a first user profile to a second user profile without requirement for input of user credentials associated with the second user profile, and wherein the currently selected user profile is displayed; dynamically refreshing web content based on the second user profile; and displaying the dynamically refreshed web content. | 1. A system, comprising:
a client device comprising a processor and a memory having instructions stored thereon which, when executed by the processor, cause the client device to perform operations comprising: receiving a request to change a currently selected profile from a first user profile to a second user profile, wherein the request does not include user credentials associated with the first or second user profiles; in response to the request, changing the currently selected user profile to the second user profile without requiring input of user credentials associated with the first or second user profiles; dynamically refreshing web content based on the second user profile; and displaying the dynamically refreshed web content and an indication of the currently selected user profile. 2. The system recited in claim 1, wherein the client device executes an authoring tool configured to develop web content that varies based on a user context. 3. The system recited in claim 1, wherein the indication of the currently selected user profile is displayed in a user profile context window. 4. The system recited in claim 1, wherein the web content includes a subset of components of a web page. 5. The system recited in claim 1, wherein the web content includes a subset of components of a web page, and wherein each of the subset of components can change based on the currently selected user profile. 6. The system recited in claim 1, wherein the dynamically refreshing:
refreshes web content based on the second user profile; and is executed locally on the client device. 7. The system recited in claim 1, the operations further comprising:
generating a pop-up window that displays user profile information associated with the currently selected user profile. 8. The system recited in claim 1, the operations further comprising:
generating a pop-up window displaying user profile information associated with the currently selected user profile, wherein the pop-up window is a partially translucent display window that is displayed in parallel with the web content display. 9. The system recited in claim 1, the operations further comprising:
generating a pop-up window displaying user profile information associated with the currently selected user profile, wherein the pop-up window is a partially translucent and overlapping display window that is displayed in parallel with the web content display and partially overlaps the web content display. 10. The system recited in claim 1, the operations further comprising:
selecting the dynamic web content based on the currently selected user profile, wherein the web content is selected from one or more of the following: an advertisement, a marketing campaign, and information associated with the currently selected user profile. 11. The system recited in claim 1, wherein the client device locally executes dynamic web content code to determine a plurality of web content components to display based on the currently selected user profile. 12. The system recited in claim 1, the operations further comprising:
loading a plurality of components based on the first selected user profile; and refreshing the plurality of components based on the second selected user profile, wherein a user context data engine listens for user profile selection changes, and wherein the user context data engine refreshes web content based on the currently selected user profile. 13. The system recited in claim 1, the operations further comprising:
receiving a request to select another user profile; displaying a list of user profiles that can be selected; receiving a user profile selection; and loading the user profile selection. 14. The system recited in claim 1, the operations further comprising:
simulating a web page that dynamically varies according to a user context based on user profile simulation using an authoring tool executed on the client device. 15. The system recited in claim 1, the operations further comprising:
receiving input to edit information of the currently selected user profile; and refreshing the display of the web content based on edited user profile information. 16. The system recited in claim 1, the operations further comprising:
receiving input to edit information of the currently selected user profile; and displaying the edited user profile information. 17. The system recited in claim 1, the operations further comprising:
receiving input to edit information of the currently selected user profile; displaying the edited user profile information; and refreshing the display of the web content based on edited user profile information. 18. The system recited in claim 1, the operations further comprising:
receiving input to edit user contextual information of the currently selected user profile; displaying the edited user profile contextual information in a user profile context window; and refreshing the display of the web content based on edited user profile information. 19. A method, comprising:
receiving a request to change a currently selected profile from a first user profile to a second user profile, wherein the request does not include user credentials associated with the first or second user profiles; in response to the request, changing the currently selected user profile to the second user profile without requiring input of user credentials associated with the first or second user profiles; dynamically refreshing web content based on the second user profile; and displaying the dynamically refreshed web content and an indication of the currently selected user profile. 20. A non-transitory computer readable storage medium having instructions stored thereon which, when executed by a computing device, cause the computing device to perform operations comprising:
receiving a request to change a currently selected profile from a first user profile to a second user profile, wherein the request does not include user credentials associated with the first or second user profiles; in response to the request, changing the currently selected user profile to the second user profile without requiring input of user credentials associated with the first or second user profiles; dynamically refreshing web content based on the second user profile; and displaying the dynamically refreshed web content and an indication of the currently selected user profile. | Integrated profile simulation techniques for dynamic content are disclosed. In some embodiments, integrated profile simulation for dynamic content includes providing an authoring tool for developing web content that varies based on a user context, and provides for the following: receiving a request to change from a first user profile to a second user profile without requirement for input of user credentials associated with the second user profile, and wherein the currently selected user profile is displayed; dynamically refreshing web content based on the second user profile; and displaying the dynamically refreshed web content.1. A system, comprising:
a client device comprising a processor and a memory having instructions stored thereon which, when executed by the processor, cause the client device to perform operations comprising: receiving a request to change a currently selected profile from a first user profile to a second user profile, wherein the request does not include user credentials associated with the first or second user profiles; in response to the request, changing the currently selected user profile to the second user profile without requiring input of user credentials associated with the first or second user profiles; dynamically refreshing web content based on the second user profile; and displaying the dynamically refreshed web content and an indication of the currently selected user profile. 2. The system recited in claim 1, wherein the client device executes an authoring tool configured to develop web content that varies based on a user context. 3. The system recited in claim 1, wherein the indication of the currently selected user profile is displayed in a user profile context window. 4. The system recited in claim 1, wherein the web content includes a subset of components of a web page. 5. The system recited in claim 1, wherein the web content includes a subset of components of a web page, and wherein each of the subset of components can change based on the currently selected user profile. 6. The system recited in claim 1, wherein the dynamically refreshing:
refreshes web content based on the second user profile; and is executed locally on the client device. 7. The system recited in claim 1, the operations further comprising:
generating a pop-up window that displays user profile information associated with the currently selected user profile. 8. The system recited in claim 1, the operations further comprising:
generating a pop-up window displaying user profile information associated with the currently selected user profile, wherein the pop-up window is a partially translucent display window that is displayed in parallel with the web content display. 9. The system recited in claim 1, the operations further comprising:
generating a pop-up window displaying user profile information associated with the currently selected user profile, wherein the pop-up window is a partially translucent and overlapping display window that is displayed in parallel with the web content display and partially overlaps the web content display. 10. The system recited in claim 1, the operations further comprising:
selecting the dynamic web content based on the currently selected user profile, wherein the web content is selected from one or more of the following: an advertisement, a marketing campaign, and information associated with the currently selected user profile. 11. The system recited in claim 1, wherein the client device locally executes dynamic web content code to determine a plurality of web content components to display based on the currently selected user profile. 12. The system recited in claim 1, the operations further comprising:
loading a plurality of components based on the first selected user profile; and refreshing the plurality of components based on the second selected user profile, wherein a user context data engine listens for user profile selection changes, and wherein the user context data engine refreshes web content based on the currently selected user profile. 13. The system recited in claim 1, the operations further comprising:
receiving a request to select another user profile; displaying a list of user profiles that can be selected; receiving a user profile selection; and loading the user profile selection. 14. The system recited in claim 1, the operations further comprising:
simulating a web page that dynamically varies according to a user context based on user profile simulation using an authoring tool executed on the client device. 15. The system recited in claim 1, the operations further comprising:
receiving input to edit information of the currently selected user profile; and refreshing the display of the web content based on edited user profile information. 16. The system recited in claim 1, the operations further comprising:
receiving input to edit information of the currently selected user profile; and displaying the edited user profile information. 17. The system recited in claim 1, the operations further comprising:
receiving input to edit information of the currently selected user profile; displaying the edited user profile information; and refreshing the display of the web content based on edited user profile information. 18. The system recited in claim 1, the operations further comprising:
receiving input to edit user contextual information of the currently selected user profile; displaying the edited user profile contextual information in a user profile context window; and refreshing the display of the web content based on edited user profile information. 19. A method, comprising:
receiving a request to change a currently selected profile from a first user profile to a second user profile, wherein the request does not include user credentials associated with the first or second user profiles; in response to the request, changing the currently selected user profile to the second user profile without requiring input of user credentials associated with the first or second user profiles; dynamically refreshing web content based on the second user profile; and displaying the dynamically refreshed web content and an indication of the currently selected user profile. 20. A non-transitory computer readable storage medium having instructions stored thereon which, when executed by a computing device, cause the computing device to perform operations comprising:
receiving a request to change a currently selected profile from a first user profile to a second user profile, wherein the request does not include user credentials associated with the first or second user profiles; in response to the request, changing the currently selected user profile to the second user profile without requiring input of user credentials associated with the first or second user profiles; dynamically refreshing web content based on the second user profile; and displaying the dynamically refreshed web content and an indication of the currently selected user profile. | 2,100 |
5,773 | 5,773 | 15,157,043 | 2,162 | Technologies for adaptively striping data across multiple storage clouds include receiving user constraints corresponding one or more cloud storage providers, receiving a file to be striped across the cloud storage providers, splitting the received file into file blocks, allocating each of the file blocks to a different one of the cloud storage providers as a function of the user constraints and operating conditions of each of the cloud storage providers, and sending each of the file blocks to the cloud storage provider to which each file block is allocated. In some embodiments, file blocks may be re-allocated from one cloud storage provider to another cloud storage provider as a function of changing user constraints or operating conditions. In addition, each of the file blocks may be retrieved from the cloud storage providers to re-assemble the file. | 1. A computing device for re-assembling a file from a plurality of file blocks striped across a plurality of storage clouds, the computing device comprising:
a block location determination module to (i) determine that a first cloud storage provider of a plurality of cloud storage providers is storing a first file block of a particular file to be re-assembled, and (ii) determine that a second cloud storage provider of a plurality of cloud storage providers is storing a second file block of the particular file to be re-assembled; a file re-assembly module to (i) request the first file block from the first cloud storage provider, and (ii) request the second file block from the second cloud storage provider; and a communication module to (i) receive the first file block from the first cloud storage provider, and (ii) receive the second file block from the second cloud storage provider, wherein the file re-assembly module is further to re-assemble the particular file to be re-assembled from the received first and second file blocks. 2. The computing device of claim 1, wherein the file re-assembly module further to determine whether the second file block of the particular file to be re-assembled exists. 3. The computing device of claim 1, wherein the block location determination module further to:
determine whether location metadata corresponding to the first file block is stored in a local metadata storage of the computing device; and determine whether location metadata corresponding to the second file block is stored in the local metadata storage of the computing device. 4. The computing device of claim 3, wherein the block location determination module further to:
request the location metadata corresponding to the first file block from a cloud resource allocation server in response to determining that the location metadata corresponding to the first file block is not stored in the local metadata storage of the computing device; and request the location metadata corresponding to the second file block from the cloud resource allocation server in response to determining that the location metadata corresponding to the second file block is not stored in the local metadata storage of the computing device. 5. The computing device of claim 4, wherein the block location determination module further to:
request the location metadata corresponding to the first file block from a second cloud resource allocation server to which the location metadata has been replicated; and request the location metadata corresponding to the second file block from the second cloud resource allocation server to which the location metadata has been replicated. 6. The computing device of claim 4, wherein to determine that a first cloud storage provider of a plurality of cloud storage providers is storing a first file block of a particular file to be re-assembled comprises to determine that a first cloud storage provider of a plurality of cloud storage providers is storing a first file block of a particular file to be re-assembled as a function of the location metadata corresponding to the first file block, and
wherein to determine that a second cloud storage provider of a plurality of cloud storage providers is storing the second file block comprises to determine that a second cloud storage provider of a plurality of cloud storage providers is storing the second file block as a function of the location metadata corresponding to the second file block. 7. The computing device of claim 3, wherein the block location determination module further to:
determine, in response to determining that the location metadata corresponding to the first file block is stored in the local metadata storage, whether the location metadata corresponding to the first file block stored in the local metadata storage is outdated; and request, in response to determining that the location metadata corresponding to the first file block stored in the local metadata storage is outdated, the location metadata corresponding to the first file block from a cloud resource allocation server. 8. The computing device of claim 1, wherein the file reassembly module further to determine whether re-assembly metadata corresponding to the particular file to be re-assembled is stored in the local metadata storage of the computing device. 9. The computing device of claim 8, wherein the file reassembly module further to request the re-assembly metadata corresponding to the particular file to be re-assembled from a cloud resource allocation server in response to determining that the re-assembly metadata corresponding to the particular file to be re-assembled is not stored in the local metadata storage of the computing device,
wherein to re-assemble the particular file to be re-assembled from the received first and second file blocks comprises to re-assemble the particular file to be re-assembled from the received first and second file blocks as a function of the re-assembly metadata. 10. A method for re-assembling a file from a plurality of file blocks striped across a plurality of storage clouds by a computing device, the method comprising:
determining, by the computing device, that a first cloud storage provider of a plurality of cloud storage providers is storing a first file block of a particular file to be re-assembled; determining, by the computing device, that a second cloud storage provider of a plurality of cloud storage providers is storing a second file block of the particular file to be re-assembled; requesting, by the computing device, the first file block from the first cloud storage provider; requesting, by the computing device, the second file block from the second cloud storage provider; receiving, by the computing device, the first file block from the first cloud storage provider; receiving, by the computing device, the second file block from the second cloud storage provider; and re-assembling, by the computing device, the particular file to be re-assembled from the received first and second file blocks. 11. The method of claim 10, further comprising:
determining, by the computing device, whether location metadata corresponding to the first file block is stored in a local metadata storage of the computing device; and determining, by the computing device, whether location metadata corresponding to the second file block is stored in the local metadata storage of the computing device. 12. The method of claim 11, further comprising:
requesting, by the computing device, the location metadata corresponding to the first file block from a cloud resource allocation server in response to determining that the location metadata corresponding to the first file block is not stored in the local metadata storage of the computing device; and requesting, by the computing device, the location metadata corresponding to the second file block from the cloud resource allocation server in response to determining that the location metadata corresponding to the second file block is not stored in the local metadata storage of the computing device. 13. The method of claim 12, further comprising:
requesting, by the computing device, the location metadata corresponding to the first file block from a second cloud resource allocation server to which the location metadata has been replicated; and requesting, by the computing device, the location metadata corresponding to the second file block from the second cloud resource allocation server to which the location metadata has been replicated. 14. The method of claim 12, wherein determining that a first cloud storage provider of a plurality of cloud storage providers is storing a first file block of a particular file to be re-assembled comprises determining that a first cloud storage provider of a plurality of cloud storage providers is storing a first file block of a particular file to be re-assembled as a function of the location metadata corresponding to the first file block, and
wherein determining that a second cloud storage provider of a plurality of cloud storage providers is storing the second file block comprises determining that a second cloud storage provider of a plurality of cloud storage providers is storing the second file block as a function of the location metadata corresponding to the second file block. 15. The method of claim 11, further comprising:
determining, by the computing device and in response to determining that the location metadata corresponding to the first file block is stored in the local metadata storage, whether the location metadata corresponding to the first file block stored in the local metadata storage is outdated; and requesting, by the computing device and in response to determining that the location metadata corresponding to the first file block stored in the local metadata storage is outdated, the location metadata corresponding to the first file block from a cloud resource allocation server. 16. The method of claim 10, further comprising determining, by the computing device, whether re-assembly metadata corresponding to the particular file to be re-assembled is stored in the local metadata storage of the computing device. 17. The method of claim 16, further comprising requesting, by the computing device, the re-assembly metadata corresponding to the particular file to be re-assembled from a cloud resource allocation server in response to determining that the re-assembly metadata corresponding to the particular file to be re-assembled is not stored in the local metadata storage of the computing device,
wherein re-assembling the particular file to be re-assembled from the received first and second file blocks comprises re-assembling the particular file to be re-assembled from the received first and second file blocks as a function of the re-assembly metadata. 18. One or more machine readable media comprising a plurality of instructions stored thereon that in response to being executed result in a computing device:
determining, by the computing device, that a first cloud storage provider of a plurality of cloud storage providers is storing a first file block of a particular file to be re-assembled; determining, by the computing device, that a second cloud storage provider of a plurality of cloud storage providers is storing a second file block of the particular file to be re-assembled; requesting, the first file block from the first cloud storage provider; requesting the second file block from the second cloud storage provider; receiving the first file block from the first cloud storage provider; receiving the second file block from the second cloud storage provider; and re-assembling the particular file to be re-assembled from the received first and second file blocks. 19. The one or more computer readable media of claim 18, wherein the plurality of instructions further result in the computing device:
determining whether location metadata corresponding to the first file block is stored in a local metadata storage of the computing device; and determining whether location metadata corresponding to the second file block is stored in the local metadata storage of the computing device. 20. The one or more computer readable media of claim 19, wherein the plurality of instructions further result in the computing device:
requesting the location metadata corresponding to the first file block from a cloud resource allocation server in response to determining that the location metadata corresponding to the first file block is not stored in the local metadata storage of the computing device; and requesting the location metadata corresponding to the second file block from the cloud resource allocation server in response to determining that the location metadata corresponding to the second file block is not stored in the local metadata storage of the computing device. 21. The one or more computer readable media of claim 20, wherein the plurality of instructions further result in the computing device:
requesting the location metadata corresponding to the first file block from a second cloud resource allocation server to which the location metadata has been replicated; and requesting the location metadata corresponding to the second file block from the second cloud resource allocation server to which the location metadata has been replicated. 22. The one or more computer readable media of claim 20, wherein determining that a first cloud storage provider of a plurality of cloud storage providers is storing a first file block of a particular file to be re-assembled comprises determining that a first cloud storage provider of a plurality of cloud storage providers is storing a first file block of a particular file to be re-assembled as a function of the location metadata corresponding to the first file block, and
wherein determining that a second cloud storage provider of a plurality of cloud storage providers is storing the second file block comprises determining that a second cloud storage provider of a plurality of cloud storage providers is storing the second file block as a function of the location metadata corresponding to the second file block. 23. The one or more computer readable media of claim 19, wherein the plurality of instructions further result in the computing device:
determining, in response to determining that the location metadata corresponding to the first file block is stored in the local metadata storage, whether the location metadata corresponding to the first file block stored in the local metadata storage is outdated; and requesting, in response to determining that the location metadata corresponding to the first file block stored in the local metadata storage is outdated, the location metadata corresponding to the first file block from a cloud resource allocation server. 24. The one or more computer readable media of claim 18, wherein the plurality of instructions further result in the computing device determining whether re-assembly metadata corresponding to the particular file to be re-assembled is stored in the local metadata storage of the computing device. 25. The one or more computer readable media of claim 24, wherein the plurality of instructions further result in the computing device requesting the re-assembly metadata corresponding to the particular file to be re-assembled from a cloud resource allocation server in response to determining that the re-assembly metadata corresponding to the particular file to be re-assembled is not stored in the local metadata storage of the computing device,
wherein re-assembling the particular file to be re-assembled from the received first and second file blocks comprises re-assembling the particular file to be re-assembled from the received first and second file blocks as a function of the re-assembly metadata. | Technologies for adaptively striping data across multiple storage clouds include receiving user constraints corresponding one or more cloud storage providers, receiving a file to be striped across the cloud storage providers, splitting the received file into file blocks, allocating each of the file blocks to a different one of the cloud storage providers as a function of the user constraints and operating conditions of each of the cloud storage providers, and sending each of the file blocks to the cloud storage provider to which each file block is allocated. In some embodiments, file blocks may be re-allocated from one cloud storage provider to another cloud storage provider as a function of changing user constraints or operating conditions. In addition, each of the file blocks may be retrieved from the cloud storage providers to re-assemble the file.1. A computing device for re-assembling a file from a plurality of file blocks striped across a plurality of storage clouds, the computing device comprising:
a block location determination module to (i) determine that a first cloud storage provider of a plurality of cloud storage providers is storing a first file block of a particular file to be re-assembled, and (ii) determine that a second cloud storage provider of a plurality of cloud storage providers is storing a second file block of the particular file to be re-assembled; a file re-assembly module to (i) request the first file block from the first cloud storage provider, and (ii) request the second file block from the second cloud storage provider; and a communication module to (i) receive the first file block from the first cloud storage provider, and (ii) receive the second file block from the second cloud storage provider, wherein the file re-assembly module is further to re-assemble the particular file to be re-assembled from the received first and second file blocks. 2. The computing device of claim 1, wherein the file re-assembly module further to determine whether the second file block of the particular file to be re-assembled exists. 3. The computing device of claim 1, wherein the block location determination module further to:
determine whether location metadata corresponding to the first file block is stored in a local metadata storage of the computing device; and determine whether location metadata corresponding to the second file block is stored in the local metadata storage of the computing device. 4. The computing device of claim 3, wherein the block location determination module further to:
request the location metadata corresponding to the first file block from a cloud resource allocation server in response to determining that the location metadata corresponding to the first file block is not stored in the local metadata storage of the computing device; and request the location metadata corresponding to the second file block from the cloud resource allocation server in response to determining that the location metadata corresponding to the second file block is not stored in the local metadata storage of the computing device. 5. The computing device of claim 4, wherein the block location determination module further to:
request the location metadata corresponding to the first file block from a second cloud resource allocation server to which the location metadata has been replicated; and request the location metadata corresponding to the second file block from the second cloud resource allocation server to which the location metadata has been replicated. 6. The computing device of claim 4, wherein to determine that a first cloud storage provider of a plurality of cloud storage providers is storing a first file block of a particular file to be re-assembled comprises to determine that a first cloud storage provider of a plurality of cloud storage providers is storing a first file block of a particular file to be re-assembled as a function of the location metadata corresponding to the first file block, and
wherein to determine that a second cloud storage provider of a plurality of cloud storage providers is storing the second file block comprises to determine that a second cloud storage provider of a plurality of cloud storage providers is storing the second file block as a function of the location metadata corresponding to the second file block. 7. The computing device of claim 3, wherein the block location determination module further to:
determine, in response to determining that the location metadata corresponding to the first file block is stored in the local metadata storage, whether the location metadata corresponding to the first file block stored in the local metadata storage is outdated; and request, in response to determining that the location metadata corresponding to the first file block stored in the local metadata storage is outdated, the location metadata corresponding to the first file block from a cloud resource allocation server. 8. The computing device of claim 1, wherein the file reassembly module further to determine whether re-assembly metadata corresponding to the particular file to be re-assembled is stored in the local metadata storage of the computing device. 9. The computing device of claim 8, wherein the file reassembly module further to request the re-assembly metadata corresponding to the particular file to be re-assembled from a cloud resource allocation server in response to determining that the re-assembly metadata corresponding to the particular file to be re-assembled is not stored in the local metadata storage of the computing device,
wherein to re-assemble the particular file to be re-assembled from the received first and second file blocks comprises to re-assemble the particular file to be re-assembled from the received first and second file blocks as a function of the re-assembly metadata. 10. A method for re-assembling a file from a plurality of file blocks striped across a plurality of storage clouds by a computing device, the method comprising:
determining, by the computing device, that a first cloud storage provider of a plurality of cloud storage providers is storing a first file block of a particular file to be re-assembled; determining, by the computing device, that a second cloud storage provider of a plurality of cloud storage providers is storing a second file block of the particular file to be re-assembled; requesting, by the computing device, the first file block from the first cloud storage provider; requesting, by the computing device, the second file block from the second cloud storage provider; receiving, by the computing device, the first file block from the first cloud storage provider; receiving, by the computing device, the second file block from the second cloud storage provider; and re-assembling, by the computing device, the particular file to be re-assembled from the received first and second file blocks. 11. The method of claim 10, further comprising:
determining, by the computing device, whether location metadata corresponding to the first file block is stored in a local metadata storage of the computing device; and determining, by the computing device, whether location metadata corresponding to the second file block is stored in the local metadata storage of the computing device. 12. The method of claim 11, further comprising:
requesting, by the computing device, the location metadata corresponding to the first file block from a cloud resource allocation server in response to determining that the location metadata corresponding to the first file block is not stored in the local metadata storage of the computing device; and requesting, by the computing device, the location metadata corresponding to the second file block from the cloud resource allocation server in response to determining that the location metadata corresponding to the second file block is not stored in the local metadata storage of the computing device. 13. The method of claim 12, further comprising:
requesting, by the computing device, the location metadata corresponding to the first file block from a second cloud resource allocation server to which the location metadata has been replicated; and requesting, by the computing device, the location metadata corresponding to the second file block from the second cloud resource allocation server to which the location metadata has been replicated. 14. The method of claim 12, wherein determining that a first cloud storage provider of a plurality of cloud storage providers is storing a first file block of a particular file to be re-assembled comprises determining that a first cloud storage provider of a plurality of cloud storage providers is storing a first file block of a particular file to be re-assembled as a function of the location metadata corresponding to the first file block, and
wherein determining that a second cloud storage provider of a plurality of cloud storage providers is storing the second file block comprises determining that a second cloud storage provider of a plurality of cloud storage providers is storing the second file block as a function of the location metadata corresponding to the second file block. 15. The method of claim 11, further comprising:
determining, by the computing device and in response to determining that the location metadata corresponding to the first file block is stored in the local metadata storage, whether the location metadata corresponding to the first file block stored in the local metadata storage is outdated; and requesting, by the computing device and in response to determining that the location metadata corresponding to the first file block stored in the local metadata storage is outdated, the location metadata corresponding to the first file block from a cloud resource allocation server. 16. The method of claim 10, further comprising determining, by the computing device, whether re-assembly metadata corresponding to the particular file to be re-assembled is stored in the local metadata storage of the computing device. 17. The method of claim 16, further comprising requesting, by the computing device, the re-assembly metadata corresponding to the particular file to be re-assembled from a cloud resource allocation server in response to determining that the re-assembly metadata corresponding to the particular file to be re-assembled is not stored in the local metadata storage of the computing device,
wherein re-assembling the particular file to be re-assembled from the received first and second file blocks comprises re-assembling the particular file to be re-assembled from the received first and second file blocks as a function of the re-assembly metadata. 18. One or more machine readable media comprising a plurality of instructions stored thereon that in response to being executed result in a computing device:
determining, by the computing device, that a first cloud storage provider of a plurality of cloud storage providers is storing a first file block of a particular file to be re-assembled; determining, by the computing device, that a second cloud storage provider of a plurality of cloud storage providers is storing a second file block of the particular file to be re-assembled; requesting, the first file block from the first cloud storage provider; requesting the second file block from the second cloud storage provider; receiving the first file block from the first cloud storage provider; receiving the second file block from the second cloud storage provider; and re-assembling the particular file to be re-assembled from the received first and second file blocks. 19. The one or more computer readable media of claim 18, wherein the plurality of instructions further result in the computing device:
determining whether location metadata corresponding to the first file block is stored in a local metadata storage of the computing device; and determining whether location metadata corresponding to the second file block is stored in the local metadata storage of the computing device. 20. The one or more computer readable media of claim 19, wherein the plurality of instructions further result in the computing device:
requesting the location metadata corresponding to the first file block from a cloud resource allocation server in response to determining that the location metadata corresponding to the first file block is not stored in the local metadata storage of the computing device; and requesting the location metadata corresponding to the second file block from the cloud resource allocation server in response to determining that the location metadata corresponding to the second file block is not stored in the local metadata storage of the computing device. 21. The one or more computer readable media of claim 20, wherein the plurality of instructions further result in the computing device:
requesting the location metadata corresponding to the first file block from a second cloud resource allocation server to which the location metadata has been replicated; and requesting the location metadata corresponding to the second file block from the second cloud resource allocation server to which the location metadata has been replicated. 22. The one or more computer readable media of claim 20, wherein determining that a first cloud storage provider of a plurality of cloud storage providers is storing a first file block of a particular file to be re-assembled comprises determining that a first cloud storage provider of a plurality of cloud storage providers is storing a first file block of a particular file to be re-assembled as a function of the location metadata corresponding to the first file block, and
wherein determining that a second cloud storage provider of a plurality of cloud storage providers is storing the second file block comprises determining that a second cloud storage provider of a plurality of cloud storage providers is storing the second file block as a function of the location metadata corresponding to the second file block. 23. The one or more computer readable media of claim 19, wherein the plurality of instructions further result in the computing device:
determining, in response to determining that the location metadata corresponding to the first file block is stored in the local metadata storage, whether the location metadata corresponding to the first file block stored in the local metadata storage is outdated; and requesting, in response to determining that the location metadata corresponding to the first file block stored in the local metadata storage is outdated, the location metadata corresponding to the first file block from a cloud resource allocation server. 24. The one or more computer readable media of claim 18, wherein the plurality of instructions further result in the computing device determining whether re-assembly metadata corresponding to the particular file to be re-assembled is stored in the local metadata storage of the computing device. 25. The one or more computer readable media of claim 24, wherein the plurality of instructions further result in the computing device requesting the re-assembly metadata corresponding to the particular file to be re-assembled from a cloud resource allocation server in response to determining that the re-assembly metadata corresponding to the particular file to be re-assembled is not stored in the local metadata storage of the computing device,
wherein re-assembling the particular file to be re-assembled from the received first and second file blocks comprises re-assembling the particular file to be re-assembled from the received first and second file blocks as a function of the re-assembly metadata. | 2,100 |
5,774 | 5,774 | 15,694,782 | 2,139 | An embodiment of the invention may include a method, computer program product, and system for improving I/O performance in a heterogeneous storage environment. The embodiment may include storage devices of different storage device types having different I/O performances. Each of the storage devices is accessible via a SAS interface. The embodiment may include identifying a plurality of storage devices of the heterogeneous storage environment. The embodiment may include creating a table including information about identifiable storage devices and attributes. The embodiment may include separating a block I/O data stream into storage device type classes. The embodiment may include routing I/O requests of corresponding device type classes to their assigned physical lanes using the information included in the table, thereby improving the I/O performance of the heterogeneous storage environment. | 1. A method for identifying software components in a computing system, the method comprising:
monitoring events relating to one or more software components of the computing system; processing the events for use to identify the software components; receiving an interruption signal indicative of an interruption of operation of the computing system being initiated; saving pending events from a volatile memory to a non-volatile memory of the computing system in response to the interruption signal, wherein pending events comprise the events having said processing thereof being not completed; and restoring the pending events from the non-volatile memory to the volatile memory for said processing thereof in response to a restarting of the operation of the computing system following the interruption thereof. 2. The method of claim 1, further comprising:
stopping said monitoring the events in response to the interruption signal. 3. The method of claim 2, further comprising:
waiting for a delay period from the interruption signal before stopping said monitoring the events. 4. The method of claim 1, further comprising:
restarting said monitoring the events after the restarting of the operation of the computing system in response to a completion of said restoring the pending events. 5. The method of claim 1, further comprising:
filtering at least part of the events into filtered events thereby producing an enrichment queue with the filtered events; consuming the filtered events from the enrichment queue; enriching the filtered events consumed from the enrichment queue into enriched events with additional information relating to the corresponding software components for use to identify the software components; saving the filtered events from the enrichment queue into the non-volatile memory in response to the interruption signal; and restoring the enrichment queue with the filtered events from the non-volatile memory in response to the restarting of the operation of the computing system. 6. The method of claim 5, further comprising:
filtering the events according to finalizing events of corresponding event sequences ending with the finalizing events, each of the event sequences relating to a logical operation for a current software component of the software components being finalized by the corresponding finalizing event; and enriching the filtered events consumed from the enrichment queue by adding current signatures of the corresponding current software components, each of the current signatures being determined according to at least part of a content of the corresponding current software component for use to identify the current software component according to a comparison of the current signature with one or more known signatures of known software components. 7. The method of claim 5, further comprising:
monitoring the events by consuming the events from a monitoring queue produced by an operating system of the computing system; saving unfiltered events comprising the events from the monitoring queue into the non-volatile memory in response to the interruption signal; and restoring the monitoring queue with the unfiltered events from the non-volatile memory in response to the restarting of the operation of the computing system. 8. The method of claim 7, further comprising:
adding a stop event to the monitoring queue in response to the interruption signal; and terminating said saving the unfiltered events in response to a reaching of the stop event in the monitoring queue. 9. The method of claim 7, further comprising:
storing at least part of the events temporally into at least one filtering queue for filtering the events; and saving the unfiltered events comprising the events from said at least one filtering queue followed by the events from the monitoring queue into the non-volatile memory in response to the interruption signal. 10. The method of claim 7, wherein restoring the monitoring queue comprises restoring the monitoring queue after a completion of restoring the enrichment queue. 11. The method of claim 7, further comprising:
asserting at least one interruption flag in response to the interruption signal; triggering said saving the unfiltered events in response to said at least one interruption flag being asserted; and triggering said saving the enriched events in response to said at least one interruption flag being asserted. 12. The method of claim 1, further comprising:
writing the pending events into one or more temporary files of the non-volatile memory in response to the interruption signal; renaming the temporary files into corresponding persistency files in response to corresponding completions of said writing the pending events; restoring the pending events from the persistency files; and deleting the persistency files in response to corresponding completions of said restoring the pending events from the persistency files. 13. A computer program product for identifying software components in a computing system, the computer program product comprising:
one or more computer-readable storage devices and program instructions stored on at least one of the one or more tangible storage devices, the program instructions comprising: program instructions to monitor events relating to one or more software components of the computing system; program instructions to process the events for use to identify the software components; program instructions to receive an interruption signal indicative of an interruption of operation of the computing system being initiated; program instructions to save any pending events of the events having said processing thereof being not completed from a volatile memory to a non-volatile memory of the computing system in response to the interruption signal; and program instructions to restore the pending events from the non-volatile memory to the volatile memory for said processing thereof in response to a restarting of the operation of the computing system following the interruption thereof. 14. A computer system for identifying software components in a computing system, the computer system comprising:
one or more processors, one or more computer-readable memories, one or more computer-readable tangible storage devices, and program instructions stored on at least one of the one or more storage devices for execution by at least one of the one or more processors via at least one of the one or more memories, the program instructions comprising: program instructions to monitor events relating to one or more software components of the computing system; program instructions to process the events for use to identify the software components; program instructions to receive an interruption signal indicative of an interruption of operation of the computing system being initiated; program instructions to save any pending events of the events having said processing thereof being not completed from a volatile memory to a non-volatile memory of the computing system in response to the interruption signal; and program instructions to restore the pending events from the non-volatile memory to the volatile memory for said processing thereof in response to a restarting of the operation of the computing system following the interruption thereof. | An embodiment of the invention may include a method, computer program product, and system for improving I/O performance in a heterogeneous storage environment. The embodiment may include storage devices of different storage device types having different I/O performances. Each of the storage devices is accessible via a SAS interface. The embodiment may include identifying a plurality of storage devices of the heterogeneous storage environment. The embodiment may include creating a table including information about identifiable storage devices and attributes. The embodiment may include separating a block I/O data stream into storage device type classes. The embodiment may include routing I/O requests of corresponding device type classes to their assigned physical lanes using the information included in the table, thereby improving the I/O performance of the heterogeneous storage environment.1. A method for identifying software components in a computing system, the method comprising:
monitoring events relating to one or more software components of the computing system; processing the events for use to identify the software components; receiving an interruption signal indicative of an interruption of operation of the computing system being initiated; saving pending events from a volatile memory to a non-volatile memory of the computing system in response to the interruption signal, wherein pending events comprise the events having said processing thereof being not completed; and restoring the pending events from the non-volatile memory to the volatile memory for said processing thereof in response to a restarting of the operation of the computing system following the interruption thereof. 2. The method of claim 1, further comprising:
stopping said monitoring the events in response to the interruption signal. 3. The method of claim 2, further comprising:
waiting for a delay period from the interruption signal before stopping said monitoring the events. 4. The method of claim 1, further comprising:
restarting said monitoring the events after the restarting of the operation of the computing system in response to a completion of said restoring the pending events. 5. The method of claim 1, further comprising:
filtering at least part of the events into filtered events thereby producing an enrichment queue with the filtered events; consuming the filtered events from the enrichment queue; enriching the filtered events consumed from the enrichment queue into enriched events with additional information relating to the corresponding software components for use to identify the software components; saving the filtered events from the enrichment queue into the non-volatile memory in response to the interruption signal; and restoring the enrichment queue with the filtered events from the non-volatile memory in response to the restarting of the operation of the computing system. 6. The method of claim 5, further comprising:
filtering the events according to finalizing events of corresponding event sequences ending with the finalizing events, each of the event sequences relating to a logical operation for a current software component of the software components being finalized by the corresponding finalizing event; and enriching the filtered events consumed from the enrichment queue by adding current signatures of the corresponding current software components, each of the current signatures being determined according to at least part of a content of the corresponding current software component for use to identify the current software component according to a comparison of the current signature with one or more known signatures of known software components. 7. The method of claim 5, further comprising:
monitoring the events by consuming the events from a monitoring queue produced by an operating system of the computing system; saving unfiltered events comprising the events from the monitoring queue into the non-volatile memory in response to the interruption signal; and restoring the monitoring queue with the unfiltered events from the non-volatile memory in response to the restarting of the operation of the computing system. 8. The method of claim 7, further comprising:
adding a stop event to the monitoring queue in response to the interruption signal; and terminating said saving the unfiltered events in response to a reaching of the stop event in the monitoring queue. 9. The method of claim 7, further comprising:
storing at least part of the events temporally into at least one filtering queue for filtering the events; and saving the unfiltered events comprising the events from said at least one filtering queue followed by the events from the monitoring queue into the non-volatile memory in response to the interruption signal. 10. The method of claim 7, wherein restoring the monitoring queue comprises restoring the monitoring queue after a completion of restoring the enrichment queue. 11. The method of claim 7, further comprising:
asserting at least one interruption flag in response to the interruption signal; triggering said saving the unfiltered events in response to said at least one interruption flag being asserted; and triggering said saving the enriched events in response to said at least one interruption flag being asserted. 12. The method of claim 1, further comprising:
writing the pending events into one or more temporary files of the non-volatile memory in response to the interruption signal; renaming the temporary files into corresponding persistency files in response to corresponding completions of said writing the pending events; restoring the pending events from the persistency files; and deleting the persistency files in response to corresponding completions of said restoring the pending events from the persistency files. 13. A computer program product for identifying software components in a computing system, the computer program product comprising:
one or more computer-readable storage devices and program instructions stored on at least one of the one or more tangible storage devices, the program instructions comprising: program instructions to monitor events relating to one or more software components of the computing system; program instructions to process the events for use to identify the software components; program instructions to receive an interruption signal indicative of an interruption of operation of the computing system being initiated; program instructions to save any pending events of the events having said processing thereof being not completed from a volatile memory to a non-volatile memory of the computing system in response to the interruption signal; and program instructions to restore the pending events from the non-volatile memory to the volatile memory for said processing thereof in response to a restarting of the operation of the computing system following the interruption thereof. 14. A computer system for identifying software components in a computing system, the computer system comprising:
one or more processors, one or more computer-readable memories, one or more computer-readable tangible storage devices, and program instructions stored on at least one of the one or more storage devices for execution by at least one of the one or more processors via at least one of the one or more memories, the program instructions comprising: program instructions to monitor events relating to one or more software components of the computing system; program instructions to process the events for use to identify the software components; program instructions to receive an interruption signal indicative of an interruption of operation of the computing system being initiated; program instructions to save any pending events of the events having said processing thereof being not completed from a volatile memory to a non-volatile memory of the computing system in response to the interruption signal; and program instructions to restore the pending events from the non-volatile memory to the volatile memory for said processing thereof in response to a restarting of the operation of the computing system following the interruption thereof. | 2,100 |
5,775 | 5,775 | 15,111,914 | 2,171 | System and method relating to a user interface for adapting a view of a display unit of a user interface. A configuration mode is retrieved for producing a separated view on the display unit including a first section and a second section. A functional scope may be assigned for at least one of the first section and the second section, and a plurality of operating surfaces may be generated in the separated view on the display unit, each of the operating surfaces representing a respective function for the vehicle. When a selection is received on one of the plurality of operating surfaces, the selected operating surface may be assigned to one of the first section and second section based on the selection, wherein the assigned operating surface is configured to execute its respective function for the vehicle under its assigned functional scope. | 1-18. (canceled) 19. A method for configuring a display unit of a user interface for a vehicle, comprising:
retrieving, via a processor, a configuration mode for producing a separated view on the display unit comprising a first section and a second section; assigning a functional scope for at least one of the first section and the second section; generating a plurality of operating surfaces in the separated view on the display unit, each of the operating surfaces representing a respective function for the vehicle; receiving a selection on one of the plurality of operating surfaces and assigning the selected operating surface to one of the first section and second section based on the selection, wherein the assigned operating surface is configured to execute its respective function for the vehicle under its assigned functional scope. 20. The method of claim 19, further comprising at least one of:
selecting, via the processor, a predefined template for the relative arrangement of the first section and the second section for the separated view; and/or defining a spatial arrangement of the first section and the second section contained in the separated view. 21. The method of claim 19, wherein the plurality of operating surfaces are displayed for selection in the form of a movable sequence. 22. The method of claim 19, further comprising arranging the plurality of operating surfaces along a demarcation line between the first section and the second section. 23. The method of claim 19, further comprising:
receiving another selection on the previously-selected operating surface and assigning the another-selected operating surface to another one of the first section and second section based on the another selection; and automatically merging the first section and the second section. 24. The method of claim 19, wherein the retrieving of the configuration mode comprises one of
actuating a sensor strip, actuating a predefined button on the display unit of the user interface, or detecting a user gesture in a predefined detection zone in front of the display unit. 25. The method of claim 19, further comprising:
detecting a predefined gesture before the user interface for a predefined minimum duration, and, in response, displaying the configuration mode for the separated view comprising the first section and the second section, wherein the first section and the second section are configured to be displayed on the display unit relative to each other as a function of a position of the predefined gesture. 26. The method of claim 25, further comprising:
generating a demarcation line between the first section and the second section based on a position of the predefined gesture. 27. The method of claim 25, wherein the detected gesture comprises a predefined minimum duration of contact with at least one of the user interface and/or the display unit, and wherein the detected gesture comprises a predefined maximum movement relative to the user interface. 28. The method according to claim 19, wherein the respective function for the vehicle comprises at least one of music playback, navigation, climate control, and/or information playback of travel statistics. 29. The method according to claim 19, further comprising highlighting at least one of the plurality of operating surfaces, wherein the highlighting comprises one of
increasing color saturation of the at least one highlighted operating surface in contrast to other screen content items, displaying a shadow cast of the at least one highlighted operating surface, and animating the at least one highlighted operating surface. 30. A vehicle user interface, comprising:
a display unit; a processing unit, and an input for receiving user input, wherein the processing unit is configured to
retrieve a configuration mode for producing a separated view on the display unit comprising a first section and a second section;
assign a functional scope for at least one of the first section and the second section;
generate a plurality of operating surfaces in the separated view on the display unit, each of the operating surfaces representing a respective function for the vehicle;
and wherein the input is configured to receive a selection on one of the plurality of operating surfaces and the processing unit is configured to assign the selected operating surface to one of the first section and second section based on the selection, wherein the assigned operating surface is configured to execute its respective function for the vehicle under its assigned functional scope. 31. The vehicle user interface of claim 30, wherein the processing unit is configured to either (1) select a predefined template for the relative arrangement of the first section and the second section for the separated view, or (2) define a spatial arrangement of the first section and the second section contained in the separated view. 32. The vehicle user interface of claim 30, wherein the processing unit is configured to display a plurality of operating surfaces for selection on the display unit in the form of a movable sequence. 33. The vehicle user interface of claim 30, wherein the processing unit is configured to arrange the plurality of operating surfaces on the display unit along a demarcation line between the first section and the second section. 34. The vehicle user interface of claim 30, wherein
the input is configured to receive another selection on the previously-selected operating surface and the processing unit is configured to assign the another-selected operating surface to another one of the first section and second section based on the another selection, and wherein the processing unit is configured to automatically merge the first section and the second section on the display unit. 35. The vehicle user interface of claim 30, wherein the configuration mode comprises one of
actuating a sensor strip, actuating a predefined button on the display unit of the user interface, or detecting a user gesture in a predefined detection zone in front of the display unit. 36. The vehicle user interface of claim 30, wherein
the processing unit is configured to detect a predefined gesture before the user interface for a predefined minimum duration, and, in response, display the configuration mode on the display unit for the separated view comprising the first section and the second section, and wherein the processing unit is configured to display the first section and the second on the display unit relative to each other as a function of a position of the predefined gesture. 37. The vehicle user interface of claim 36, wherein the processing unit is configured to generate a demarcation line between the first section and the second section on the display unit based on a position of the predefined gesture. 38. The vehicle user interface of claim 36, wherein the detected gesture comprises a predefined minimum duration of contact with at least one of the user interface and/or the display unit, and wherein the detected gesture comprises a predefined maximum movement relative to the user interface. 39. The vehicle user interface according to claim 30, wherein the respective function for the vehicle comprises at least one of music playback, navigation, climate control, and/or information playback of travel statistics. | System and method relating to a user interface for adapting a view of a display unit of a user interface. A configuration mode is retrieved for producing a separated view on the display unit including a first section and a second section. A functional scope may be assigned for at least one of the first section and the second section, and a plurality of operating surfaces may be generated in the separated view on the display unit, each of the operating surfaces representing a respective function for the vehicle. When a selection is received on one of the plurality of operating surfaces, the selected operating surface may be assigned to one of the first section and second section based on the selection, wherein the assigned operating surface is configured to execute its respective function for the vehicle under its assigned functional scope.1-18. (canceled) 19. A method for configuring a display unit of a user interface for a vehicle, comprising:
retrieving, via a processor, a configuration mode for producing a separated view on the display unit comprising a first section and a second section; assigning a functional scope for at least one of the first section and the second section; generating a plurality of operating surfaces in the separated view on the display unit, each of the operating surfaces representing a respective function for the vehicle; receiving a selection on one of the plurality of operating surfaces and assigning the selected operating surface to one of the first section and second section based on the selection, wherein the assigned operating surface is configured to execute its respective function for the vehicle under its assigned functional scope. 20. The method of claim 19, further comprising at least one of:
selecting, via the processor, a predefined template for the relative arrangement of the first section and the second section for the separated view; and/or defining a spatial arrangement of the first section and the second section contained in the separated view. 21. The method of claim 19, wherein the plurality of operating surfaces are displayed for selection in the form of a movable sequence. 22. The method of claim 19, further comprising arranging the plurality of operating surfaces along a demarcation line between the first section and the second section. 23. The method of claim 19, further comprising:
receiving another selection on the previously-selected operating surface and assigning the another-selected operating surface to another one of the first section and second section based on the another selection; and automatically merging the first section and the second section. 24. The method of claim 19, wherein the retrieving of the configuration mode comprises one of
actuating a sensor strip, actuating a predefined button on the display unit of the user interface, or detecting a user gesture in a predefined detection zone in front of the display unit. 25. The method of claim 19, further comprising:
detecting a predefined gesture before the user interface for a predefined minimum duration, and, in response, displaying the configuration mode for the separated view comprising the first section and the second section, wherein the first section and the second section are configured to be displayed on the display unit relative to each other as a function of a position of the predefined gesture. 26. The method of claim 25, further comprising:
generating a demarcation line between the first section and the second section based on a position of the predefined gesture. 27. The method of claim 25, wherein the detected gesture comprises a predefined minimum duration of contact with at least one of the user interface and/or the display unit, and wherein the detected gesture comprises a predefined maximum movement relative to the user interface. 28. The method according to claim 19, wherein the respective function for the vehicle comprises at least one of music playback, navigation, climate control, and/or information playback of travel statistics. 29. The method according to claim 19, further comprising highlighting at least one of the plurality of operating surfaces, wherein the highlighting comprises one of
increasing color saturation of the at least one highlighted operating surface in contrast to other screen content items, displaying a shadow cast of the at least one highlighted operating surface, and animating the at least one highlighted operating surface. 30. A vehicle user interface, comprising:
a display unit; a processing unit, and an input for receiving user input, wherein the processing unit is configured to
retrieve a configuration mode for producing a separated view on the display unit comprising a first section and a second section;
assign a functional scope for at least one of the first section and the second section;
generate a plurality of operating surfaces in the separated view on the display unit, each of the operating surfaces representing a respective function for the vehicle;
and wherein the input is configured to receive a selection on one of the plurality of operating surfaces and the processing unit is configured to assign the selected operating surface to one of the first section and second section based on the selection, wherein the assigned operating surface is configured to execute its respective function for the vehicle under its assigned functional scope. 31. The vehicle user interface of claim 30, wherein the processing unit is configured to either (1) select a predefined template for the relative arrangement of the first section and the second section for the separated view, or (2) define a spatial arrangement of the first section and the second section contained in the separated view. 32. The vehicle user interface of claim 30, wherein the processing unit is configured to display a plurality of operating surfaces for selection on the display unit in the form of a movable sequence. 33. The vehicle user interface of claim 30, wherein the processing unit is configured to arrange the plurality of operating surfaces on the display unit along a demarcation line between the first section and the second section. 34. The vehicle user interface of claim 30, wherein
the input is configured to receive another selection on the previously-selected operating surface and the processing unit is configured to assign the another-selected operating surface to another one of the first section and second section based on the another selection, and wherein the processing unit is configured to automatically merge the first section and the second section on the display unit. 35. The vehicle user interface of claim 30, wherein the configuration mode comprises one of
actuating a sensor strip, actuating a predefined button on the display unit of the user interface, or detecting a user gesture in a predefined detection zone in front of the display unit. 36. The vehicle user interface of claim 30, wherein
the processing unit is configured to detect a predefined gesture before the user interface for a predefined minimum duration, and, in response, display the configuration mode on the display unit for the separated view comprising the first section and the second section, and wherein the processing unit is configured to display the first section and the second on the display unit relative to each other as a function of a position of the predefined gesture. 37. The vehicle user interface of claim 36, wherein the processing unit is configured to generate a demarcation line between the first section and the second section on the display unit based on a position of the predefined gesture. 38. The vehicle user interface of claim 36, wherein the detected gesture comprises a predefined minimum duration of contact with at least one of the user interface and/or the display unit, and wherein the detected gesture comprises a predefined maximum movement relative to the user interface. 39. The vehicle user interface according to claim 30, wherein the respective function for the vehicle comprises at least one of music playback, navigation, climate control, and/or information playback of travel statistics. | 2,100 |
5,776 | 5,776 | 15,194,435 | 2,175 | A system for managing collections having multiple content types can include a screen data capture module to capture screen data in a window having a window privacy setting presented to a user on a display device, a mixed-media collection (MMC) managing module configured to manage an MMC incorporating the captured screen data, and an MMC storage module configured to store the MMC. The MMC managing module can alter the captured screen data based on the window privacy setting. | 1. A system for creating collections having one or more content types, comprising:
a display module configured to present a plurality of windows to a user on a screen of a display device; a screen data capture module configured to capture first screen data corresponding to a first area of the screen using a first recording parameter, the screen data capture module being further configured to capture second screen data corresponding to a second area of the screen using a second recording parameter, the second area of the screen being distinct from the first area of the screen, and the second recording parameter having a different value than the first recording parameter; a mixed-media collection (MMC) creation module configured to create an MMC, the MMC incorporating at least some of the first screen data and at least some of the second screen data; and an MMC storage module configured to store the MMC. 2. The system according to claim 1 in which the first and second recording parameters respectively comprise first and second compression ratios. 3. The system according to claim 1 in which the first and second recording parameters respectively comprise first and second frame resolutions. 4. The system according to claim 3 in which at least one of the first and second frame resolutions is variable. 5. The system according to claim 3 in which at least one of the first and second frame resolutions is dynamic. 6. The system according to claim 1 in which the first and second recording parameters respectively comprise first and second frame rates. 7. The system according to claim 6 in which at least one of the first and second frame rates is constantly adjusted. 8. The system according to claim 1 in which at least one of the first and second areas of the screen comprises a corresponding one of the plurality of windows. 9. The system according to claim 8 in which at least a portion of the corresponding one of the plurality of windows is not displayed on the screen during capture. 10. The system according to claim 1 further comprising a target window configured to designate at least one of the first and second areas. 11. The system according to claim 1 in which the first area of the screen is in an area adjacent a current pointing device position. 12. A machine-controlled method of creating collections having one or more content types, comprising:
presenting a screen to a user on a display device, the screen having a plurality of windows; capturing first screen data corresponding to a first defined area of the screen using a first recording parameter; capturing second screen data corresponding to a second defined area of the screen using a second recording parameter, the second recording parameter being different than the first recording parameter; creating a mixed-media collection (MMC), the MMC incorporating at least some of the first screen data and at least some of the second screen data; and storing the MMC on at least one of a user machine and a remote storage device. 13. The machine-controlled method according to claim 12 in which the first and second recording parameters respectively comprise first and second compression ratios. 14. The machine-controlled method according to claim 12 in which the first and second recording parameters respectively comprise first and second frame rates. 15. The method according to claim 14 further comprising dynamically adjusting at least one of the first and second frame rates. 16. The method according to claim 15 in which dynamically adjusting at least one of the first and second frame rates comprises dynamically adjusting at least one of the first and second frame rates responsive to an indication of a certain amount of change within the corresponding one of the first and second areas. 17. The machine-controlled method according to claim 12 in which capturing the first screen data and capturing the second screen data occur at least partially simultaneously. 18. A machine-controlled method, comprising:
presenting a screen to a user on a display device, the screen having a plurality of windows; capturing first window data corresponding to a first one of the plurality of windows based at least in part on a first recording parameter associated with the first one of the plurality of windows; simultaneously with capturing the first window data, capturing second window data corresponding to a second one of the plurality of windows based at least in part on a second recording parameter associated with the second one of the plurality of windows, the second recording parameter having a value that is different than a value of the first recording parameter; incorporating at least some of the first window data and at least some of the second window data into a mixed-media collection (MMC); and storing the MMC. 19. The machine-controlled method according to claim 18 in which the first and second recording parameters are frame rates, the first recording parameter having a higher frame rate that the second recording parameter. 20. The machine-controlled method according to claim 18 in which the first and second recording parameters are compression ratios, the first recording parameter having a lower compression ratio that the second recording parameter. 21. One or more tangible, machine-readable media storing machine-executable instructions that, when executed by a machine, cause the machine to perform the machine-controlled method according to claim 18. | A system for managing collections having multiple content types can include a screen data capture module to capture screen data in a window having a window privacy setting presented to a user on a display device, a mixed-media collection (MMC) managing module configured to manage an MMC incorporating the captured screen data, and an MMC storage module configured to store the MMC. The MMC managing module can alter the captured screen data based on the window privacy setting.1. A system for creating collections having one or more content types, comprising:
a display module configured to present a plurality of windows to a user on a screen of a display device; a screen data capture module configured to capture first screen data corresponding to a first area of the screen using a first recording parameter, the screen data capture module being further configured to capture second screen data corresponding to a second area of the screen using a second recording parameter, the second area of the screen being distinct from the first area of the screen, and the second recording parameter having a different value than the first recording parameter; a mixed-media collection (MMC) creation module configured to create an MMC, the MMC incorporating at least some of the first screen data and at least some of the second screen data; and an MMC storage module configured to store the MMC. 2. The system according to claim 1 in which the first and second recording parameters respectively comprise first and second compression ratios. 3. The system according to claim 1 in which the first and second recording parameters respectively comprise first and second frame resolutions. 4. The system according to claim 3 in which at least one of the first and second frame resolutions is variable. 5. The system according to claim 3 in which at least one of the first and second frame resolutions is dynamic. 6. The system according to claim 1 in which the first and second recording parameters respectively comprise first and second frame rates. 7. The system according to claim 6 in which at least one of the first and second frame rates is constantly adjusted. 8. The system according to claim 1 in which at least one of the first and second areas of the screen comprises a corresponding one of the plurality of windows. 9. The system according to claim 8 in which at least a portion of the corresponding one of the plurality of windows is not displayed on the screen during capture. 10. The system according to claim 1 further comprising a target window configured to designate at least one of the first and second areas. 11. The system according to claim 1 in which the first area of the screen is in an area adjacent a current pointing device position. 12. A machine-controlled method of creating collections having one or more content types, comprising:
presenting a screen to a user on a display device, the screen having a plurality of windows; capturing first screen data corresponding to a first defined area of the screen using a first recording parameter; capturing second screen data corresponding to a second defined area of the screen using a second recording parameter, the second recording parameter being different than the first recording parameter; creating a mixed-media collection (MMC), the MMC incorporating at least some of the first screen data and at least some of the second screen data; and storing the MMC on at least one of a user machine and a remote storage device. 13. The machine-controlled method according to claim 12 in which the first and second recording parameters respectively comprise first and second compression ratios. 14. The machine-controlled method according to claim 12 in which the first and second recording parameters respectively comprise first and second frame rates. 15. The method according to claim 14 further comprising dynamically adjusting at least one of the first and second frame rates. 16. The method according to claim 15 in which dynamically adjusting at least one of the first and second frame rates comprises dynamically adjusting at least one of the first and second frame rates responsive to an indication of a certain amount of change within the corresponding one of the first and second areas. 17. The machine-controlled method according to claim 12 in which capturing the first screen data and capturing the second screen data occur at least partially simultaneously. 18. A machine-controlled method, comprising:
presenting a screen to a user on a display device, the screen having a plurality of windows; capturing first window data corresponding to a first one of the plurality of windows based at least in part on a first recording parameter associated with the first one of the plurality of windows; simultaneously with capturing the first window data, capturing second window data corresponding to a second one of the plurality of windows based at least in part on a second recording parameter associated with the second one of the plurality of windows, the second recording parameter having a value that is different than a value of the first recording parameter; incorporating at least some of the first window data and at least some of the second window data into a mixed-media collection (MMC); and storing the MMC. 19. The machine-controlled method according to claim 18 in which the first and second recording parameters are frame rates, the first recording parameter having a higher frame rate that the second recording parameter. 20. The machine-controlled method according to claim 18 in which the first and second recording parameters are compression ratios, the first recording parameter having a lower compression ratio that the second recording parameter. 21. One or more tangible, machine-readable media storing machine-executable instructions that, when executed by a machine, cause the machine to perform the machine-controlled method according to claim 18. | 2,100 |
5,777 | 5,777 | 15,632,467 | 2,176 | At least some embodiments are directed to a computer-implemented method that comprises receiving original input text that includes a term, comparing a definition of the term to definitions of multiple candidate replacement terms to generate a set of candidate replacement terms, and substituting each of the candidate replacement terms in the set for the term in the original input text to produce a plurality of modified input texts. The method also comprises determining the grammatical accuracy of each of the plurality of modified input texts, comparing meanings of the modified input texts to a meaning of the original input text, and modifying the set of candidate replacement terms based on the determinations of grammatical accuracy and the comparisons of the meanings. The method still further comprises ranking the modified set of candidate replacement terms using one or more criteria, and displaying the ranking on a display. | 1. A computer-implemented method, comprising:
receiving original input text that includes a term; identifying the term for replacement based upon a target audience of the original input text; comparing a definition of the term to definitions of multiple candidate replacement terms to generate a set of candidate replacement terms; substituting each of the candidate replacement terms in the set for the term in the original input text to produce a plurality of modified input texts; determining grammatical accuracy of each of the plurality of modified input texts; comparing meanings of the plurality of modified input texts to a meaning of the original input text; modifying the set of candidate replacement terms based on the determinations of grammatical accuracy and the comparisons of the meanings; ranking the modified set of candidate replacement terms using one or more criteria; and displaying the ranking on a display. 2. The method of claim 1, wherein the multiple candidate replacement terms are selected from a dynamically modifiable corpus. 3. The method of claim 2, further comprising updating the dynamically modifiable corpus using linguistic trends. 4. The method of claim 2, wherein the dynamically modifiable corpus includes social media content. 5. The method of claim 2, wherein the dynamically modifiable corpus is based on the target audience. 6. The method of claim 1, further comprising weighting the one or more criteria based on user preferences. 7. The method of claim 1, wherein all terms in the ranked, modified set of candidate replacement terms are in a same language. 8. The method of claim 1, further comprising comparing at least one of the plurality of modified input texts to text in a corpus to identify a number of matches. 9. The method of claim 1, wherein the criteria are selected from the group consisting of: frequency of use of a term among the target audience; erudition associated with the term; affect of the term; and historical success of the term with the target audience. 10. A computer program product for identifying linguistic replacements to improve textual message effectiveness, the computer program product comprising a computer-readable storage medium having program instructions embodied therewith, which when executed by a processor, cause the processor to:
receive original input text that includes a term; identify the term for replacement based upon a target audience of the original input text; access a dynamically modifiable corpus of candidate replacement terms to collect a set of candidate replacement terms; modify the set of candidate replacement terms based on an analysis of definitional similarity between the term and each of the set of candidate replacement terms, of grammatical accuracy of modified input texts generated by replacing the term with each of the candidate replacement terms in the set, and of meanings of each of the modified input texts; rank the modified set of candidate replacement terms based on multiple weighted criteria; and display the ranking on a display. 11. The computer program product of claim 10, wherein each candidate replacement term in the set of candidate replacement terms pertains to an audience targeted by the original input text. 12. The computer program product of claim 10, wherein the dynamically modifiable corpus includes social media content. 13. The computer program product of claim 10, wherein the analysis of the grammatical accuracy is based on grammar rules used by the target audience of the original input text. 14. The computer program product of claim 10, wherein the program instructions cause the processor to modify a portion of the original input text other than the term based on at least one of the candidate replacement terms in the set. 15. A system, comprising:
an input device configured to receive original input text that includes a term; an output device configured to display images; storage comprising executable code; a network interface configured to access a dynamically changing corpus of information; and a processor coupled to the input device, the output device, the storage, and the network interface, wherein execution of the executable code causes the processor to:
identify the term for replacement based upon a target audience of the original input text.
collect from the corpus a set of candidate replacement terms based on comparisons of definitions of the candidate replacement terms and a definition of the term in the original input text;
generate a first score for each of the candidate replacement terms in the set based on the comparisons of definitions;
analyze grammatical accuracy of modified input texts that replace the term with the candidate replacement terms in the set;
determine a meaning of each of the modified input texts;
generate a second score for each of the candidate replacement terms in the set based on the analyses and the determinations;
assess popularity of each of the modified input texts using the corpus;
generate a third score for each of the candidate replacement terms in the set based on the assessments;
determine a final score for each of the candidate replacement terms in the set based on a weighted calculation using the first, second, and third scores of each such candidate replacement term;
rank the candidate replacement terms in the set based on the final scores; and
display the ranking on the output device. 16. The system of claim 15, wherein the first, second, and third scores are based on the target audience of the original input text. 17. The system of claim 15, wherein each of the first, second, and third scores are weighted. 18. The system of claim 15, wherein the system comprises a cognitive computer. 19. The system of claim 15, wherein the corpus includes linguistic trends that vary with time. 20. The system of claim 15, wherein the processor learns a user's weighting preferences for the weighted calculation and automatically applies the weighting preferences. | At least some embodiments are directed to a computer-implemented method that comprises receiving original input text that includes a term, comparing a definition of the term to definitions of multiple candidate replacement terms to generate a set of candidate replacement terms, and substituting each of the candidate replacement terms in the set for the term in the original input text to produce a plurality of modified input texts. The method also comprises determining the grammatical accuracy of each of the plurality of modified input texts, comparing meanings of the modified input texts to a meaning of the original input text, and modifying the set of candidate replacement terms based on the determinations of grammatical accuracy and the comparisons of the meanings. The method still further comprises ranking the modified set of candidate replacement terms using one or more criteria, and displaying the ranking on a display.1. A computer-implemented method, comprising:
receiving original input text that includes a term; identifying the term for replacement based upon a target audience of the original input text; comparing a definition of the term to definitions of multiple candidate replacement terms to generate a set of candidate replacement terms; substituting each of the candidate replacement terms in the set for the term in the original input text to produce a plurality of modified input texts; determining grammatical accuracy of each of the plurality of modified input texts; comparing meanings of the plurality of modified input texts to a meaning of the original input text; modifying the set of candidate replacement terms based on the determinations of grammatical accuracy and the comparisons of the meanings; ranking the modified set of candidate replacement terms using one or more criteria; and displaying the ranking on a display. 2. The method of claim 1, wherein the multiple candidate replacement terms are selected from a dynamically modifiable corpus. 3. The method of claim 2, further comprising updating the dynamically modifiable corpus using linguistic trends. 4. The method of claim 2, wherein the dynamically modifiable corpus includes social media content. 5. The method of claim 2, wherein the dynamically modifiable corpus is based on the target audience. 6. The method of claim 1, further comprising weighting the one or more criteria based on user preferences. 7. The method of claim 1, wherein all terms in the ranked, modified set of candidate replacement terms are in a same language. 8. The method of claim 1, further comprising comparing at least one of the plurality of modified input texts to text in a corpus to identify a number of matches. 9. The method of claim 1, wherein the criteria are selected from the group consisting of: frequency of use of a term among the target audience; erudition associated with the term; affect of the term; and historical success of the term with the target audience. 10. A computer program product for identifying linguistic replacements to improve textual message effectiveness, the computer program product comprising a computer-readable storage medium having program instructions embodied therewith, which when executed by a processor, cause the processor to:
receive original input text that includes a term; identify the term for replacement based upon a target audience of the original input text; access a dynamically modifiable corpus of candidate replacement terms to collect a set of candidate replacement terms; modify the set of candidate replacement terms based on an analysis of definitional similarity between the term and each of the set of candidate replacement terms, of grammatical accuracy of modified input texts generated by replacing the term with each of the candidate replacement terms in the set, and of meanings of each of the modified input texts; rank the modified set of candidate replacement terms based on multiple weighted criteria; and display the ranking on a display. 11. The computer program product of claim 10, wherein each candidate replacement term in the set of candidate replacement terms pertains to an audience targeted by the original input text. 12. The computer program product of claim 10, wherein the dynamically modifiable corpus includes social media content. 13. The computer program product of claim 10, wherein the analysis of the grammatical accuracy is based on grammar rules used by the target audience of the original input text. 14. The computer program product of claim 10, wherein the program instructions cause the processor to modify a portion of the original input text other than the term based on at least one of the candidate replacement terms in the set. 15. A system, comprising:
an input device configured to receive original input text that includes a term; an output device configured to display images; storage comprising executable code; a network interface configured to access a dynamically changing corpus of information; and a processor coupled to the input device, the output device, the storage, and the network interface, wherein execution of the executable code causes the processor to:
identify the term for replacement based upon a target audience of the original input text.
collect from the corpus a set of candidate replacement terms based on comparisons of definitions of the candidate replacement terms and a definition of the term in the original input text;
generate a first score for each of the candidate replacement terms in the set based on the comparisons of definitions;
analyze grammatical accuracy of modified input texts that replace the term with the candidate replacement terms in the set;
determine a meaning of each of the modified input texts;
generate a second score for each of the candidate replacement terms in the set based on the analyses and the determinations;
assess popularity of each of the modified input texts using the corpus;
generate a third score for each of the candidate replacement terms in the set based on the assessments;
determine a final score for each of the candidate replacement terms in the set based on a weighted calculation using the first, second, and third scores of each such candidate replacement term;
rank the candidate replacement terms in the set based on the final scores; and
display the ranking on the output device. 16. The system of claim 15, wherein the first, second, and third scores are based on the target audience of the original input text. 17. The system of claim 15, wherein each of the first, second, and third scores are weighted. 18. The system of claim 15, wherein the system comprises a cognitive computer. 19. The system of claim 15, wherein the corpus includes linguistic trends that vary with time. 20. The system of claim 15, wherein the processor learns a user's weighting preferences for the weighted calculation and automatically applies the weighting preferences. | 2,100 |
5,778 | 5,778 | 14,554,843 | 2,117 | Devices, systems, and methods for providing energy management recommendations are provided. One method includes recording a number of interactions between a user and a computing device, creating an energy usage profile according to the number of interactions between the user and the computing device, computing energy usage analytics associated with the energy usage profile, presenting the energy usage analytics to the user, and providing a number of energy management recommendations that account for the usage analytics and the energy usage profile. | 1. A non-transitory computer-readable medium containing instructions which, when executed by a processor, provide a computer implemented method for providing energy management recommendations for operating one or more appliances, the method comprising:
recording a number of interactions between a user and a computing device, wherein at least some of the user interactions capture one or more choices made by the user related to energy usage preferences; and providing a number of energy management recommendations to the user, wherein at least some of the energy management recommendations are tailored to the particular user based on one or more of the choices made by the user related to the energy usage preferences. 2. The computer implemented method of claim 1, wherein the one or more choices comprise a choice made by the user in response to a past energy management recommendation. 3. The computer implemented method of claim 1, further comprises deriving an energy usage profile for the user based, at least in part, on one or more of the interactions of the user. 4. The computer implemented method of claim 3, further comprises:
computing energy usage analytics associated with the energy usage profile of the user; and presenting the energy usage analytics to the user. 5. The computer implemented method of claim 4, wherein the energy usage analytics are presented to the user in a bar chart. 6. The computer implemented method of claim 4, wherein the energy usage analytics are presented to the user in a pie chart. 7. The computer implemented method of claim 4, wherein the energy usage analytics are presented to the user using numerical values. 8. The computer implemented method of claim 1, further comprising:
computing energy usage analytics associated with each of two or more appliances, the energy usage analytics comprising a cost and/or an energy usage of each of the two or more appliances; and displaying an appliance indication on a display for each of two or more of the appliances, wherein the displayed appliance indications are sorted on the display based on one or more of the cost and the energy usage of the appliance. 9. The computer implemented method of claim 1, further comprising:
collecting sensor data related to the operation of one or more of the appliances; and wherein at least some of the energy management recommendations include a recommendation to perform a maintenance item on one or more appliances based on the collected sensor data. 10. A computing device for providing energy management recommendations to a user for operating one or more appliances, comprising:
a memory; a controller configured to execute executable instructions stored in the memory to: record a number of interactions between a user and the computing device, wherein at least some of the user interactions capture one or more choices made by the user related to energy usage preferences; and provide a number of energy management recommendations to the user, wherein at least some of the energy management recommendations are tailored to the user based on one or more of the choices made by the user related to energy usage preferences. 11. The computing device of claim 10, wherein the one or more choices comprise a choice made by the user in response to a past energy management recommendation. 12. The computing device of claim 10, wherein the controller is further configured to derive an energy usage profile for the user based, at least in part, on one or more of the interactions of the user. 13. The computing device of claim 10, wherein the controller is further configured to: compute energy usage analytics associated with the energy usage profile of the user; and present the energy usage analytics to the user. 14. The computing device of claim 13, wherein the energy usage analytics are presented to the user in a bar chart. 15. The computing device of claim 13, wherein the energy usage analytics are presented to the user in a pie chart. 16. The computing device of claim 13, wherein the energy usage analytics are presented to the user using numerical values. 17. The computing device of claim 10, wherein the controller is further configured to:
compute energy usage analytics associated with each of two or more appliances, the energy usage analytics comprising a cost and/or an energy usage of each of the two or more appliances; and display an appliance indication on a display for each of two or more of the appliances, wherein the displayed appliance indications are sorted on the display based on one or more of the cost and the energy usage of the appliance. 18. The computing device of claim 10, wherein the controller is further configured to: collect sensor data related to the operation of one or more of the appliances; and wherein at least some of the energy management recommendations include a recommendation to perform a maintenance item on one or more appliances based on the collected sensor data. 19. A computing device for providing energy management recommendations to a user for operating one or more appliances, comprising:
a memory; a controller configured to execute executable instructions stored in the memory to: record a number of interactions between a user and the computing device, wherein at least some of the user interactions capture one or more choices made by the user in response to one or more previous energy management recommendations; and provide a number of energy management recommendations to the user, wherein at least some of the energy management recommendations are tailored to the user based on one or more of the choices made by the user in response to one or more previous energy management recommendations. 20. The computing device of claim 19, wherein a previous energy management recommendation relates to conserving energy, and a choice made by the user was to decline the recommendation related to conserving energy, and wherein at least some of the energy management recommendations are tailored to the user based on the choice made by the user to decline the recommendation related to conserving energy. | Devices, systems, and methods for providing energy management recommendations are provided. One method includes recording a number of interactions between a user and a computing device, creating an energy usage profile according to the number of interactions between the user and the computing device, computing energy usage analytics associated with the energy usage profile, presenting the energy usage analytics to the user, and providing a number of energy management recommendations that account for the usage analytics and the energy usage profile.1. A non-transitory computer-readable medium containing instructions which, when executed by a processor, provide a computer implemented method for providing energy management recommendations for operating one or more appliances, the method comprising:
recording a number of interactions between a user and a computing device, wherein at least some of the user interactions capture one or more choices made by the user related to energy usage preferences; and providing a number of energy management recommendations to the user, wherein at least some of the energy management recommendations are tailored to the particular user based on one or more of the choices made by the user related to the energy usage preferences. 2. The computer implemented method of claim 1, wherein the one or more choices comprise a choice made by the user in response to a past energy management recommendation. 3. The computer implemented method of claim 1, further comprises deriving an energy usage profile for the user based, at least in part, on one or more of the interactions of the user. 4. The computer implemented method of claim 3, further comprises:
computing energy usage analytics associated with the energy usage profile of the user; and presenting the energy usage analytics to the user. 5. The computer implemented method of claim 4, wherein the energy usage analytics are presented to the user in a bar chart. 6. The computer implemented method of claim 4, wherein the energy usage analytics are presented to the user in a pie chart. 7. The computer implemented method of claim 4, wherein the energy usage analytics are presented to the user using numerical values. 8. The computer implemented method of claim 1, further comprising:
computing energy usage analytics associated with each of two or more appliances, the energy usage analytics comprising a cost and/or an energy usage of each of the two or more appliances; and displaying an appliance indication on a display for each of two or more of the appliances, wherein the displayed appliance indications are sorted on the display based on one or more of the cost and the energy usage of the appliance. 9. The computer implemented method of claim 1, further comprising:
collecting sensor data related to the operation of one or more of the appliances; and wherein at least some of the energy management recommendations include a recommendation to perform a maintenance item on one or more appliances based on the collected sensor data. 10. A computing device for providing energy management recommendations to a user for operating one or more appliances, comprising:
a memory; a controller configured to execute executable instructions stored in the memory to: record a number of interactions between a user and the computing device, wherein at least some of the user interactions capture one or more choices made by the user related to energy usage preferences; and provide a number of energy management recommendations to the user, wherein at least some of the energy management recommendations are tailored to the user based on one or more of the choices made by the user related to energy usage preferences. 11. The computing device of claim 10, wherein the one or more choices comprise a choice made by the user in response to a past energy management recommendation. 12. The computing device of claim 10, wherein the controller is further configured to derive an energy usage profile for the user based, at least in part, on one or more of the interactions of the user. 13. The computing device of claim 10, wherein the controller is further configured to: compute energy usage analytics associated with the energy usage profile of the user; and present the energy usage analytics to the user. 14. The computing device of claim 13, wherein the energy usage analytics are presented to the user in a bar chart. 15. The computing device of claim 13, wherein the energy usage analytics are presented to the user in a pie chart. 16. The computing device of claim 13, wherein the energy usage analytics are presented to the user using numerical values. 17. The computing device of claim 10, wherein the controller is further configured to:
compute energy usage analytics associated with each of two or more appliances, the energy usage analytics comprising a cost and/or an energy usage of each of the two or more appliances; and display an appliance indication on a display for each of two or more of the appliances, wherein the displayed appliance indications are sorted on the display based on one or more of the cost and the energy usage of the appliance. 18. The computing device of claim 10, wherein the controller is further configured to: collect sensor data related to the operation of one or more of the appliances; and wherein at least some of the energy management recommendations include a recommendation to perform a maintenance item on one or more appliances based on the collected sensor data. 19. A computing device for providing energy management recommendations to a user for operating one or more appliances, comprising:
a memory; a controller configured to execute executable instructions stored in the memory to: record a number of interactions between a user and the computing device, wherein at least some of the user interactions capture one or more choices made by the user in response to one or more previous energy management recommendations; and provide a number of energy management recommendations to the user, wherein at least some of the energy management recommendations are tailored to the user based on one or more of the choices made by the user in response to one or more previous energy management recommendations. 20. The computing device of claim 19, wherein a previous energy management recommendation relates to conserving energy, and a choice made by the user was to decline the recommendation related to conserving energy, and wherein at least some of the energy management recommendations are tailored to the user based on the choice made by the user to decline the recommendation related to conserving energy. | 2,100 |
5,779 | 5,779 | 15,220,169 | 2,165 | The self-service resource management system includes a resource auditor to audit version information and state information of resources contributed by users. Further, a resource broker in the resource management system is configured to facilitate a formation of a resource pool of shared resources when each of the required resources in the resource pool reached a published state. Subsequently, a resource distributor in the resource management system is configured to form a workflow to distribute respective versions of the resources published to the resource pool. As such, the self-service resource management system can enable users to share and receive resources negotiated by users. | 1. One or more computer storage media comprising computer-implemented instructions that, when used by one or more computing devices, cause the one or more computing devices to:
enable a user of a plurality of users participating in a resource pool of shared resources to publish a version of a resource to the resource pool; receive an indication that each of a plurality of resources required by the resource pool reached a published state; and based on the indication, form a data distribution specification for the resource pool to distribute respective versions of the plurality of resources published to the resource pool. 2. The one or more computer storage media of claim 1, the instructions further cause the one or more computing devices to:
enable the user to create a draft version of the resource; and enable another user to view the draft version of the resource and provide feedback to the user of the draft version of the resource. 3. The one or more computer storage media of claim 1, the instructions further cause the one or more computing devices to:
audit version information and state information of the plurality of resources. 4. The one or more computer storage media of claim 1, the instructions further cause the one or more computing devices to:
receive a signal from the user to suspend the resource; and based on the signal, deactivate the resource pool and disable a workflow conforming to the data distribution specification for distributing the resource. 5. The one or more computer storage media of claim 4, the instructions further cause the one or more computing devices to:
enable the user to publish a new version of the resource; and notify other users in the resource pool of the new version of the resource. 6. The one or more computer storage media of claim 5, the instructions further cause the one or more computing devices to:
enable other users to publish their respective resources into a new resource pool of shared resources; and form a new data distribution specification to distribute resources published to the new resource pool. 7. The one or more computer storage media of claim 1, the instructions further cause the one or more computing devices to:
enable the user to publish the version of the resource to different resource pools of shared resources. 8. The one or more computer storage media of claim 1, the instructions further cause the one or more computing devices to:
enable the user to publish distinct versions of the resource to different resource pools of shared resources. 9. The one or more computer storage media of claim 8, wherein the plurality of resources comprise multimedia or analytics data, and the instructions further cause the one or more computing devices to:
route the multimedia or analytics data to appropriate destinations based on the data distribution specification. 10. A computer-implemented method, comprising:
deactivating a first resource pool of shared resources based on a first indication of suspension for a resource contributed by a user of a plurality of users participating in the first resource pool; receiving a second indication of publication of another version of the resource by the user to a second resource pool of shared resources; notifying other users of the plurality of users for the another version of the resource; receiving a third indication that each of a plurality of resources required by the second resource pool reached a published status; and based on the third indication, forming a workflow for the second resource pool to distribute respective versions of the plurality of resources published to the second resource pool. 11. The method of claim 10, further comprising:
deactivating all resource pools of shared resources that include the resource contributed by the user. 12. The method of claim 11, further comprising:
enabling the user to create a draft version of the resource; and enabling another user to view the draft version of the resource and provide feedback to the user of the draft version of the resource. 13. The method of claim 10, further comprising:
auditing version information and state information of the plurality of resources. 14. The method of claim 13, wherein the state information comprises at least one state of draft, published, or suspended. 15. The method of claim 10, further comprising:
auditing state information of the resource pool. 16. The method of claim 13, wherein the state information comprises at least one state of active or inactive. 17. The method of claim 16, further comprising:
marking a state of the resource pool as inactive when one of the plurality of resources transitioned from a published state to a suspended state. 18. A system, comprising:
a processor; a resource auditor, coupled to the processor, to audit version information and state information of a plurality of resources contributed by a plurality of users; a resource broker, coupled to the resource auditor, to facilitate a formation of a resource pool of shared resources when each of required resources in the resource pool reached a published status; and a resource distributor, coupled to the resource broker, to form a workflow to distribute respective versions of the plurality of resources published to the resource pool. 19. The system of claim 18, wherein the resource broker is further to enable a user to publish distinct versions of a resource to different resource pools of shared resources. 20. The system of claim 18, wherein the resource broker is further to deactivate all resource pools of shared resources that include a resource contributed by a user when the user suspends the resource. | The self-service resource management system includes a resource auditor to audit version information and state information of resources contributed by users. Further, a resource broker in the resource management system is configured to facilitate a formation of a resource pool of shared resources when each of the required resources in the resource pool reached a published state. Subsequently, a resource distributor in the resource management system is configured to form a workflow to distribute respective versions of the resources published to the resource pool. As such, the self-service resource management system can enable users to share and receive resources negotiated by users.1. One or more computer storage media comprising computer-implemented instructions that, when used by one or more computing devices, cause the one or more computing devices to:
enable a user of a plurality of users participating in a resource pool of shared resources to publish a version of a resource to the resource pool; receive an indication that each of a plurality of resources required by the resource pool reached a published state; and based on the indication, form a data distribution specification for the resource pool to distribute respective versions of the plurality of resources published to the resource pool. 2. The one or more computer storage media of claim 1, the instructions further cause the one or more computing devices to:
enable the user to create a draft version of the resource; and enable another user to view the draft version of the resource and provide feedback to the user of the draft version of the resource. 3. The one or more computer storage media of claim 1, the instructions further cause the one or more computing devices to:
audit version information and state information of the plurality of resources. 4. The one or more computer storage media of claim 1, the instructions further cause the one or more computing devices to:
receive a signal from the user to suspend the resource; and based on the signal, deactivate the resource pool and disable a workflow conforming to the data distribution specification for distributing the resource. 5. The one or more computer storage media of claim 4, the instructions further cause the one or more computing devices to:
enable the user to publish a new version of the resource; and notify other users in the resource pool of the new version of the resource. 6. The one or more computer storage media of claim 5, the instructions further cause the one or more computing devices to:
enable other users to publish their respective resources into a new resource pool of shared resources; and form a new data distribution specification to distribute resources published to the new resource pool. 7. The one or more computer storage media of claim 1, the instructions further cause the one or more computing devices to:
enable the user to publish the version of the resource to different resource pools of shared resources. 8. The one or more computer storage media of claim 1, the instructions further cause the one or more computing devices to:
enable the user to publish distinct versions of the resource to different resource pools of shared resources. 9. The one or more computer storage media of claim 8, wherein the plurality of resources comprise multimedia or analytics data, and the instructions further cause the one or more computing devices to:
route the multimedia or analytics data to appropriate destinations based on the data distribution specification. 10. A computer-implemented method, comprising:
deactivating a first resource pool of shared resources based on a first indication of suspension for a resource contributed by a user of a plurality of users participating in the first resource pool; receiving a second indication of publication of another version of the resource by the user to a second resource pool of shared resources; notifying other users of the plurality of users for the another version of the resource; receiving a third indication that each of a plurality of resources required by the second resource pool reached a published status; and based on the third indication, forming a workflow for the second resource pool to distribute respective versions of the plurality of resources published to the second resource pool. 11. The method of claim 10, further comprising:
deactivating all resource pools of shared resources that include the resource contributed by the user. 12. The method of claim 11, further comprising:
enabling the user to create a draft version of the resource; and enabling another user to view the draft version of the resource and provide feedback to the user of the draft version of the resource. 13. The method of claim 10, further comprising:
auditing version information and state information of the plurality of resources. 14. The method of claim 13, wherein the state information comprises at least one state of draft, published, or suspended. 15. The method of claim 10, further comprising:
auditing state information of the resource pool. 16. The method of claim 13, wherein the state information comprises at least one state of active or inactive. 17. The method of claim 16, further comprising:
marking a state of the resource pool as inactive when one of the plurality of resources transitioned from a published state to a suspended state. 18. A system, comprising:
a processor; a resource auditor, coupled to the processor, to audit version information and state information of a plurality of resources contributed by a plurality of users; a resource broker, coupled to the resource auditor, to facilitate a formation of a resource pool of shared resources when each of required resources in the resource pool reached a published status; and a resource distributor, coupled to the resource broker, to form a workflow to distribute respective versions of the plurality of resources published to the resource pool. 19. The system of claim 18, wherein the resource broker is further to enable a user to publish distinct versions of a resource to different resource pools of shared resources. 20. The system of claim 18, wherein the resource broker is further to deactivate all resource pools of shared resources that include a resource contributed by a user when the user suspends the resource. | 2,100 |
5,780 | 5,780 | 14,631,890 | 2,177 | A method for consolidating reusable image components with multi-media contents is provided. The method includes defining a location in a content template for storing a library of reusable image components and multi-media contents. The method further includes transmitting at least one multi-media content of a digital asset management environment, wherein the transmitted at least one multi-media content is stored in the defined location of the content template with the library of reusable image components. The method further includes determining if the selected at least one multi-media content was transmitted, stored and, is present in the defined location of the content template. The method further includes generating in the defined location of authoring content template, another library of reusable image components of the at the least one multi-media content, if the at least one multi-media content is not confirmed present in the defined location of the content template. | 1. A computer system for consolidating reusable image components with multi-media contents, between a digital asset management environment and a web content management environment, the computer system comprising:
one or more processors, one or more computer-readable memories, one or more computer-readable tangible storage devices and program instructions which are stored on at least one of the one or more storage devices for execution by at least one of the one or more processors via at least one of the one or more memories, the program instructions comprising: program instructions to define a location in a content template of a web content management environment for storing a library of reusable image components and multi-media contents of a digital asset management environment, wherein the defined location is configured to consolidate the library of reusable image components with the multi-media contents; program instructions to transmit at least one multi-media content of the digital asset management environment, wherein the transmitted at least one multi-media content is stored in the defined location of the content template with the library of reusable image components; program instructions to if the selected at least one multi-media content was transmitted, stored and, is present in the defined location of the content template, wherein the determination is based on search of component identifiers of the library of reusable image components; and program instructions to generate in the defined location of authoring content template, another library of reusable image components of the at the least one multi-media content, if the at least one multi-media content is not confirmed present in the defined location of the content template. 2. The computer system of claim 1, wherein if the at least one multi-media content is confirmed present in the defined location of the content template, the at least one multi-media content is automatically linked, and consolidated with the library of reusable image components, wherein the linked and consolidated library of reusable image components provides a platform for dynamic management of the at least one multi-media contents in the web content management environment. 3. The computer system of claim 2, wherein the library of reusable image components includes component identifiers of the at least one multi-media content, and wherein the component identifiers include web content tables, web content lists, or web content text elements, that are complied for storing, editing, or deploying multi-media contents of the at least one multi-media content in the web content management environment. 4. The computer system of claim 1 further comprises:
program instructions to select at least one multi-media content, wherein the at least one multi-media content includes a text based data content, a video based data content, and a voice based data content, including, at least one of graphical sources, media sources, or image sources that are published, edited, or modified in the web content management environment. 5. The computer system of claim 4, wherein the at least one multi-media content is selected in an administrative client interface via a digital asset management environment. 6. The computer system of claim 5 wherein the digital asset management environment provides a protocol for downloading, renaming, storing, rating, grouping, archiving, optimizing, or exporting the at least one multi-media contents to the administrative client interface. 7. The computer system of claim of 1, wherein the library of reusable image component comprises image metadata, wherein the image metadata includes at least one of web image identification, web image hypertext markup language elements, or web text elements of the at least one multi-media content:
one or more processors, one or more computer-readable memories, one or more computer-readable tangible storage devices and program instructions which are stored on at least one of the one or more storage devices for execution by at least one of the one or more processors via at least one of the one or more memories, the program instructions comprising: program instructions to define a location in a content template of a web content management environment for storing a library of reusable image components and multi-media contents of a digital asset management environment, wherein the defined location is configured to consolidate the library of reusable image components with the multi-media contents; program instructions to transmit at least one multi-media content of the digital asset management environment, wherein the transmitted at least one multi-media content is stored in the defined location of the content template with the library of reusable image components; program instructions to if the selected at least one multi-media content was transmitted, stored and, is present in the defined location of the content template, wherein the determination is based on search of component identifiers of the library of reusable image components; and program instructions to generate in the defined location of authoring content template, another library of reusable image components of the at the least one multi-media content, if the at least one multi-media content is not confirmed present in the defined location of the content template. 8. A computer program product for consolidating reusable image components with multi-media contents, between a digital asset management environment and a web content management environment, the computer program product comprises:
one or more computer-readable tangible storage devices and program instructions stored on at least one of the one or more storage devices, the program instructions comprising: program instructions to define a location in a content template of a web content management environment for storing a library of reusable image components and multi-media contents of a digital asset management environment, wherein the defined location is configured to consolidate the library of reusable image components with the multi-media contents; program instructions to transmit at least one multi-media content of the digital asset management environment, wherein the transmitted at least one multi-media content is stored in the defined location of the content template with the library of reusable image components; program instructions to if the selected at least one multi-media content was transmitted, stored and, is present in the defined location of the content template, wherein the determination is based on search of component identifiers of the library of reusable image components; and program instructions to generate in the defined location of authoring content template, another library of reusable image components of the at the least one multi-media content, if the at least one multi-media content is not confirmed present in the defined location of the content template. 9. The computer program product of claim 8, wherein if the at least one multi-media content is confirmed present in the defined location of the content template, the at least one multi-media content is automatically linked, and consolidated with the library of reusable image components, wherein the linked and consolidated library of reusable image components provides a platform for dynamic management of the at least one multi-media contents in the web content management environment. 10. The computer program product of claim 9, wherein the library of reusable image components includes component identifiers of the at least one multi-media content, and wherein the component identifiers include web content tables, web content lists, or web content text elements, that are complied for storing, editing, or deploying multi-media contents of the at least one multi-media content in the web content management environment. 11. The computer program product of claim 8 further comprises:
program instructions to select at least one multi-media content, wherein the at least one multi-media content includes a text based data content, a video based data content, and a voice based data content, including, at least one of graphical sources, media sources, or image sources that are published, edited, or modified in the web content management environment. 12. The computer program product of claim 11, wherein the at least one multi-media content is selected in an administrative client interface via a digital asset management environment and, wherein, the digital asset management environment provides a protocol for downloading, renaming, storing, rating, grouping, archiving, optimizing, or exporting the at least one multi-media contents to the administrative client interface. 13. The computer program product of claim 12, wherein the library of reusable image component comprises image metadata, wherein the image metadata includes at least one of web image identification, web image hypertext markup language elements, or web text elements of the at least one multi-media content. | A method for consolidating reusable image components with multi-media contents is provided. The method includes defining a location in a content template for storing a library of reusable image components and multi-media contents. The method further includes transmitting at least one multi-media content of a digital asset management environment, wherein the transmitted at least one multi-media content is stored in the defined location of the content template with the library of reusable image components. The method further includes determining if the selected at least one multi-media content was transmitted, stored and, is present in the defined location of the content template. The method further includes generating in the defined location of authoring content template, another library of reusable image components of the at the least one multi-media content, if the at least one multi-media content is not confirmed present in the defined location of the content template.1. A computer system for consolidating reusable image components with multi-media contents, between a digital asset management environment and a web content management environment, the computer system comprising:
one or more processors, one or more computer-readable memories, one or more computer-readable tangible storage devices and program instructions which are stored on at least one of the one or more storage devices for execution by at least one of the one or more processors via at least one of the one or more memories, the program instructions comprising: program instructions to define a location in a content template of a web content management environment for storing a library of reusable image components and multi-media contents of a digital asset management environment, wherein the defined location is configured to consolidate the library of reusable image components with the multi-media contents; program instructions to transmit at least one multi-media content of the digital asset management environment, wherein the transmitted at least one multi-media content is stored in the defined location of the content template with the library of reusable image components; program instructions to if the selected at least one multi-media content was transmitted, stored and, is present in the defined location of the content template, wherein the determination is based on search of component identifiers of the library of reusable image components; and program instructions to generate in the defined location of authoring content template, another library of reusable image components of the at the least one multi-media content, if the at least one multi-media content is not confirmed present in the defined location of the content template. 2. The computer system of claim 1, wherein if the at least one multi-media content is confirmed present in the defined location of the content template, the at least one multi-media content is automatically linked, and consolidated with the library of reusable image components, wherein the linked and consolidated library of reusable image components provides a platform for dynamic management of the at least one multi-media contents in the web content management environment. 3. The computer system of claim 2, wherein the library of reusable image components includes component identifiers of the at least one multi-media content, and wherein the component identifiers include web content tables, web content lists, or web content text elements, that are complied for storing, editing, or deploying multi-media contents of the at least one multi-media content in the web content management environment. 4. The computer system of claim 1 further comprises:
program instructions to select at least one multi-media content, wherein the at least one multi-media content includes a text based data content, a video based data content, and a voice based data content, including, at least one of graphical sources, media sources, or image sources that are published, edited, or modified in the web content management environment. 5. The computer system of claim 4, wherein the at least one multi-media content is selected in an administrative client interface via a digital asset management environment. 6. The computer system of claim 5 wherein the digital asset management environment provides a protocol for downloading, renaming, storing, rating, grouping, archiving, optimizing, or exporting the at least one multi-media contents to the administrative client interface. 7. The computer system of claim of 1, wherein the library of reusable image component comprises image metadata, wherein the image metadata includes at least one of web image identification, web image hypertext markup language elements, or web text elements of the at least one multi-media content:
one or more processors, one or more computer-readable memories, one or more computer-readable tangible storage devices and program instructions which are stored on at least one of the one or more storage devices for execution by at least one of the one or more processors via at least one of the one or more memories, the program instructions comprising: program instructions to define a location in a content template of a web content management environment for storing a library of reusable image components and multi-media contents of a digital asset management environment, wherein the defined location is configured to consolidate the library of reusable image components with the multi-media contents; program instructions to transmit at least one multi-media content of the digital asset management environment, wherein the transmitted at least one multi-media content is stored in the defined location of the content template with the library of reusable image components; program instructions to if the selected at least one multi-media content was transmitted, stored and, is present in the defined location of the content template, wherein the determination is based on search of component identifiers of the library of reusable image components; and program instructions to generate in the defined location of authoring content template, another library of reusable image components of the at the least one multi-media content, if the at least one multi-media content is not confirmed present in the defined location of the content template. 8. A computer program product for consolidating reusable image components with multi-media contents, between a digital asset management environment and a web content management environment, the computer program product comprises:
one or more computer-readable tangible storage devices and program instructions stored on at least one of the one or more storage devices, the program instructions comprising: program instructions to define a location in a content template of a web content management environment for storing a library of reusable image components and multi-media contents of a digital asset management environment, wherein the defined location is configured to consolidate the library of reusable image components with the multi-media contents; program instructions to transmit at least one multi-media content of the digital asset management environment, wherein the transmitted at least one multi-media content is stored in the defined location of the content template with the library of reusable image components; program instructions to if the selected at least one multi-media content was transmitted, stored and, is present in the defined location of the content template, wherein the determination is based on search of component identifiers of the library of reusable image components; and program instructions to generate in the defined location of authoring content template, another library of reusable image components of the at the least one multi-media content, if the at least one multi-media content is not confirmed present in the defined location of the content template. 9. The computer program product of claim 8, wherein if the at least one multi-media content is confirmed present in the defined location of the content template, the at least one multi-media content is automatically linked, and consolidated with the library of reusable image components, wherein the linked and consolidated library of reusable image components provides a platform for dynamic management of the at least one multi-media contents in the web content management environment. 10. The computer program product of claim 9, wherein the library of reusable image components includes component identifiers of the at least one multi-media content, and wherein the component identifiers include web content tables, web content lists, or web content text elements, that are complied for storing, editing, or deploying multi-media contents of the at least one multi-media content in the web content management environment. 11. The computer program product of claim 8 further comprises:
program instructions to select at least one multi-media content, wherein the at least one multi-media content includes a text based data content, a video based data content, and a voice based data content, including, at least one of graphical sources, media sources, or image sources that are published, edited, or modified in the web content management environment. 12. The computer program product of claim 11, wherein the at least one multi-media content is selected in an administrative client interface via a digital asset management environment and, wherein, the digital asset management environment provides a protocol for downloading, renaming, storing, rating, grouping, archiving, optimizing, or exporting the at least one multi-media contents to the administrative client interface. 13. The computer program product of claim 12, wherein the library of reusable image component comprises image metadata, wherein the image metadata includes at least one of web image identification, web image hypertext markup language elements, or web text elements of the at least one multi-media content. | 2,100 |
5,781 | 5,781 | 15,508,206 | 2,173 | An imaged image obtaining section obtains an imaged image from a camera. A face recognizing section detects the face images of a plurality of users in the imaged image. A display user determining section has a function of determining a user to be included in a display image. When an instruction receiving section receives a changing instruction, the display user determining section changes a user included in the display image. A face image clipping section clips a region including the face image of the determined user from the imaged image. A display image generating section generates the display image including the clipped region. | 1. An information processing device comprising:
an image obtaining section configured to obtain an imaged image from an imaging device; a face recognizing section configured to detect face images of a plurality of users in the imaged image; a display user determining section configured to determine a user to be included in a display image; a face image clipping section configured to clip a region including the face image of the determined user from the imaged image; a display image generating section configured to generate the display image including the clipped region; and an instruction receiving section configured to receive an instruction; the display user determining section determining the user to be included in the display image on a basis of the instruction received by the instruction receiving section, the face image clipping section clipping the region including the face image of the determined user. 2. The information processing device according to claim 1, wherein the face image clipping section clips the region including the face image of one user. 3. The information processing device according to claim 1, wherein the instruction receiving section receives a changing instruction of a user included in the display image, and the display user determining section determines the user to be included in the display image on a basis of the changing instruction. 4. The information processing device according to claim 3, further comprising an order determining section configured to determine display order of the plurality of users, wherein when the instruction receiving section receives the changing instruction of the user, the display user determining section determines the user according to the display order. 5. The information processing device according to claim 1, wherein when the instruction receiving section receives an instruction that designates a user, the display user determining section determines that the designated user is to be included in the display image. 6. An information processing device comprising:
an image obtaining section configured to obtain an imaged image from an imaging device; a face recognizing section configured to detect face images of a plurality of users in the imaged image; an instruction receiving section configured to receive a predetermined voice command as a changing instruction of a user included in a display image; a display user determining section configured to determine a user to be included in the display image on a basis of the changing instruction; a face image clipping section configured to clip a region including the face image of the determined user from the imaged image; and a display image generating section configured to generate the display image including the clipped region. 7. The information processing device according to claim 1, wherein
the display image generating section generates the display image in which an application image is disposed in a first region and the clipped region is disposed in a second region. 8. The information processing device according to claim 7, wherein the display image generating section sets the second region within the first region. 9. The information processing device according to claim 7, wherein the display image generating section sets the first region and the second region such that the first region and the second region are not superimposed on each other. 10. The information processing device according to claim 1, wherein the face image clipping section clips a region including the face images of the plurality of users. 11. A non-transitory, computer readable storage medium containing a computer program, which when executed by a computer, causes the computer to carry out actions, comprising:
by an image obtaining section, obtaining an imaged image from an imaging device; by a face recognizing section, detecting face images of a plurality of users in the imaged image; by an instruction receiving section, receiving an instruction; by a display user determining section, determining a user to be included in a display image on a basis of the received instruction; by a face image clipping section, clipping a region including the face image of the determined user from the imaged image; by a display image generating section, generating the display image including the clipped region; and by an instruction receiving section, receiving an instruction. 12. (canceled) | An imaged image obtaining section obtains an imaged image from a camera. A face recognizing section detects the face images of a plurality of users in the imaged image. A display user determining section has a function of determining a user to be included in a display image. When an instruction receiving section receives a changing instruction, the display user determining section changes a user included in the display image. A face image clipping section clips a region including the face image of the determined user from the imaged image. A display image generating section generates the display image including the clipped region.1. An information processing device comprising:
an image obtaining section configured to obtain an imaged image from an imaging device; a face recognizing section configured to detect face images of a plurality of users in the imaged image; a display user determining section configured to determine a user to be included in a display image; a face image clipping section configured to clip a region including the face image of the determined user from the imaged image; a display image generating section configured to generate the display image including the clipped region; and an instruction receiving section configured to receive an instruction; the display user determining section determining the user to be included in the display image on a basis of the instruction received by the instruction receiving section, the face image clipping section clipping the region including the face image of the determined user. 2. The information processing device according to claim 1, wherein the face image clipping section clips the region including the face image of one user. 3. The information processing device according to claim 1, wherein the instruction receiving section receives a changing instruction of a user included in the display image, and the display user determining section determines the user to be included in the display image on a basis of the changing instruction. 4. The information processing device according to claim 3, further comprising an order determining section configured to determine display order of the plurality of users, wherein when the instruction receiving section receives the changing instruction of the user, the display user determining section determines the user according to the display order. 5. The information processing device according to claim 1, wherein when the instruction receiving section receives an instruction that designates a user, the display user determining section determines that the designated user is to be included in the display image. 6. An information processing device comprising:
an image obtaining section configured to obtain an imaged image from an imaging device; a face recognizing section configured to detect face images of a plurality of users in the imaged image; an instruction receiving section configured to receive a predetermined voice command as a changing instruction of a user included in a display image; a display user determining section configured to determine a user to be included in the display image on a basis of the changing instruction; a face image clipping section configured to clip a region including the face image of the determined user from the imaged image; and a display image generating section configured to generate the display image including the clipped region. 7. The information processing device according to claim 1, wherein
the display image generating section generates the display image in which an application image is disposed in a first region and the clipped region is disposed in a second region. 8. The information processing device according to claim 7, wherein the display image generating section sets the second region within the first region. 9. The information processing device according to claim 7, wherein the display image generating section sets the first region and the second region such that the first region and the second region are not superimposed on each other. 10. The information processing device according to claim 1, wherein the face image clipping section clips a region including the face images of the plurality of users. 11. A non-transitory, computer readable storage medium containing a computer program, which when executed by a computer, causes the computer to carry out actions, comprising:
by an image obtaining section, obtaining an imaged image from an imaging device; by a face recognizing section, detecting face images of a plurality of users in the imaged image; by an instruction receiving section, receiving an instruction; by a display user determining section, determining a user to be included in a display image on a basis of the received instruction; by a face image clipping section, clipping a region including the face image of the determined user from the imaged image; by a display image generating section, generating the display image including the clipped region; and by an instruction receiving section, receiving an instruction. 12. (canceled) | 2,100 |
5,782 | 5,782 | 13,925,292 | 2,173 | Systems and methods are disclosed for providing navigation control across multiple layers of content views within a mobile application. One method includes: providing a first layer of content views that are each selectable by a user for display via a graphical user interface of an application executable at a mobile device; responsive to receiving user input selecting at least one of the content views in the first layer, obtaining content views for a second layer corresponding to the content view selected in the first layer; and enabling the user to navigate between the content views in the first layer and corresponding content views in the second layer via the graphical user interface; wherein content views obtained for the second layer are automatically updated with content views corresponding to a currently selected content view in the first layer. | 1. A method for providing navigation control across multiple layers of content views within a mobile application, the method comprising:
providing a first layer of content views that are each selectable by a user for display via a graphical user interface of an application executable at a mobile device; responsive to receiving user input selecting at least one of the content views in the first layer, obtaining content views for a second layer corresponding to the content view selected in the first layer; and enabling the user to navigate between the content views in the first layer and corresponding content views in the second layer via the graphical user interface; wherein the user selects different content views in the first layer or the second layer to be displayed at the mobile device via the graphical user interface, and content views obtained for the second layer are automatically updated with content views corresponding to a currently selected content view in the first layer. 2. The method of claim 1, further comprising:
displaying the currently selected content view or at least one of the corresponding content views in the second layer on a display screen of the mobile device based on user input received via the graphical user interface. 3. The method of claim 1, wherein the enabling step comprises:
providing navigation controls within each of the first and second layers for enabling the user to navigate between the content views of the respective first and second layers via the graphical user interface. 4. The method of claim 1, wherein the graphical user interface includes navigation controls enabling the user to select different content views of the first and second layers for display at the mobile device. 5. The method of claim 1, further comprising:
obtaining content items for the selected content view of the first layer; and displaying the content items. 6. The method of claim 1, wherein the obtaining step comprises;
sending a request for the content items from the mobile device to a server via a communication network; and upon receiving a response including the content items from the server, storing the content items to a memory of the mobile device. 7. The method of claim 1, further comprising:
enabling the user to select a content view; retrieving the stored content items from memory for the second content layer; and displaying the retrieved content items via the graphical user interface. 8. The method of claim 1, wherein the first layer of content views includes a plurality of content previews, each content preview being related to a subject matter topic. 9. The method of claim 1, wherein the first layer of content views includes a plurality of content previews, each content preview being related to a physical location including a neighborhood, city, or town. 10. The method of claim 9, wherein each content preview is related to a subject matter topic specific to the neighborhood, city, or town. 11. A system for providing navigation control across multiple layers of content views within a mobile application, the system including:
a data storage device storing instructions for providing navigation control across multiple layers of content views within a mobile application; a processor configured to execute the instructions to perform a method including:
providing a first layer of content views that are each selectable by a user for display via a graphical user interface of an application executable at a mobile device;
responsive to receiving user input selecting at least one of the content views in the first layer, obtaining content views for a second layer corresponding to the content view selected in the first layer; and
enabling the user to navigate between the content views in the first layer and corresponding content views in the second layer via the graphical user interface;
wherein the user selects different content views in the first layer or the second layer to be displayed at the mobile device via the graphical user interface, and content views obtained for the second layer are automatically updated with content views corresponding to a currently selected content view in the first layer. 12. The system of claim 11, wherein the processor is further configured for:
displaying the currently selected content view or at least one of the corresponding content views in the second layer on a display screen of the mobile device based on user input received via the graphical user interface. 13. The system of claim 11, wherein the enabling step comprises:
providing navigation controls within each of the first and second layers for enabling the user to navigate between the content views of the respective first and second layers via the graphical user interface. 14. The system of claim 11, wherein the graphical user interface includes navigation controls enabling the user to select different content views of the first and second layers for display at the mobile device. 15. The system of claim 11, wherein the enabling step comprises:
obtaining content items for the selected content view of the first layer; and displaying the content items. 16. The system of claim 11, wherein the obtaining step comprises:
sending a request for the content items from the mobile device to a server via a communication network; and upon receiving a response including the content items from the server, storing the content items to a memory of the mobile device. 17. The system of claim 11, wherein the first layer of content views includes a plurality of content previews, each content preview being related to a subject matter topic. 18. The system of claim 11, wherein the first layer of content views includes a plurality of content previews, each content preview being related to a physical location including a neighborhood, city, or town. 19. The system of claim 11, wherein each content preview is related to a subject matter topic specific to the neighborhood, city, or town. 20. A computer readable medium storing instructions that, when executed by a computer, cause the computer to perform a method of providing navigation control across multiple layers of content views within a mobile application, the method including:
providing a first layer of content views that are each selectable by a user for display via a graphical user interface of an application executable at a mobile device; responsive to receiving user input selecting at least one of the content views in the first layer, obtaining content views for a second layer corresponding to the content view selected in the first layer; and enabling the user to navigate between the content views in the first layer and corresponding content views in the second layer via the graphical user interface; wherein the user selects different content views in the first layer or the second layer to be displayed at the mobile device via the graphical user interface, and content views obtained for the second layer are automatically updated with content views corresponding to a currently selected content view in the first layer. | Systems and methods are disclosed for providing navigation control across multiple layers of content views within a mobile application. One method includes: providing a first layer of content views that are each selectable by a user for display via a graphical user interface of an application executable at a mobile device; responsive to receiving user input selecting at least one of the content views in the first layer, obtaining content views for a second layer corresponding to the content view selected in the first layer; and enabling the user to navigate between the content views in the first layer and corresponding content views in the second layer via the graphical user interface; wherein content views obtained for the second layer are automatically updated with content views corresponding to a currently selected content view in the first layer.1. A method for providing navigation control across multiple layers of content views within a mobile application, the method comprising:
providing a first layer of content views that are each selectable by a user for display via a graphical user interface of an application executable at a mobile device; responsive to receiving user input selecting at least one of the content views in the first layer, obtaining content views for a second layer corresponding to the content view selected in the first layer; and enabling the user to navigate between the content views in the first layer and corresponding content views in the second layer via the graphical user interface; wherein the user selects different content views in the first layer or the second layer to be displayed at the mobile device via the graphical user interface, and content views obtained for the second layer are automatically updated with content views corresponding to a currently selected content view in the first layer. 2. The method of claim 1, further comprising:
displaying the currently selected content view or at least one of the corresponding content views in the second layer on a display screen of the mobile device based on user input received via the graphical user interface. 3. The method of claim 1, wherein the enabling step comprises:
providing navigation controls within each of the first and second layers for enabling the user to navigate between the content views of the respective first and second layers via the graphical user interface. 4. The method of claim 1, wherein the graphical user interface includes navigation controls enabling the user to select different content views of the first and second layers for display at the mobile device. 5. The method of claim 1, further comprising:
obtaining content items for the selected content view of the first layer; and displaying the content items. 6. The method of claim 1, wherein the obtaining step comprises;
sending a request for the content items from the mobile device to a server via a communication network; and upon receiving a response including the content items from the server, storing the content items to a memory of the mobile device. 7. The method of claim 1, further comprising:
enabling the user to select a content view; retrieving the stored content items from memory for the second content layer; and displaying the retrieved content items via the graphical user interface. 8. The method of claim 1, wherein the first layer of content views includes a plurality of content previews, each content preview being related to a subject matter topic. 9. The method of claim 1, wherein the first layer of content views includes a plurality of content previews, each content preview being related to a physical location including a neighborhood, city, or town. 10. The method of claim 9, wherein each content preview is related to a subject matter topic specific to the neighborhood, city, or town. 11. A system for providing navigation control across multiple layers of content views within a mobile application, the system including:
a data storage device storing instructions for providing navigation control across multiple layers of content views within a mobile application; a processor configured to execute the instructions to perform a method including:
providing a first layer of content views that are each selectable by a user for display via a graphical user interface of an application executable at a mobile device;
responsive to receiving user input selecting at least one of the content views in the first layer, obtaining content views for a second layer corresponding to the content view selected in the first layer; and
enabling the user to navigate between the content views in the first layer and corresponding content views in the second layer via the graphical user interface;
wherein the user selects different content views in the first layer or the second layer to be displayed at the mobile device via the graphical user interface, and content views obtained for the second layer are automatically updated with content views corresponding to a currently selected content view in the first layer. 12. The system of claim 11, wherein the processor is further configured for:
displaying the currently selected content view or at least one of the corresponding content views in the second layer on a display screen of the mobile device based on user input received via the graphical user interface. 13. The system of claim 11, wherein the enabling step comprises:
providing navigation controls within each of the first and second layers for enabling the user to navigate between the content views of the respective first and second layers via the graphical user interface. 14. The system of claim 11, wherein the graphical user interface includes navigation controls enabling the user to select different content views of the first and second layers for display at the mobile device. 15. The system of claim 11, wherein the enabling step comprises:
obtaining content items for the selected content view of the first layer; and displaying the content items. 16. The system of claim 11, wherein the obtaining step comprises:
sending a request for the content items from the mobile device to a server via a communication network; and upon receiving a response including the content items from the server, storing the content items to a memory of the mobile device. 17. The system of claim 11, wherein the first layer of content views includes a plurality of content previews, each content preview being related to a subject matter topic. 18. The system of claim 11, wherein the first layer of content views includes a plurality of content previews, each content preview being related to a physical location including a neighborhood, city, or town. 19. The system of claim 11, wherein each content preview is related to a subject matter topic specific to the neighborhood, city, or town. 20. A computer readable medium storing instructions that, when executed by a computer, cause the computer to perform a method of providing navigation control across multiple layers of content views within a mobile application, the method including:
providing a first layer of content views that are each selectable by a user for display via a graphical user interface of an application executable at a mobile device; responsive to receiving user input selecting at least one of the content views in the first layer, obtaining content views for a second layer corresponding to the content view selected in the first layer; and enabling the user to navigate between the content views in the first layer and corresponding content views in the second layer via the graphical user interface; wherein the user selects different content views in the first layer or the second layer to be displayed at the mobile device via the graphical user interface, and content views obtained for the second layer are automatically updated with content views corresponding to a currently selected content view in the first layer. | 2,100 |
5,783 | 5,783 | 15,197,183 | 2,135 | A system comprising a processor and a memory storing instructions that, when executed, cause the system to receive a request for garbage collection, identify a range of physical blocks in a storage device, query a bitmap, the bitmap having a bit for each physical block in the range of physical blocks, determine a status associated with a first bit from the bitmap, in response to determining the status associated with the first bit is a first state, add a first physical block associated with the first bit to a list of physical blocks for relocation, and relocate the list of physical blocks. | 1. A method comprising:
receiving a request for garbage collection; identifying a range of physical blocks in a storage device; querying a bitmap, the bitmap having a bit for each physical block in the range of physical blocks; determining a status associated with a first bit from the bitmap; in response to determining the status associated with the first bit is a first state, adding a first physical block associated with the first bit to a list of physical blocks for relocation; and relocating the list of physical blocks. 2. The method of claim 1, wherein a size of the bitmap corresponds to a size of the storage device. 3. The method of claim 1, wherein the first state indicates an active mapping associated with the first physical block. 4. The method of claim 1, further comprising:
receiving a request to pre-fetch a translation table entry; in response to receiving the request to pre-fetch, marking the translation table entry in the memory; and generating a non-zero reference count for the translation table entry. 5. The method of claim 3, wherein the marked translation table entry is associated with an expiration timeout. 6. The method of claim 1, further comprising:
receiving a write request for a first logical block; mapping the first logical block to a second physical block; allocating a second bit associated with the second physical block; assigning the first state to the second bit associated with the second physical block; and updating the bitmap based on the first state assigned to the second bit. 7. A system comprising:
a processor; and a memory storing instructions that, when executed, cause the system to:
receive a request for garbage collection;
identifying a range of physical blocks in a storage device;
query a bitmap, the bitmap having a bit for a first physical block in the range of physical blocks;
determine a status associated with for a first bit from the bitmap;
in response to determining the status associated with the first bit is a first state, add the first physical block associated with the first bit to a list of physical blocks for relocation; and
relocate the list of physical blocks. 8. The system of claim 7, wherein a size of the bitmap corresponds to a size of the storage device. 9. The system of claim 7, wherein the first state indicates an active mapping associated with the first physical block. 10. The system of claim 7, further comprising:
receiving a request to pre-fetch a translation table entry; in response to receiving the request to pre-fetch, marking the translation table entry in the memory; and generating a non-zero reference count for the translation table entry. 11. The system of claim 10, wherein the marked translation table entry is associated with an expiration timeout. 12. The system of claim 7, further comprising:
receiving a write request for a first logical block; mapping the first logical block to a second physical block; allocating a second bit associated with the second physical block; assigning the first state to the second bit associated with the second physical block; and updating the bitmap based on the first state assigned to the second bit. 13. A method comprising:
receiving a request to map a first physical block to a first logical block; assigning a first state to a first bit associated with the first physical block; receiving an write request for the first logical block; mapping a second physical block to the first logical block; assigning a second state to the first bit associated with the first physical block; and assigning the first state to the second bit associated with the second physical block. 14. The method of claim 13, further comprising:
updating a bitmap using the second state associated with the first bit and the first state associated with the second bit. 15. The method of claim 13, wherein a size of the bitmap corresponds to a size of the storage device. 16. The method of claim 14, wherein the first state indicates an active mapping associated with the second physical block. 17. The method of claim 13, further comprising:
receiving a request to pre-fetch a translation table entry; and in response to receiving the request to pre-fetch, marking the translation table entry in the memory; and generating a non-zero reference count for the translation table entry. 18. The method of claim 17, wherein marked translation table entry is associated with an expiration timeout. 19. The method of claim 13, further comprising:
receiving a write request for a second logical block; mapping the second logical block to a third physical block; allocating a third bit associated with the third physical block; assigning the first state to the third bit associated with the third physical block; and updating the bitmap based on the first status assigned to the third bit. | A system comprising a processor and a memory storing instructions that, when executed, cause the system to receive a request for garbage collection, identify a range of physical blocks in a storage device, query a bitmap, the bitmap having a bit for each physical block in the range of physical blocks, determine a status associated with a first bit from the bitmap, in response to determining the status associated with the first bit is a first state, add a first physical block associated with the first bit to a list of physical blocks for relocation, and relocate the list of physical blocks.1. A method comprising:
receiving a request for garbage collection; identifying a range of physical blocks in a storage device; querying a bitmap, the bitmap having a bit for each physical block in the range of physical blocks; determining a status associated with a first bit from the bitmap; in response to determining the status associated with the first bit is a first state, adding a first physical block associated with the first bit to a list of physical blocks for relocation; and relocating the list of physical blocks. 2. The method of claim 1, wherein a size of the bitmap corresponds to a size of the storage device. 3. The method of claim 1, wherein the first state indicates an active mapping associated with the first physical block. 4. The method of claim 1, further comprising:
receiving a request to pre-fetch a translation table entry; in response to receiving the request to pre-fetch, marking the translation table entry in the memory; and generating a non-zero reference count for the translation table entry. 5. The method of claim 3, wherein the marked translation table entry is associated with an expiration timeout. 6. The method of claim 1, further comprising:
receiving a write request for a first logical block; mapping the first logical block to a second physical block; allocating a second bit associated with the second physical block; assigning the first state to the second bit associated with the second physical block; and updating the bitmap based on the first state assigned to the second bit. 7. A system comprising:
a processor; and a memory storing instructions that, when executed, cause the system to:
receive a request for garbage collection;
identifying a range of physical blocks in a storage device;
query a bitmap, the bitmap having a bit for a first physical block in the range of physical blocks;
determine a status associated with for a first bit from the bitmap;
in response to determining the status associated with the first bit is a first state, add the first physical block associated with the first bit to a list of physical blocks for relocation; and
relocate the list of physical blocks. 8. The system of claim 7, wherein a size of the bitmap corresponds to a size of the storage device. 9. The system of claim 7, wherein the first state indicates an active mapping associated with the first physical block. 10. The system of claim 7, further comprising:
receiving a request to pre-fetch a translation table entry; in response to receiving the request to pre-fetch, marking the translation table entry in the memory; and generating a non-zero reference count for the translation table entry. 11. The system of claim 10, wherein the marked translation table entry is associated with an expiration timeout. 12. The system of claim 7, further comprising:
receiving a write request for a first logical block; mapping the first logical block to a second physical block; allocating a second bit associated with the second physical block; assigning the first state to the second bit associated with the second physical block; and updating the bitmap based on the first state assigned to the second bit. 13. A method comprising:
receiving a request to map a first physical block to a first logical block; assigning a first state to a first bit associated with the first physical block; receiving an write request for the first logical block; mapping a second physical block to the first logical block; assigning a second state to the first bit associated with the first physical block; and assigning the first state to the second bit associated with the second physical block. 14. The method of claim 13, further comprising:
updating a bitmap using the second state associated with the first bit and the first state associated with the second bit. 15. The method of claim 13, wherein a size of the bitmap corresponds to a size of the storage device. 16. The method of claim 14, wherein the first state indicates an active mapping associated with the second physical block. 17. The method of claim 13, further comprising:
receiving a request to pre-fetch a translation table entry; and in response to receiving the request to pre-fetch, marking the translation table entry in the memory; and generating a non-zero reference count for the translation table entry. 18. The method of claim 17, wherein marked translation table entry is associated with an expiration timeout. 19. The method of claim 13, further comprising:
receiving a write request for a second logical block; mapping the second logical block to a third physical block; allocating a third bit associated with the third physical block; assigning the first state to the third bit associated with the third physical block; and updating the bitmap based on the first status assigned to the third bit. | 2,100 |
5,784 | 5,784 | 15,200,189 | 2,158 | A system includes reception of a first query, the first query comprising a meta-facet, determination of one or more dimensions associated with the meta-facet, determination of a dimension query for each of the one or more dimensions based on the first query, execution of each of the determined dimension queries to generate a respective result set for each of the determined dimension queries, and presentation of a respective visualization of each of the respective result sets. | 1. A system comprising:
a memory storing processor-executable process steps; and a processor to execute the processor-executable process steps to cause the system to: receive a first query, the first query comprising a meta-facet; determine one or more dimensions associated with the meta-facet; determine a dimension query for each of the one or more dimensions based on the first query; execute each of the determined dimension queries to generate a respective result set for each of the determined dimension queries; and present a respective visualization of each of the respective result sets. 2. A system according to claim 1, the processor to further execute the processor-executable process steps to cause the system to:
receive a second query; determine that the second query does not comprise a meta-facet; execute the second query to generate a second result set; and present a second visualization of the second result set. 3. A system according to claim 1, the processor to further execute the processor-executable process steps to cause the system to:
receive a second query, the second query comprising a second meta-facet; determine a second one or more dimensions associated with the second meta-facet; determine a second dimension query for each of the second one or more dimensions based on the second query; execute each of the determined second dimension queries to generate a respective second result set for each of the determined second dimension queries; and present a respective visualization of each of the respective second result sets. 4. A system according to claim 3, the processor to further execute the processor-executable process steps to cause the system to:
receive a third query, the third query comprising a dimension value; identify a meta-dimension of which the dimension value is a member; determine a third dimension query for each of one or more dimensions of the meta-dimension based on the third query; execute each of the third determined dimension queries to generate a respective third result set for each of the third determined dimension queries; and present a respective third visualization of each of the respective third result sets. 5. A system according to claim 1, the processor to further execute the processor-executable process steps to cause the system to:
receive a second query, the second query comprising a dimension value; identify a meta-dimension of which the dimension value is a member; determine a second dimension query for each of one or more dimensions of the meta-dimension based on the second query; execute each of the second determined dimension queries to generate a respective second result set for each of the second determined dimension queries; and present a respective second visualization of each of the respective second result sets. 6. A computer-implemented method comprising:
receiving a query, the query comprising a dimension value; identifying a meta-dimension of which the dimension value is a member; determining a dimension query for each of one or more dimensions of the meta-dimension based on the query; executing each of the determined dimension queries to generate a respective result set for each of the determined dimension queries; and presenting a respective visualization of each of the respective result sets. 7. A method according to claim 6, further comprising:
receiving a second query, the second query comprising a meta-facet; determining a second one or more dimensions associated with the meta-facet; determining a second dimension query for each of the second one or more dimensions based on the second query; executing each of the determined second dimension queries to generate a respective second result set for each of the determined second dimension queries; and presenting a respective second visualization of each of the respective second result sets. 8. A method according to claim 7, further comprising:
receiving a third query; determining that the third query does not comprise a meta-facet; executing the third query to generate a third result set; and presenting a third visualization of the third result set. 9. A method according to claim 6, further comprising:
receiving a second query, the query comprising a second dimension value; identifying a second meta-dimension of which the second dimension value is a member; determining a second dimension query for each of one or more second dimensions of the second meta-dimension based on the query; executing each of the determined second dimension queries to generate a respective second result set for each of the determined second dimension queries; and presenting a respective second visualization of each of the respective second result sets. 10. A method according to claim 9, further comprising:
receiving a third query, the third query comprising a meta-facet; determining a third one or more dimensions associated with the meta-facet; determining a third dimension query for each of the third one or more dimensions based on the third query; executing each of the determined third dimension queries to generate a respective third result set for each of the determined third dimension queries; and presenting a respective third visualization of each of the respective third result sets. 11. A non-transitory computer-readable medium storing program code, the program code executable by a processor of a computing system to cause the computing system to:
receive a first query, the first query comprising a meta-facet; determine one or more dimensions associated with the meta-facet; determine a dimension query for each of the one or more dimensions based on the first query; execute each of the determined dimension queries to generate a respective result set for each of the determined dimension queries; and present a respective visualization of each of the respective result sets. 12. A medium according to claim 11, the program code further executable by a processor of a computing system to cause the computing system to:
receive a second query; determine that the second query does not comprise a meta-facet; execute the second query to generate a second result set; and present a second visualization of the second result set. 13. A medium according to claim 11, the program code further executable by a processor of a computing system to cause the computing system to:
receive a second query, the second query comprising a second meta-facet; determine a second one or more dimensions associated with the second meta-facet; determine a second dimension query for each of the second one or more dimensions based on the second query; execute each of the determined second dimension queries to generate a respective second result set for each of the determined second dimension queries; and present a respective visualization of each of the respective second result sets. 14. A medium according to claim 13, the program code further executable by a processor of a computing system to cause the computing system to:
receive a third query, the third query comprising a dimension value; identify a meta-dimension of which the dimension value is a member; determine a third dimension query for each of one or more dimensions of the meta-dimension based on the third query; execute each of the third determined dimension queries to generate a respective third result set for each of the third determined dimension queries; and present a respective third visualization of each of the respective third result sets. 15. A medium according to claim 11, the program code further executable by a processor of a computing system to cause the computing system to:
receive a second query, the second query comprising a dimension value; identify a meta-dimension of which the dimension value is a member; determine a second dimension query for each of one or more dimensions of the meta-dimension based on the second query; execute each of the second determined dimension queries to generate a respective second result set for each of the second determined dimension queries; and present a respective second visualization of each of the respective second result sets. | A system includes reception of a first query, the first query comprising a meta-facet, determination of one or more dimensions associated with the meta-facet, determination of a dimension query for each of the one or more dimensions based on the first query, execution of each of the determined dimension queries to generate a respective result set for each of the determined dimension queries, and presentation of a respective visualization of each of the respective result sets.1. A system comprising:
a memory storing processor-executable process steps; and a processor to execute the processor-executable process steps to cause the system to: receive a first query, the first query comprising a meta-facet; determine one or more dimensions associated with the meta-facet; determine a dimension query for each of the one or more dimensions based on the first query; execute each of the determined dimension queries to generate a respective result set for each of the determined dimension queries; and present a respective visualization of each of the respective result sets. 2. A system according to claim 1, the processor to further execute the processor-executable process steps to cause the system to:
receive a second query; determine that the second query does not comprise a meta-facet; execute the second query to generate a second result set; and present a second visualization of the second result set. 3. A system according to claim 1, the processor to further execute the processor-executable process steps to cause the system to:
receive a second query, the second query comprising a second meta-facet; determine a second one or more dimensions associated with the second meta-facet; determine a second dimension query for each of the second one or more dimensions based on the second query; execute each of the determined second dimension queries to generate a respective second result set for each of the determined second dimension queries; and present a respective visualization of each of the respective second result sets. 4. A system according to claim 3, the processor to further execute the processor-executable process steps to cause the system to:
receive a third query, the third query comprising a dimension value; identify a meta-dimension of which the dimension value is a member; determine a third dimension query for each of one or more dimensions of the meta-dimension based on the third query; execute each of the third determined dimension queries to generate a respective third result set for each of the third determined dimension queries; and present a respective third visualization of each of the respective third result sets. 5. A system according to claim 1, the processor to further execute the processor-executable process steps to cause the system to:
receive a second query, the second query comprising a dimension value; identify a meta-dimension of which the dimension value is a member; determine a second dimension query for each of one or more dimensions of the meta-dimension based on the second query; execute each of the second determined dimension queries to generate a respective second result set for each of the second determined dimension queries; and present a respective second visualization of each of the respective second result sets. 6. A computer-implemented method comprising:
receiving a query, the query comprising a dimension value; identifying a meta-dimension of which the dimension value is a member; determining a dimension query for each of one or more dimensions of the meta-dimension based on the query; executing each of the determined dimension queries to generate a respective result set for each of the determined dimension queries; and presenting a respective visualization of each of the respective result sets. 7. A method according to claim 6, further comprising:
receiving a second query, the second query comprising a meta-facet; determining a second one or more dimensions associated with the meta-facet; determining a second dimension query for each of the second one or more dimensions based on the second query; executing each of the determined second dimension queries to generate a respective second result set for each of the determined second dimension queries; and presenting a respective second visualization of each of the respective second result sets. 8. A method according to claim 7, further comprising:
receiving a third query; determining that the third query does not comprise a meta-facet; executing the third query to generate a third result set; and presenting a third visualization of the third result set. 9. A method according to claim 6, further comprising:
receiving a second query, the query comprising a second dimension value; identifying a second meta-dimension of which the second dimension value is a member; determining a second dimension query for each of one or more second dimensions of the second meta-dimension based on the query; executing each of the determined second dimension queries to generate a respective second result set for each of the determined second dimension queries; and presenting a respective second visualization of each of the respective second result sets. 10. A method according to claim 9, further comprising:
receiving a third query, the third query comprising a meta-facet; determining a third one or more dimensions associated with the meta-facet; determining a third dimension query for each of the third one or more dimensions based on the third query; executing each of the determined third dimension queries to generate a respective third result set for each of the determined third dimension queries; and presenting a respective third visualization of each of the respective third result sets. 11. A non-transitory computer-readable medium storing program code, the program code executable by a processor of a computing system to cause the computing system to:
receive a first query, the first query comprising a meta-facet; determine one or more dimensions associated with the meta-facet; determine a dimension query for each of the one or more dimensions based on the first query; execute each of the determined dimension queries to generate a respective result set for each of the determined dimension queries; and present a respective visualization of each of the respective result sets. 12. A medium according to claim 11, the program code further executable by a processor of a computing system to cause the computing system to:
receive a second query; determine that the second query does not comprise a meta-facet; execute the second query to generate a second result set; and present a second visualization of the second result set. 13. A medium according to claim 11, the program code further executable by a processor of a computing system to cause the computing system to:
receive a second query, the second query comprising a second meta-facet; determine a second one or more dimensions associated with the second meta-facet; determine a second dimension query for each of the second one or more dimensions based on the second query; execute each of the determined second dimension queries to generate a respective second result set for each of the determined second dimension queries; and present a respective visualization of each of the respective second result sets. 14. A medium according to claim 13, the program code further executable by a processor of a computing system to cause the computing system to:
receive a third query, the third query comprising a dimension value; identify a meta-dimension of which the dimension value is a member; determine a third dimension query for each of one or more dimensions of the meta-dimension based on the third query; execute each of the third determined dimension queries to generate a respective third result set for each of the third determined dimension queries; and present a respective third visualization of each of the respective third result sets. 15. A medium according to claim 11, the program code further executable by a processor of a computing system to cause the computing system to:
receive a second query, the second query comprising a dimension value; identify a meta-dimension of which the dimension value is a member; determine a second dimension query for each of one or more dimensions of the meta-dimension based on the second query; execute each of the second determined dimension queries to generate a respective second result set for each of the second determined dimension queries; and present a respective second visualization of each of the respective second result sets. | 2,100 |
5,785 | 5,785 | 14,672,722 | 2,181 | In one form, power consumed in transmitting data over a bus interconnect is reduced. The power is reduced by configuring a buffer that is used to store data to be transmitted over the bus interconnect as a two-dimensional (2D) buffer array having a plurality of rows and columns. The data stored in the 2D buffer array is then analyzed to determine a mode of transmitting the data that uses a least amount of power. The determined mode is used to transmit the data over the bus interconnect. | 1. A method of reducing power consumption in a bus interconnect comprising:
analyzing data stored in the a two-dimensional (2D) buffer array for transmission over the bus interconnect to determine a mode of transmitting the stored data, the determined mode being a mode using a least amount of power to transmit the stored data; and transmitting the stored data over the bus interconnect according to the determined mode. 2. The method of claim 1, wherein the determined mode includes transmitting the stored data one column at a time. 3. The method of claim 1, wherein the determined mode includes transmitting the stored data one row at a time. 4. The method of claim 1, wherein the stored data is encoded using an encoding algorithm. 5. The method of claim 1, wherein the buffer is configured as a three-dimensional (3D) buffer array having three planes, wherein the determined mode includes transmitting the stored data in the 3D buffer array from one plane of the three planes, the one plane being a plane using the least amount of power to transmit the data. 6. A circuit comprising:
a buffer for storing data; and a controller, wherein the controller:
analyzes N bits data chunks to determine a mode of transmitting the data in the buffer that uses a least amount of power; and
transmits the data in the buffer according to the determined mode. 7. The circuit of claim 6, wherein the controller configures the buffer into an N×N buffer array. 8. The circuit of claim 7, wherein the determined mode includes transmitting the data in the N×N buffer array one column at a time. 9. The circuit of claim 7, wherein the determined mode includes transmitting the data in the N×N buffer array one row at a time. 10. The circuit of claim 6, wherein analyzing the N bits data chunks includes determining whether to encode the N bits data chunks using an encoding algorithm. 11. The circuit of claim 10, wherein the N bits chunks of data is encoded using the encoding algorithm. 12. The circuit of claim 6, further comprising a control data line, wherein the controller uses the control data line to notify a receiving circuit of the determined mode of transmitting the data. 13. The circuit of claim 12, wherein a command bus comprises the control data line. 14. The circuit of claim 6, wherein the data is transmitted over an interconnect bus to a receiving circuit, wherein the buffer and the controller are included in a first integrated circuit and the receiving circuit is included in a second integrated circuit. 15. The circuit of claim 14, wherein the buffer, the controller and the receiving circuit are included in an integrated circuit. 16. The circuit of claim 6, wherein the circuit is in a data processing device. 17. The circuit of claim 6, wherein the circuit is in a memory device. 18. A circuit comprising:
a two-dimensional (2D) buffer array for storing data; a data control line; and a controller, wherein the controller:
analyzes data in the 2D buffer array to determine a mode of transmitting the data to the receiving circuit that uses a least amount of power;
transmits the data in the 2D buffer array to the receiving circuit according to the determined mode; and
notifies the receiving circuit of the determined mode of transmitting the data using the data control line. 19. The circuit of claim 18, wherein the buffer and the controller are in a first integrated circuit and the receiving circuit is in a second integrated circuit. 20. The circuit of claim 18, wherein the buffer, the controller and the receiving circuit are in an integrated circuit. 21. The method of claim 1, further comprising:
configuring a buffer as the 2D buffer array having a plurality of rows and columns; and storing data to be transmitted over the bus interconnect into the buffer. 22. The circuit of claim 6, wherein the controller further:
stores data to be transmitted in the buffer; and divides the data in the buffer into a plurality of the N bits data chunks, N being an integer. 23. The circuit of claim 18, wherein the controller further:
configures a buffer as the 2D buffer array; and stores data to be transmitted to a receiving circuit in the 2D buffer array. | In one form, power consumed in transmitting data over a bus interconnect is reduced. The power is reduced by configuring a buffer that is used to store data to be transmitted over the bus interconnect as a two-dimensional (2D) buffer array having a plurality of rows and columns. The data stored in the 2D buffer array is then analyzed to determine a mode of transmitting the data that uses a least amount of power. The determined mode is used to transmit the data over the bus interconnect.1. A method of reducing power consumption in a bus interconnect comprising:
analyzing data stored in the a two-dimensional (2D) buffer array for transmission over the bus interconnect to determine a mode of transmitting the stored data, the determined mode being a mode using a least amount of power to transmit the stored data; and transmitting the stored data over the bus interconnect according to the determined mode. 2. The method of claim 1, wherein the determined mode includes transmitting the stored data one column at a time. 3. The method of claim 1, wherein the determined mode includes transmitting the stored data one row at a time. 4. The method of claim 1, wherein the stored data is encoded using an encoding algorithm. 5. The method of claim 1, wherein the buffer is configured as a three-dimensional (3D) buffer array having three planes, wherein the determined mode includes transmitting the stored data in the 3D buffer array from one plane of the three planes, the one plane being a plane using the least amount of power to transmit the data. 6. A circuit comprising:
a buffer for storing data; and a controller, wherein the controller:
analyzes N bits data chunks to determine a mode of transmitting the data in the buffer that uses a least amount of power; and
transmits the data in the buffer according to the determined mode. 7. The circuit of claim 6, wherein the controller configures the buffer into an N×N buffer array. 8. The circuit of claim 7, wherein the determined mode includes transmitting the data in the N×N buffer array one column at a time. 9. The circuit of claim 7, wherein the determined mode includes transmitting the data in the N×N buffer array one row at a time. 10. The circuit of claim 6, wherein analyzing the N bits data chunks includes determining whether to encode the N bits data chunks using an encoding algorithm. 11. The circuit of claim 10, wherein the N bits chunks of data is encoded using the encoding algorithm. 12. The circuit of claim 6, further comprising a control data line, wherein the controller uses the control data line to notify a receiving circuit of the determined mode of transmitting the data. 13. The circuit of claim 12, wherein a command bus comprises the control data line. 14. The circuit of claim 6, wherein the data is transmitted over an interconnect bus to a receiving circuit, wherein the buffer and the controller are included in a first integrated circuit and the receiving circuit is included in a second integrated circuit. 15. The circuit of claim 14, wherein the buffer, the controller and the receiving circuit are included in an integrated circuit. 16. The circuit of claim 6, wherein the circuit is in a data processing device. 17. The circuit of claim 6, wherein the circuit is in a memory device. 18. A circuit comprising:
a two-dimensional (2D) buffer array for storing data; a data control line; and a controller, wherein the controller:
analyzes data in the 2D buffer array to determine a mode of transmitting the data to the receiving circuit that uses a least amount of power;
transmits the data in the 2D buffer array to the receiving circuit according to the determined mode; and
notifies the receiving circuit of the determined mode of transmitting the data using the data control line. 19. The circuit of claim 18, wherein the buffer and the controller are in a first integrated circuit and the receiving circuit is in a second integrated circuit. 20. The circuit of claim 18, wherein the buffer, the controller and the receiving circuit are in an integrated circuit. 21. The method of claim 1, further comprising:
configuring a buffer as the 2D buffer array having a plurality of rows and columns; and storing data to be transmitted over the bus interconnect into the buffer. 22. The circuit of claim 6, wherein the controller further:
stores data to be transmitted in the buffer; and divides the data in the buffer into a plurality of the N bits data chunks, N being an integer. 23. The circuit of claim 18, wherein the controller further:
configures a buffer as the 2D buffer array; and stores data to be transmitted to a receiving circuit in the 2D buffer array. | 2,100 |
5,786 | 5,786 | 13,121,208 | 2,128 | A testing system comprises an emulator having a simulated radio channel for communicating therethrough with the electronic device. The testing system comprises a plurality of antenna elements coupled to an emulator which forms a beam of a signal of a path of a simulated radio channel with at least two antenna elements of the plurality of antenna elements in an anechoic chamber. | 1. A method of communicating with an electronic device under test through a simulated radio channel of an emulator, the method comprising:
forming a beam of a signal of a path of a simulated radio channel with at least two antenna elements of a plurality of antenna elements coupled to an emulator in an anechoic chamber. 2. The method of claim 1, the method further comprising dividing a signal of a path of the radio channel to at least two antenna elements for a transmission beam. 3. The method of claim 1, the method further comprising receiving by the at least two antenna elements and combining signals of the at least two antenna elements for forming a reception beam of a signal of a path of a simulated radio channel. 4. The method of claim 1, the method further comprising forming different beams of different paths of the simulated radio channel at different moments of time. 5. The method of claim 1, the method further comprising forming a beam of a path of the simulated radio channel at different moments of time. 6. The method of claim 1, the method further comprising forming a plurality of different beams of different paths of the simulated radio channel at a moment of time. 7. The method of claim 1, the method further comprising searching for two antenna elements between angles of which an angle of a direction of a path is and forming the beam using the two antenna elements. 8. The method of claim 1, the method further comprising forming the beam by a group of antenna elements including an odd number of antenna elements. 9. A testing system, the testing system comprising;
an emulator having a simulated radio channel for communicating therethrough with the electronic device; and a plurality of antenna elements couplable to an emulator, the emulator being configured to form a beam of a signal of a path of a simulated radio channel with at least two antenna elements of the plurality of antenna elements in an anechoic chamber. 10. The testing system of claim 9, wherein the emulator is configured to divide a signal of a path of the radio channel to at least two antenna elements for a transmission beam. 11. The testing system of claim 9, the emulator is configured to receive by the at least two antenna elements and combining signals of the at least two antenna elements for forming a reception beam of a signal of a path of a simulated radio channel. 12. The testing system of claim 9, wherein the emulator is configured to form different beams of different paths of the simulated radio channel at different moments of time. 13. The testing system of claim 9, wherein the emulator is configured to form a beam of a path of the simulated radio channel at different moments of time. 14. The testing system of claim 9, wherein the emulator is configured to form a plurality of different beams of different paths of the simulated radio channel at a moment of time. 15. The testing system of claim 9, wherein the emulator is configured to search for two antenna elements between whose angles an angle of a direction of a path is and forming the beam using the two antenna elements. 16. The testing system of claim 9, wherein the emulator is configured to form the beam by a group of antenna elements including an odd number of antenna elements. 17. A computer program product comprising a computer program of instructions encoded thereon for executing a computer process for communicating with an electronic device under test through a simulated radio channel of an emulator, wherein the process comprises:
forming a beam of a signal of a path of a simulated radio channel with at least two antenna elements of a plurality of antenna elements coupled to an emulator in an anechoic chamber. 18. The computer program product of claim 17, the process further comprising dividing a signal of a path of the radio channel to at least two antenna elements for a transmission beam. 19. The computer program product of claim 17, the process further comprising receiving by the at least two antenna elements and combining signals of the at least two antenna elements for forming a reception beam of a signal of a path of a simulated radio channel. 20. The computer program product of claim 17, the process further comprising forming different beams of different paths of the simulated radio channel at different moments of time. 21. The computer program product of claim 17, the process further comprising forming a beam of a path of the simulated radio channel at different moments of time. 22. The computer program product of claim 17, the process further comprising forming a plurality of different beams of different paths of the simulated radio channel at a moment of time. 23. The computer program product of claim 17, the process further comprising searching for two antenna elements between whose angles an angle of a direction of a path is and forming the beam using the two antenna elements. 24. The computer program product of claim 17, the process further comprising forming the beam by a group of antenna elements including an odd number of antenna elements. 25. The computer program product of claim 17, wherein the computer program product is distributed in a distribution medium including at least one of the following media: a computer readable medium, a program storage medium, a record medium, a computer readable memory, a computer readable software distribution package, a computer readable signal, a computer readable telecommunications signal, and a computer readable compressed software package. | A testing system comprises an emulator having a simulated radio channel for communicating therethrough with the electronic device. The testing system comprises a plurality of antenna elements coupled to an emulator which forms a beam of a signal of a path of a simulated radio channel with at least two antenna elements of the plurality of antenna elements in an anechoic chamber.1. A method of communicating with an electronic device under test through a simulated radio channel of an emulator, the method comprising:
forming a beam of a signal of a path of a simulated radio channel with at least two antenna elements of a plurality of antenna elements coupled to an emulator in an anechoic chamber. 2. The method of claim 1, the method further comprising dividing a signal of a path of the radio channel to at least two antenna elements for a transmission beam. 3. The method of claim 1, the method further comprising receiving by the at least two antenna elements and combining signals of the at least two antenna elements for forming a reception beam of a signal of a path of a simulated radio channel. 4. The method of claim 1, the method further comprising forming different beams of different paths of the simulated radio channel at different moments of time. 5. The method of claim 1, the method further comprising forming a beam of a path of the simulated radio channel at different moments of time. 6. The method of claim 1, the method further comprising forming a plurality of different beams of different paths of the simulated radio channel at a moment of time. 7. The method of claim 1, the method further comprising searching for two antenna elements between angles of which an angle of a direction of a path is and forming the beam using the two antenna elements. 8. The method of claim 1, the method further comprising forming the beam by a group of antenna elements including an odd number of antenna elements. 9. A testing system, the testing system comprising;
an emulator having a simulated radio channel for communicating therethrough with the electronic device; and a plurality of antenna elements couplable to an emulator, the emulator being configured to form a beam of a signal of a path of a simulated radio channel with at least two antenna elements of the plurality of antenna elements in an anechoic chamber. 10. The testing system of claim 9, wherein the emulator is configured to divide a signal of a path of the radio channel to at least two antenna elements for a transmission beam. 11. The testing system of claim 9, the emulator is configured to receive by the at least two antenna elements and combining signals of the at least two antenna elements for forming a reception beam of a signal of a path of a simulated radio channel. 12. The testing system of claim 9, wherein the emulator is configured to form different beams of different paths of the simulated radio channel at different moments of time. 13. The testing system of claim 9, wherein the emulator is configured to form a beam of a path of the simulated radio channel at different moments of time. 14. The testing system of claim 9, wherein the emulator is configured to form a plurality of different beams of different paths of the simulated radio channel at a moment of time. 15. The testing system of claim 9, wherein the emulator is configured to search for two antenna elements between whose angles an angle of a direction of a path is and forming the beam using the two antenna elements. 16. The testing system of claim 9, wherein the emulator is configured to form the beam by a group of antenna elements including an odd number of antenna elements. 17. A computer program product comprising a computer program of instructions encoded thereon for executing a computer process for communicating with an electronic device under test through a simulated radio channel of an emulator, wherein the process comprises:
forming a beam of a signal of a path of a simulated radio channel with at least two antenna elements of a plurality of antenna elements coupled to an emulator in an anechoic chamber. 18. The computer program product of claim 17, the process further comprising dividing a signal of a path of the radio channel to at least two antenna elements for a transmission beam. 19. The computer program product of claim 17, the process further comprising receiving by the at least two antenna elements and combining signals of the at least two antenna elements for forming a reception beam of a signal of a path of a simulated radio channel. 20. The computer program product of claim 17, the process further comprising forming different beams of different paths of the simulated radio channel at different moments of time. 21. The computer program product of claim 17, the process further comprising forming a beam of a path of the simulated radio channel at different moments of time. 22. The computer program product of claim 17, the process further comprising forming a plurality of different beams of different paths of the simulated radio channel at a moment of time. 23. The computer program product of claim 17, the process further comprising searching for two antenna elements between whose angles an angle of a direction of a path is and forming the beam using the two antenna elements. 24. The computer program product of claim 17, the process further comprising forming the beam by a group of antenna elements including an odd number of antenna elements. 25. The computer program product of claim 17, wherein the computer program product is distributed in a distribution medium including at least one of the following media: a computer readable medium, a program storage medium, a record medium, a computer readable memory, a computer readable software distribution package, a computer readable signal, a computer readable telecommunications signal, and a computer readable compressed software package. | 2,100 |
5,787 | 5,787 | 15,439,333 | 2,191 | A mechanism is provided for managing problems in a software product installed on a plurality of computing machines. Tracking information of one or more problems being solved on corresponding ones of the plurality of computing machines is received. One or more solution models are established according to the tracking information. Corresponding diagnostic reports are collected from the computing machines according to the solution models, the diagnostic report of each computing machine indicating of any of the problems of the solution models occurring on the computing machine and a set of collected values of any diagnostic parameters of the solution models available on the computing machine. A determination is made of any applicable solutions for each of the computing machines according to a comparison of the diagnostic report of the computing machine with the solution models. Each of the plurality of computing machines then applies the corresponding applicable solutions. | 1. A method for managing problems in a software product installed on a plurality of computing machines, wherein the method comprises:
retrieving tracking information of one or more problems being solved on corresponding ones of the plurality of computing machines, for each of the one or more problems the tracking information comprising an indication of a solution applied to the problem on the corresponding computing machine and a set of tracking values of one or more diagnostic parameters of the corresponding computing machine; establishing one or more solution models according to the tracking information, each solution model comprising an indication of a applied solution, an indication of a problem the solution was applied to, and one of the set of tracking values of the diagnostic parameters of the problem; collecting corresponding diagnostic reports from the computing machines according to the solution models, the diagnostic report of each computing machine comprising an indication of any of the problems of the solution models occurred on the computing machine and a set of collected values of any diagnostic parameters of the solution models available on the computing machine; determining any applicable solutions from the solutions of the solution models for each of the computing machines according to a comparison of the diagnostic report of the computing machine with the solution models; and causing each computing machine to apply the corresponding applicable solutions. 2. The method of claim 1, further comprising:
retrieving the tracking information further comprising a set of tracking values of one or more environment parameters of the corresponding computing machine for each of the problems; establishing the solution models each one to further comprise the corresponding sets of tracking values of the environment parameters; and collecting the diagnostic report from each of the computing machines by filtering the solution models according to a match of a set of collected values of the environment parameters of the solution models available on the computing machine with the set of tracking values of the environment parameters. 3. The method of claim 1, wherein the diagnostic parameters comprise one or more configuration parameters of the corresponding computing machine and/or an indication of one or more local events occurred on the corresponding computing machine. 4. The method of claim 1, wherein the determining of any applicable solutions further comprises, for each computing machine:
determining any completely-matched solution models of the solution models having the problem and the set of tracking values of the diagnostic parameters matched by the diagnostic report of the computing machine; and determining one of the applicable solutions, for each of the problems of the completely-matched solution models comprised in a single one of the completely-matched solution models, equal to the solution of the single completely-matched solution model. 5. The method of claim 4, wherein the determining of any applicable solutions further comprises, for each computing machine:
determining a further one of the applicable solutions, for each of the problems of the completely-matched solution models comprised in multiple ones of the completely-matched solution models, equal to the solution of a selected one of the multiple completely-matched solution models. 6. The method of claim 5, further comprising:
assigning a weight to each of the solution models according to occurrences thereof in the tracking information, wherein the determining of the further one of the applicable solutions comprises:
selecting one of the multiple completely-matched solution models for each of the problems according to the corresponding weights. 7. The method of claim 1, further comprising:
excluding each of the solution models from application on each of the computing machines in response to at least one further occurrence of the problem of the solution model on the computing machine after the application of the solution of the solution model on the computing machine. 8. The method of claim 7, wherein the excluding of each of the solution models comprises:
detecting each of the at least one further occurrence of the problem of the solution model in response to the solution model having the problem matched by the diagnostic report of the computing machine. 9. The method of claim 7, further comprising:
causing each computing machine to reverse the application of each of the applicable solutions in response to the exclusion of the solution model of the applicable solution from application on the computing machine. 10. The method of claim 1, wherein the determining of any applicable solutions further comprises, for each computing machine:
determining any partially-matched solution models of the solution models having the set of tracking values of the configuration parameters matched by the diagnostic report of the computing machine; and setting at least one of the solutions of the partially-matched solution models as one of the applicable solutions. 11. The method of claim 10, further comprising:
assigning a weight to each of the solution models according to occurrences thereof in the tracking information, wherein the setting of the at least one of the solutions comprises:
setting at least one of the solutions of the partially-matched solution models as one of the applicable solutions according to the corresponding weights. 12. The method according to claim 11, wherein said setting at least one of the solutions comprises:
consolidating the weights of the partially-matched solution models by the solutions, and setting at least one of the solutions of the partially-matched solution models as one of the applicable solutions according to the corresponding consolidated weights. 13. The method according to claim 1, wherein the method comprises:
receiving corresponding manual validations of the solution models; learning one or more validation rules according to the manual validations; and validating each solution model according to the validation rules. 14. A computer program product comprising a computer readable storage medium having a computer readable program for managing problems in a software product installed on a plurality of computing machines stored therein, wherein the computer readable program, when executed on a computing device, causes the computing device to:
retrieve tracking information of one or more problems being solved on corresponding ones of the plurality of computing machines, for each of the one or more problems the tracking information comprising an indication of a solution applied to the problem on the corresponding computing machine and a set of tracking values of one or more diagnostic parameters of the corresponding computing machine; establish one or more solution models according to the tracking information, each solution model comprising an indication of a applied solution, an indication of a problem the solution was applied to, and one of the set of tracking values of the diagnostic parameters of the problem; collect corresponding diagnostic reports from the computing machines according to the solution models, the diagnostic report of each computing machine comprising an indication of any of the problems of the solution models occurred on the computing machine and a set of collected values of any diagnostic parameters of the solution models available on the computing machine; determine any applicable solutions from the solutions of the solution models for each of the computing machines according to a comparison of the diagnostic report of the computing machine with the solution models; and cause each computing machine to apply the corresponding applicable solutions. 15. The computer program product of claim 14, wherein the computer readable program further causes the computing device to:
retrieve the tracking information further comprising a set of tracking values of one or more environment parameters of the corresponding computing machine for each of the problems; establish the solution models each one to further comprise the corresponding sets of tracking values of the environment parameters; and collect the diagnostic report from each of the computing machines by filtering the solution models according to a match of a set of collected values of the environment parameters of the solution models available on the computing machine with the set of tracking values of the environment parameters. 16. The computer program product of claim 14, wherein the computer readable program for determining of any applicable solutions further causes the computing device to, for each computing machine:
determine any completely-matched solution models of the solution models having the problem and the set of tracking values of the diagnostic parameters matched by the diagnostic report of the computing machine; and determine one of the applicable solutions, for each of the problems of the completely-matched solution models comprised in a single one of the completely-matched solution models, equal to the solution of the single completely-matched solution model. 17. The computer program product of claim 14, wherein the computer readable program further causes the computing device to:
exclude each of the solution models from application on each of the computing machines in response to at least one further occurrence of the problem of the solution model on the computing machine after the application of the solution of the solution model on the computing machine. 18. The computer program product of claim 14, wherein the computer readable program for determining of any applicable solutions further causes the computing device to, for each computing machine:
determine any partially-matched solution models of the solution models having the set of tracking values of the configuration parameters matched by the diagnostic report of the computing machine; and set at least one of the solutions of the partially-matched solution models as one of the applicable solutions. 19. The computer program product of claim 14, wherein the computer readable program further causes the computing device to:
receive corresponding manual validations of the solution models; learn one or more validation rules according to the manual validations; and validate each solution model according to the validation rules. 20. An apparatus for managing problems in a software product installed on a plurality of computing machines 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: retrieve tracking information of one or more problems being solved on corresponding ones of the plurality of computing machines, for each of the one or more problems the tracking information comprising an indication of a solution applied to the problem on the corresponding computing machine and a set of tracking values of one or more diagnostic parameters of the corresponding computing machine; establish one or more solution models according to the tracking information, each solution model comprising an indication of a applied solution, an indication of a problem the solution was applied to, and one of the set of tracking values of the diagnostic parameters of the problem; collect corresponding diagnostic reports from the computing machines according to the solution models, the diagnostic report of each computing machine comprising an indication of any of the problems of the solution models occurred on the computing machine and a set of collected values of any diagnostic parameters of the solution models available on the computing machine; determine any applicable solutions from the solutions of the solution models for each of the computing machines according to a comparison of the diagnostic report of the computing machine with the solution models; and cause each computing machine to apply the corresponding applicable solutions. | A mechanism is provided for managing problems in a software product installed on a plurality of computing machines. Tracking information of one or more problems being solved on corresponding ones of the plurality of computing machines is received. One or more solution models are established according to the tracking information. Corresponding diagnostic reports are collected from the computing machines according to the solution models, the diagnostic report of each computing machine indicating of any of the problems of the solution models occurring on the computing machine and a set of collected values of any diagnostic parameters of the solution models available on the computing machine. A determination is made of any applicable solutions for each of the computing machines according to a comparison of the diagnostic report of the computing machine with the solution models. Each of the plurality of computing machines then applies the corresponding applicable solutions.1. A method for managing problems in a software product installed on a plurality of computing machines, wherein the method comprises:
retrieving tracking information of one or more problems being solved on corresponding ones of the plurality of computing machines, for each of the one or more problems the tracking information comprising an indication of a solution applied to the problem on the corresponding computing machine and a set of tracking values of one or more diagnostic parameters of the corresponding computing machine; establishing one or more solution models according to the tracking information, each solution model comprising an indication of a applied solution, an indication of a problem the solution was applied to, and one of the set of tracking values of the diagnostic parameters of the problem; collecting corresponding diagnostic reports from the computing machines according to the solution models, the diagnostic report of each computing machine comprising an indication of any of the problems of the solution models occurred on the computing machine and a set of collected values of any diagnostic parameters of the solution models available on the computing machine; determining any applicable solutions from the solutions of the solution models for each of the computing machines according to a comparison of the diagnostic report of the computing machine with the solution models; and causing each computing machine to apply the corresponding applicable solutions. 2. The method of claim 1, further comprising:
retrieving the tracking information further comprising a set of tracking values of one or more environment parameters of the corresponding computing machine for each of the problems; establishing the solution models each one to further comprise the corresponding sets of tracking values of the environment parameters; and collecting the diagnostic report from each of the computing machines by filtering the solution models according to a match of a set of collected values of the environment parameters of the solution models available on the computing machine with the set of tracking values of the environment parameters. 3. The method of claim 1, wherein the diagnostic parameters comprise one or more configuration parameters of the corresponding computing machine and/or an indication of one or more local events occurred on the corresponding computing machine. 4. The method of claim 1, wherein the determining of any applicable solutions further comprises, for each computing machine:
determining any completely-matched solution models of the solution models having the problem and the set of tracking values of the diagnostic parameters matched by the diagnostic report of the computing machine; and determining one of the applicable solutions, for each of the problems of the completely-matched solution models comprised in a single one of the completely-matched solution models, equal to the solution of the single completely-matched solution model. 5. The method of claim 4, wherein the determining of any applicable solutions further comprises, for each computing machine:
determining a further one of the applicable solutions, for each of the problems of the completely-matched solution models comprised in multiple ones of the completely-matched solution models, equal to the solution of a selected one of the multiple completely-matched solution models. 6. The method of claim 5, further comprising:
assigning a weight to each of the solution models according to occurrences thereof in the tracking information, wherein the determining of the further one of the applicable solutions comprises:
selecting one of the multiple completely-matched solution models for each of the problems according to the corresponding weights. 7. The method of claim 1, further comprising:
excluding each of the solution models from application on each of the computing machines in response to at least one further occurrence of the problem of the solution model on the computing machine after the application of the solution of the solution model on the computing machine. 8. The method of claim 7, wherein the excluding of each of the solution models comprises:
detecting each of the at least one further occurrence of the problem of the solution model in response to the solution model having the problem matched by the diagnostic report of the computing machine. 9. The method of claim 7, further comprising:
causing each computing machine to reverse the application of each of the applicable solutions in response to the exclusion of the solution model of the applicable solution from application on the computing machine. 10. The method of claim 1, wherein the determining of any applicable solutions further comprises, for each computing machine:
determining any partially-matched solution models of the solution models having the set of tracking values of the configuration parameters matched by the diagnostic report of the computing machine; and setting at least one of the solutions of the partially-matched solution models as one of the applicable solutions. 11. The method of claim 10, further comprising:
assigning a weight to each of the solution models according to occurrences thereof in the tracking information, wherein the setting of the at least one of the solutions comprises:
setting at least one of the solutions of the partially-matched solution models as one of the applicable solutions according to the corresponding weights. 12. The method according to claim 11, wherein said setting at least one of the solutions comprises:
consolidating the weights of the partially-matched solution models by the solutions, and setting at least one of the solutions of the partially-matched solution models as one of the applicable solutions according to the corresponding consolidated weights. 13. The method according to claim 1, wherein the method comprises:
receiving corresponding manual validations of the solution models; learning one or more validation rules according to the manual validations; and validating each solution model according to the validation rules. 14. A computer program product comprising a computer readable storage medium having a computer readable program for managing problems in a software product installed on a plurality of computing machines stored therein, wherein the computer readable program, when executed on a computing device, causes the computing device to:
retrieve tracking information of one or more problems being solved on corresponding ones of the plurality of computing machines, for each of the one or more problems the tracking information comprising an indication of a solution applied to the problem on the corresponding computing machine and a set of tracking values of one or more diagnostic parameters of the corresponding computing machine; establish one or more solution models according to the tracking information, each solution model comprising an indication of a applied solution, an indication of a problem the solution was applied to, and one of the set of tracking values of the diagnostic parameters of the problem; collect corresponding diagnostic reports from the computing machines according to the solution models, the diagnostic report of each computing machine comprising an indication of any of the problems of the solution models occurred on the computing machine and a set of collected values of any diagnostic parameters of the solution models available on the computing machine; determine any applicable solutions from the solutions of the solution models for each of the computing machines according to a comparison of the diagnostic report of the computing machine with the solution models; and cause each computing machine to apply the corresponding applicable solutions. 15. The computer program product of claim 14, wherein the computer readable program further causes the computing device to:
retrieve the tracking information further comprising a set of tracking values of one or more environment parameters of the corresponding computing machine for each of the problems; establish the solution models each one to further comprise the corresponding sets of tracking values of the environment parameters; and collect the diagnostic report from each of the computing machines by filtering the solution models according to a match of a set of collected values of the environment parameters of the solution models available on the computing machine with the set of tracking values of the environment parameters. 16. The computer program product of claim 14, wherein the computer readable program for determining of any applicable solutions further causes the computing device to, for each computing machine:
determine any completely-matched solution models of the solution models having the problem and the set of tracking values of the diagnostic parameters matched by the diagnostic report of the computing machine; and determine one of the applicable solutions, for each of the problems of the completely-matched solution models comprised in a single one of the completely-matched solution models, equal to the solution of the single completely-matched solution model. 17. The computer program product of claim 14, wherein the computer readable program further causes the computing device to:
exclude each of the solution models from application on each of the computing machines in response to at least one further occurrence of the problem of the solution model on the computing machine after the application of the solution of the solution model on the computing machine. 18. The computer program product of claim 14, wherein the computer readable program for determining of any applicable solutions further causes the computing device to, for each computing machine:
determine any partially-matched solution models of the solution models having the set of tracking values of the configuration parameters matched by the diagnostic report of the computing machine; and set at least one of the solutions of the partially-matched solution models as one of the applicable solutions. 19. The computer program product of claim 14, wherein the computer readable program further causes the computing device to:
receive corresponding manual validations of the solution models; learn one or more validation rules according to the manual validations; and validate each solution model according to the validation rules. 20. An apparatus for managing problems in a software product installed on a plurality of computing machines 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: retrieve tracking information of one or more problems being solved on corresponding ones of the plurality of computing machines, for each of the one or more problems the tracking information comprising an indication of a solution applied to the problem on the corresponding computing machine and a set of tracking values of one or more diagnostic parameters of the corresponding computing machine; establish one or more solution models according to the tracking information, each solution model comprising an indication of a applied solution, an indication of a problem the solution was applied to, and one of the set of tracking values of the diagnostic parameters of the problem; collect corresponding diagnostic reports from the computing machines according to the solution models, the diagnostic report of each computing machine comprising an indication of any of the problems of the solution models occurred on the computing machine and a set of collected values of any diagnostic parameters of the solution models available on the computing machine; determine any applicable solutions from the solutions of the solution models for each of the computing machines according to a comparison of the diagnostic report of the computing machine with the solution models; and cause each computing machine to apply the corresponding applicable solutions. | 2,100 |
5,788 | 5,788 | 14,871,707 | 2,176 | Embodiments of the present disclosure relate to generating adaptive grid layouts, for example, for webpages or application pages (i.e., content pages). In this regard, a content page with a grid layout can adapt its presentation, including various properties of its grid layout, for various displaying devices having different characteristics. As such, the content page is presented to users with a suitable layout even while presented via various display devices. In implementation, breakpoints are used to delineate different screen sizes or ranges of screen sizes. The grid layout can be rendered differently in association with different breakpoints. | 1. A computer-implemented method, comprising:
receiving, from a requesting device, a request for a content page; generating a grid layout for hosting at least one component of the content page, the grid layout being associated with a plurality of breakpoints and having mutable columns that are mutable based on one of the plurality of breakpoints that corresponds with the requesting device; obtaining the at least one component for the content page; and providing the content page with the grid layout and the at least one component to the requesting device. 2. The method of claim 1, wherein the grid layout comprises a nested grid in the grid layout, the nested grid inheriting at least a property associated with the mutable columns. 3. The method of claim 1, wherein the one of the plurality of breakpoints corresponds with a first number of columns for the grid layout and another of the plurality of breakpoints corresponds with a second number of columns that is different from the first number of columns. 4. The method of claim 1, wherein the plurality of breakpoints represent a plurality of display settings. 5. The method of claim 1, wherein the obtaining further comprises obtaining a number of columns occupied by the at least one component, the number of columns corresponding to the one of the plurality of breakpoints. 6. The method of claim 1, wherein an indication of a relative position of one of the at least one components among a plurality of components to be displayed on the grid layout is provided with the grid layout. 7. The method of claim 1, wherein an indication to prevent one of the at least one components from being displayed on the grid layout or an indication to display one of the at least one components on a new line of the grid layout is provided with the grid layout. 8. The method of claim 1, wherein the providing comprises providing a style sheet to enable the requesting device to render the content page based on the one of the plurality of breakpoints and the grid layout. 9. A system, comprising:
a networking interface to receive a request for a content page; a content manager, coupled to the networking interface, to retrieve a plurality of components for the content page based on the request; and a layout manager, coupled to the content manager and the networking interface, to provide a grid layout associated with a plurality of breakpoints and mutable columns that are mutable based on a selected one of the plurality of breakpoints, to host the plurality of components. 10. The system of claim 9, wherein the content manager further retrieves a number of columns occupied by a component of the plurality of components associated with the selected one of the plurality of breakpoints. 11. The system of claim 9, wherein the layout manager further provides a nested grid layout, nested in the grid layout, the nested grid layout inheriting at least a property associated with the mutable columns. 12. The system of claim 9, wherein the layout manager further provides a relative position of a component among the plurality of components to be displayed on the grid layout. 13. The system of claim 9, wherein the layout manager further provides an indication to prevent a component among the plurality of components from being displayed on the grid layout for the selected one of the plurality of breakpoints. 14. The system of claim 9, wherein the layout manager further provides an indication to force a component among the plurality of components to be displayed on a new line on the grid layout for the selected one of the plurality of breakpoints. 15. A computer-implemented method, comprising:
receiving, from a requesting device, a request to modify a grid layout in a content page; parsing an intended modification of the grid layout corresponding with a selected breakpoint from the request; and updating a resource node with the intended modification under the selected breakpoint. 16. The method of claim 15, further comprising:
parsing, from the request, an intended number of columns occupied by a component under the selected breakpoint on the grid layout from the request; and updating the resource node with the intended number of columns occupied by the component under the selected breakpoint. 17. The method of claim 15, further comprising:
parsing, from the request, an intended number of columns associated with the selected breakpoint inside the grid layout; and updating the resource node with the intended number of columns associated with the selected breakpoint. 18. The method of claim 15, further comprising:
parsing, from the request, a plurality of characteristics of a nested grid inside the grid layout; and updating the resource node with the nested grid. 19. The method of claim 15, further comprising:
parsing, from the request, a relative position of a component among a plurality of components to be displayed on the grid layout associated with the selected breakpoint; and updating the resource node associated with the selected breakpoint with the relative position of the component. 20. The method of claim 15, further comprising:
parsing, from the request, a first indication, associated with the selected breakpoint, for preventing the component from being displayed on the grid layout, or a second indication, associated with the selected breakpoint, to force the component to be displayed on a new line on the grid layout; and updating the resource node with the first or second indication. | Embodiments of the present disclosure relate to generating adaptive grid layouts, for example, for webpages or application pages (i.e., content pages). In this regard, a content page with a grid layout can adapt its presentation, including various properties of its grid layout, for various displaying devices having different characteristics. As such, the content page is presented to users with a suitable layout even while presented via various display devices. In implementation, breakpoints are used to delineate different screen sizes or ranges of screen sizes. The grid layout can be rendered differently in association with different breakpoints.1. A computer-implemented method, comprising:
receiving, from a requesting device, a request for a content page; generating a grid layout for hosting at least one component of the content page, the grid layout being associated with a plurality of breakpoints and having mutable columns that are mutable based on one of the plurality of breakpoints that corresponds with the requesting device; obtaining the at least one component for the content page; and providing the content page with the grid layout and the at least one component to the requesting device. 2. The method of claim 1, wherein the grid layout comprises a nested grid in the grid layout, the nested grid inheriting at least a property associated with the mutable columns. 3. The method of claim 1, wherein the one of the plurality of breakpoints corresponds with a first number of columns for the grid layout and another of the plurality of breakpoints corresponds with a second number of columns that is different from the first number of columns. 4. The method of claim 1, wherein the plurality of breakpoints represent a plurality of display settings. 5. The method of claim 1, wherein the obtaining further comprises obtaining a number of columns occupied by the at least one component, the number of columns corresponding to the one of the plurality of breakpoints. 6. The method of claim 1, wherein an indication of a relative position of one of the at least one components among a plurality of components to be displayed on the grid layout is provided with the grid layout. 7. The method of claim 1, wherein an indication to prevent one of the at least one components from being displayed on the grid layout or an indication to display one of the at least one components on a new line of the grid layout is provided with the grid layout. 8. The method of claim 1, wherein the providing comprises providing a style sheet to enable the requesting device to render the content page based on the one of the plurality of breakpoints and the grid layout. 9. A system, comprising:
a networking interface to receive a request for a content page; a content manager, coupled to the networking interface, to retrieve a plurality of components for the content page based on the request; and a layout manager, coupled to the content manager and the networking interface, to provide a grid layout associated with a plurality of breakpoints and mutable columns that are mutable based on a selected one of the plurality of breakpoints, to host the plurality of components. 10. The system of claim 9, wherein the content manager further retrieves a number of columns occupied by a component of the plurality of components associated with the selected one of the plurality of breakpoints. 11. The system of claim 9, wherein the layout manager further provides a nested grid layout, nested in the grid layout, the nested grid layout inheriting at least a property associated with the mutable columns. 12. The system of claim 9, wherein the layout manager further provides a relative position of a component among the plurality of components to be displayed on the grid layout. 13. The system of claim 9, wherein the layout manager further provides an indication to prevent a component among the plurality of components from being displayed on the grid layout for the selected one of the plurality of breakpoints. 14. The system of claim 9, wherein the layout manager further provides an indication to force a component among the plurality of components to be displayed on a new line on the grid layout for the selected one of the plurality of breakpoints. 15. A computer-implemented method, comprising:
receiving, from a requesting device, a request to modify a grid layout in a content page; parsing an intended modification of the grid layout corresponding with a selected breakpoint from the request; and updating a resource node with the intended modification under the selected breakpoint. 16. The method of claim 15, further comprising:
parsing, from the request, an intended number of columns occupied by a component under the selected breakpoint on the grid layout from the request; and updating the resource node with the intended number of columns occupied by the component under the selected breakpoint. 17. The method of claim 15, further comprising:
parsing, from the request, an intended number of columns associated with the selected breakpoint inside the grid layout; and updating the resource node with the intended number of columns associated with the selected breakpoint. 18. The method of claim 15, further comprising:
parsing, from the request, a plurality of characteristics of a nested grid inside the grid layout; and updating the resource node with the nested grid. 19. The method of claim 15, further comprising:
parsing, from the request, a relative position of a component among a plurality of components to be displayed on the grid layout associated with the selected breakpoint; and updating the resource node associated with the selected breakpoint with the relative position of the component. 20. The method of claim 15, further comprising:
parsing, from the request, a first indication, associated with the selected breakpoint, for preventing the component from being displayed on the grid layout, or a second indication, associated with the selected breakpoint, to force the component to be displayed on a new line on the grid layout; and updating the resource node with the first or second indication. | 2,100 |
5,789 | 5,789 | 14,709,333 | 2,145 | The disclosure reveals a system and approach for remote health monitoring and diagnostics of room controllers, networks and devices. A master room controller may be used to open a system health page or a diagnostic page for other controllers. A system health page may provide an overview of virtually all of the other room controllers. A tool of the present system may be used to trouble shoot issues remotely at another room controller in lieu of doing a visit to the respective room controller. A user may navigate from the system health page to virtually any place on the room controller to diagnose issues. The navigation may be done by hyper linking from the system health page. The healthy controllers may be hidden from the page so that the unhealthy systems can be viewed in one shot. | 1. A system for remote room controller monitoring, comprising:
one or more remote room controllers; a master room controller connected to the one or more remote room controllers; and a user interface connected to the master room controller; and wherein: the user interface is used to obtain an at-a-glance overview of system-wide issues to provide an at-a-glance overview of a system-wide health status of the one or more remote room controllers; the user interface is used to obtain a diagnostics page corresponding to a selected remote room controller; and the user interface is used to pull up a tool to remotely troubleshoot issues of the selected remote room controller in accordance with issues indicated in the diagnostics page corresponding to the selected remote room controller. 2. The system of claim 1, wherein the user interface is used to go to a website to get the at-a-glance overview of system-wide issues and go to the website to troubleshoot any issues as indicated in the at-a-glance overview of system-wide issues in the one or more remote room controllers. 3. The system of claim 2, wherein the system health summary screen reveals the at-a-glance overview of system-wide issues to indicate health of each remote room controller for helping a technician to remotely check one or more health items of each remote room controller. 4. The system of claim 1, wherein the one or more health items are selected from a group consisting of a status of an application control engine, a status of one or more networks in the application control engine, a status of devices in the one or more networks, and a hyperlink of the application control engine to allow a user to navigate to a diagnostics screen of the application control engine, mode, errors, or alarm conditions. 5. The system of claim 1, wherein the system is launched from a health page for a remote room controller from a workbench at the master room controller. 6. The system of claim 5, wherein the health page comprises one or more remote room controllers with overall health indicators remote room controller health, network health, and device health. 7. The system of claim 6, wherein the system health page incorporates a link to a diagnostics page for each remote room controller in a table. 8. The system of claim 7, wherein upon clicking the link, the diagnostics page for selected remote room controller health, network health and/or a device health comes up on the display. 9. The system of claim 8, wherein the remote room controller health on the diagnostics page revealed on the display comprises one or more details selected from a group consisting of central processing unit usage, memory usage, heap usage and resources. 10. The system of claim 8, wherein the display shows a list of devices connected to one or more networks having a health indicator and details of one or more devices on the list with alarm and error details. 11. The system of claim 8, wherein the display shows details of the one or more networks. 12. The system of claim 1, wherein:
the mode, error and alarm details for a device may highlighted with an indicator for showing a first, second or third color; the first color indicates that something is wrong and one or more of the conditions exceed a threshold; the second color indicates that a connection has not been established; and the third color indicates a healthy condition. 13. A method for health monitoring and diagnosis, comprising:
developing a diagnostics page for one or more remote room controllers; clicking on a link to obtain for one or more remote room controllers the diagnostics page on a display of a processor; developing a tool for troubleshooting an issue with a device of the one or more remote room controllers; and entering into a system to get to a health page incorporating one or more remote room controllers having overall health indicators; and wherein the diagnostics page shows the remote room controllers having overall health indicators. 14. The method of claim 13, wherein the overall health indicators reveal a health of one or more items of a group consisting of remote room controllers, networks, and devices. 15. The method of claim 13, wherein the diagnostics page is for a selected remote room controller. 16. The method of claim 15, wherein the diagnostics page comprises details of remote room controller health, network health and device health for a selected remote room controller. 17. The method of claim 16, wherein details of the remote room controller health incorporate one or more items of a group consisting of central computing unit usage, memory usage, heap usage and resource details. 18. The method of claim 16, wherein a list of devices is connected to one or more networks with a health indicator and additional details of a selected device with mode, alarm and error details displayed. 19. A system having monitoring and diagnostics comprising:
one or more remote room controllers; a master room controller connected to the one or more remote room controllers; and a display with an input mechanism connected to the master room controller; and wherein the master room controller comprises:
an application to develop a remote room controller health page and a diagnostic page; and
a tool to remotely troubleshoot issues based on the diagnostics page of a device at a remote room controller. 20. The system of claim 19, wherein the display can show a screen that provides a system-wide health status of the one or more remote controllers. 21. The system of claim 20, wherein each of the one or more remote room controllers comprises one or more items selected from a group consisting of an application control engine, networks connected to and in the application control engine, and a hyperlink of the application control engine to allow a user to navigate to a detailed diagnostics screen of the application control engine, modes, errors, or alarm conditions. 22. The system of claim 21, wherein:
a user can remotely check one or more items of a group consisting of the application control engine, networks in the application control engine, and the hyperlink of the application control engine of the application control engine to allow a user to navigate to the detailed diagnostics screen of the application control engine, modes, errors, or alarm conditions; each of the one or more remote room controllers has a unique internet protocol address; a user can use an internet protocol address at the master room controller to open a system health page or a diagnostics page for a remote room controller having the internet protocol address; and the user can troubleshoot a device having a property issue spotted with the diagnostics page. | The disclosure reveals a system and approach for remote health monitoring and diagnostics of room controllers, networks and devices. A master room controller may be used to open a system health page or a diagnostic page for other controllers. A system health page may provide an overview of virtually all of the other room controllers. A tool of the present system may be used to trouble shoot issues remotely at another room controller in lieu of doing a visit to the respective room controller. A user may navigate from the system health page to virtually any place on the room controller to diagnose issues. The navigation may be done by hyper linking from the system health page. The healthy controllers may be hidden from the page so that the unhealthy systems can be viewed in one shot.1. A system for remote room controller monitoring, comprising:
one or more remote room controllers; a master room controller connected to the one or more remote room controllers; and a user interface connected to the master room controller; and wherein: the user interface is used to obtain an at-a-glance overview of system-wide issues to provide an at-a-glance overview of a system-wide health status of the one or more remote room controllers; the user interface is used to obtain a diagnostics page corresponding to a selected remote room controller; and the user interface is used to pull up a tool to remotely troubleshoot issues of the selected remote room controller in accordance with issues indicated in the diagnostics page corresponding to the selected remote room controller. 2. The system of claim 1, wherein the user interface is used to go to a website to get the at-a-glance overview of system-wide issues and go to the website to troubleshoot any issues as indicated in the at-a-glance overview of system-wide issues in the one or more remote room controllers. 3. The system of claim 2, wherein the system health summary screen reveals the at-a-glance overview of system-wide issues to indicate health of each remote room controller for helping a technician to remotely check one or more health items of each remote room controller. 4. The system of claim 1, wherein the one or more health items are selected from a group consisting of a status of an application control engine, a status of one or more networks in the application control engine, a status of devices in the one or more networks, and a hyperlink of the application control engine to allow a user to navigate to a diagnostics screen of the application control engine, mode, errors, or alarm conditions. 5. The system of claim 1, wherein the system is launched from a health page for a remote room controller from a workbench at the master room controller. 6. The system of claim 5, wherein the health page comprises one or more remote room controllers with overall health indicators remote room controller health, network health, and device health. 7. The system of claim 6, wherein the system health page incorporates a link to a diagnostics page for each remote room controller in a table. 8. The system of claim 7, wherein upon clicking the link, the diagnostics page for selected remote room controller health, network health and/or a device health comes up on the display. 9. The system of claim 8, wherein the remote room controller health on the diagnostics page revealed on the display comprises one or more details selected from a group consisting of central processing unit usage, memory usage, heap usage and resources. 10. The system of claim 8, wherein the display shows a list of devices connected to one or more networks having a health indicator and details of one or more devices on the list with alarm and error details. 11. The system of claim 8, wherein the display shows details of the one or more networks. 12. The system of claim 1, wherein:
the mode, error and alarm details for a device may highlighted with an indicator for showing a first, second or third color; the first color indicates that something is wrong and one or more of the conditions exceed a threshold; the second color indicates that a connection has not been established; and the third color indicates a healthy condition. 13. A method for health monitoring and diagnosis, comprising:
developing a diagnostics page for one or more remote room controllers; clicking on a link to obtain for one or more remote room controllers the diagnostics page on a display of a processor; developing a tool for troubleshooting an issue with a device of the one or more remote room controllers; and entering into a system to get to a health page incorporating one or more remote room controllers having overall health indicators; and wherein the diagnostics page shows the remote room controllers having overall health indicators. 14. The method of claim 13, wherein the overall health indicators reveal a health of one or more items of a group consisting of remote room controllers, networks, and devices. 15. The method of claim 13, wherein the diagnostics page is for a selected remote room controller. 16. The method of claim 15, wherein the diagnostics page comprises details of remote room controller health, network health and device health for a selected remote room controller. 17. The method of claim 16, wherein details of the remote room controller health incorporate one or more items of a group consisting of central computing unit usage, memory usage, heap usage and resource details. 18. The method of claim 16, wherein a list of devices is connected to one or more networks with a health indicator and additional details of a selected device with mode, alarm and error details displayed. 19. A system having monitoring and diagnostics comprising:
one or more remote room controllers; a master room controller connected to the one or more remote room controllers; and a display with an input mechanism connected to the master room controller; and wherein the master room controller comprises:
an application to develop a remote room controller health page and a diagnostic page; and
a tool to remotely troubleshoot issues based on the diagnostics page of a device at a remote room controller. 20. The system of claim 19, wherein the display can show a screen that provides a system-wide health status of the one or more remote controllers. 21. The system of claim 20, wherein each of the one or more remote room controllers comprises one or more items selected from a group consisting of an application control engine, networks connected to and in the application control engine, and a hyperlink of the application control engine to allow a user to navigate to a detailed diagnostics screen of the application control engine, modes, errors, or alarm conditions. 22. The system of claim 21, wherein:
a user can remotely check one or more items of a group consisting of the application control engine, networks in the application control engine, and the hyperlink of the application control engine of the application control engine to allow a user to navigate to the detailed diagnostics screen of the application control engine, modes, errors, or alarm conditions; each of the one or more remote room controllers has a unique internet protocol address; a user can use an internet protocol address at the master room controller to open a system health page or a diagnostics page for a remote room controller having the internet protocol address; and the user can troubleshoot a device having a property issue spotted with the diagnostics page. | 2,100 |
5,790 | 5,790 | 14,666,211 | 2,112 | Disclosed herein are techniques to generate frames and pack frames for a line code, where the frames include a header information element, an error-correction information element, and a data information element. Additionally, disclosed are techniques to communicate via a high-speed interconnect using the above frames. A technique including a training state and an error-correction state are disclosed to synchronize communications via a serial interconnect and to communicate via the serial interconnect providing error-correction. | 1. An apparatus, comprising:
a processor circuit; and an interconnect manager component for execution by the processor circuit, the interconnect manager component comprising:
a frame packing component to generate a block, the block comprising a plurality of frames, each of the plurality of frames comprising a header information element, an error-correction information element, and a data information element; and
an interconnect component to communicate the block via a serial interconnect. 2. The apparatus of claim 1, the interconnect manager component comprising a synchronization component to generate one or more synchronization frames, each of the synchronization frames comprising a synchronization header information element and a data information element, the interconnect component to communicate the synchronization frames via the serial interconnect to synchronize the plurality of frames in the block. 3. The apparatus of claim 2, the interconnect manager component to communicate the synchronization frames via the serial interconnect prior to communicating the block to synchronize the plurality of frames in the block. 4. The apparatus of claim 1, the frame packing component to generate the block comprising a plurality of combined data and header information elements and a parity information element, each of the combined data and header information elements to comprise one of the header information elements and a corresponding one of the data information elements, the parity information element to comprise the plurality of error-correction information elements. 5. The apparatus of claim 1, the frame packing component to generate the block comprising a parity information element and a combined header information element, the combined header information elements to comprise the plurality of header information elements and the parity information element to comprise the plurality of error-correction information elements. 6. The apparatus of claim 1, each of the header information elements to comprise an indication of whether the frames correspond to a data frame or a control frame. 7. The apparatus of claim 6, each of the synchronization header information elements to comprise an indication of whether the synchronization frames correspond to a data frame of a control frame. 8. The apparatus of claim 1, each of the header information elements to comprise one bit, each of the error-correction information elements to comprise three bits, and each of the data information elements to comprise 128 bits. 9. The apparatus of claim 1, the serial interconnect to comprise a DisplayPort interconnect, a Thunderbolt interconnect, or a mini-DisplayPort interconnect. 10. An apparatus, comprising:
a processor circuit; and an interconnect manager component for execution by the processor circuit, the interconnect manager component comprising:
an interconnect component to receive a block via a serial interconnect, the block comprising a plurality of frames, each of the plurality of frames comprising a header information element, an error-correction information element, and a data information element, the data information elements comprising an indication of a coded symbol and the error-correction information elements to comprise an indication of parity information corresponding to the coded symbols; and
an error-correction component to determine whether the coded symbols are received correctly based in part on the parity information. 11. The apparatus of claim 10, the interconnect component to receive one or more synchronization frames, each of the synchronization frames comprising a synchronization header information element and a data information element, the interconnect manager component comprising a synchronization component to synchronize the plurality of frames of the block based on the synchronization frames. 12. The apparatus of claim 10, the serial interconnect to comprise a DisplayPort interconnect, a Thunderbolt interconnect, or a mini-DisplayPort interconnect. 13. The apparatus of claim 10, comprising a display and a display component executable by the processor circuit, the display component to send a control signal to the display based on the coded symbols. 14. At least one machine-readable storage medium comprising instructions, that when executed by a system, cause the system to:
generate a block, the block comprising a plurality of frames, each of the plurality of frames comprising a header information element, an error-correction information element, and a data information element; and communicate the block via a serial interconnect. 15. The at least one machine-readable storage medium of claim 14, comprising instructions, that when executed by the system, cause the system to:
generate one or more synchronization frames, each of the synchronization frames comprising a synchronization header information element and a data information element; and communicate the synchronization frames via the serial interconnect to synchronize the plurality of frames in the block. 16. The at least one machine-readable storage medium of claim 15, comprising instructions, that when executed by the system, cause the system to communicate the synchronization frames via the serial interconnect prior to communicating the block to synchronize the plurality of frames in the block. 17. The at least one machine-readable storage medium of claim 14, comprising instructions, that when executed by the system, cause the system to generate the block comprising a plurality of combined data and header information elements and a parity information element, each of the combined data and header information elements to comprise one of the header information elements and a corresponding one of the data information elements, the parity information element to comprise the plurality of error-correction information elements. 18. The at least one machine-readable storage medium of claim 14, comprising instructions, that when executed by the system, cause the system to generate the block comprising a parity information element and a combined header information element, the combined header information elements to comprise the plurality of header information elements and the parity information element to comprise the plurality of error-correction information elements. 19. The at least one machine-readable storage medium of claim 14, each of the error-correction information elements to comprise an indication of parity information corresponding to the data information element. 20. The at least one machine-readable storage medium of claim 14, each of the error-correction information elements to comprise three bits. 21. A computer-implemented method, comprising:
receiving a block via a serial interconnect, the block comprising a plurality of frames, each of the plurality of frames comprising a header information element, an error-correction information element, and a data information element, the data information elements comprising an indication of a coded symbol and the error-correction information elements to comprise an indication of parity information corresponding to the coded symbols; and determining whether the coded symbols are received correctly based in part on the parity information. 22. The computer-implemented method of claim 21, comprising:
receiving one or more synchronization frames, each of the synchronization frames comprising a synchronization header information element and a data information element; and synchronizing the plurality of frames of the block based on the synchronization frames. 23. The computer-implemented method of claim 22, each of the header information elements to comprise an indication of whether the frames correspond to a data frame or a control frame and each of the synchronization header information elements to comprise an indication of whether the synchronization frames correspond to a data frame of a control frame. 24. The computer-implemented method of claim 21, each of the header information elements to comprise one bit and each of the synchronization header information elements to comprise four bits. 25. The computer-implemented method of claim 21, the block comprising a plurality of combined data and header information elements and a parity information element, each of the combined data and header information elements to comprise one of the header information element and a corresponding one of the data information elements, the parity information element to comprise the plurality of error-correction information elements. | Disclosed herein are techniques to generate frames and pack frames for a line code, where the frames include a header information element, an error-correction information element, and a data information element. Additionally, disclosed are techniques to communicate via a high-speed interconnect using the above frames. A technique including a training state and an error-correction state are disclosed to synchronize communications via a serial interconnect and to communicate via the serial interconnect providing error-correction.1. An apparatus, comprising:
a processor circuit; and an interconnect manager component for execution by the processor circuit, the interconnect manager component comprising:
a frame packing component to generate a block, the block comprising a plurality of frames, each of the plurality of frames comprising a header information element, an error-correction information element, and a data information element; and
an interconnect component to communicate the block via a serial interconnect. 2. The apparatus of claim 1, the interconnect manager component comprising a synchronization component to generate one or more synchronization frames, each of the synchronization frames comprising a synchronization header information element and a data information element, the interconnect component to communicate the synchronization frames via the serial interconnect to synchronize the plurality of frames in the block. 3. The apparatus of claim 2, the interconnect manager component to communicate the synchronization frames via the serial interconnect prior to communicating the block to synchronize the plurality of frames in the block. 4. The apparatus of claim 1, the frame packing component to generate the block comprising a plurality of combined data and header information elements and a parity information element, each of the combined data and header information elements to comprise one of the header information elements and a corresponding one of the data information elements, the parity information element to comprise the plurality of error-correction information elements. 5. The apparatus of claim 1, the frame packing component to generate the block comprising a parity information element and a combined header information element, the combined header information elements to comprise the plurality of header information elements and the parity information element to comprise the plurality of error-correction information elements. 6. The apparatus of claim 1, each of the header information elements to comprise an indication of whether the frames correspond to a data frame or a control frame. 7. The apparatus of claim 6, each of the synchronization header information elements to comprise an indication of whether the synchronization frames correspond to a data frame of a control frame. 8. The apparatus of claim 1, each of the header information elements to comprise one bit, each of the error-correction information elements to comprise three bits, and each of the data information elements to comprise 128 bits. 9. The apparatus of claim 1, the serial interconnect to comprise a DisplayPort interconnect, a Thunderbolt interconnect, or a mini-DisplayPort interconnect. 10. An apparatus, comprising:
a processor circuit; and an interconnect manager component for execution by the processor circuit, the interconnect manager component comprising:
an interconnect component to receive a block via a serial interconnect, the block comprising a plurality of frames, each of the plurality of frames comprising a header information element, an error-correction information element, and a data information element, the data information elements comprising an indication of a coded symbol and the error-correction information elements to comprise an indication of parity information corresponding to the coded symbols; and
an error-correction component to determine whether the coded symbols are received correctly based in part on the parity information. 11. The apparatus of claim 10, the interconnect component to receive one or more synchronization frames, each of the synchronization frames comprising a synchronization header information element and a data information element, the interconnect manager component comprising a synchronization component to synchronize the plurality of frames of the block based on the synchronization frames. 12. The apparatus of claim 10, the serial interconnect to comprise a DisplayPort interconnect, a Thunderbolt interconnect, or a mini-DisplayPort interconnect. 13. The apparatus of claim 10, comprising a display and a display component executable by the processor circuit, the display component to send a control signal to the display based on the coded symbols. 14. At least one machine-readable storage medium comprising instructions, that when executed by a system, cause the system to:
generate a block, the block comprising a plurality of frames, each of the plurality of frames comprising a header information element, an error-correction information element, and a data information element; and communicate the block via a serial interconnect. 15. The at least one machine-readable storage medium of claim 14, comprising instructions, that when executed by the system, cause the system to:
generate one or more synchronization frames, each of the synchronization frames comprising a synchronization header information element and a data information element; and communicate the synchronization frames via the serial interconnect to synchronize the plurality of frames in the block. 16. The at least one machine-readable storage medium of claim 15, comprising instructions, that when executed by the system, cause the system to communicate the synchronization frames via the serial interconnect prior to communicating the block to synchronize the plurality of frames in the block. 17. The at least one machine-readable storage medium of claim 14, comprising instructions, that when executed by the system, cause the system to generate the block comprising a plurality of combined data and header information elements and a parity information element, each of the combined data and header information elements to comprise one of the header information elements and a corresponding one of the data information elements, the parity information element to comprise the plurality of error-correction information elements. 18. The at least one machine-readable storage medium of claim 14, comprising instructions, that when executed by the system, cause the system to generate the block comprising a parity information element and a combined header information element, the combined header information elements to comprise the plurality of header information elements and the parity information element to comprise the plurality of error-correction information elements. 19. The at least one machine-readable storage medium of claim 14, each of the error-correction information elements to comprise an indication of parity information corresponding to the data information element. 20. The at least one machine-readable storage medium of claim 14, each of the error-correction information elements to comprise three bits. 21. A computer-implemented method, comprising:
receiving a block via a serial interconnect, the block comprising a plurality of frames, each of the plurality of frames comprising a header information element, an error-correction information element, and a data information element, the data information elements comprising an indication of a coded symbol and the error-correction information elements to comprise an indication of parity information corresponding to the coded symbols; and determining whether the coded symbols are received correctly based in part on the parity information. 22. The computer-implemented method of claim 21, comprising:
receiving one or more synchronization frames, each of the synchronization frames comprising a synchronization header information element and a data information element; and synchronizing the plurality of frames of the block based on the synchronization frames. 23. The computer-implemented method of claim 22, each of the header information elements to comprise an indication of whether the frames correspond to a data frame or a control frame and each of the synchronization header information elements to comprise an indication of whether the synchronization frames correspond to a data frame of a control frame. 24. The computer-implemented method of claim 21, each of the header information elements to comprise one bit and each of the synchronization header information elements to comprise four bits. 25. The computer-implemented method of claim 21, the block comprising a plurality of combined data and header information elements and a parity information element, each of the combined data and header information elements to comprise one of the header information element and a corresponding one of the data information elements, the parity information element to comprise the plurality of error-correction information elements. | 2,100 |
5,791 | 5,791 | 14,533,509 | 2,161 | The present disclosure is directed toward systems and methods that allow users to efficiently and effectively create and identify segments of usage patterns. For example, systems and methods described herein allow marketers to query and return sequential segments including sequence conditions based on user-defined dimension item values. Furthermore, systems and methods described allow marketers to query and return sequential segments including sequential events based on user-defined dimension variables. In addition to the foregoing, systems and methods described herein allow marketers to query and return sequential segments defined by repeated events performed at given regularity or frequency. | 1. A method for sequentially segmenting a data set comprising:
receiving, by a server device comprising at least one processor, a segment query from a client device, the segment query comprising:
an indication of a first event and a second event, and
a sequence condition defined by one or more specific dimension item values;
querying, by the server device, an analytics database for a segment of users who performed the first event followed by the second event in accordance with the sequence condition defined by the one or more specific dimension item values; and providing, by the server device, the segment of users to the client device. 2. The method as recited in claim 1, wherein:
the sequence condition comprises one of: a number of purchases, a number of pages visited, a number of in-application purchases, a number of searches, a number of advertisements engaged; and the one or more specific dimension item values comprises one of: one or more specific products purchased, one or more specific pages visited, one or more specific applications from which the in-application purchases were made, one or more specific search queries, one or more specific advertisements engaged, or a campaign of advertisements. 3. The method as recited in claim 1, wherein the one or more specific dimension item values comprises a plurality of dimension item values. 4. The method as recited in claim 1, wherein:
the segment query further comprises an additional sequence condition; and querying, by the server device, the analytics database comprises querying the analytics database for a segment of users who performed the first event followed by the second event in accordance with the sequence condition defined by the one or more specific dimension item values and the additional sequence condition. 5. The method as recited in claim 4, wherein the additional sequence condition comprises one or more additional specific dimension item values. 6. The method as recited in claim 4, wherein the additional sequence condition comprises a time-based sequence condition. 7. The method as recited in claim 1, wherein the one or more specific dimension item values comprises a variable. 8. The method as recited in claim 7, wherein the variable comprises one or more of a value, a regular expression, or an array of possible values. 9. The method as recited in claim 1, further comprising:
prior to receiving the segment query, providing, by the server device and to the client device, a graphical user interface, the graphical user interface comprising one or more segment query building controls; wherein receiving, by the server device from the client device, the segment query comprises receiving an indication of one or more segment query building controls entered into the graphical user interface. 10. The method as recited in claim 9, further comprising:
receiving, by the server device, an input via one of the one or more segment query building controls that partially defines the segment query; based on the input received via the segment query building control, providing, by the server device to the client device, an update indicating results of the partially defined segment query. 11. The method as recited in claim 1, wherein the indication of the first event and the indication of the second event specify actions performed by a user. 12. The method as recited in claim 11, wherein actions performed by the user comprise one or more of requesting a webpage, downloading data, uploading data, instantiating an application, or submitting a transaction. 13. A method for sequentially segmenting a data set comprising:
receiving, by a server device comprising at least one processor, a segment query from a client device, the segment query comprising:
an indication of an initial event defined by a dimension item variable, and
an indication of a subsequent event defined by the dimension item variable,
querying, by the server device, an analytics database for a segment of users who performed the initial event defined by the dimension item variable and then performed the subsequent event defined by the dimension item variable; and providing, by the server device, the segment of users to the client device. 14. The method as recited in claim 13, wherein querying, by the server device, the analytics database for the segment of users who performed the initial event defined by the dimension item variable, then performed the subsequent event as defined by the dimension item variable comprises returning a segment of users who performed the initial event defined by a specific dimension item and then performed the subsequent event defined the same specific dimension item, the specific dimension item being any item of the dimension. 15. The method as recited in claim 13, wherein:
the segment query further comprises a sequence condition; and querying, by the server device, the analytics database comprises querying the analytics database for a segment of users who performed the initial event defined by the dimension item variable followed by the subsequent event defined by the dimension item variable in accordance with the sequence condition. 16. The method as recited in claim 13, wherein dimension item variable comprises one or more of a single item variable, an item type variable, a plurality of item variables, or a plurality of item type variables. 17. A system for sequentially segmenting a data set comprising:
at least one processor; at least one non-transitory computer readable storage medium storing instructions thereon, that, when executed by the at least one processor, cause the system to: receive a segment query comprising:
a segment rule, and
a frequency threshold, wherein the frequency threshold is a number of times the segment rule is satisfied;
query an analytics database for a segment of users who satisfy the segment rule within the frequency threshold; and provide the segment of users to a client device. 18. The system as recited in claim 17, wherein:
the segment rule comprises an event defined by a dimension item variable; and the frequency threshold is defined by the number of times the segment rule is satisfied within a predetermined period of time. 19. The system as recited in claim 17, further comprising instructions that, when executed by the at least one processor, cause the system to provide analytical information from the analytics database associated with the segment of users. 20. The system as recited in claim 19, wherein the analytical information from the analytics database associated with the segment of users comprises one or more of events performed by each of the segment of users, a timestamp associated with each of the one or more events performed by each of the segment of users, tracking data associated with each of the segment of users, demographic data associated with each of the segment of users, or transaction data associated with each of the segment of users. | The present disclosure is directed toward systems and methods that allow users to efficiently and effectively create and identify segments of usage patterns. For example, systems and methods described herein allow marketers to query and return sequential segments including sequence conditions based on user-defined dimension item values. Furthermore, systems and methods described allow marketers to query and return sequential segments including sequential events based on user-defined dimension variables. In addition to the foregoing, systems and methods described herein allow marketers to query and return sequential segments defined by repeated events performed at given regularity or frequency.1. A method for sequentially segmenting a data set comprising:
receiving, by a server device comprising at least one processor, a segment query from a client device, the segment query comprising:
an indication of a first event and a second event, and
a sequence condition defined by one or more specific dimension item values;
querying, by the server device, an analytics database for a segment of users who performed the first event followed by the second event in accordance with the sequence condition defined by the one or more specific dimension item values; and providing, by the server device, the segment of users to the client device. 2. The method as recited in claim 1, wherein:
the sequence condition comprises one of: a number of purchases, a number of pages visited, a number of in-application purchases, a number of searches, a number of advertisements engaged; and the one or more specific dimension item values comprises one of: one or more specific products purchased, one or more specific pages visited, one or more specific applications from which the in-application purchases were made, one or more specific search queries, one or more specific advertisements engaged, or a campaign of advertisements. 3. The method as recited in claim 1, wherein the one or more specific dimension item values comprises a plurality of dimension item values. 4. The method as recited in claim 1, wherein:
the segment query further comprises an additional sequence condition; and querying, by the server device, the analytics database comprises querying the analytics database for a segment of users who performed the first event followed by the second event in accordance with the sequence condition defined by the one or more specific dimension item values and the additional sequence condition. 5. The method as recited in claim 4, wherein the additional sequence condition comprises one or more additional specific dimension item values. 6. The method as recited in claim 4, wherein the additional sequence condition comprises a time-based sequence condition. 7. The method as recited in claim 1, wherein the one or more specific dimension item values comprises a variable. 8. The method as recited in claim 7, wherein the variable comprises one or more of a value, a regular expression, or an array of possible values. 9. The method as recited in claim 1, further comprising:
prior to receiving the segment query, providing, by the server device and to the client device, a graphical user interface, the graphical user interface comprising one or more segment query building controls; wherein receiving, by the server device from the client device, the segment query comprises receiving an indication of one or more segment query building controls entered into the graphical user interface. 10. The method as recited in claim 9, further comprising:
receiving, by the server device, an input via one of the one or more segment query building controls that partially defines the segment query; based on the input received via the segment query building control, providing, by the server device to the client device, an update indicating results of the partially defined segment query. 11. The method as recited in claim 1, wherein the indication of the first event and the indication of the second event specify actions performed by a user. 12. The method as recited in claim 11, wherein actions performed by the user comprise one or more of requesting a webpage, downloading data, uploading data, instantiating an application, or submitting a transaction. 13. A method for sequentially segmenting a data set comprising:
receiving, by a server device comprising at least one processor, a segment query from a client device, the segment query comprising:
an indication of an initial event defined by a dimension item variable, and
an indication of a subsequent event defined by the dimension item variable,
querying, by the server device, an analytics database for a segment of users who performed the initial event defined by the dimension item variable and then performed the subsequent event defined by the dimension item variable; and providing, by the server device, the segment of users to the client device. 14. The method as recited in claim 13, wherein querying, by the server device, the analytics database for the segment of users who performed the initial event defined by the dimension item variable, then performed the subsequent event as defined by the dimension item variable comprises returning a segment of users who performed the initial event defined by a specific dimension item and then performed the subsequent event defined the same specific dimension item, the specific dimension item being any item of the dimension. 15. The method as recited in claim 13, wherein:
the segment query further comprises a sequence condition; and querying, by the server device, the analytics database comprises querying the analytics database for a segment of users who performed the initial event defined by the dimension item variable followed by the subsequent event defined by the dimension item variable in accordance with the sequence condition. 16. The method as recited in claim 13, wherein dimension item variable comprises one or more of a single item variable, an item type variable, a plurality of item variables, or a plurality of item type variables. 17. A system for sequentially segmenting a data set comprising:
at least one processor; at least one non-transitory computer readable storage medium storing instructions thereon, that, when executed by the at least one processor, cause the system to: receive a segment query comprising:
a segment rule, and
a frequency threshold, wherein the frequency threshold is a number of times the segment rule is satisfied;
query an analytics database for a segment of users who satisfy the segment rule within the frequency threshold; and provide the segment of users to a client device. 18. The system as recited in claim 17, wherein:
the segment rule comprises an event defined by a dimension item variable; and the frequency threshold is defined by the number of times the segment rule is satisfied within a predetermined period of time. 19. The system as recited in claim 17, further comprising instructions that, when executed by the at least one processor, cause the system to provide analytical information from the analytics database associated with the segment of users. 20. The system as recited in claim 19, wherein the analytical information from the analytics database associated with the segment of users comprises one or more of events performed by each of the segment of users, a timestamp associated with each of the one or more events performed by each of the segment of users, tracking data associated with each of the segment of users, demographic data associated with each of the segment of users, or transaction data associated with each of the segment of users. | 2,100 |
5,792 | 5,792 | 14,842,459 | 2,185 | Optimized bus powered peripheral battery charging includes a circuit to initiate a change in an advanced configuration and power interface (ACPI) state in a controller allowing charging of a peripheral device battery, the circuit including a signal converter coupled between an input port and the controller to sense when a the peripheral device battery is coupled to an input port and to restrict the controller from changing ACPI state multiple times for a given peripheral device battery coupling; and a ground loop detector coupled in parallel to the signal converter between the input port and the controller to allow the controller to know that the peripheral device battery has maintained being coupled to the input port. | 1. A device battery charging system, comprising:
a power rail; an input port that is coupled to the power rail; and a controller that is coupled to the input port and the power rail, wherein the controller is configured to:
detect the coupling of a device battery to the input port when the input port is not being supplied power through the power rail from a charging battery; and
in response to detecting the coupling of the device battery to the input port, cause the power rail to provide power from the charging battery to the input port to charge the device battery. 2. The circuit of claim 1, wherein the controller is configured to:
detect that the device battery has been decoupled from the input port and, in response, cause the power rail to cease providing power from the charging battery to the input port. 3. The circuit of claim 2, wherein the device battery is a first device battery and the controller is configured, subsequent to causing the power rail to cease providing power from the charging battery to the input port, to:
monitor the input port for the coupling of one of the first device battery and a second device battery that is different than the first device battery to the input port when the input port is not being supplied power through the power rail from the charging battery. 4. The circuit of claim 1, wherein the causing the power rail to provide power from the charging battery to the input port includes changing a system power state that causes the power rail to provide power from the charging battery to the input port. 5. The circuit of claim 4, wherein the controller includes at least one subsystem that prevents the controller from changing the system power state multiple times for a single coupling of the device battery to the input port. 6. The circuit of claim 1, wherein the controller is configured to:
determine that the device battery has maintained being coupled to the input port upon the entering of a run time state. 7. The circuit of claim 1, wherein the input port is a universal serial bus (USB) port. 8. An information handling system (IHS), comprising:
a processing system; a memory system coupled to the processing system; a charging battery coupled to the processing system; an input port coupled to the processing system and the charging battery; and a controller coupled to the charging battery and the input port, wherein the controller is configured to:
detect the coupling of a device battery to the input port when the input port is not being supplied power from the charging battery; and
in response to detecting the coupling of the device battery to the input port, cause power from the charging battery to be provided to the input port to charge the device battery. 9. The IHS of claim 8, wherein the controller is configured to:
detect that the device battery has been decoupled from the input port and, in response, cause the power from the charging battery to cease being provided to the input port. 10. The IHS of claim 8, wherein the causing the power from the charging battery to be provided to the input port includes changing a system power state that causes the power from the charging battery to be provided to the input port. 11. The IHS of claim 10, wherein the controller includes at least one subsystem that prevents the controller from changing the system power state multiple times for a single coupling of the device battery to the input port. 12. The IHS of claim 8, wherein the controller is configured to:
determine that the device battery has maintained being coupled to the input port upon the entering of a run time state. 13. The IHS of claim 8, wherein the input port is a universal serial bus (USB) port. 14. A method for charging a device battery, comprising:
configuring, by a controller, at least one power connection between a charging battery and an input port such that the input port is not supplied power from the charging battery; monitoring, by the controller, for the coupling of a device battery to the input port; detecting, by the controller, the coupling of the device battery to the input port when the input port is not being supplied power from the charging battery; and in response to detecting the coupling of the device battery to the input port, causing, by the controller, power from the charging battery to be provided to the input port to charge the device battery. 15. The method of claim 14, further comprising:
detecting, by the controller, that the device battery has been decoupled from the input port and, in response, causing the power from the charging battery to cease being provided to the input port. 16. The method of claim 15, wherein the device battery is a first device battery and the method further comprises, subsequent to the controller causing the power rail to cease providing power from the charging battery to the input port:
monitoring, by the controller, the input port for the coupling of one of the first device battery and a second device battery that is different than the first device battery to the input port when the input port is not being supplied power through the power rail from the charging battery. 17. The method of claim 14, wherein the causing the power rail to provide power from the charging battery to the input port includes changing, by the controller, a system power state that causes the power rail to provide power from the charging battery to the input port. 18. The method of claim 17, further comprising:
preventing, by at least one subsystem in the controller, the controller from changing the system power state multiple times for a single coupling of the device battery to the input port. 19. The method of claim 14, further comprising:
determining, by the controller, that the device battery has maintained being coupled to the input port upon the entering of a run time state. 20. The method of claim 14, wherein the input port is a universal serial bus (USB) port. | Optimized bus powered peripheral battery charging includes a circuit to initiate a change in an advanced configuration and power interface (ACPI) state in a controller allowing charging of a peripheral device battery, the circuit including a signal converter coupled between an input port and the controller to sense when a the peripheral device battery is coupled to an input port and to restrict the controller from changing ACPI state multiple times for a given peripheral device battery coupling; and a ground loop detector coupled in parallel to the signal converter between the input port and the controller to allow the controller to know that the peripheral device battery has maintained being coupled to the input port.1. A device battery charging system, comprising:
a power rail; an input port that is coupled to the power rail; and a controller that is coupled to the input port and the power rail, wherein the controller is configured to:
detect the coupling of a device battery to the input port when the input port is not being supplied power through the power rail from a charging battery; and
in response to detecting the coupling of the device battery to the input port, cause the power rail to provide power from the charging battery to the input port to charge the device battery. 2. The circuit of claim 1, wherein the controller is configured to:
detect that the device battery has been decoupled from the input port and, in response, cause the power rail to cease providing power from the charging battery to the input port. 3. The circuit of claim 2, wherein the device battery is a first device battery and the controller is configured, subsequent to causing the power rail to cease providing power from the charging battery to the input port, to:
monitor the input port for the coupling of one of the first device battery and a second device battery that is different than the first device battery to the input port when the input port is not being supplied power through the power rail from the charging battery. 4. The circuit of claim 1, wherein the causing the power rail to provide power from the charging battery to the input port includes changing a system power state that causes the power rail to provide power from the charging battery to the input port. 5. The circuit of claim 4, wherein the controller includes at least one subsystem that prevents the controller from changing the system power state multiple times for a single coupling of the device battery to the input port. 6. The circuit of claim 1, wherein the controller is configured to:
determine that the device battery has maintained being coupled to the input port upon the entering of a run time state. 7. The circuit of claim 1, wherein the input port is a universal serial bus (USB) port. 8. An information handling system (IHS), comprising:
a processing system; a memory system coupled to the processing system; a charging battery coupled to the processing system; an input port coupled to the processing system and the charging battery; and a controller coupled to the charging battery and the input port, wherein the controller is configured to:
detect the coupling of a device battery to the input port when the input port is not being supplied power from the charging battery; and
in response to detecting the coupling of the device battery to the input port, cause power from the charging battery to be provided to the input port to charge the device battery. 9. The IHS of claim 8, wherein the controller is configured to:
detect that the device battery has been decoupled from the input port and, in response, cause the power from the charging battery to cease being provided to the input port. 10. The IHS of claim 8, wherein the causing the power from the charging battery to be provided to the input port includes changing a system power state that causes the power from the charging battery to be provided to the input port. 11. The IHS of claim 10, wherein the controller includes at least one subsystem that prevents the controller from changing the system power state multiple times for a single coupling of the device battery to the input port. 12. The IHS of claim 8, wherein the controller is configured to:
determine that the device battery has maintained being coupled to the input port upon the entering of a run time state. 13. The IHS of claim 8, wherein the input port is a universal serial bus (USB) port. 14. A method for charging a device battery, comprising:
configuring, by a controller, at least one power connection between a charging battery and an input port such that the input port is not supplied power from the charging battery; monitoring, by the controller, for the coupling of a device battery to the input port; detecting, by the controller, the coupling of the device battery to the input port when the input port is not being supplied power from the charging battery; and in response to detecting the coupling of the device battery to the input port, causing, by the controller, power from the charging battery to be provided to the input port to charge the device battery. 15. The method of claim 14, further comprising:
detecting, by the controller, that the device battery has been decoupled from the input port and, in response, causing the power from the charging battery to cease being provided to the input port. 16. The method of claim 15, wherein the device battery is a first device battery and the method further comprises, subsequent to the controller causing the power rail to cease providing power from the charging battery to the input port:
monitoring, by the controller, the input port for the coupling of one of the first device battery and a second device battery that is different than the first device battery to the input port when the input port is not being supplied power through the power rail from the charging battery. 17. The method of claim 14, wherein the causing the power rail to provide power from the charging battery to the input port includes changing, by the controller, a system power state that causes the power rail to provide power from the charging battery to the input port. 18. The method of claim 17, further comprising:
preventing, by at least one subsystem in the controller, the controller from changing the system power state multiple times for a single coupling of the device battery to the input port. 19. The method of claim 14, further comprising:
determining, by the controller, that the device battery has maintained being coupled to the input port upon the entering of a run time state. 20. The method of claim 14, wherein the input port is a universal serial bus (USB) port. | 2,100 |
5,793 | 5,793 | 15,783,577 | 2,143 | A system for executing context based operations can include a processor and a memory device comprising a plurality of instructions that, in response to an execution by the processor, cause the processor to detect context information corresponding to input wherein the context information comprises device information, a subject of the input, device usage information, or a combination thereof. The processor can also store a link between the context information and the input. Additionally, the processor can detect an operation corresponding to the context information and the input and execute the operation based on the context information and the input. | 1. A system for context based operations comprising:
a processor; and a memory device comprising a plurality of instructions that, in response to an execution by the processor, cause the processor to:
detect context information corresponding to input, wherein the context information comprises device information, a screenshot of a user interface, device usage information, or a combination thereof;
detect an operation corresponding to the context information and the input; and
execute the operation based on the context information and the input. 2. The system of claim 1, wherein the operation comprises a reverse search based on the context information related to a phone call. 3. The system of claim 1, wherein the operation comprises an input based search. 4. The system of claim 1, wherein the system comprises two display screens and the context information corresponds to a first of the two display screens and the input is detected with a second of the two display screens. 5. The system of claim 4, wherein the context information comprises a screenshot from the first of the two display screens, wherein the screenshot is captured at a time of the input being detected. 6. The system of claim 4, wherein the context information comprises a selection of content from the first of the two display screens. 7. The system of claim 4, wherein the context information corresponds to a symbol captured in the input. 8. The system of claim 4, wherein the context information indicates a position in a video, an electronic book, or a website based on a stored font and an amount scrolled. 9. The system of claim 4, wherein the input is to be captured with a keyboard, by a camera, or by contacting the second of the display screens with a stylus or a user's hand. 10. The system of claim 4, wherein the operation comprises extracting text from a screenshot of the first display screen. 11. The system of claim 4, wherein the operation comprises applying image analysis to a screenshot of the first display screen and storing image data detected from the image analysis as context information. 12. The system of claim 11, wherein the plurality of instructions cause the processor to execute a search based on the image data. 13. The system of claim 4, wherein the plurality of instructions cause the processor to detect a gesture and display the context information corresponding to the input. 14. The system of claim 4, wherein the context information comprises a location of the system at a time related to detecting the input. 15. The system of claim 4, wherein the plurality of instructions cause the processor to:
detect the input relates to an incomplete section of notes; and auto-complete the incomplete section of notes based on content from additional devices sharing the same context information or from a web service storing the content for the additional devices. 16. The system of claim 4, wherein the operation comprises identifying and automatically selecting multiple items of the input that share common context information. 17. The system of claim 4, wherein the operation comprises sharing or deleting multiple items of the input that share common context information. 18. The system of claim 4, wherein the operation comprises generating a label corresponding to the input based on the context information. 19. A method for context based operations comprising:
detecting context information corresponding to input, wherein the context information comprises device information, device usage information, or a combination thereof, wherein the device information indicates two display screens are connected to a device and the context information corresponds to a first of the two display screens and the input is detected with a second of the two display screens; storing a link between the context information and the corresponding input; detecting an operation corresponding to the context information; and executing the operation based on the context information and the corresponding input, wherein the operation comprises a reverse search query based on the context information, and wherein a result of the reverse search query comprises previously detected input corresponding to the context information. 20. One or more computer-readable storage media for context based operations comprising a plurality of instructions that, in response to execution by a processor, cause the processor to:
detect context information corresponding to input, wherein the context information comprises device information, a subject of the input, device usage information, or a combination thereof, wherein the device information indicates two display screens are coupled to a system and the context information corresponds to a first of the two display screens and the input is detected with a second of the two display screens; store a link between the context information and the corresponding input; detect an operation corresponding to the context information and the input; and execute the operation based on the context information and the input. | A system for executing context based operations can include a processor and a memory device comprising a plurality of instructions that, in response to an execution by the processor, cause the processor to detect context information corresponding to input wherein the context information comprises device information, a subject of the input, device usage information, or a combination thereof. The processor can also store a link between the context information and the input. Additionally, the processor can detect an operation corresponding to the context information and the input and execute the operation based on the context information and the input.1. A system for context based operations comprising:
a processor; and a memory device comprising a plurality of instructions that, in response to an execution by the processor, cause the processor to:
detect context information corresponding to input, wherein the context information comprises device information, a screenshot of a user interface, device usage information, or a combination thereof;
detect an operation corresponding to the context information and the input; and
execute the operation based on the context information and the input. 2. The system of claim 1, wherein the operation comprises a reverse search based on the context information related to a phone call. 3. The system of claim 1, wherein the operation comprises an input based search. 4. The system of claim 1, wherein the system comprises two display screens and the context information corresponds to a first of the two display screens and the input is detected with a second of the two display screens. 5. The system of claim 4, wherein the context information comprises a screenshot from the first of the two display screens, wherein the screenshot is captured at a time of the input being detected. 6. The system of claim 4, wherein the context information comprises a selection of content from the first of the two display screens. 7. The system of claim 4, wherein the context information corresponds to a symbol captured in the input. 8. The system of claim 4, wherein the context information indicates a position in a video, an electronic book, or a website based on a stored font and an amount scrolled. 9. The system of claim 4, wherein the input is to be captured with a keyboard, by a camera, or by contacting the second of the display screens with a stylus or a user's hand. 10. The system of claim 4, wherein the operation comprises extracting text from a screenshot of the first display screen. 11. The system of claim 4, wherein the operation comprises applying image analysis to a screenshot of the first display screen and storing image data detected from the image analysis as context information. 12. The system of claim 11, wherein the plurality of instructions cause the processor to execute a search based on the image data. 13. The system of claim 4, wherein the plurality of instructions cause the processor to detect a gesture and display the context information corresponding to the input. 14. The system of claim 4, wherein the context information comprises a location of the system at a time related to detecting the input. 15. The system of claim 4, wherein the plurality of instructions cause the processor to:
detect the input relates to an incomplete section of notes; and auto-complete the incomplete section of notes based on content from additional devices sharing the same context information or from a web service storing the content for the additional devices. 16. The system of claim 4, wherein the operation comprises identifying and automatically selecting multiple items of the input that share common context information. 17. The system of claim 4, wherein the operation comprises sharing or deleting multiple items of the input that share common context information. 18. The system of claim 4, wherein the operation comprises generating a label corresponding to the input based on the context information. 19. A method for context based operations comprising:
detecting context information corresponding to input, wherein the context information comprises device information, device usage information, or a combination thereof, wherein the device information indicates two display screens are connected to a device and the context information corresponds to a first of the two display screens and the input is detected with a second of the two display screens; storing a link between the context information and the corresponding input; detecting an operation corresponding to the context information; and executing the operation based on the context information and the corresponding input, wherein the operation comprises a reverse search query based on the context information, and wherein a result of the reverse search query comprises previously detected input corresponding to the context information. 20. One or more computer-readable storage media for context based operations comprising a plurality of instructions that, in response to execution by a processor, cause the processor to:
detect context information corresponding to input, wherein the context information comprises device information, a subject of the input, device usage information, or a combination thereof, wherein the device information indicates two display screens are coupled to a system and the context information corresponds to a first of the two display screens and the input is detected with a second of the two display screens; store a link between the context information and the corresponding input; detect an operation corresponding to the context information and the input; and execute the operation based on the context information and the input. | 2,100 |
5,794 | 5,794 | 14,753,939 | 2,117 | An operator interface within a process plant includes an execution engine that implements process flow modules made up of interconnected smart process objects that are aware of devices and other entities within the plant and that can perform methods to detect conditions within the plant, especially on a system-level basis. The smart process objects include a display element to be displayed to the operator, data storage for storing data pertaining to and/or received from an associated entity within a plant, inputs and outputs for communicating with other smart process objects and methods that may be executed on the data to detect plant conditions, including system-level conditions, such as leaks, errors and other conditions. Process flow modules, which may be made up of numerous interconnected smart process objects, may also include flow algorithms associated therewith to calculate mass balances, flows, etc. for the process elements within the process flow modules. | 1. An object entity within an object oriented programming environment for use in viewing and providing functionality in a process plant, the object entity comprising:
a computer readable memory; an object stored on the computer readable memory and executable on a processor, the object representing a process entity within the process plant and including:
a data storage which stores (i) parameter data for the process entity corresponding to the object and (ii) one or more data inputs or outputs which communicate with other objects representing other process plant entities within the process plant;
a graphic representation of a process entity corresponding to the object; and
a method memory storage that stores one or more methods, which when executed on the processor, perform functions related to the process entity using at least one of the parameter data and the one or more data inputs or outputs for the process entity corresponding to the object. | An operator interface within a process plant includes an execution engine that implements process flow modules made up of interconnected smart process objects that are aware of devices and other entities within the plant and that can perform methods to detect conditions within the plant, especially on a system-level basis. The smart process objects include a display element to be displayed to the operator, data storage for storing data pertaining to and/or received from an associated entity within a plant, inputs and outputs for communicating with other smart process objects and methods that may be executed on the data to detect plant conditions, including system-level conditions, such as leaks, errors and other conditions. Process flow modules, which may be made up of numerous interconnected smart process objects, may also include flow algorithms associated therewith to calculate mass balances, flows, etc. for the process elements within the process flow modules.1. An object entity within an object oriented programming environment for use in viewing and providing functionality in a process plant, the object entity comprising:
a computer readable memory; an object stored on the computer readable memory and executable on a processor, the object representing a process entity within the process plant and including:
a data storage which stores (i) parameter data for the process entity corresponding to the object and (ii) one or more data inputs or outputs which communicate with other objects representing other process plant entities within the process plant;
a graphic representation of a process entity corresponding to the object; and
a method memory storage that stores one or more methods, which when executed on the processor, perform functions related to the process entity using at least one of the parameter data and the one or more data inputs or outputs for the process entity corresponding to the object. | 2,100 |
5,795 | 5,795 | 14,750,600 | 2,158 | One or more processors determine reputation scores for one or more subjects based on connections. One or more processors use a plurality of citations, with each citation representing an expression of opinion or description by a subject on an object. One or more processors select a subset of citations for each object from the citations citing each object. The content of the citations matches one or more search terms for a search query. One or more processors assign citation scores to a subset of a plurality of objects. The citation scores indicate relevance of the objects cited by citations and are determined based at least in part on matching one or more search terms with the content of the citations of the objects by the one or more subjects. The selection scores for an object are determined for each search query based on a subset of subjects citing the object. | 1-20. (canceled) 21. A non-transitory machine-readable medium containing executable program instructions which when executed by a data processing device cause the device to perform a method of ranking objects using reputation scores, comprising:
determining reputation scores for one or more subjects based on connections, the reputation scores indicating reputations of the subjects and a subject is a representation of a user of a social network; receiving a plurality of citations, each citation representing an online posting in the social network of an expression of opinion by a subject on an object, wherein the object is an object that is accessible outside of the social network; selecting a subset of citations for each object from the citations citing each object, the content of the citations in the selected subset matching one or more of search terms of a search query; assigning citation scores to a subset of a plurality of objects, the citation scores indicating relevance of the objects cited by citations and are determined based at least in part on matching one or more search terms with the content of the citations of these objects by the one or more subjects; determining a selection score for each of the subset of a plurality of objects based on the citation scores for these objects and the reputation scores for the subjects citing these objects; and selecting and ranking the objects based on the selection scores of the objects. 22. The machine-readable medium of claim 21, wherein a different subset of citations being selectable for a same object when a different search query is provided. 23. The machine-readable medium of claim 21, wherein the subjects in the subset of subjects are the subjects of previously selected subsets of citations to each object. 24. The machine-readable medium recited in claim 21, wherein the objects include books, films, music, documents, websites, objects for sale, objects that are reviewed or recommended or cited, or any entities that are associated with a Uniform Resource Identifier (URI), wherein the subjects include entities representing authors of Internet content or users of social media services. 25. The machine-readable medium recited in claim 21, wherein the method further comprises:
receiving descriptive criteria from a user. 26. The machine-readable medium recited in claim 21, wherein the method further comprises:
receiving search terms, wherein the search terms are provided in a search query, and wherein the search terms are included in the descriptive criteria. 27. The machine-readable medium recited in claim 21, wherein the method further comprises:
displaying a subset of top ranked objects based on the selection scores. 28. The machine-readable medium recited in claim 21, wherein the method further comprises:
receiving search terms, wherein the search terms are provided in a search query; and displaying a subset of top ranked objects based on the selection scores, wherein the top ranked objects based on the selection scores provide a subjective based search result. 29. The machine-readable medium recited in claim 21, wherein the method further comprises:
determining a content score for an object based on the description criteria; wherein the selection score is based on the citation score, the subjective reputation score, and the content score. 30. The machine-readable medium recited in claim 21, wherein the method further comprises:
determining an expertise score for each subject citing each object based on a second descriptive criteria, wherein the selection score is based on the citation score, the subjective reputation score, and the expertise score. 31. A method of ranking objects using reputation scores, comprising:
determining reputation scores for one or more subjects based on connections, the reputation scores indicating reputations of the subjects and a subject is a representation of a user of a social network; receiving, with one or more processors, a plurality of citations, each citation representing an online posting in the social network of an expression of opinion by a subject on an object, wherein the object is an object that is accessible outside of the social network; selecting a subset of citations for each object from the citations citing each object, the content of the citations in the selected subset matching one or more of search terms of a search query; assigning citation scores to a subset of a plurality of objects, the citation scores indicating relevance of the objects cited by citations and are determined based at least in part on matching one or more search terms with the content of the citations of these objects by the one or more subjects; determining a selection score for each of the subset of a plurality of objects based on the citation scores for these objects and the reputation scores for the subjects citing these objects; and selecting and ranking the objects based on the selection scores of the objects. 32. The method of claim 31, wherein a different subset of citations being selectable for a same object when a different search query is provided. 33. The method of claim 31, wherein the subjects in the subset of subjects are the subjects of previously selected subsets of citations to each object. 34. The method of claim 31, wherein the objects include books, films, music, documents, websites, objects for sale, objects that are reviewed or recommended or cited, or any entities that are associated with a Uniform Resource Identifier (URI), wherein the subjects include entities representing authors of Internet content or users of social media services. 35. The method of claim 31, further comprising:
receiving descriptive criteria from a user. 36. The method of claim 31, further comprising:
receiving search terms, wherein the search terms are provided in a search query, and wherein the search terms are included in the descriptive criteria. 37. The method of claim 31, further comprising:
displaying a subset of top ranked objects based on the selection scores. 38. The method of claim 31, further comprising:
determining a content score for an object based on the description criteria; wherein the selection score is based on the citation score, the subjective reputation score, and the content score. 39. The method of claim 11, further comprising:
determining an expertise score for each subject citing each object based on a second descriptive criteria, wherein the selection score is based on the citation score, the subjective reputation score, and the expertise score. 40. A device that ranks objects using reputation scores, the device comprising:
a processor; a memory coupled to the processor though a bus; and a process executed from the memory by the processor causes the processor to determine reputation scores for one or more subjects based on connections, the reputation scores indicating reputations of the subjects and a subject is a representation of a user of a social network, receive, with one or more processors, a plurality of citations, each citation representing an online posting in the social network of an expression of opinion by a subject on an object, wherein the object is an object that is accessible outside of the social network, select a subset of citations for each object from the citations citing each object, the content of the citations in the selected subset matching one or more of search terms of a search query, assign citation scores to a subset of a plurality of objects, the citation scores indicating relevance of the objects cited by citations and are determined based at least in part on matching one or more search terms with the content of the citations of these objects by the one or more subjects, determine a selection score for each of the subset of a plurality of objects based on the citation scores for these objects and the reputation scores for the subjects citing these objects, and select and ranking the objects based on the selection scores of the objects. | One or more processors determine reputation scores for one or more subjects based on connections. One or more processors use a plurality of citations, with each citation representing an expression of opinion or description by a subject on an object. One or more processors select a subset of citations for each object from the citations citing each object. The content of the citations matches one or more search terms for a search query. One or more processors assign citation scores to a subset of a plurality of objects. The citation scores indicate relevance of the objects cited by citations and are determined based at least in part on matching one or more search terms with the content of the citations of the objects by the one or more subjects. The selection scores for an object are determined for each search query based on a subset of subjects citing the object.1-20. (canceled) 21. A non-transitory machine-readable medium containing executable program instructions which when executed by a data processing device cause the device to perform a method of ranking objects using reputation scores, comprising:
determining reputation scores for one or more subjects based on connections, the reputation scores indicating reputations of the subjects and a subject is a representation of a user of a social network; receiving a plurality of citations, each citation representing an online posting in the social network of an expression of opinion by a subject on an object, wherein the object is an object that is accessible outside of the social network; selecting a subset of citations for each object from the citations citing each object, the content of the citations in the selected subset matching one or more of search terms of a search query; assigning citation scores to a subset of a plurality of objects, the citation scores indicating relevance of the objects cited by citations and are determined based at least in part on matching one or more search terms with the content of the citations of these objects by the one or more subjects; determining a selection score for each of the subset of a plurality of objects based on the citation scores for these objects and the reputation scores for the subjects citing these objects; and selecting and ranking the objects based on the selection scores of the objects. 22. The machine-readable medium of claim 21, wherein a different subset of citations being selectable for a same object when a different search query is provided. 23. The machine-readable medium of claim 21, wherein the subjects in the subset of subjects are the subjects of previously selected subsets of citations to each object. 24. The machine-readable medium recited in claim 21, wherein the objects include books, films, music, documents, websites, objects for sale, objects that are reviewed or recommended or cited, or any entities that are associated with a Uniform Resource Identifier (URI), wherein the subjects include entities representing authors of Internet content or users of social media services. 25. The machine-readable medium recited in claim 21, wherein the method further comprises:
receiving descriptive criteria from a user. 26. The machine-readable medium recited in claim 21, wherein the method further comprises:
receiving search terms, wherein the search terms are provided in a search query, and wherein the search terms are included in the descriptive criteria. 27. The machine-readable medium recited in claim 21, wherein the method further comprises:
displaying a subset of top ranked objects based on the selection scores. 28. The machine-readable medium recited in claim 21, wherein the method further comprises:
receiving search terms, wherein the search terms are provided in a search query; and displaying a subset of top ranked objects based on the selection scores, wherein the top ranked objects based on the selection scores provide a subjective based search result. 29. The machine-readable medium recited in claim 21, wherein the method further comprises:
determining a content score for an object based on the description criteria; wherein the selection score is based on the citation score, the subjective reputation score, and the content score. 30. The machine-readable medium recited in claim 21, wherein the method further comprises:
determining an expertise score for each subject citing each object based on a second descriptive criteria, wherein the selection score is based on the citation score, the subjective reputation score, and the expertise score. 31. A method of ranking objects using reputation scores, comprising:
determining reputation scores for one or more subjects based on connections, the reputation scores indicating reputations of the subjects and a subject is a representation of a user of a social network; receiving, with one or more processors, a plurality of citations, each citation representing an online posting in the social network of an expression of opinion by a subject on an object, wherein the object is an object that is accessible outside of the social network; selecting a subset of citations for each object from the citations citing each object, the content of the citations in the selected subset matching one or more of search terms of a search query; assigning citation scores to a subset of a plurality of objects, the citation scores indicating relevance of the objects cited by citations and are determined based at least in part on matching one or more search terms with the content of the citations of these objects by the one or more subjects; determining a selection score for each of the subset of a plurality of objects based on the citation scores for these objects and the reputation scores for the subjects citing these objects; and selecting and ranking the objects based on the selection scores of the objects. 32. The method of claim 31, wherein a different subset of citations being selectable for a same object when a different search query is provided. 33. The method of claim 31, wherein the subjects in the subset of subjects are the subjects of previously selected subsets of citations to each object. 34. The method of claim 31, wherein the objects include books, films, music, documents, websites, objects for sale, objects that are reviewed or recommended or cited, or any entities that are associated with a Uniform Resource Identifier (URI), wherein the subjects include entities representing authors of Internet content or users of social media services. 35. The method of claim 31, further comprising:
receiving descriptive criteria from a user. 36. The method of claim 31, further comprising:
receiving search terms, wherein the search terms are provided in a search query, and wherein the search terms are included in the descriptive criteria. 37. The method of claim 31, further comprising:
displaying a subset of top ranked objects based on the selection scores. 38. The method of claim 31, further comprising:
determining a content score for an object based on the description criteria; wherein the selection score is based on the citation score, the subjective reputation score, and the content score. 39. The method of claim 11, further comprising:
determining an expertise score for each subject citing each object based on a second descriptive criteria, wherein the selection score is based on the citation score, the subjective reputation score, and the expertise score. 40. A device that ranks objects using reputation scores, the device comprising:
a processor; a memory coupled to the processor though a bus; and a process executed from the memory by the processor causes the processor to determine reputation scores for one or more subjects based on connections, the reputation scores indicating reputations of the subjects and a subject is a representation of a user of a social network, receive, with one or more processors, a plurality of citations, each citation representing an online posting in the social network of an expression of opinion by a subject on an object, wherein the object is an object that is accessible outside of the social network, select a subset of citations for each object from the citations citing each object, the content of the citations in the selected subset matching one or more of search terms of a search query, assign citation scores to a subset of a plurality of objects, the citation scores indicating relevance of the objects cited by citations and are determined based at least in part on matching one or more search terms with the content of the citations of these objects by the one or more subjects, determine a selection score for each of the subset of a plurality of objects based on the citation scores for these objects and the reputation scores for the subjects citing these objects, and select and ranking the objects based on the selection scores of the objects. | 2,100 |
5,796 | 5,796 | 15,424,502 | 2,137 | A method includes writing sample data from a media recording device to a digital memory card, wherein the sample data includes predetermined characteristics, determining a length of write time to write the sample data to the digital memory card, and calculating actual write speed between the media recording device and the digital memory card. In certain embodiments, writing the sample data can include writing the sample data from a sample module of a media recording device to the digital memory card. | 1. A method, comprising:
writing sample data from a media recording device to a digital memory card, wherein the sample data includes predetermined characteristics; determining a length of write time to write the sample data to the digital memory card; and calculating actual write speed between the media recording device and the digital memory card. 2. The method of claim 1, wherein writing the sample data includes writing the sample data from a sample module of the media recording device to the digital memory card. 3. The method of claim 2, wherein writing the sample data includes writing the sample data upon startup of the media recording device. 4. The method of claim 1, further comprising adjusting a data compression ratio dynamically to maintain a data transfer rate that does not exceed the actual write speed between the media recording device and the digital memory card. 5. The method of claim 5, wherein the media recording device includes a video camera. 6. The method of claim 5, wherein adjusting a data compression ratio includes adjusting a video compression ratio dynamically to maintain a video recording quality such that the data transfer rate does not exceed the actual write speed between the media recording device and the digital memory card. 7. The method of claim 6, wherein adjusting the video compression ratio includes adjusting the video compression ratio such that video recording quality is highest allowed to cause the data transfer rate to be maximized but not to exceed the actual write speed between the media recording device and the digital memory card. 8. The method of claim 1, wherein writing sample data to the digital memory card includes writing sample data to an SD card. 9. The method of claim 1, further comprising displaying the actual write speed data to a user. 10. A media recording device, comprising:
a sample data module stored on a non-transitory computer readable medium configured to execute a method, the method including:
writing sample data to a digital memory card, wherein the sample data includes predetermined characteristics;
determining a length of write time to write the sample data to the digital memory card; and
calculating actual write speed between the media recording device and the digital memory card. 11. The device of claim 10, wherein writing the sample data includes writing the sample data upon startup of the media recording device. 12. The device of claim 10, comprising a control module configured to adjust a data compression ratio dynamically to maintain a data transfer rate that does not exceed the actual write speed between the media recording device and the digital memory card. 13. The device of claim 12, wherein the media recording device includes a video camera. 14. The device of claim 13, wherein the control module is configured to adjust a video compression ratio dynamically to maintain a video recording quality such that the data transfer rate does not exceed the actual write speed between the media recording device and the digital memory card. 15. The device of claim 14, wherein the control module is configured to adjust the video compression ratio such that video recording quality is highest allowed to cause the data transfer rate to be maximized but not to exceed the actual write speed between the media recording device and the digital memory card. | A method includes writing sample data from a media recording device to a digital memory card, wherein the sample data includes predetermined characteristics, determining a length of write time to write the sample data to the digital memory card, and calculating actual write speed between the media recording device and the digital memory card. In certain embodiments, writing the sample data can include writing the sample data from a sample module of a media recording device to the digital memory card.1. A method, comprising:
writing sample data from a media recording device to a digital memory card, wherein the sample data includes predetermined characteristics; determining a length of write time to write the sample data to the digital memory card; and calculating actual write speed between the media recording device and the digital memory card. 2. The method of claim 1, wherein writing the sample data includes writing the sample data from a sample module of the media recording device to the digital memory card. 3. The method of claim 2, wherein writing the sample data includes writing the sample data upon startup of the media recording device. 4. The method of claim 1, further comprising adjusting a data compression ratio dynamically to maintain a data transfer rate that does not exceed the actual write speed between the media recording device and the digital memory card. 5. The method of claim 5, wherein the media recording device includes a video camera. 6. The method of claim 5, wherein adjusting a data compression ratio includes adjusting a video compression ratio dynamically to maintain a video recording quality such that the data transfer rate does not exceed the actual write speed between the media recording device and the digital memory card. 7. The method of claim 6, wherein adjusting the video compression ratio includes adjusting the video compression ratio such that video recording quality is highest allowed to cause the data transfer rate to be maximized but not to exceed the actual write speed between the media recording device and the digital memory card. 8. The method of claim 1, wherein writing sample data to the digital memory card includes writing sample data to an SD card. 9. The method of claim 1, further comprising displaying the actual write speed data to a user. 10. A media recording device, comprising:
a sample data module stored on a non-transitory computer readable medium configured to execute a method, the method including:
writing sample data to a digital memory card, wherein the sample data includes predetermined characteristics;
determining a length of write time to write the sample data to the digital memory card; and
calculating actual write speed between the media recording device and the digital memory card. 11. The device of claim 10, wherein writing the sample data includes writing the sample data upon startup of the media recording device. 12. The device of claim 10, comprising a control module configured to adjust a data compression ratio dynamically to maintain a data transfer rate that does not exceed the actual write speed between the media recording device and the digital memory card. 13. The device of claim 12, wherein the media recording device includes a video camera. 14. The device of claim 13, wherein the control module is configured to adjust a video compression ratio dynamically to maintain a video recording quality such that the data transfer rate does not exceed the actual write speed between the media recording device and the digital memory card. 15. The device of claim 14, wherein the control module is configured to adjust the video compression ratio such that video recording quality is highest allowed to cause the data transfer rate to be maximized but not to exceed the actual write speed between the media recording device and the digital memory card. | 2,100 |
5,797 | 5,797 | 15,799,966 | 2,178 | Dynamic code generation and coordination techniques are provided for display of dynamic markup documents including script code. A code generation process is not only guided by deferral of code preparation stages and sub-stages, but also informed by various information levels possessed concerning the code itself, either through interpretation or observation of execution, to not only generate modified code, but also to generate alternative code for alternative situations (e.g., generating different loop bodies that can thereafter be readily swapped in or out depending on a given function call by the browser application). A multi-core architecture further improves user experience by asymmetrically ensuring web site presentation and functionality is prioritized for the user experience. | 1-8. (canceled) 9. A method, comprising:
receiving script code by a script engine of a computing device, the script code being included or referenced in a markup document received by a browser application of the computing device from a network in response to a user request; and determining to reduce or defer at least one phase of a multi-phase code preparation process applied to the script code, the multi-phase code preparation process utilizing one or more phases to create executable code, the one or more phases including parsing the script code and optimizing the script code, wherein the determination is based on a pattern observed in historical usage of a portion of the script code by a browser in connection with displaying the markup document or frequency of a portion of the script code called by a browser in connection with displaying the markup document. 10. The method of claim 9, wherein the determining step further comprises: deferring or reducing usage of a just-in-time compiler to optimize the script code. 11. The method of claim 9, wherein the determining step further comprises: deferring or reducing optimization of a loop body of the script code. 12. The method of claim 9, wherein the determining step further comprises: deferring or reducing interpreting the script code. 13. The method of claim 9, wherein the determining step further comprises: deferring or reducing generation of bytecodes based on the script code. 14. The method of claim 9, wherein the one or more phases includes loading the script code and interpreting the script code. 15. A system, comprising:
one or more processors and a memory; the one or more processors configured to:
receive script code by a script engine of a computing device, the script code being included or referenced in a markup document in response to a user request;
defer, by the script engine, parsing of the script code;
determine boundaries of one or more functions in the script code;
upon activation of one of the one or more functions in the script code, generate, by the script engine, executable code for the activated function; and
execute the activated function. 16. The system of claim 15, wherein activation of the one of the one or more functions is initiated by a browser application that calls the one of the one or more functions. 17. The system of claim 15, the one or more processors are further configured to:
insert a stub in the script code to indicate deferred parsing. 18. The system of claim 15, the one or more processors are further configured to:
during execution of the activated function, analyze the activated function to predict characteristics of the activated function that are used to generate specialized executable code for the activated function. 19. The system of claim 15, further comprising:
during generation of executable code for the activated function, analyze the activated function to determine characteristics of the activated function that are used to generate specialized executable code for the activated function. 20. A computing device, comprising:
at least one processor and a memory; the at least one processor configured to:
render a markup document, in response to a user request, concurrently while generating executable code for a script code embedded or referenced in the markup document;
based on a characteristic of the script code, selectively generate, concurrently with rendering the markup document, alternative executable code, the alternative executable code different from the executable code; and
substitute the executable code with the alternative executable code. 21. The computing device of claim 20, wherein the at least one processor is further configured to:
execute a garbage collection process for objects no longer used or referenced by the markup document. 22. The computing device of claim 20, wherein the at least one processor is further configured to observe the characteristics of the script code during interpretation of the script code. 23. The computing device of claim 20, wherein the at least one processor is further configured to determine the characteristics of the script code as a result of observing the script code during execution of the script code. 24. The computing device of claim 20, wherein the characteristics of the script code is based on one or more common code paths, usage of executed code or a prediction of code usage. 25. The computing device of claim 20, wherein the characteristics of the script code is based on a function of a ratio of a size of one or more loops in the script code to an overall size of the script code, a measurement of a computational intensity of the script code or an analysis of a call tree associated with the script code. 26. The computing device of claim 20, wherein substitute the executable code with the alternative executable code is performed without interfering with a current execution of the executable code. 27. The computing device of claim 20, wherein substitute the executable code with the alternative executable code is performed by swapping in an address of the alternative executable code. 28. The computing device of claim 20, wherein the alternative executable code is generated based on a priority assigned to the script code | Dynamic code generation and coordination techniques are provided for display of dynamic markup documents including script code. A code generation process is not only guided by deferral of code preparation stages and sub-stages, but also informed by various information levels possessed concerning the code itself, either through interpretation or observation of execution, to not only generate modified code, but also to generate alternative code for alternative situations (e.g., generating different loop bodies that can thereafter be readily swapped in or out depending on a given function call by the browser application). A multi-core architecture further improves user experience by asymmetrically ensuring web site presentation and functionality is prioritized for the user experience.1-8. (canceled) 9. A method, comprising:
receiving script code by a script engine of a computing device, the script code being included or referenced in a markup document received by a browser application of the computing device from a network in response to a user request; and determining to reduce or defer at least one phase of a multi-phase code preparation process applied to the script code, the multi-phase code preparation process utilizing one or more phases to create executable code, the one or more phases including parsing the script code and optimizing the script code, wherein the determination is based on a pattern observed in historical usage of a portion of the script code by a browser in connection with displaying the markup document or frequency of a portion of the script code called by a browser in connection with displaying the markup document. 10. The method of claim 9, wherein the determining step further comprises: deferring or reducing usage of a just-in-time compiler to optimize the script code. 11. The method of claim 9, wherein the determining step further comprises: deferring or reducing optimization of a loop body of the script code. 12. The method of claim 9, wherein the determining step further comprises: deferring or reducing interpreting the script code. 13. The method of claim 9, wherein the determining step further comprises: deferring or reducing generation of bytecodes based on the script code. 14. The method of claim 9, wherein the one or more phases includes loading the script code and interpreting the script code. 15. A system, comprising:
one or more processors and a memory; the one or more processors configured to:
receive script code by a script engine of a computing device, the script code being included or referenced in a markup document in response to a user request;
defer, by the script engine, parsing of the script code;
determine boundaries of one or more functions in the script code;
upon activation of one of the one or more functions in the script code, generate, by the script engine, executable code for the activated function; and
execute the activated function. 16. The system of claim 15, wherein activation of the one of the one or more functions is initiated by a browser application that calls the one of the one or more functions. 17. The system of claim 15, the one or more processors are further configured to:
insert a stub in the script code to indicate deferred parsing. 18. The system of claim 15, the one or more processors are further configured to:
during execution of the activated function, analyze the activated function to predict characteristics of the activated function that are used to generate specialized executable code for the activated function. 19. The system of claim 15, further comprising:
during generation of executable code for the activated function, analyze the activated function to determine characteristics of the activated function that are used to generate specialized executable code for the activated function. 20. A computing device, comprising:
at least one processor and a memory; the at least one processor configured to:
render a markup document, in response to a user request, concurrently while generating executable code for a script code embedded or referenced in the markup document;
based on a characteristic of the script code, selectively generate, concurrently with rendering the markup document, alternative executable code, the alternative executable code different from the executable code; and
substitute the executable code with the alternative executable code. 21. The computing device of claim 20, wherein the at least one processor is further configured to:
execute a garbage collection process for objects no longer used or referenced by the markup document. 22. The computing device of claim 20, wherein the at least one processor is further configured to observe the characteristics of the script code during interpretation of the script code. 23. The computing device of claim 20, wherein the at least one processor is further configured to determine the characteristics of the script code as a result of observing the script code during execution of the script code. 24. The computing device of claim 20, wherein the characteristics of the script code is based on one or more common code paths, usage of executed code or a prediction of code usage. 25. The computing device of claim 20, wherein the characteristics of the script code is based on a function of a ratio of a size of one or more loops in the script code to an overall size of the script code, a measurement of a computational intensity of the script code or an analysis of a call tree associated with the script code. 26. The computing device of claim 20, wherein substitute the executable code with the alternative executable code is performed without interfering with a current execution of the executable code. 27. The computing device of claim 20, wherein substitute the executable code with the alternative executable code is performed by swapping in an address of the alternative executable code. 28. The computing device of claim 20, wherein the alternative executable code is generated based on a priority assigned to the script code | 2,100 |
5,798 | 5,798 | 15,182,837 | 2,121 | A mechanism is provided in a computing device configured with instructions executing on a processor of the computing device to implement a question answering system for answer scoring based on a specificity score. The question answering system, executing on the processor of the computing device and configured with a question answering machine learning model, generates a set of candidate answers for a user-generated input question. For each given candidate answer in the set of candidate answers, a specificity scorer of the question answering system determines a specificity value of each term in the given candidate answer based on a position of the term in a taxonomy data structure and determines a specificity score of the given candidate answer based on the specificity value of the terms in the given candidate answer. The question answering system, determines a confidence score for each candidate answer within the set of candidate answers based on its specificity score. The question answering system ranks the set of candidate answers according to confidence score to form a ranked set of candidate answers and returns the ranked set of candidate answers. | 1. A method, in a computing device configured with instructions executing on a processor of the computing device to implement a question answering system, for answer scoring based on a specificity score, the method comprising:
generating, by the question answering system executing on the processor of the computing device and configured with a question answering machine learning model, a set of candidate answers for a user-generated input question; for each given candidate answer in the set of candidate answers, determining, by a specificity scorer of the question answering system, a specificity value of each term in the given candidate answer based on a position of the term in a taxonomy data structure and determining a specificity score of the given candidate answer based on the specificity value of the terms in the given candidate answer; determining, by the question answering system, a confidence score for each candidate answer within the set of candidate answers based on its specificity score; ranking, by the question answering system, the set of candidate answers according to confidence score to form a ranked set of candidate answers; and returning, by the question answering system, the ranked set of candidate answers. 2. The method of claim 1, wherein each node of the taxonomy data structure is assigned a specificity value. 3. The method of claim 2, wherein each node of the taxonomy data structure has an associated informativity value; and
wherein determining the specificity value of each term in the given candidate answer comprises, responsive to the specificity scorer determining that a given term in the given candidate answer does not occur in the taxonomy data structure: determining an informativity value for the given term using corpus statistics; aligning the given term with a node in the taxonomy data structure based on informativity value; and assigning specificity value of the node in the taxonomy data structure to be the specificity value of the given term. 4. The method of claim 3, wherein determining the informativity value for the given term comprises determining an inverse Zipfian ranking of the given term as the informativity value. 5. The method of claim 3, wherein an informativity value of a given taxonomic group within the taxonomy data structure is an average of informativity values of member nodes in the taxonomic group. 6. The method of claim 2, wherein specificity values of the taxonomy data structure are determined heuristically or using a machine learning approach. 7. The method of claim 1, wherein determining the specificity score of the given candidate answer comprises determining a highest specificity value of the terms in the given candidate answer to be the specificity score of the given candidate answer. 8. A computer program product comprising a computer readable storage medium having a computer readable program stored therein, wherein the computer readable program comprises instructions, which when executed on a processor of a computing device causes the computing device to implement a question answering system for answer scoring based on a specificity score, wherein the computer readable program causes the computing device to:
generate, by the question answering system executing on the processor of the computing device and configured with a question answering machine learning model, a set of candidate answers for a user-generated input question; for each given candidate answer in the set of candidate answers, determine, by a specificity scorer of the question answering system, a specificity value of each term in the given candidate answer based on a position of the term in a taxonomy data structure and determine a specificity score of the given candidate answer based on the specificity value of the terms in the given candidate answer; determine, by the question answering system, a confidence score for each candidate answer within the set of candidate answers based on its specificity score; rank, by the question answering system, the set of candidate answers according to confidence score to form a ranked set of candidate answers; and return, by the question answering system, the ranked set of candidate answers. 9. The computer program product of claim 8, wherein each node of the taxonomy data structure is assigned a specificity value. 10. The computer program product of claim 9, wherein each node of the taxonomy data structure has an associated informativity value; and
wherein determining the specificity value of each term in the given candidate answer comprises, responsive to the specificity scorer determining that a given term in the given candidate answer does not occur in the taxonomy data structure: determining an informativity value for the given term using corpus statistics; aligning the given term with a node in the taxonomy data structure based on informativity value; and assigning specificity value of the node in the taxonomy data structure to be the specificity value of the given term. 11. The computer program product of claim 10, wherein determining the informativity value for the given term comprises determining an inverse Zipfian ranking of the given term as the informativity value. 12. The computer program product of claim 10, wherein an informativity value of a given taxonomic group within the taxonomy data structure is an average of informativity values of member nodes in the taxonomic group. 13. The computer program product of claim 9, wherein specificity values of the taxonomy data structure are determined heuristically or using a machine learning approach. 14. The computer program product of claim 8, wherein determining the specificity score of the given candidate answer comprises determining a highest specificity value of the terms in the given candidate answer to be the specificity score of the given candidate answer. 15. A computing device comprising:
a processor; and a memory coupled to the processor, wherein the memory comprises instructions, which when executed on a processor of a computing device causes the computing device to implement a question answering system for answer scoring based on a specificity score, wherein the instructions cause the processor to: generate, by the question answering system executing on the processor of the computing device and configured with a question answering machine learning model, a set of candidate answers for a user-generated input question; for each given candidate answer in the set of candidate answers, determine, by a specificity scorer of the question answering system, a specificity value of each term in the given candidate answer based on a position of the term in a taxonomy data structure and determine a specificity score of the given candidate answer based on the specificity value of the terms in the given candidate answer; determine, by the question answering system, a confidence score for each candidate answer within the set of candidate answers based on its specificity score; rank, by the question answering system, the set of candidate answers according to confidence score to form a ranked set of candidate answers; and return, by the question answering system, the ranked set of candidate answers. 16. The computing device of claim 15, wherein each node of the taxonomy data structure is assigned a specificity value. 17. The computing device of claim 16, wherein each node of the taxonomy data structure has an associated informativity value; and
wherein determining the specificity value of each tern in the given candidate answer comprises, responsive to the specificity scorer determining that a given term in the given candidate answer does not occur in the taxonomy data structure: determining an informativity value for the given term using corpus statistics; aligning the given term with a node in the taxonomy data structure based on informativity value; and assigning specificity value of the node in the taxonomy data structure to be the specificity value of the given term. 18. The computing device of claim 17, wherein determining the informativity value for the given term comprises determining an inverse Zipfian ranking of the given term as the informativity value. 19. The computing device of claim 17, wherein an informativity value of a given taxonomic group within the taxonomy data structure is an average of informativity values of member nodes in the taxonomic group. 20. The computing device of claim 15, wherein determining the specificity score of the given candidate answer comprises determining a highest specificity value of the terms in the given candidate answer to be the specificity score of the given candidate answer. | A mechanism is provided in a computing device configured with instructions executing on a processor of the computing device to implement a question answering system for answer scoring based on a specificity score. The question answering system, executing on the processor of the computing device and configured with a question answering machine learning model, generates a set of candidate answers for a user-generated input question. For each given candidate answer in the set of candidate answers, a specificity scorer of the question answering system determines a specificity value of each term in the given candidate answer based on a position of the term in a taxonomy data structure and determines a specificity score of the given candidate answer based on the specificity value of the terms in the given candidate answer. The question answering system, determines a confidence score for each candidate answer within the set of candidate answers based on its specificity score. The question answering system ranks the set of candidate answers according to confidence score to form a ranked set of candidate answers and returns the ranked set of candidate answers.1. A method, in a computing device configured with instructions executing on a processor of the computing device to implement a question answering system, for answer scoring based on a specificity score, the method comprising:
generating, by the question answering system executing on the processor of the computing device and configured with a question answering machine learning model, a set of candidate answers for a user-generated input question; for each given candidate answer in the set of candidate answers, determining, by a specificity scorer of the question answering system, a specificity value of each term in the given candidate answer based on a position of the term in a taxonomy data structure and determining a specificity score of the given candidate answer based on the specificity value of the terms in the given candidate answer; determining, by the question answering system, a confidence score for each candidate answer within the set of candidate answers based on its specificity score; ranking, by the question answering system, the set of candidate answers according to confidence score to form a ranked set of candidate answers; and returning, by the question answering system, the ranked set of candidate answers. 2. The method of claim 1, wherein each node of the taxonomy data structure is assigned a specificity value. 3. The method of claim 2, wherein each node of the taxonomy data structure has an associated informativity value; and
wherein determining the specificity value of each term in the given candidate answer comprises, responsive to the specificity scorer determining that a given term in the given candidate answer does not occur in the taxonomy data structure: determining an informativity value for the given term using corpus statistics; aligning the given term with a node in the taxonomy data structure based on informativity value; and assigning specificity value of the node in the taxonomy data structure to be the specificity value of the given term. 4. The method of claim 3, wherein determining the informativity value for the given term comprises determining an inverse Zipfian ranking of the given term as the informativity value. 5. The method of claim 3, wherein an informativity value of a given taxonomic group within the taxonomy data structure is an average of informativity values of member nodes in the taxonomic group. 6. The method of claim 2, wherein specificity values of the taxonomy data structure are determined heuristically or using a machine learning approach. 7. The method of claim 1, wherein determining the specificity score of the given candidate answer comprises determining a highest specificity value of the terms in the given candidate answer to be the specificity score of the given candidate answer. 8. A computer program product comprising a computer readable storage medium having a computer readable program stored therein, wherein the computer readable program comprises instructions, which when executed on a processor of a computing device causes the computing device to implement a question answering system for answer scoring based on a specificity score, wherein the computer readable program causes the computing device to:
generate, by the question answering system executing on the processor of the computing device and configured with a question answering machine learning model, a set of candidate answers for a user-generated input question; for each given candidate answer in the set of candidate answers, determine, by a specificity scorer of the question answering system, a specificity value of each term in the given candidate answer based on a position of the term in a taxonomy data structure and determine a specificity score of the given candidate answer based on the specificity value of the terms in the given candidate answer; determine, by the question answering system, a confidence score for each candidate answer within the set of candidate answers based on its specificity score; rank, by the question answering system, the set of candidate answers according to confidence score to form a ranked set of candidate answers; and return, by the question answering system, the ranked set of candidate answers. 9. The computer program product of claim 8, wherein each node of the taxonomy data structure is assigned a specificity value. 10. The computer program product of claim 9, wherein each node of the taxonomy data structure has an associated informativity value; and
wherein determining the specificity value of each term in the given candidate answer comprises, responsive to the specificity scorer determining that a given term in the given candidate answer does not occur in the taxonomy data structure: determining an informativity value for the given term using corpus statistics; aligning the given term with a node in the taxonomy data structure based on informativity value; and assigning specificity value of the node in the taxonomy data structure to be the specificity value of the given term. 11. The computer program product of claim 10, wherein determining the informativity value for the given term comprises determining an inverse Zipfian ranking of the given term as the informativity value. 12. The computer program product of claim 10, wherein an informativity value of a given taxonomic group within the taxonomy data structure is an average of informativity values of member nodes in the taxonomic group. 13. The computer program product of claim 9, wherein specificity values of the taxonomy data structure are determined heuristically or using a machine learning approach. 14. The computer program product of claim 8, wherein determining the specificity score of the given candidate answer comprises determining a highest specificity value of the terms in the given candidate answer to be the specificity score of the given candidate answer. 15. A computing device comprising:
a processor; and a memory coupled to the processor, wherein the memory comprises instructions, which when executed on a processor of a computing device causes the computing device to implement a question answering system for answer scoring based on a specificity score, wherein the instructions cause the processor to: generate, by the question answering system executing on the processor of the computing device and configured with a question answering machine learning model, a set of candidate answers for a user-generated input question; for each given candidate answer in the set of candidate answers, determine, by a specificity scorer of the question answering system, a specificity value of each term in the given candidate answer based on a position of the term in a taxonomy data structure and determine a specificity score of the given candidate answer based on the specificity value of the terms in the given candidate answer; determine, by the question answering system, a confidence score for each candidate answer within the set of candidate answers based on its specificity score; rank, by the question answering system, the set of candidate answers according to confidence score to form a ranked set of candidate answers; and return, by the question answering system, the ranked set of candidate answers. 16. The computing device of claim 15, wherein each node of the taxonomy data structure is assigned a specificity value. 17. The computing device of claim 16, wherein each node of the taxonomy data structure has an associated informativity value; and
wherein determining the specificity value of each tern in the given candidate answer comprises, responsive to the specificity scorer determining that a given term in the given candidate answer does not occur in the taxonomy data structure: determining an informativity value for the given term using corpus statistics; aligning the given term with a node in the taxonomy data structure based on informativity value; and assigning specificity value of the node in the taxonomy data structure to be the specificity value of the given term. 18. The computing device of claim 17, wherein determining the informativity value for the given term comprises determining an inverse Zipfian ranking of the given term as the informativity value. 19. The computing device of claim 17, wherein an informativity value of a given taxonomic group within the taxonomy data structure is an average of informativity values of member nodes in the taxonomic group. 20. The computing device of claim 15, wherein determining the specificity score of the given candidate answer comprises determining a highest specificity value of the terms in the given candidate answer to be the specificity score of the given candidate answer. | 2,100 |
5,799 | 5,799 | 15,204,857 | 2,194 | A method for generating training data is disclosed. The method may include executing a simulation process. The simulation process may include traversing a virtual, forward-looking sensor over a virtual road surface defining at least one virtual railroad crossing. During the traversing, the virtual sensor may be moved with respect to the virtual road surface as dictated by a vehicle-motion model modeling motion of a vehicle driving on the virtual road surface while carrying the virtual sensor. Virtual sensor data characterizing the virtual road surface may be recorded. The virtual sensor data may correspond to what a real sensor would have output had it sensed the road surface in the real world. | 1. A method comprising:
traversing, by a computer system, one or more virtual sensors over a virtual road surface in a simulation; recording, by the computer system, data corresponding to signals output by the one or more virtual sensors during the traversing, wherein the data characterizes a virtual railroad crossing in the virtual road surface; and annotating, by the computer system, the data with ground-truth data corresponding to the virtual railroad crossing. 2. The method of claim 1, wherein the virtual railroad crossing is one of a plurality of virtual railroad crossings distributed cross the virtual road surface, each virtual railroad crossing of the plurality of virtual railroad crossings defining a structure sensible by the a first sensor of the one or more virtual sensors. 3. The method of claim 2, wherein the traversing comprises moving each of the one or more virtual sensors with respect to the virtual road surface as dictated by a vehicle-motion model modeling motion of a vehicle carrying the one or more virtual sensors and driving on the virtual road surface. 4. The method of claim 3, wherein the one or more virtual sensors comprise a forward-looking sensor positioned to sense a portion of the virtual road surface ahead of the vehicle. 5. The method of claim 4, wherein the forward-looking sensor is a camera, radar, or lidar device. 6. The method of claim 5, wherein the data further characterizes weather conditions proximate the virtual road surface. 7. The method of claim 6, wherein the annotating further comprises annotating the data with ground-truth information corresponding to the weather conditions proximate the virtual road surface. 8. The method of claim 7, wherein a second virtual sensor comprises a thermometer. 9. The method of claim 8, wherein the data characterizes an ambient temperature proximate the virtual road surface. 10. The method of claim 9, wherein the annotating further comprises annotating the data with ground-truth information comprising at least one temperature value proximate the virtual road surface. 11. A method of generating training data, the method comprising:
executing, by a computer system, a simulation comprising
traversing one or more virtual sensors over a virtual road surface, the virtual road surface defining one or more virtual railroad crossings that are each sensible by a first sensor of the one or more virtual sensors, and
moving, during the traversing, each of the one or more virtual sensors with respect to the virtual road surface as dictated by a vehicle-motion model modeling motion of a vehicle driving on the virtual road surface while carrying the one or more virtual sensors; and
recording, by the computer system, perception data characterizing the one or more virtual railroad crossings, the data corresponding to signal output by the first virtual sensor during the traversing. 12. The method of claim 11, further comprising annotating, by the computer system, the perception data with ground-truth data corresponding to each of the one or more virtual railroad crossings. 13. The method of claim 12, wherein the first virtual sensor comprises a forward-looking sensor positioned to sense a portion of the virtual road surface ahead of the vehicle. 14. The method of claim 13, wherein the forward-looking sensor is a camera, radar, or lidar device. 15. The method of claim 14, wherein the perception data further characterizes weather conditions proximate the virtual road surface. 16. The method of claim 15, wherein the annotating further comprises annotating the perception data with ground-truth data corresponding to the weather conditions proximate the virtual road surface. 17. The method of claim 16, wherein a second virtual sensor comprises a thermometer. 18. The method of claim 17, wherein the perception data characterizes an ambient temperature proximate the virtual road surface. 19. The method of claim 18, wherein the annotating further comprises annotating the perception data with ground-truth data comprising at least one temperature value proximate the virtual road surface. 20. A computer system comprising:
one or more processors; memory operably connected to the one or more processors; and the memory storing
a virtual driving environment programmed to include a plurality of virtual railroad crossings,
a first software model programmed to model a forward-looking sensor,
a second software model programmed to model a vehicle, and
a simulation module programmed to use the virtual driving environment, the first software model, and the second software model to produce an output modeling what would be output by the forward-looking sensor had the forward-looking sensor been mounted to the vehicle and the vehicle had driven on an actual driving environment matching the virtual driving environment. | A method for generating training data is disclosed. The method may include executing a simulation process. The simulation process may include traversing a virtual, forward-looking sensor over a virtual road surface defining at least one virtual railroad crossing. During the traversing, the virtual sensor may be moved with respect to the virtual road surface as dictated by a vehicle-motion model modeling motion of a vehicle driving on the virtual road surface while carrying the virtual sensor. Virtual sensor data characterizing the virtual road surface may be recorded. The virtual sensor data may correspond to what a real sensor would have output had it sensed the road surface in the real world.1. A method comprising:
traversing, by a computer system, one or more virtual sensors over a virtual road surface in a simulation; recording, by the computer system, data corresponding to signals output by the one or more virtual sensors during the traversing, wherein the data characterizes a virtual railroad crossing in the virtual road surface; and annotating, by the computer system, the data with ground-truth data corresponding to the virtual railroad crossing. 2. The method of claim 1, wherein the virtual railroad crossing is one of a plurality of virtual railroad crossings distributed cross the virtual road surface, each virtual railroad crossing of the plurality of virtual railroad crossings defining a structure sensible by the a first sensor of the one or more virtual sensors. 3. The method of claim 2, wherein the traversing comprises moving each of the one or more virtual sensors with respect to the virtual road surface as dictated by a vehicle-motion model modeling motion of a vehicle carrying the one or more virtual sensors and driving on the virtual road surface. 4. The method of claim 3, wherein the one or more virtual sensors comprise a forward-looking sensor positioned to sense a portion of the virtual road surface ahead of the vehicle. 5. The method of claim 4, wherein the forward-looking sensor is a camera, radar, or lidar device. 6. The method of claim 5, wherein the data further characterizes weather conditions proximate the virtual road surface. 7. The method of claim 6, wherein the annotating further comprises annotating the data with ground-truth information corresponding to the weather conditions proximate the virtual road surface. 8. The method of claim 7, wherein a second virtual sensor comprises a thermometer. 9. The method of claim 8, wherein the data characterizes an ambient temperature proximate the virtual road surface. 10. The method of claim 9, wherein the annotating further comprises annotating the data with ground-truth information comprising at least one temperature value proximate the virtual road surface. 11. A method of generating training data, the method comprising:
executing, by a computer system, a simulation comprising
traversing one or more virtual sensors over a virtual road surface, the virtual road surface defining one or more virtual railroad crossings that are each sensible by a first sensor of the one or more virtual sensors, and
moving, during the traversing, each of the one or more virtual sensors with respect to the virtual road surface as dictated by a vehicle-motion model modeling motion of a vehicle driving on the virtual road surface while carrying the one or more virtual sensors; and
recording, by the computer system, perception data characterizing the one or more virtual railroad crossings, the data corresponding to signal output by the first virtual sensor during the traversing. 12. The method of claim 11, further comprising annotating, by the computer system, the perception data with ground-truth data corresponding to each of the one or more virtual railroad crossings. 13. The method of claim 12, wherein the first virtual sensor comprises a forward-looking sensor positioned to sense a portion of the virtual road surface ahead of the vehicle. 14. The method of claim 13, wherein the forward-looking sensor is a camera, radar, or lidar device. 15. The method of claim 14, wherein the perception data further characterizes weather conditions proximate the virtual road surface. 16. The method of claim 15, wherein the annotating further comprises annotating the perception data with ground-truth data corresponding to the weather conditions proximate the virtual road surface. 17. The method of claim 16, wherein a second virtual sensor comprises a thermometer. 18. The method of claim 17, wherein the perception data characterizes an ambient temperature proximate the virtual road surface. 19. The method of claim 18, wherein the annotating further comprises annotating the perception data with ground-truth data comprising at least one temperature value proximate the virtual road surface. 20. A computer system comprising:
one or more processors; memory operably connected to the one or more processors; and the memory storing
a virtual driving environment programmed to include a plurality of virtual railroad crossings,
a first software model programmed to model a forward-looking sensor,
a second software model programmed to model a vehicle, and
a simulation module programmed to use the virtual driving environment, the first software model, and the second software model to produce an output modeling what would be output by the forward-looking sensor had the forward-looking sensor been mounted to the vehicle and the vehicle had driven on an actual driving environment matching the virtual driving environment. | 2,100 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.