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,300 | 5,300 | 14,697,490 | 2,125 | A management system for a computer system is disclosed. The computer system operates or includes various products (e.g., software products) that can be managed in a management system or collectively by a group of management systems. Typically, the management system operates on a computer separate from the computer system being managed. The management system can make use of a knowledge base of causing symptoms for previously observed problems at other sites or computer systems. In other words, the knowledge base can built from and shared by different users across different products to leverage knowledge that is otherwise disparate. The knowledge base typically grows over time. The management system can use its ability to request information from the computer system being managed together with the knowledge base to infer a problem root cause in the computer system being managed. The computer system being managed can also request the management system to process its knowledge base for possible problem cause analysis. The management system can also continually identify persisting problem causing symptoms. | 1. A non-transitory computer-readable medium including at least computer program code stored therein for managing an enterprise computer system, the enterprise computer system being configured to operate a plurality of different software products, said computer-readable medium comprising:
computer program code for receiving a fact pertaining to a condition of at least one of the plurality of different software products that are operating in the enterprise computer system; computer program code for asserting the fact to an inference engine, the inference engine using rules based on facts, the rules are obtained from a knowledge base that stores the rules as well as resources associated with the plurality of different software programs; computer program code for retrieving at least one updated fact from the inference engine based on at least one rule from those of the rules stored in the knowledge base that are dependent on the fact that has been asserted; computer program code for initiating an action in view of the at least one updated fact; computer program code for diagnosing a software problem at the enterprise computer system due to at least one of the plurality of different software programs operating at the enterprise computer system, using the inference engine and the at least one rule from the knowledge base; and computer program code for making log entries to store log data in a log, wherein at least one of the log entries pertains to at least the fact that has been asserted, wherein at least one of the log entries pertains to the at least one updated fact, wherein at least one of the log entries pertains to the action being initiated, and wherein at least one of the log entries pertains to debug data. | A management system for a computer system is disclosed. The computer system operates or includes various products (e.g., software products) that can be managed in a management system or collectively by a group of management systems. Typically, the management system operates on a computer separate from the computer system being managed. The management system can make use of a knowledge base of causing symptoms for previously observed problems at other sites or computer systems. In other words, the knowledge base can built from and shared by different users across different products to leverage knowledge that is otherwise disparate. The knowledge base typically grows over time. The management system can use its ability to request information from the computer system being managed together with the knowledge base to infer a problem root cause in the computer system being managed. The computer system being managed can also request the management system to process its knowledge base for possible problem cause analysis. The management system can also continually identify persisting problem causing symptoms.1. A non-transitory computer-readable medium including at least computer program code stored therein for managing an enterprise computer system, the enterprise computer system being configured to operate a plurality of different software products, said computer-readable medium comprising:
computer program code for receiving a fact pertaining to a condition of at least one of the plurality of different software products that are operating in the enterprise computer system; computer program code for asserting the fact to an inference engine, the inference engine using rules based on facts, the rules are obtained from a knowledge base that stores the rules as well as resources associated with the plurality of different software programs; computer program code for retrieving at least one updated fact from the inference engine based on at least one rule from those of the rules stored in the knowledge base that are dependent on the fact that has been asserted; computer program code for initiating an action in view of the at least one updated fact; computer program code for diagnosing a software problem at the enterprise computer system due to at least one of the plurality of different software programs operating at the enterprise computer system, using the inference engine and the at least one rule from the knowledge base; and computer program code for making log entries to store log data in a log, wherein at least one of the log entries pertains to at least the fact that has been asserted, wherein at least one of the log entries pertains to the at least one updated fact, wherein at least one of the log entries pertains to the action being initiated, and wherein at least one of the log entries pertains to debug data. | 2,100 |
5,301 | 5,301 | 14,469,885 | 2,191 | In one aspect, a device includes at least one processor and a memory accessible to the at least one processor. The memory bears instructions executable by the at least one processor to determine that a virtual machine (VM) at the device is in an at least partially idle state and pause the VM in response to the determination that the VM is in an at least partially idle state. | 1. A device, comprising:
at least one processor; and a memory accessible to the at least one processor and bearing instructions executable by the at least one processor to: determine that a virtual machine (VM) at the device is in an at least partially idle state; pause the VM in response to the determination that the VM is in an at least partially idle state; and present at least one user interface (UI) on a display, the UI including an indication that the VM is idle, the UI also including at least a first selector element selectable to automatically without further user input pause the VM and at least a second selector element selectable to automatically without further user input put the VM in a sleep or hibernate state. 2. The device of claim 1, wherein the instructions are executable to:
determine that the VM is in the at least partially idle state at least in part based on a determination that the VM is not performing at least one operation at any hard disk drive of the device. 3. The device of claim 1, wherein the instructions are executable to:
determine that the VM is in the at least partially idle state at least in part based on a determination that the VM has not been performing at least one operation at any hard disk drive of the device for at least a threshold amount of time. 4. The device of claim 1, wherein the instructions are executable to:
determine that the VM is in the at least partially idle state at least in part based on a determination that the VM is not performing at least one operation at any hard disk drive of the device at the time the determination is made that the VM is not performing at least one operation at any hard disk drive of the device. 5. The device of claim 1, wherein the instructions are executable to:
determine that the VM is in the at least partially idle state at least in part based on a determination that the VM is not using a processor of the device to perform at least one operation. 6. The device of claim 1, wherein the instructions are executable to:
determine that the VM is in the at least partially idle state at least in part based on a determination that the VM has not been using a processor of the device to perform at least one operation for at least a threshold amount of time. 7. The device of claim 1, wherein the instructions are executable to:
determine that the VM is in the at least partially idle state at least in part based on a determination that the VM is not using a processor of the device to perform at least one operation at the time the determination is made that the VM is not using a processor of the device to perform at least one operation. 8. The device of claim 1, wherein the pause of the VM is a pause that does not comprise the VM being in one of the group consisting of: a sleep state, hibernate state, an off state, a power off state. 9. The device of claim 1, wherein the instructions are executable to:
during pause of the VM, maintain a virtual machine memory file for the VM in random access memory (RAM) of the device. 10. The device of claim 1, wherein the instructions are further executable to:
unpause the VM in response to receipt at the device of a request. 11. The device of claim 10, wherein the request is received at a predefined port for which the VM is to be unpaused in response to receipt of the request at the predefined port. 12. The device of claim 10, wherein the request is an unpause request. 13. The device of claim 10, wherein the request is a request to perform an input/output (I/O) operation which uses the VM. 14. The device of claim 11, wherein the request is identified by a service proxy operating at the device, and wherein the service proxy unpauses the VM in response to receipt of the request. 15. A method, comprising:
identifying that a virtual machine (VM) on a server is in an idle state; pausing the VM in response to identifying that the VM is in the idle state without receiving user input to pause the VM subsequent to the identifying that the VM is in the idle state; resuming operation of the VM in response to receipt at the server of a signal identified as a signal type for which to resume operation of the VM; and presenting on a display at least one user interface (UI), the UI including an indication that the VM is paused, the UI including at least a first selector element selectable to automatically without further user input unpause the VM, and a second selector element selectable to automatically without further user input decline to unpause the VM. 16. The method of claim 15, comprising:
operating a driver at the server which identifies that the VM is in an idle state and notifies a host processor on the server that the VM is to be paused. 17. The method of claim 15, comprising:
pausing, without the aid of a driver, the VM using a host processor of the server. 18. A computer readable storage medium that is not a carrier wave, the computer readable storage medium comprising instructions executable by a processor to:
determine that a virtual machine (VM) running at a device is not using a processor on the device to perform at least one function; pause operation of the VM in response to the determination; and present on a display at least one user interface (UI), the UI including at least a first setting to establish a threshold amount of time of no action, operations, and/or functions being executed at the VM such that upon the threshold amount of time being met the VM is paused, the UI including a first selector selectable to cause an automatic pause of the VM when the VM is idle and a second selector to decline to permit a user to pause the VM, the UI further including a second setting for establishing a second threshold amount of time, wherein the second threshold amount of time pertains to placing the VM when already in a pause state in a hibernation and/or sleep state from the pause state responsive to determining that the VM has been paused for the second threshold amount of time. 19. The computer readable storage medium of claim 18, wherein operation of the VM is paused at least in part using an application running on the device that is separate from the VM. 20. The computer readable storage medium of claim 18, wherein the instructions are further executable to:
operate a service proxy to make a determination that a request has been received at the device to perform a function at least in part using the VM; and operate the service proxy to resume operation of the VM. | In one aspect, a device includes at least one processor and a memory accessible to the at least one processor. The memory bears instructions executable by the at least one processor to determine that a virtual machine (VM) at the device is in an at least partially idle state and pause the VM in response to the determination that the VM is in an at least partially idle state.1. A device, comprising:
at least one processor; and a memory accessible to the at least one processor and bearing instructions executable by the at least one processor to: determine that a virtual machine (VM) at the device is in an at least partially idle state; pause the VM in response to the determination that the VM is in an at least partially idle state; and present at least one user interface (UI) on a display, the UI including an indication that the VM is idle, the UI also including at least a first selector element selectable to automatically without further user input pause the VM and at least a second selector element selectable to automatically without further user input put the VM in a sleep or hibernate state. 2. The device of claim 1, wherein the instructions are executable to:
determine that the VM is in the at least partially idle state at least in part based on a determination that the VM is not performing at least one operation at any hard disk drive of the device. 3. The device of claim 1, wherein the instructions are executable to:
determine that the VM is in the at least partially idle state at least in part based on a determination that the VM has not been performing at least one operation at any hard disk drive of the device for at least a threshold amount of time. 4. The device of claim 1, wherein the instructions are executable to:
determine that the VM is in the at least partially idle state at least in part based on a determination that the VM is not performing at least one operation at any hard disk drive of the device at the time the determination is made that the VM is not performing at least one operation at any hard disk drive of the device. 5. The device of claim 1, wherein the instructions are executable to:
determine that the VM is in the at least partially idle state at least in part based on a determination that the VM is not using a processor of the device to perform at least one operation. 6. The device of claim 1, wherein the instructions are executable to:
determine that the VM is in the at least partially idle state at least in part based on a determination that the VM has not been using a processor of the device to perform at least one operation for at least a threshold amount of time. 7. The device of claim 1, wherein the instructions are executable to:
determine that the VM is in the at least partially idle state at least in part based on a determination that the VM is not using a processor of the device to perform at least one operation at the time the determination is made that the VM is not using a processor of the device to perform at least one operation. 8. The device of claim 1, wherein the pause of the VM is a pause that does not comprise the VM being in one of the group consisting of: a sleep state, hibernate state, an off state, a power off state. 9. The device of claim 1, wherein the instructions are executable to:
during pause of the VM, maintain a virtual machine memory file for the VM in random access memory (RAM) of the device. 10. The device of claim 1, wherein the instructions are further executable to:
unpause the VM in response to receipt at the device of a request. 11. The device of claim 10, wherein the request is received at a predefined port for which the VM is to be unpaused in response to receipt of the request at the predefined port. 12. The device of claim 10, wherein the request is an unpause request. 13. The device of claim 10, wherein the request is a request to perform an input/output (I/O) operation which uses the VM. 14. The device of claim 11, wherein the request is identified by a service proxy operating at the device, and wherein the service proxy unpauses the VM in response to receipt of the request. 15. A method, comprising:
identifying that a virtual machine (VM) on a server is in an idle state; pausing the VM in response to identifying that the VM is in the idle state without receiving user input to pause the VM subsequent to the identifying that the VM is in the idle state; resuming operation of the VM in response to receipt at the server of a signal identified as a signal type for which to resume operation of the VM; and presenting on a display at least one user interface (UI), the UI including an indication that the VM is paused, the UI including at least a first selector element selectable to automatically without further user input unpause the VM, and a second selector element selectable to automatically without further user input decline to unpause the VM. 16. The method of claim 15, comprising:
operating a driver at the server which identifies that the VM is in an idle state and notifies a host processor on the server that the VM is to be paused. 17. The method of claim 15, comprising:
pausing, without the aid of a driver, the VM using a host processor of the server. 18. A computer readable storage medium that is not a carrier wave, the computer readable storage medium comprising instructions executable by a processor to:
determine that a virtual machine (VM) running at a device is not using a processor on the device to perform at least one function; pause operation of the VM in response to the determination; and present on a display at least one user interface (UI), the UI including at least a first setting to establish a threshold amount of time of no action, operations, and/or functions being executed at the VM such that upon the threshold amount of time being met the VM is paused, the UI including a first selector selectable to cause an automatic pause of the VM when the VM is idle and a second selector to decline to permit a user to pause the VM, the UI further including a second setting for establishing a second threshold amount of time, wherein the second threshold amount of time pertains to placing the VM when already in a pause state in a hibernation and/or sleep state from the pause state responsive to determining that the VM has been paused for the second threshold amount of time. 19. The computer readable storage medium of claim 18, wherein operation of the VM is paused at least in part using an application running on the device that is separate from the VM. 20. The computer readable storage medium of claim 18, wherein the instructions are further executable to:
operate a service proxy to make a determination that a request has been received at the device to perform a function at least in part using the VM; and operate the service proxy to resume operation of the VM. | 2,100 |
5,302 | 5,302 | 12,508,994 | 2,179 | An apparatus is provided to configure an online shopping portal that includes a plurality of site. The apparatus receives a request to configure a site of the online shopping portal. The apparatus provides a user interface (UI) shell that corresponds to the site. The apparatus provides an option to select a page of the site to configure. Based on the selected page, the UI shell comprises at least one placeholder and at least one UI content. The apparatus provides a selection mechanism configured to select the at least one UI content to be placed in the at least one placeholder. | 1. A computer readable medium having instructions stored thereon to configure an online shopping portal comprising a plurality of sites that, when executed by a processor, cause the processor to perform:
receive a request to configure a site of the online shopping portal; provide a user interface (UI) shell that corresponds to the site; provide an option to select a page of the site to configure, wherein, based on the selected page, the UI shell comprises at least one placeholder and at least one UI content; and provide a selection mechanism configured to select the at least one UI content to be placed in the at least one placeholder. 2. The computer readable medium of claim 1, wherein the selection mechanism allows a user to drag and drop the at least one UI component in the at least one placeholder. 3. The computer readable medium of claim 1, wherein, when a catalog page is selected as the page of the site to configure, the at least one UI content comprises at least one of: a narrow by UI content, a compare UI content, and a price range UI content. 4. The computer readable medium of claim 1, wherein, when an order details page is selected as the page of the site to configure, the at least one UI content comprises at least one of: a shipping details UI content and a service request UI content. 5. The computer readable medium of claim 1, wherein, when a product details page is selected as the page of the site to configure, the at least one UI content comprises at least one of: a related item UI content, a hot offers UI content, and a cross sell UI content. 6. The computer readable medium of claim 1, wherein, when all pages is selected as the page of the site to configure, the at least one UI content comprises at least one of: a user profile UI content and a contact us UI content. 7. The computer readable medium of claim 1, wherein when the page of the site that is to be configured is selected, the at least one UI content is provided based on a set of rules,
wherein the set of rules is based on business and functional relevance of the at least one UI content with the page that is being selected, and wherein the page that is being selected comprises one of: all pages, a catalog page, an order details page, and a product details page. 8. The computer readable medium of claim 1, wherein the selection mechanism is further configured to select a menu type, a header, a footer, and a theme for the site. 9. The computer readable medium of claim 8, wherein the menu type comprises a set of menu types that includes at least one of: a vertical menu type and a horizontal menu type, and
wherein a new menu type is added to the set of menu types. 10. The computer readable medium of claim 8, wherein the header comprises a set of header that includes at least one of: a two level menu header and three level menu header, and
wherein a new header is added to the set of headers. 11. The computer readable medium of claim 8, wherein the footer comprises a set of footers that include at least one of: a copyright message or copyright and menu links, and
wherein a new footer is added to the set of footers. 12. The computer readable medium of claim 8, wherein the theme is based on a set of themes that includes at least one of: seasonal theme, a geographical theme, and a color theme, and
where a new theme is added to the set of themes. 13. The computer readable medium of claim 8, wherein, when a new store is created, the new store inherits the design of a default store which is created before the new store. 14. An apparatus to configure an online shopping portal comprising a plurality of sites, the apparatus comprising:
a receiver configured to a request to configure a site of the online shopping portal; and a graphical user interface configured to
provide a user interface (UI) shell that corresponds to the site,
provide an option to select a page of the site to configure, wherein, based on the selected page, the UI shell comprises at least one placeholder and at least one UI content; and
provide a selection mechanism configured to select the at least one UI content to be placed in the at least one placeholder. 15. The apparatus of claim 14, wherein the selection mechanism allows a user to drag and drop the at least one UI component in the at least one placeholder. 16. The apparatus of claim 14, wherein when the page of the site that is to be configured is selected, the at least one UI content is provided based on a set of rules,
wherein the set of rules is based on business and functional relevance of the at least one UI content with the page that is being selected, and wherein the page that is being selected comprises one of: all pages, a catalog page, an order details page, and a product details page. 17. A computer implemented method of configuring an online shopping portal comprising a plurality of sites, the method comprising:
receiving a request to configure a site of the online shopping portal, wherein the plurality of sites of the online shopping portal are based on at least one of: geography, business type, and customer type; providing a user interface (UI) shell that corresponds to the site; providing an option to select a page of the site to configure, wherein, based on the selected page, the UI shell comprises at least one placeholder and at least one UI content; and providing a selection mechanism configured to select the at least one UI content to be placed in the at least one placeholder. 18. The computer implemented method of claim 17, wherein the selection mechanism allows a user to drag and drop the at least one UI component in the at least one placeholder. 19. The computer implemented method claim 17, further comprising:
providing, by a default mechanism, at least one UI content that is applicable to all pages of the site when all pages is selected from a drop down; and applying the at least one UI content to all pages of the site when a user selected the at least one UI content. | An apparatus is provided to configure an online shopping portal that includes a plurality of site. The apparatus receives a request to configure a site of the online shopping portal. The apparatus provides a user interface (UI) shell that corresponds to the site. The apparatus provides an option to select a page of the site to configure. Based on the selected page, the UI shell comprises at least one placeholder and at least one UI content. The apparatus provides a selection mechanism configured to select the at least one UI content to be placed in the at least one placeholder.1. A computer readable medium having instructions stored thereon to configure an online shopping portal comprising a plurality of sites that, when executed by a processor, cause the processor to perform:
receive a request to configure a site of the online shopping portal; provide a user interface (UI) shell that corresponds to the site; provide an option to select a page of the site to configure, wherein, based on the selected page, the UI shell comprises at least one placeholder and at least one UI content; and provide a selection mechanism configured to select the at least one UI content to be placed in the at least one placeholder. 2. The computer readable medium of claim 1, wherein the selection mechanism allows a user to drag and drop the at least one UI component in the at least one placeholder. 3. The computer readable medium of claim 1, wherein, when a catalog page is selected as the page of the site to configure, the at least one UI content comprises at least one of: a narrow by UI content, a compare UI content, and a price range UI content. 4. The computer readable medium of claim 1, wherein, when an order details page is selected as the page of the site to configure, the at least one UI content comprises at least one of: a shipping details UI content and a service request UI content. 5. The computer readable medium of claim 1, wherein, when a product details page is selected as the page of the site to configure, the at least one UI content comprises at least one of: a related item UI content, a hot offers UI content, and a cross sell UI content. 6. The computer readable medium of claim 1, wherein, when all pages is selected as the page of the site to configure, the at least one UI content comprises at least one of: a user profile UI content and a contact us UI content. 7. The computer readable medium of claim 1, wherein when the page of the site that is to be configured is selected, the at least one UI content is provided based on a set of rules,
wherein the set of rules is based on business and functional relevance of the at least one UI content with the page that is being selected, and wherein the page that is being selected comprises one of: all pages, a catalog page, an order details page, and a product details page. 8. The computer readable medium of claim 1, wherein the selection mechanism is further configured to select a menu type, a header, a footer, and a theme for the site. 9. The computer readable medium of claim 8, wherein the menu type comprises a set of menu types that includes at least one of: a vertical menu type and a horizontal menu type, and
wherein a new menu type is added to the set of menu types. 10. The computer readable medium of claim 8, wherein the header comprises a set of header that includes at least one of: a two level menu header and three level menu header, and
wherein a new header is added to the set of headers. 11. The computer readable medium of claim 8, wherein the footer comprises a set of footers that include at least one of: a copyright message or copyright and menu links, and
wherein a new footer is added to the set of footers. 12. The computer readable medium of claim 8, wherein the theme is based on a set of themes that includes at least one of: seasonal theme, a geographical theme, and a color theme, and
where a new theme is added to the set of themes. 13. The computer readable medium of claim 8, wherein, when a new store is created, the new store inherits the design of a default store which is created before the new store. 14. An apparatus to configure an online shopping portal comprising a plurality of sites, the apparatus comprising:
a receiver configured to a request to configure a site of the online shopping portal; and a graphical user interface configured to
provide a user interface (UI) shell that corresponds to the site,
provide an option to select a page of the site to configure, wherein, based on the selected page, the UI shell comprises at least one placeholder and at least one UI content; and
provide a selection mechanism configured to select the at least one UI content to be placed in the at least one placeholder. 15. The apparatus of claim 14, wherein the selection mechanism allows a user to drag and drop the at least one UI component in the at least one placeholder. 16. The apparatus of claim 14, wherein when the page of the site that is to be configured is selected, the at least one UI content is provided based on a set of rules,
wherein the set of rules is based on business and functional relevance of the at least one UI content with the page that is being selected, and wherein the page that is being selected comprises one of: all pages, a catalog page, an order details page, and a product details page. 17. A computer implemented method of configuring an online shopping portal comprising a plurality of sites, the method comprising:
receiving a request to configure a site of the online shopping portal, wherein the plurality of sites of the online shopping portal are based on at least one of: geography, business type, and customer type; providing a user interface (UI) shell that corresponds to the site; providing an option to select a page of the site to configure, wherein, based on the selected page, the UI shell comprises at least one placeholder and at least one UI content; and providing a selection mechanism configured to select the at least one UI content to be placed in the at least one placeholder. 18. The computer implemented method of claim 17, wherein the selection mechanism allows a user to drag and drop the at least one UI component in the at least one placeholder. 19. The computer implemented method claim 17, further comprising:
providing, by a default mechanism, at least one UI content that is applicable to all pages of the site when all pages is selected from a drop down; and applying the at least one UI content to all pages of the site when a user selected the at least one UI content. | 2,100 |
5,303 | 5,303 | 14,994,242 | 2,184 | Signaling protocols for radio frequency front-end control interface (RFFE) buses are disclosed. In an exemplary aspect, the RFFE protocol is modified to provide addresses that are shorter than the normal four bits allocated by the RFFE protocol. By allocating fewer bits to an address, frames sent across an RFFE bus are shorter, and thus, bus turnaround time is improved, which reduces overall latency. Further, it is possible that shorter messages may provide incremental power savings. In a further exemplary aspect, different portions of a frame are transmitted using different data rates. In particular, a bus management portion may be sent using a single data rate (SDR), and a payload portion may be sent using a double data rate (DDR). The net effect of using the DDR on the payload portion is to reduce bus turnaround time, and thus, reduce latency. | 1. A method of constructing an address field for a frame on a radio frequency front-end control interface (RFFE) bus, the method comprising:
ascertaining a total number of addresses for devices associated with an RFFE bus; calculating a number of bits required to provide the total number of addresses; and setting a bit-field address-field length for a frame at a minimum number of bits based on the calculating. 2. The method of claim 1, wherein ascertaining the total number of addresses includes a first number of unique slave identifiers (USIDs) and a second number of group slave identifiers (GSIDs). 3. The method of claim 1, further comprising ascertaining a maximum number of registers associated with any of the devices associated with the RFFE bus;
calculating a register number of bits required to provide register addresses for the maximum number of registers; and setting a register-field address-field length at a register minimum number of bits based on the calculating. 4. The method of claim 1, further comprising setting a maximum packet payload size for the frame. 5. The method of claim 4, wherein the maximum packet payload size is three bytes. 6. The method of claim 1, further comprising transmitting the frame over the RFFE bus. 7. The method of claim 6, wherein transmitting the frame comprises transmitting a bus management portion of the frame at a first data rate and transmitting a payload portion of the frame at a second data rate. 8. The method of claim 7, wherein the first data rate comprises a single data rate (SDR) and the second data rate comprises a double data rate (DDR). 9. The method of claim 1, further comprising generating a capability inquiry from a master to a device relating to whether the device can accept short addresses. 10. The method of claim 9, further comprising receiving a response from the device at the master indicating whether the device can accept the short addresses. 11. A method of transmitting a frame on a radio frequency front-end control interface (RFFE) bus, the method comprising:
transmitting a first portion of a frame over an RFFE bus using a single data rate (SDR) technique; and transmitting a second portion of the frame over the RFFE bus using a double data rate (DDR) technique. 12. The method of claim 11, wherein transmitting the first portion of the frame comprises transmitting a bus management portion of the frame. 13. The method of claim 12, wherein transmitting the bus management portion of the frame comprises transmitting an address having fewer than four bits. 14. The method of claim 11, wherein transmitting the second portion of the frame comprises transmitting a payload portion of the frame. 15. The method of claim 14, wherein transmitting the second portion of the frame comprises transmitting no more than three bytes in the second portion of the frame. 16. The method of claim 14, wherein transmitting the second portion of the frame comprises transmitting a register address. 17. The method of claim 16, wherein transmitting the register address comprises transmitting a register address of fewer than eight bits. 18. A master comprising:
an interface configured to couple to a radio frequency front-end control interface (RFFE) bus; a transmitter configured to transmit over the RFFE bus through the interface; and a control system communicatively coupled to the transmitter and configured to:
ascertain a total number of addresses for devices associated with the RFFE bus;
calculate a number of bits required to provide the total number of addresses; and
set a bit-field address-field length for a frame at a minimum number of bits based on the calculating. 19. A device comprising:
an interface configured to couple to a radio frequency front-end control interface (RFFE) bus; a transmitter configured to transmit over the RFFE bus through the interface; and a receiver configured to receive data over the RFFE bus through the interface, the receiver comprising a decoder configured to decode both single data rate (SDR) data and double data rate (DDR) data. | Signaling protocols for radio frequency front-end control interface (RFFE) buses are disclosed. In an exemplary aspect, the RFFE protocol is modified to provide addresses that are shorter than the normal four bits allocated by the RFFE protocol. By allocating fewer bits to an address, frames sent across an RFFE bus are shorter, and thus, bus turnaround time is improved, which reduces overall latency. Further, it is possible that shorter messages may provide incremental power savings. In a further exemplary aspect, different portions of a frame are transmitted using different data rates. In particular, a bus management portion may be sent using a single data rate (SDR), and a payload portion may be sent using a double data rate (DDR). The net effect of using the DDR on the payload portion is to reduce bus turnaround time, and thus, reduce latency.1. A method of constructing an address field for a frame on a radio frequency front-end control interface (RFFE) bus, the method comprising:
ascertaining a total number of addresses for devices associated with an RFFE bus; calculating a number of bits required to provide the total number of addresses; and setting a bit-field address-field length for a frame at a minimum number of bits based on the calculating. 2. The method of claim 1, wherein ascertaining the total number of addresses includes a first number of unique slave identifiers (USIDs) and a second number of group slave identifiers (GSIDs). 3. The method of claim 1, further comprising ascertaining a maximum number of registers associated with any of the devices associated with the RFFE bus;
calculating a register number of bits required to provide register addresses for the maximum number of registers; and setting a register-field address-field length at a register minimum number of bits based on the calculating. 4. The method of claim 1, further comprising setting a maximum packet payload size for the frame. 5. The method of claim 4, wherein the maximum packet payload size is three bytes. 6. The method of claim 1, further comprising transmitting the frame over the RFFE bus. 7. The method of claim 6, wherein transmitting the frame comprises transmitting a bus management portion of the frame at a first data rate and transmitting a payload portion of the frame at a second data rate. 8. The method of claim 7, wherein the first data rate comprises a single data rate (SDR) and the second data rate comprises a double data rate (DDR). 9. The method of claim 1, further comprising generating a capability inquiry from a master to a device relating to whether the device can accept short addresses. 10. The method of claim 9, further comprising receiving a response from the device at the master indicating whether the device can accept the short addresses. 11. A method of transmitting a frame on a radio frequency front-end control interface (RFFE) bus, the method comprising:
transmitting a first portion of a frame over an RFFE bus using a single data rate (SDR) technique; and transmitting a second portion of the frame over the RFFE bus using a double data rate (DDR) technique. 12. The method of claim 11, wherein transmitting the first portion of the frame comprises transmitting a bus management portion of the frame. 13. The method of claim 12, wherein transmitting the bus management portion of the frame comprises transmitting an address having fewer than four bits. 14. The method of claim 11, wherein transmitting the second portion of the frame comprises transmitting a payload portion of the frame. 15. The method of claim 14, wherein transmitting the second portion of the frame comprises transmitting no more than three bytes in the second portion of the frame. 16. The method of claim 14, wherein transmitting the second portion of the frame comprises transmitting a register address. 17. The method of claim 16, wherein transmitting the register address comprises transmitting a register address of fewer than eight bits. 18. A master comprising:
an interface configured to couple to a radio frequency front-end control interface (RFFE) bus; a transmitter configured to transmit over the RFFE bus through the interface; and a control system communicatively coupled to the transmitter and configured to:
ascertain a total number of addresses for devices associated with the RFFE bus;
calculate a number of bits required to provide the total number of addresses; and
set a bit-field address-field length for a frame at a minimum number of bits based on the calculating. 19. A device comprising:
an interface configured to couple to a radio frequency front-end control interface (RFFE) bus; a transmitter configured to transmit over the RFFE bus through the interface; and a receiver configured to receive data over the RFFE bus through the interface, the receiver comprising a decoder configured to decode both single data rate (SDR) data and double data rate (DDR) data. | 2,100 |
5,304 | 5,304 | 15,181,187 | 2,177 | In one embodiment, a system and method for reporting lost items includes presenting a lost item reporting link associated with an entity having a plurality of different physical establishment locations; receiving a user selection of the lost item reporting link; presenting at a website, in response to the user selection of the lost item reporting link, a graphical user interface configured to solicit lost item recovery information, the website being associated with the entity having the plurality of different physical establishments; receiving the lost item recovery information via the graphical user interface; and transmitting the lost item recovery information to a third party online lost and found system. | 1. A computer-implemented method for reporting lost items, comprising:
receiving, via one or more computing devices, a user selection of a lost item reporting link presented on a webpage, the webpage with the lost item reporting link being presented on a display associated with another computing device and being associated with an entity; initiating, via the one or more computing devices, presentment on the display, in response to the user selection of the lost item reporting link, a graphical user interface to solicit lost item recovery information; receiving, via the one or more computing devices, the lost item recovery information via the graphical user interface, the lost item recovery information concerning a lost item and including at least (i) a designation of the entity, (ii) description of lost item, (iii) customer contact information, and (iv) shipping information for the lost item; preparing a lost and found report based on the lost item recovery information; initiating electronic transmission of the lost and found report to the entity based on contact information for the entity; and initiating electronic transmission of a notification concerning the lost item to the customer based on the customer contact information. 2. A non-transitory computer readable medium including at least computer program code stored thereon for reporting lost items, comprising:
computer program code for receiving a user selection of a lost item reporting link presented on a webpage, the webpage with the lost item reporting link being presented on a display associated with another computing device and being associated with an entity; computer program code for initiating presentment on the display, in response to the user selection of the lost item reporting link, a graphical user interface to solicit lost item recovery information; computer program code for receiving the lost item recovery information via the graphical user interface, the lost item recovery information concerning a lost item and including at least (i) a designation of the entity, (ii) description of lost item, (iii) contact information, and (iv) shipping information for the lost item; computer program code for preparing a lost and found report based on the lost item recovery information; computer program code for initiating electronic transmission of the lost and found report to the entity based on contact information for the entity; and computer program code for initiating electronic transmission of a notification concerning the lost item to the customer based on the customer contact information. | In one embodiment, a system and method for reporting lost items includes presenting a lost item reporting link associated with an entity having a plurality of different physical establishment locations; receiving a user selection of the lost item reporting link; presenting at a website, in response to the user selection of the lost item reporting link, a graphical user interface configured to solicit lost item recovery information, the website being associated with the entity having the plurality of different physical establishments; receiving the lost item recovery information via the graphical user interface; and transmitting the lost item recovery information to a third party online lost and found system.1. A computer-implemented method for reporting lost items, comprising:
receiving, via one or more computing devices, a user selection of a lost item reporting link presented on a webpage, the webpage with the lost item reporting link being presented on a display associated with another computing device and being associated with an entity; initiating, via the one or more computing devices, presentment on the display, in response to the user selection of the lost item reporting link, a graphical user interface to solicit lost item recovery information; receiving, via the one or more computing devices, the lost item recovery information via the graphical user interface, the lost item recovery information concerning a lost item and including at least (i) a designation of the entity, (ii) description of lost item, (iii) customer contact information, and (iv) shipping information for the lost item; preparing a lost and found report based on the lost item recovery information; initiating electronic transmission of the lost and found report to the entity based on contact information for the entity; and initiating electronic transmission of a notification concerning the lost item to the customer based on the customer contact information. 2. A non-transitory computer readable medium including at least computer program code stored thereon for reporting lost items, comprising:
computer program code for receiving a user selection of a lost item reporting link presented on a webpage, the webpage with the lost item reporting link being presented on a display associated with another computing device and being associated with an entity; computer program code for initiating presentment on the display, in response to the user selection of the lost item reporting link, a graphical user interface to solicit lost item recovery information; computer program code for receiving the lost item recovery information via the graphical user interface, the lost item recovery information concerning a lost item and including at least (i) a designation of the entity, (ii) description of lost item, (iii) contact information, and (iv) shipping information for the lost item; computer program code for preparing a lost and found report based on the lost item recovery information; computer program code for initiating electronic transmission of the lost and found report to the entity based on contact information for the entity; and computer program code for initiating electronic transmission of a notification concerning the lost item to the customer based on the customer contact information. | 2,100 |
5,305 | 5,305 | 14,825,495 | 2,114 | Reducing system downtime during memory subsystem maintenance in a computer processing system is disclosed. In some aspects, a computer processing system comprises a computer processor communicatively coupled to a plurality of memory sockets, each of which interfaces with a memory module and includes a gate control. The computer processor is further communicatively coupled to a dedicated non-volatile storage device. Upon detection of a memory health condition requiring replacement of a memory module, access to the memory module is blocked, and data is transferred from the memory module to the dedicated non-volatile storage device. A memory address range of the memory module is then remapped to the dedicated non-volatile storage device, such that subsequent memory access requests to the memory module are rerouted to the dedicated non-volatile storage device. The memory socket of the memory module is then gated, allowing maintenance to be performed while maintaining system availability. | 1. A computer processing system, comprising:
a plurality of memory sockets, each comprising a gate control and configured to interface with a memory module; a dedicated non-volatile storage device; and a computer processor communicatively coupled to the plurality of memory sockets and the dedicated non-volatile storage device; the computer processor configured to:
detect a memory health condition for a memory module interfaced with a memory socket among the plurality of memory sockets;
identify the memory module interfaced with the memory socket of the plurality of memory sockets as a source of the memory health condition;
transfer data stored in the memory module to the dedicated non-volatile storage device; and
cause voltage gating to be applied to the memory socket using the gate control of the memory socket to render the memory socket inactive. 2. The computer processing system of claim 1, wherein the computer processor is further configured to cause clock gating to be applied to the memory socket using the gate control of the memory socket. 3. The computer processing system of claim 1, wherein the computer processor is communicatively coupled to the dedicated non-volatile storage device via a high-speed serial device channel. 4. The computer processing system of claim 3, wherein the high-speed serial device channel is configured to operate according to a bus standard selected from the group consisting of: Peripheral Component Interconnect Express (PCIe); Serial AT Attachment (SATA); and Non-Volatile Memory Express (NVMe). 5. The computer processing system of claim 1, wherein:
each of the plurality of memory sockets further comprises an inactivity indicator; and the computer processor is further configured to provide an indication, using the inactivity indicator of the memory socket, that the memory module is inactive to facilitate removal of the memory module. 6. The computer processing system of claim 1, wherein the computer processor is further configured to, responsive to the memory socket receiving a replacement memory module:
restore power to the memory socket using the gate control of the memory socket; perform an initialization procedure on the replacement memory module; and transfer data from the dedicated non-volatile storage device to the replacement memory module. 7. The computer processing system of claim 1, wherein the computer processor is configured to detect the memory health condition by detecting, for the memory module interfaced with the memory socket of the plurality of memory sockets, at least one of the group consisting of a correctable memory error, an uncorrectable memory error, a temperature level, a voltage level, an indication of performance, a calibration value, and a user-initiated upgrade request, or any combination thereof. 8. The computer processing system of claim 1, wherein the computer processor is further configured to execute a built-in self test (BIST) on the dedicated non-volatile storage device at startup of the computer processing system. 9. The computer processing system of claim 1 integrated into an integrated circuit (IC). 10. The computer processing system of claim 1 integrated into a device selected from the group consisting of: a set top box; an entertainment unit; a navigation device; a communications device; a fixed location data unit; a mobile location data unit; a mobile phone; a cellular phone; a computer; a portable computer; a desktop computer; a personal digital assistant (PDA); a monitor; a computer monitor; a television; a tuner; a radio; a satellite radio; a music player; a digital music player; a portable music player; a digital video player; a video player; a digital video disc (DVD) player; and a portable digital video player. 11. A computer processing system, comprising:
a means for detecting a memory health condition for a memory module interfaced with a memory socket among a plurality of memory sockets; a means for identifying the memory module interfaced with the memory socket of the plurality of memory sockets as a source of the memory health condition; a means for transferring data stored in the memory module to a dedicated non-volatile storage device; and a means for causing voltage gating to be applied to the memory socket to render the memory socket inactive. 12. The computer processing system of claim 11, further comprising a means for causing clock gating to be applied to the memory socket. 13. The computer processing system of claim 11, further comprising a means for providing an indication that the memory module is inactive to facilitate removal of the memory module. 14. The computer processing system of claim 11, further comprising:
a means for restoring power to the memory module of the memory socket, responsive to the memory socket receiving a replacement memory module; a means for performing an initialization procedure on the replacement memory module; and a means for transferring data from the dedicated non-volatile storage device to the replacement memory module. 15. The computer processing system of claim 11, wherein the means for detecting the memory health condition comprises a means for detecting, for the memory module interfaced with the memory socket of the plurality of memory sockets, at least one of the group consisting of a correctable memory error, an uncorrectable memory error, a temperature level, a voltage level, an indication of performance, a calibration value, and a user-initiated upgrade request, or any combination thereof. 16. The computer processing system of claim 11, further comprising a means for executing a built-in self test (BIST) on the dedicated non-volatile storage device at startup of the computer processing system. 17. A method for facilitating maintenance of a computer processing system, comprising:
receiving an indication of a memory health condition of a memory module of a plurality of memory modules of a computer processing system; determining whether the memory health condition warrants replacement of the memory module; and responsive to determining that the memory health condition warrants the replacement of the memory module:
blocking access to a memory address range of the memory module based on receiving the indication of the memory health condition;
initiating a transfer of data stored in the memory module to a dedicated non-volatile storage device of the computer processing system; and
remapping the memory address range of the memory module to the dedicated non-volatile storage device. 18. The method of claim 17, further comprising initiating at least one of voltage gating and clock gating of a memory socket of the memory module. 19. The method of claim 17, further comprising:
blocking access to the memory address range of the dedicated non-volatile storage device; initiating a transfer of data from the dedicated non-volatile storage device to a replacement memory module; and remapping the memory address range to the replacement memory module. 20. The method of claim 17, wherein receiving the indication of the memory health condition comprises receiving an indication of, for the memory module of the plurality of memory modules, at least one of the group consisting of a correctable memory error, an uncorrectable memory error, a temperature level, a voltage level, an indication of performance, a calibration value, and a user-initiated upgrade request, or any combination thereof. 21. The method of claim 17, further comprising, responsive to determining that the memory health condition does not warrant the replacement of the memory module, maintaining a record of an occurrence of the memory health condition. 22. The method of claim 17, wherein determining whether the memory health condition warrants the replacement of the memory module is based on at least one of a memory health condition threshold and a user-provided replacement indication. 23. A non-transitory computer-readable medium having stored thereon computer executable instructions which, when executed by a processor, cause the processor to:
receive an indication of a memory health condition of a memory module of a plurality of memory modules of a computer processing system; determine whether the memory health condition warrants replacement of the memory module; and responsive to determining that the memory health condition warrants the replacement of the memory module:
block access to a memory address range of the memory module based on receiving the indication of the memory health condition;
initiate a transfer of data stored in the memory module to a dedicated non-volatile storage device of the computer processing system; and
remap the memory address range of the memory module to the dedicated non-volatile storage device. 24. The non-transitory computer-readable medium of claim 23 having stored thereon computer-executable instructions which, when executed by the processor, further cause the processor to initiate at least one of voltage gating and clock gating of a memory socket of the memory module. 25. The non-transitory computer-readable medium of claim 23 having stored thereon computer-executable instructions which, when executed by the processor, further cause the processor to:
block access to the memory address range of the dedicated non-volatile storage device;
initiate a transfer of data from the dedicated non-volatile storage device to a replacement memory module; and
remap the memory address range to the replacement memory module. 26. The non-transitory computer-readable medium of claim 23 having stored thereon computer-executable instructions which, when executed by the processor, further cause the processor to receive the indication of the memory health condition by receiving an indication of, for the memory module of the plurality of memory modules, at least one of the group consisting of a correctable memory error, an uncorrectable memory error, a temperature level, a voltage level, an indication of performance, a calibration value, and a user-initiated upgrade request, or any combination thereof. 27. The non-transitory computer-readable medium of claim 23 having stored thereon computer-executable instructions which, when executed by the processor, further cause the processor to, responsive to determining that the memory health condition does not warrant the replacement of the memory module, maintain a record of an occurrence of the memory health condition. 28. The non-transitory computer-readable medium of claim 23 having stored thereon computer-executable instructions which, when executed by the processor, further cause the processor to determine whether the memory health condition warrants the replacement of the memory module based on at least one of a memory health condition threshold and a user-provided replacement indication. | Reducing system downtime during memory subsystem maintenance in a computer processing system is disclosed. In some aspects, a computer processing system comprises a computer processor communicatively coupled to a plurality of memory sockets, each of which interfaces with a memory module and includes a gate control. The computer processor is further communicatively coupled to a dedicated non-volatile storage device. Upon detection of a memory health condition requiring replacement of a memory module, access to the memory module is blocked, and data is transferred from the memory module to the dedicated non-volatile storage device. A memory address range of the memory module is then remapped to the dedicated non-volatile storage device, such that subsequent memory access requests to the memory module are rerouted to the dedicated non-volatile storage device. The memory socket of the memory module is then gated, allowing maintenance to be performed while maintaining system availability.1. A computer processing system, comprising:
a plurality of memory sockets, each comprising a gate control and configured to interface with a memory module; a dedicated non-volatile storage device; and a computer processor communicatively coupled to the plurality of memory sockets and the dedicated non-volatile storage device; the computer processor configured to:
detect a memory health condition for a memory module interfaced with a memory socket among the plurality of memory sockets;
identify the memory module interfaced with the memory socket of the plurality of memory sockets as a source of the memory health condition;
transfer data stored in the memory module to the dedicated non-volatile storage device; and
cause voltage gating to be applied to the memory socket using the gate control of the memory socket to render the memory socket inactive. 2. The computer processing system of claim 1, wherein the computer processor is further configured to cause clock gating to be applied to the memory socket using the gate control of the memory socket. 3. The computer processing system of claim 1, wherein the computer processor is communicatively coupled to the dedicated non-volatile storage device via a high-speed serial device channel. 4. The computer processing system of claim 3, wherein the high-speed serial device channel is configured to operate according to a bus standard selected from the group consisting of: Peripheral Component Interconnect Express (PCIe); Serial AT Attachment (SATA); and Non-Volatile Memory Express (NVMe). 5. The computer processing system of claim 1, wherein:
each of the plurality of memory sockets further comprises an inactivity indicator; and the computer processor is further configured to provide an indication, using the inactivity indicator of the memory socket, that the memory module is inactive to facilitate removal of the memory module. 6. The computer processing system of claim 1, wherein the computer processor is further configured to, responsive to the memory socket receiving a replacement memory module:
restore power to the memory socket using the gate control of the memory socket; perform an initialization procedure on the replacement memory module; and transfer data from the dedicated non-volatile storage device to the replacement memory module. 7. The computer processing system of claim 1, wherein the computer processor is configured to detect the memory health condition by detecting, for the memory module interfaced with the memory socket of the plurality of memory sockets, at least one of the group consisting of a correctable memory error, an uncorrectable memory error, a temperature level, a voltage level, an indication of performance, a calibration value, and a user-initiated upgrade request, or any combination thereof. 8. The computer processing system of claim 1, wherein the computer processor is further configured to execute a built-in self test (BIST) on the dedicated non-volatile storage device at startup of the computer processing system. 9. The computer processing system of claim 1 integrated into an integrated circuit (IC). 10. The computer processing system of claim 1 integrated into a device selected from the group consisting of: a set top box; an entertainment unit; a navigation device; a communications device; a fixed location data unit; a mobile location data unit; a mobile phone; a cellular phone; a computer; a portable computer; a desktop computer; a personal digital assistant (PDA); a monitor; a computer monitor; a television; a tuner; a radio; a satellite radio; a music player; a digital music player; a portable music player; a digital video player; a video player; a digital video disc (DVD) player; and a portable digital video player. 11. A computer processing system, comprising:
a means for detecting a memory health condition for a memory module interfaced with a memory socket among a plurality of memory sockets; a means for identifying the memory module interfaced with the memory socket of the plurality of memory sockets as a source of the memory health condition; a means for transferring data stored in the memory module to a dedicated non-volatile storage device; and a means for causing voltage gating to be applied to the memory socket to render the memory socket inactive. 12. The computer processing system of claim 11, further comprising a means for causing clock gating to be applied to the memory socket. 13. The computer processing system of claim 11, further comprising a means for providing an indication that the memory module is inactive to facilitate removal of the memory module. 14. The computer processing system of claim 11, further comprising:
a means for restoring power to the memory module of the memory socket, responsive to the memory socket receiving a replacement memory module; a means for performing an initialization procedure on the replacement memory module; and a means for transferring data from the dedicated non-volatile storage device to the replacement memory module. 15. The computer processing system of claim 11, wherein the means for detecting the memory health condition comprises a means for detecting, for the memory module interfaced with the memory socket of the plurality of memory sockets, at least one of the group consisting of a correctable memory error, an uncorrectable memory error, a temperature level, a voltage level, an indication of performance, a calibration value, and a user-initiated upgrade request, or any combination thereof. 16. The computer processing system of claim 11, further comprising a means for executing a built-in self test (BIST) on the dedicated non-volatile storage device at startup of the computer processing system. 17. A method for facilitating maintenance of a computer processing system, comprising:
receiving an indication of a memory health condition of a memory module of a plurality of memory modules of a computer processing system; determining whether the memory health condition warrants replacement of the memory module; and responsive to determining that the memory health condition warrants the replacement of the memory module:
blocking access to a memory address range of the memory module based on receiving the indication of the memory health condition;
initiating a transfer of data stored in the memory module to a dedicated non-volatile storage device of the computer processing system; and
remapping the memory address range of the memory module to the dedicated non-volatile storage device. 18. The method of claim 17, further comprising initiating at least one of voltage gating and clock gating of a memory socket of the memory module. 19. The method of claim 17, further comprising:
blocking access to the memory address range of the dedicated non-volatile storage device; initiating a transfer of data from the dedicated non-volatile storage device to a replacement memory module; and remapping the memory address range to the replacement memory module. 20. The method of claim 17, wherein receiving the indication of the memory health condition comprises receiving an indication of, for the memory module of the plurality of memory modules, at least one of the group consisting of a correctable memory error, an uncorrectable memory error, a temperature level, a voltage level, an indication of performance, a calibration value, and a user-initiated upgrade request, or any combination thereof. 21. The method of claim 17, further comprising, responsive to determining that the memory health condition does not warrant the replacement of the memory module, maintaining a record of an occurrence of the memory health condition. 22. The method of claim 17, wherein determining whether the memory health condition warrants the replacement of the memory module is based on at least one of a memory health condition threshold and a user-provided replacement indication. 23. A non-transitory computer-readable medium having stored thereon computer executable instructions which, when executed by a processor, cause the processor to:
receive an indication of a memory health condition of a memory module of a plurality of memory modules of a computer processing system; determine whether the memory health condition warrants replacement of the memory module; and responsive to determining that the memory health condition warrants the replacement of the memory module:
block access to a memory address range of the memory module based on receiving the indication of the memory health condition;
initiate a transfer of data stored in the memory module to a dedicated non-volatile storage device of the computer processing system; and
remap the memory address range of the memory module to the dedicated non-volatile storage device. 24. The non-transitory computer-readable medium of claim 23 having stored thereon computer-executable instructions which, when executed by the processor, further cause the processor to initiate at least one of voltage gating and clock gating of a memory socket of the memory module. 25. The non-transitory computer-readable medium of claim 23 having stored thereon computer-executable instructions which, when executed by the processor, further cause the processor to:
block access to the memory address range of the dedicated non-volatile storage device;
initiate a transfer of data from the dedicated non-volatile storage device to a replacement memory module; and
remap the memory address range to the replacement memory module. 26. The non-transitory computer-readable medium of claim 23 having stored thereon computer-executable instructions which, when executed by the processor, further cause the processor to receive the indication of the memory health condition by receiving an indication of, for the memory module of the plurality of memory modules, at least one of the group consisting of a correctable memory error, an uncorrectable memory error, a temperature level, a voltage level, an indication of performance, a calibration value, and a user-initiated upgrade request, or any combination thereof. 27. The non-transitory computer-readable medium of claim 23 having stored thereon computer-executable instructions which, when executed by the processor, further cause the processor to, responsive to determining that the memory health condition does not warrant the replacement of the memory module, maintain a record of an occurrence of the memory health condition. 28. The non-transitory computer-readable medium of claim 23 having stored thereon computer-executable instructions which, when executed by the processor, further cause the processor to determine whether the memory health condition warrants the replacement of the memory module based on at least one of a memory health condition threshold and a user-provided replacement indication. | 2,100 |
5,306 | 5,306 | 14,643,029 | 2,145 | A system for creating a wireframe from a user interface of a software application is proposed. The software application is run on a computing system such that the user interface is displayed on a monitor. A portion of the user interface is blocked from view. An image of the user interface, with the portion being blocked from view, is captured and used to automatically create code describing the user interface. For example, one or more shapes in the image are recognized as user interface widgets and HTML code (or other type of code) is created that describes the recognized widgets. | 1. A method of creating a wireframe for a user interface of a software application, comprising:
blocking a portion of the user interface from view; capturing an image of the user interface with the portion being blocked from view; and automatically creating code describing the user interface from the captured image of the user interface with the portion being blocked from view. 2. The method of claim 1, wherein:
the automatically creating code comprises automatically creating an HTML description of the user interface from the captured image showing the portion being blocked from view. 3. The method of claim 1, wherein:
the capturing an image is performed by a camera; and the automatically creating code is performed by a computer. 4. The method of claim 1, wherein:
the automatically creating code comprises automatically recognizing a shape in the captured image and creating code that describes a user interface element corresponding to the recognized shape. 5. The method of claim 4, wherein:
the automatically creating code further comprises automatically identifying a position of the shape in the user interface, the created code describes that position. 6. The method of claim 1, wherein:
the blocking is performed by configuring an e-ink display. 7. The method of claim 1, wherein:
the blocking is performed by using back-out software to black-out the portion on a computer screen. 8. The method of claim 1, further comprising:
running the software application on a first computer, including displaying the user interface from a monitor of the first computer; wherein the automatically creating code is performed by a second computer, the capturing an image is performed by a camera connected to the second computer, and the blocking is performed by configuring an e-ink display that positioned between the camera and the monitor. 9. The method of claim 8, wherein:
the e-ink display is configured by the second computer; and the camera is triggered by the second computer. 10. The method of claim 9, wherein:
the automatically creating code comprises automatically recognizing a shape in the captured image and creating an HTML description of that shape from the captured image showing the portion of the user interface being blocked from view. 11. The method of claim 8, wherein:
the camera is triggered by the e-ink display. 12. A system for creating a wireframe for a user interface of a software application, comprising:
a computing system including a monitor, the computing system runs the software application and displays the user interface on the monitor; a camera pointed at the monitor; and an e-ink display positioned between the monitor and the camera such that the camera views the user interface on the monitor through the e-ink display, the e-ink display is configurable to selectively block a portion of the user interface from view by the camera, the camera is triggerable to capture an image of the user interface with the portion being blocked from its view and transmit the image to the computing system, the computing system is configured to automatically create an HTML description of the user interface from the captured image. 13. The system of claim 12, wherein:
the computing system includes a first computer and a second computer; the first computer is connected to the monitor and is configured to run the software application; and the second computer is configured to trigger the camera, receive the captured image from the camera, configure the e-ink display and create the HTML description of the user interface from the captured image. 14. The system of claim 12, wherein:
the e-ink display is configurable to have a first region that is transparent and a second region that is opaque, the region that is opaque blocks the portion of the user interface from view by the camera. 15. The system of claim 12, wherein:
the computing system is configured to automatically create the HTML description of the user interface from the captured image by recognizing a shape in the captured image and creating HTML code describing a user interface element corresponding to the recognized shape. 16. A computer program product, comprising:
a computer readable storage medium having computer readable program code embodied therewith, the computer readable program code comprising: computer readable program code configured to receive an image of a user interface of a software application with a portion of the user interface being blocked from view; and computer readable program code configured to automatically create code describing the user interface from the received image of the user interface of the software application with the portion of the user interface being blocked from view. 17. The computer program product of claim 16, further comprising:
computer readable program code configured to run the software application including displaying the user interface from a monitor. 18. The computer program product of claim 16, wherein:
the computer readable program code configured to automatically create code describing the user interface automatically creates an HTML description of the user interface from the captured image showing the portion of the user interface being blocked from view. 19. The computer program product of claim 16, wherein:
the computer readable program code configured to automatically create code describing the user interface automatically recognizes a shape in the captured image and creates HTML code that describes a user interface element corresponding to the recognized shape. 20. The computer program product of claim 16, wherein:
the computer readable program code configured to automatically create code describing the user interface automatically recognizes a shape in the captured image, identifies a position of the shape in the user interface and creates HTML code that describes a user interface element corresponding to the recognized shape and identified position. | A system for creating a wireframe from a user interface of a software application is proposed. The software application is run on a computing system such that the user interface is displayed on a monitor. A portion of the user interface is blocked from view. An image of the user interface, with the portion being blocked from view, is captured and used to automatically create code describing the user interface. For example, one or more shapes in the image are recognized as user interface widgets and HTML code (or other type of code) is created that describes the recognized widgets.1. A method of creating a wireframe for a user interface of a software application, comprising:
blocking a portion of the user interface from view; capturing an image of the user interface with the portion being blocked from view; and automatically creating code describing the user interface from the captured image of the user interface with the portion being blocked from view. 2. The method of claim 1, wherein:
the automatically creating code comprises automatically creating an HTML description of the user interface from the captured image showing the portion being blocked from view. 3. The method of claim 1, wherein:
the capturing an image is performed by a camera; and the automatically creating code is performed by a computer. 4. The method of claim 1, wherein:
the automatically creating code comprises automatically recognizing a shape in the captured image and creating code that describes a user interface element corresponding to the recognized shape. 5. The method of claim 4, wherein:
the automatically creating code further comprises automatically identifying a position of the shape in the user interface, the created code describes that position. 6. The method of claim 1, wherein:
the blocking is performed by configuring an e-ink display. 7. The method of claim 1, wherein:
the blocking is performed by using back-out software to black-out the portion on a computer screen. 8. The method of claim 1, further comprising:
running the software application on a first computer, including displaying the user interface from a monitor of the first computer; wherein the automatically creating code is performed by a second computer, the capturing an image is performed by a camera connected to the second computer, and the blocking is performed by configuring an e-ink display that positioned between the camera and the monitor. 9. The method of claim 8, wherein:
the e-ink display is configured by the second computer; and the camera is triggered by the second computer. 10. The method of claim 9, wherein:
the automatically creating code comprises automatically recognizing a shape in the captured image and creating an HTML description of that shape from the captured image showing the portion of the user interface being blocked from view. 11. The method of claim 8, wherein:
the camera is triggered by the e-ink display. 12. A system for creating a wireframe for a user interface of a software application, comprising:
a computing system including a monitor, the computing system runs the software application and displays the user interface on the monitor; a camera pointed at the monitor; and an e-ink display positioned between the monitor and the camera such that the camera views the user interface on the monitor through the e-ink display, the e-ink display is configurable to selectively block a portion of the user interface from view by the camera, the camera is triggerable to capture an image of the user interface with the portion being blocked from its view and transmit the image to the computing system, the computing system is configured to automatically create an HTML description of the user interface from the captured image. 13. The system of claim 12, wherein:
the computing system includes a first computer and a second computer; the first computer is connected to the monitor and is configured to run the software application; and the second computer is configured to trigger the camera, receive the captured image from the camera, configure the e-ink display and create the HTML description of the user interface from the captured image. 14. The system of claim 12, wherein:
the e-ink display is configurable to have a first region that is transparent and a second region that is opaque, the region that is opaque blocks the portion of the user interface from view by the camera. 15. The system of claim 12, wherein:
the computing system is configured to automatically create the HTML description of the user interface from the captured image by recognizing a shape in the captured image and creating HTML code describing a user interface element corresponding to the recognized shape. 16. A computer program product, comprising:
a computer readable storage medium having computer readable program code embodied therewith, the computer readable program code comprising: computer readable program code configured to receive an image of a user interface of a software application with a portion of the user interface being blocked from view; and computer readable program code configured to automatically create code describing the user interface from the received image of the user interface of the software application with the portion of the user interface being blocked from view. 17. The computer program product of claim 16, further comprising:
computer readable program code configured to run the software application including displaying the user interface from a monitor. 18. The computer program product of claim 16, wherein:
the computer readable program code configured to automatically create code describing the user interface automatically creates an HTML description of the user interface from the captured image showing the portion of the user interface being blocked from view. 19. The computer program product of claim 16, wherein:
the computer readable program code configured to automatically create code describing the user interface automatically recognizes a shape in the captured image and creates HTML code that describes a user interface element corresponding to the recognized shape. 20. The computer program product of claim 16, wherein:
the computer readable program code configured to automatically create code describing the user interface automatically recognizes a shape in the captured image, identifies a position of the shape in the user interface and creates HTML code that describes a user interface element corresponding to the recognized shape and identified position. | 2,100 |
5,307 | 5,307 | 10,933,466 | 2,153 | The present invention provides a document generation system for generating a customised document using content elements selected by rules operating on input information. The customised document further contains symbol elements. The system comprises at least one computer having a document generation program installed thereon, which is capable of generating a fully or a partially customised document by evaluating the rules to select some of the content elements. The system further comprises means to associate further rules with the symbol elements. The rules associated with the symbol elements are evaluated independently of the rules associated with the content elements. | 1-21. (Cancelled). 22. A document generation system for generating a customised document using content elements selected by rules operating on input information, and symbol elements, the system comprising:
at least one computer having a document generation program installed thereon; wherein the system is capable of generating a fully or a partially customised document by evaluating the rules to select some of the content elements; and and wherein the system further comprises means to associate further rules with the symbol elements. 23. The document generation system of claim 22, wherein the at least one computer is part of a client server network, comprising at least one client computer and at least one server computer. 24. The document generation system of claim 23, wherein the at least one client computer and the at least one server computer communicate using a communication protocol. 25. The document generation system of claim 24, wherein the communication protocol is at least one of TCP/IP, HTTP or XML. 26. The document generation program of claim 23, wherein the at least one computer is a server computer. 27. The document generation program of claim 23, wherein the at least one computer is a client computer. 28. The document generation system of claim 22, wherein the symbol elements comprise any form of symbol or character. 29. The document generation system of claim 22, wherein the document generation program associates the further rules with the symbol elements. 30. The document generation system of claim 22, wherein the symbol elements comprise characters or punctuation characters. 31. The document generation system of claim 30, wherein the characters or punctuation symbols belong to at least one language. 32. The document generation system of claim 30, wherein characters or punctuation symbols of different languages are inserted into a single document. 33. A document generation system for generating a customised document using content elements selected by rules operating on input information, and symbol elements, the system comprising:
at least one computer having a document generation program installed thereon; wherein the system is capable of generating a fully or a partially customised document by evaluating the rules to select some of the content elements; and and wherein the system further comprises means to associate further rules with the symbol elements, the further rules being evaluated independently of the rules for selecting the content elements. 34. A computer-implemented method of document generation using external data and received information, the method comprising:
accessing a template comprising content elements and symbol elements for use when generating a document; accessing data associated with the template, the data representing at least one rule for making at least one determination of the use of the content elements; receiving information enabling at least one determination to be made; associating at least one further rule with the symbol elements; generating a partially or fully customised document on the basis of the received information; and evaluating the at least one further rule to enable punctuation of the partially or filly customised document. 35. A computer-implemented method of document generation using external data and received information, the method comprising:
accessing a template comprising content elements and symbol elements for use when generating a document; accessing data associated with the template, the data representing at least one rule for making at least one determination of the use of the content elements; receiving information enabling at least one determination to be made; associating at least one further rule with the symbol elements; generating a partially or fully customised document on the basis of the received information; and evaluating the at least one further rule independently of the rules for making at least one determination of the content elements to enable punctuation of the partially or filly customised document. 36. A computer program product comprising a computer readable medium having stored thereon program instructions which when run on a computer causes the computer to perform the steps of:
accessing a template comprising content elements and symbol elements for use when generating a document; accessing data associated with the template, the data representing at least one rule for making at least one determination of the use of the content elements; receiving information enabling at least one determination to be made; associating at least one further rule with the symbol elements; generating a partially or filly customised document on the basis of the received information; and evaluating the at least on further rule to enable punctuation of the partially or fully customised document. 37. A computer program product comprising a computer readable medium having stored thereon program instructions which when run on a computer causes the computer to perform the steps of:
accessing a template comprising content elements and symbol elements for use when generating a document; accessing data associated with the template, the data representing at least one rule for making at least one determination of the use of the content elements; receiving information enabling at least one determination to be made; associating at least one further rule with the symbol elements; generating a partially or fully customised document on the basis of the received information; and evaluating the at least one further rule independently of the rules for making at least one determination of the content elements to enable punctuation of the partially or fully customised document. 38. A document generation system for generating a customised document using content elements selected by rules operating on input information, and symbol elements, the system comprising:
at least one computer having a document generation program installed thereon; wherein the system is capable of generating a fully or a partially customised document by evaluating the rules to select some of the content elements; and and wherein the system further comprises means to associate further rules with the symbol elements, the symbol elements comprising punctuation symbols or characters from at least one language. 39. The document generation system of claim 38, wherein the fully or symbols from at least one language. 40. The document generation system of claim 32, wherein the symbols or punctuation characters are grammatically correct. 41. The document generation system of claim 40 where the punctuation symbols are grammatically correct. 42. A computer-implemented method of document generation using external data and received information, the method comprising:
accessing a template comprising content elements and symbol elements for use when generating a document; accessing data associated with the template, the data representing at least one rule for making at least one determination of the use of the content elements; receiving information enabling at least one determination to be made; associating at least one further rule with the symbol elements; generating a partially or fully customised document on the basis of the received information; and evaluating the at least one further rule to enable the insertion of symbols or characters into the partially or fully customised document. 43. A computer-implemented method of document generation using external data and received information, the method comprising:
accessing a template comprising content elements and symbol elements for use when generating a document; accessing data associated with the template, the data representing at least one rule for making at least one determination of the use of the content elements; receiving information enabling at least one determination to be made; associating at least one further rule with the symbol elements; generating a partially or fully customised document on the basis of the received information; and evaluating the at least one further rule independently of the rules for making at least one determination of the content elements to enable the insertion of symbols or characters into the partially or fully customised document. 44. A computer program product comprising a computer readable medium having stored thereon program instructions which when run on a computer causes the computer to perform the steps of:
accessing a template comprising content elements and symbol elements for use when generating a document; accessing data associated with the template, the data representing at least one rule for making at least one determination of the use of the content elements; receiving information enabling at least one determination to be made; associating at least one further rule with the symbol elements; generating a partially or fully customised document on the basis of the received information; and evaluating the at least on further rule to enable the insertion of symbols or characters into the partially or fully customised document. 45. A computer program product comprising a computer readable medium having stored thereon program instructions which when run on a computer causes the computer to perform the steps of:
accessing a template comprising content elements and symbol elements for use when generating a document; accessing data associated with the template, the data representing at least one rule for making at least one determination of the use of the content elements; receiving information enabling at least one determination to be made; associating at least one further rule with the symbol elements; generating a partially or fully customised document on the basis of the received information; and evaluating the at least one further rule independently of the rules for making at least one determination of the content elements to enable the insertion of symbols or characters into the partially or filly customised document. | The present invention provides a document generation system for generating a customised document using content elements selected by rules operating on input information. The customised document further contains symbol elements. The system comprises at least one computer having a document generation program installed thereon, which is capable of generating a fully or a partially customised document by evaluating the rules to select some of the content elements. The system further comprises means to associate further rules with the symbol elements. The rules associated with the symbol elements are evaluated independently of the rules associated with the content elements.1-21. (Cancelled). 22. A document generation system for generating a customised document using content elements selected by rules operating on input information, and symbol elements, the system comprising:
at least one computer having a document generation program installed thereon; wherein the system is capable of generating a fully or a partially customised document by evaluating the rules to select some of the content elements; and and wherein the system further comprises means to associate further rules with the symbol elements. 23. The document generation system of claim 22, wherein the at least one computer is part of a client server network, comprising at least one client computer and at least one server computer. 24. The document generation system of claim 23, wherein the at least one client computer and the at least one server computer communicate using a communication protocol. 25. The document generation system of claim 24, wherein the communication protocol is at least one of TCP/IP, HTTP or XML. 26. The document generation program of claim 23, wherein the at least one computer is a server computer. 27. The document generation program of claim 23, wherein the at least one computer is a client computer. 28. The document generation system of claim 22, wherein the symbol elements comprise any form of symbol or character. 29. The document generation system of claim 22, wherein the document generation program associates the further rules with the symbol elements. 30. The document generation system of claim 22, wherein the symbol elements comprise characters or punctuation characters. 31. The document generation system of claim 30, wherein the characters or punctuation symbols belong to at least one language. 32. The document generation system of claim 30, wherein characters or punctuation symbols of different languages are inserted into a single document. 33. A document generation system for generating a customised document using content elements selected by rules operating on input information, and symbol elements, the system comprising:
at least one computer having a document generation program installed thereon; wherein the system is capable of generating a fully or a partially customised document by evaluating the rules to select some of the content elements; and and wherein the system further comprises means to associate further rules with the symbol elements, the further rules being evaluated independently of the rules for selecting the content elements. 34. A computer-implemented method of document generation using external data and received information, the method comprising:
accessing a template comprising content elements and symbol elements for use when generating a document; accessing data associated with the template, the data representing at least one rule for making at least one determination of the use of the content elements; receiving information enabling at least one determination to be made; associating at least one further rule with the symbol elements; generating a partially or fully customised document on the basis of the received information; and evaluating the at least one further rule to enable punctuation of the partially or filly customised document. 35. A computer-implemented method of document generation using external data and received information, the method comprising:
accessing a template comprising content elements and symbol elements for use when generating a document; accessing data associated with the template, the data representing at least one rule for making at least one determination of the use of the content elements; receiving information enabling at least one determination to be made; associating at least one further rule with the symbol elements; generating a partially or fully customised document on the basis of the received information; and evaluating the at least one further rule independently of the rules for making at least one determination of the content elements to enable punctuation of the partially or filly customised document. 36. A computer program product comprising a computer readable medium having stored thereon program instructions which when run on a computer causes the computer to perform the steps of:
accessing a template comprising content elements and symbol elements for use when generating a document; accessing data associated with the template, the data representing at least one rule for making at least one determination of the use of the content elements; receiving information enabling at least one determination to be made; associating at least one further rule with the symbol elements; generating a partially or filly customised document on the basis of the received information; and evaluating the at least on further rule to enable punctuation of the partially or fully customised document. 37. A computer program product comprising a computer readable medium having stored thereon program instructions which when run on a computer causes the computer to perform the steps of:
accessing a template comprising content elements and symbol elements for use when generating a document; accessing data associated with the template, the data representing at least one rule for making at least one determination of the use of the content elements; receiving information enabling at least one determination to be made; associating at least one further rule with the symbol elements; generating a partially or fully customised document on the basis of the received information; and evaluating the at least one further rule independently of the rules for making at least one determination of the content elements to enable punctuation of the partially or fully customised document. 38. A document generation system for generating a customised document using content elements selected by rules operating on input information, and symbol elements, the system comprising:
at least one computer having a document generation program installed thereon; wherein the system is capable of generating a fully or a partially customised document by evaluating the rules to select some of the content elements; and and wherein the system further comprises means to associate further rules with the symbol elements, the symbol elements comprising punctuation symbols or characters from at least one language. 39. The document generation system of claim 38, wherein the fully or symbols from at least one language. 40. The document generation system of claim 32, wherein the symbols or punctuation characters are grammatically correct. 41. The document generation system of claim 40 where the punctuation symbols are grammatically correct. 42. A computer-implemented method of document generation using external data and received information, the method comprising:
accessing a template comprising content elements and symbol elements for use when generating a document; accessing data associated with the template, the data representing at least one rule for making at least one determination of the use of the content elements; receiving information enabling at least one determination to be made; associating at least one further rule with the symbol elements; generating a partially or fully customised document on the basis of the received information; and evaluating the at least one further rule to enable the insertion of symbols or characters into the partially or fully customised document. 43. A computer-implemented method of document generation using external data and received information, the method comprising:
accessing a template comprising content elements and symbol elements for use when generating a document; accessing data associated with the template, the data representing at least one rule for making at least one determination of the use of the content elements; receiving information enabling at least one determination to be made; associating at least one further rule with the symbol elements; generating a partially or fully customised document on the basis of the received information; and evaluating the at least one further rule independently of the rules for making at least one determination of the content elements to enable the insertion of symbols or characters into the partially or fully customised document. 44. A computer program product comprising a computer readable medium having stored thereon program instructions which when run on a computer causes the computer to perform the steps of:
accessing a template comprising content elements and symbol elements for use when generating a document; accessing data associated with the template, the data representing at least one rule for making at least one determination of the use of the content elements; receiving information enabling at least one determination to be made; associating at least one further rule with the symbol elements; generating a partially or fully customised document on the basis of the received information; and evaluating the at least on further rule to enable the insertion of symbols or characters into the partially or fully customised document. 45. A computer program product comprising a computer readable medium having stored thereon program instructions which when run on a computer causes the computer to perform the steps of:
accessing a template comprising content elements and symbol elements for use when generating a document; accessing data associated with the template, the data representing at least one rule for making at least one determination of the use of the content elements; receiving information enabling at least one determination to be made; associating at least one further rule with the symbol elements; generating a partially or fully customised document on the basis of the received information; and evaluating the at least one further rule independently of the rules for making at least one determination of the content elements to enable the insertion of symbols or characters into the partially or filly customised document. | 2,100 |
5,308 | 5,308 | 15,078,306 | 2,143 | An ability to present user-defined start pages on graphical user interfaces is provided. At least one of a user interface of a computing device, an operating system executing on the computing device, and an application executing on the computing device is monitored to detect, on the user interface, one or more trigger conditions that are associated with the application. The one or more trigger conditions are detected, and in response, a start-page database is queried for information that describes, at least in part, a user-defined start page that is associated with the application. The user-defined start page, and not a default start page, is presented on a screen of the computing device via an interface with at least one of the application and the operating system. | 1. A method for presenting start-pages on a graphical user interface, comprising:
monitoring, by one or more computer processors, at least one of a first user interface of a computing device, an operating system executing on the computing device, and an application executing on the computing device to detect one or more trigger conditions that are associated with the application on the first user interface; detecting, by one or more computer processors, the one or more trigger conditions on the first user interface, and in response, querying, by one or more computer processors, a start-page database for information that describes, at least in part, a user-defined start page that is associated with the application; and interfacing, by one or more computer processors, with at least one of the application and the operating system such that the first user interface presents the user-defined start page and not a default start page on a screen of the computing device. 2. The method of claim 1, further comprising:
presenting, by one or more computer processors, a second user interface on the screen of the computing device; detecting, by one or more computer processors, an interaction with the second user interface that associates the user-defined start page with the application; and storing, by one or more computer processors, the information that describes, at least in part, the user-defined start page to the start-page database. 3. The method of claim 2, wherein the second user interface is an overlay on the first user interface. 4. The method of claim 2, further comprising:
associating, by one or more computer processors, a user-defined interaction with the application as the one or more trigger conditions. 5. The method of claim 2, wherein:
the one or more trigger conditions that are associated with the application is a click on an icon that is (i) presented on the first user interface and (ii) associated with the application; and the first user interface presents, in response to the click on the icon, one of the user-defined start page and the default start page based on a query for the information that describes, at least in part, the user-defined start page in the start-page database. 6. The method of claim 2, wherein the second user interface is presented in response to detecting on the first user interface, by one or more computer processors, an interaction with an icon that is associated with the second user interface. 7. A computer program product for presenting start-pages on a graphical user interface, the computer program product comprising:
a computer readable storage medium and program instructions stored on the computer readable storage medium, the program instructions comprising:
program instructions to monitor at least one of a first user interface of a computing device, an operating system executing on the computing device, and an application executing on the computing device to detect one or more trigger conditions that are associated with the application on the first user interface;
program instructions to detect the one or more trigger conditions on the first user interface, and in response, querying, by one or more computer processors, a start-page database for information that describes, at least in part, a user-defined start page that is associated with the application; and
program instructions to interface with at least one of the application and the operating system such that the first user interface presents the user-defined start page and not a default start page on a screen of the computing device. 8. The computer program product of claim 7, the program instructions further comprising:
program instructions to present a second user interface on the screen of the computing device; program instructions to detect an interaction with the second user interface that associates the user-defined start page with the application; and program instructions to store the information that describes, at least in part, the user-defined start page to the start-page database. 9. The computer program product of claim 8, wherein the second user interface is an overlay on the first user interface. 10. The computer program product of claim 8, the program instructions further comprising:
associating, by one or more computer processors, a user-defined interaction with the application as the one or more trigger conditions. 11. The computer program product of claim 8, wherein:
the one or more trigger conditions that are associated with the application is a click on an icon that is (i) presented on the first user interface and (ii) associated with the application; and the first user interface presents, in response to the click on the icon, one of the user-defined start page and the default start page based on a query for the information that describes, at least in part, the user-defined start page in the start-page database. 12. The computer program product of claim 8, wherein the second user interface is presented in response to detecting on the first user interface, by one or more computer processors, an interaction with an icon that is associated with the second user interface. 13. A computer system for presenting start-pages on a graphical user interface, the 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 monitor at least one of a first user interface of a computing device, an operating system executing on the computing device, and an application executing on the computing device to detect one or more trigger conditions that are associated with the application on the first user interface;
program instructions to detect the one or more trigger conditions on the first user interface, and in response, querying, by one or more computer processors, a start-page database for information that describes, at least in part, a user-defined start page that is associated with the application; and
program instructions to interface with at least one of the application and the operating system such that the first user interface presents the user-defined start page and not a default start page on a screen of the computing device. 14. The computer system of claim 13, the program instructions further comprising:
program instructions to present a second user interface on the screen of the computing device; program instructions to detect an interaction with the second user interface that associates the user-defined start page with the application; and program instructions to store the information that describes, at least in part, the user-defined start page to the start-page database. 15. The computer system of claim 14, wherein the second user interface is an overlay on the first user interface. 16. The computer system of claim 14, the program instructions further comprising:
associating, by one or more computer processors, a user-defined interaction with the application as the one or more trigger conditions. 17. The computer system of claim 14, wherein:
the one or more trigger conditions that are associated with the application is a click on an icon that is (i) presented on the first user interface and (ii) associated with the application; and the first user interface presents, in response to the click on the icon, one of the user-defined start page and the default start page based on a query for the information that describes, at least in part, the user-defined start page in the start-page database. 18. The computer system of claim 14, wherein the second user interface is presented in response to detecting on the first user interface, by one or more computer processors, an interaction with an icon that is associated with the second user interface. | An ability to present user-defined start pages on graphical user interfaces is provided. At least one of a user interface of a computing device, an operating system executing on the computing device, and an application executing on the computing device is monitored to detect, on the user interface, one or more trigger conditions that are associated with the application. The one or more trigger conditions are detected, and in response, a start-page database is queried for information that describes, at least in part, a user-defined start page that is associated with the application. The user-defined start page, and not a default start page, is presented on a screen of the computing device via an interface with at least one of the application and the operating system.1. A method for presenting start-pages on a graphical user interface, comprising:
monitoring, by one or more computer processors, at least one of a first user interface of a computing device, an operating system executing on the computing device, and an application executing on the computing device to detect one or more trigger conditions that are associated with the application on the first user interface; detecting, by one or more computer processors, the one or more trigger conditions on the first user interface, and in response, querying, by one or more computer processors, a start-page database for information that describes, at least in part, a user-defined start page that is associated with the application; and interfacing, by one or more computer processors, with at least one of the application and the operating system such that the first user interface presents the user-defined start page and not a default start page on a screen of the computing device. 2. The method of claim 1, further comprising:
presenting, by one or more computer processors, a second user interface on the screen of the computing device; detecting, by one or more computer processors, an interaction with the second user interface that associates the user-defined start page with the application; and storing, by one or more computer processors, the information that describes, at least in part, the user-defined start page to the start-page database. 3. The method of claim 2, wherein the second user interface is an overlay on the first user interface. 4. The method of claim 2, further comprising:
associating, by one or more computer processors, a user-defined interaction with the application as the one or more trigger conditions. 5. The method of claim 2, wherein:
the one or more trigger conditions that are associated with the application is a click on an icon that is (i) presented on the first user interface and (ii) associated with the application; and the first user interface presents, in response to the click on the icon, one of the user-defined start page and the default start page based on a query for the information that describes, at least in part, the user-defined start page in the start-page database. 6. The method of claim 2, wherein the second user interface is presented in response to detecting on the first user interface, by one or more computer processors, an interaction with an icon that is associated with the second user interface. 7. A computer program product for presenting start-pages on a graphical user interface, the computer program product comprising:
a computer readable storage medium and program instructions stored on the computer readable storage medium, the program instructions comprising:
program instructions to monitor at least one of a first user interface of a computing device, an operating system executing on the computing device, and an application executing on the computing device to detect one or more trigger conditions that are associated with the application on the first user interface;
program instructions to detect the one or more trigger conditions on the first user interface, and in response, querying, by one or more computer processors, a start-page database for information that describes, at least in part, a user-defined start page that is associated with the application; and
program instructions to interface with at least one of the application and the operating system such that the first user interface presents the user-defined start page and not a default start page on a screen of the computing device. 8. The computer program product of claim 7, the program instructions further comprising:
program instructions to present a second user interface on the screen of the computing device; program instructions to detect an interaction with the second user interface that associates the user-defined start page with the application; and program instructions to store the information that describes, at least in part, the user-defined start page to the start-page database. 9. The computer program product of claim 8, wherein the second user interface is an overlay on the first user interface. 10. The computer program product of claim 8, the program instructions further comprising:
associating, by one or more computer processors, a user-defined interaction with the application as the one or more trigger conditions. 11. The computer program product of claim 8, wherein:
the one or more trigger conditions that are associated with the application is a click on an icon that is (i) presented on the first user interface and (ii) associated with the application; and the first user interface presents, in response to the click on the icon, one of the user-defined start page and the default start page based on a query for the information that describes, at least in part, the user-defined start page in the start-page database. 12. The computer program product of claim 8, wherein the second user interface is presented in response to detecting on the first user interface, by one or more computer processors, an interaction with an icon that is associated with the second user interface. 13. A computer system for presenting start-pages on a graphical user interface, the 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 monitor at least one of a first user interface of a computing device, an operating system executing on the computing device, and an application executing on the computing device to detect one or more trigger conditions that are associated with the application on the first user interface;
program instructions to detect the one or more trigger conditions on the first user interface, and in response, querying, by one or more computer processors, a start-page database for information that describes, at least in part, a user-defined start page that is associated with the application; and
program instructions to interface with at least one of the application and the operating system such that the first user interface presents the user-defined start page and not a default start page on a screen of the computing device. 14. The computer system of claim 13, the program instructions further comprising:
program instructions to present a second user interface on the screen of the computing device; program instructions to detect an interaction with the second user interface that associates the user-defined start page with the application; and program instructions to store the information that describes, at least in part, the user-defined start page to the start-page database. 15. The computer system of claim 14, wherein the second user interface is an overlay on the first user interface. 16. The computer system of claim 14, the program instructions further comprising:
associating, by one or more computer processors, a user-defined interaction with the application as the one or more trigger conditions. 17. The computer system of claim 14, wherein:
the one or more trigger conditions that are associated with the application is a click on an icon that is (i) presented on the first user interface and (ii) associated with the application; and the first user interface presents, in response to the click on the icon, one of the user-defined start page and the default start page based on a query for the information that describes, at least in part, the user-defined start page in the start-page database. 18. The computer system of claim 14, wherein the second user interface is presented in response to detecting on the first user interface, by one or more computer processors, an interaction with an icon that is associated with the second user interface. | 2,100 |
5,309 | 5,309 | 14,571,643 | 2,193 | Systems, methods, and software described herein facilitate servicing of data requests based on quality of service assigned to processing jobs. In one example, a method of prioritizing data requests in a computing system based on quality of service includes identifying a plurality of data requests from a plurality of processing jobs. The method further includes prioritizing the plurality of data requests based on a quality of service assessed to each of the plurality of processing jobs, and assigning cache memory in the computing system to each of the plurality of data requests based on the prioritization. | 1. A method of prioritizing data requests in a computing system, the method comprising:
identifying a plurality of data requests from a plurality of processing jobs; prioritizing the plurality of data requests based on a quality of service assessed to each of the plurality of processing jobs; and assigning cache memory in the computing system to each of the plurality of data requests based on the prioritization. 2. The method of claim 1 further comprising retrieving data from one or more data repositories to service the plurality of data requests based on the prioritization, and caching the data in the cache memory. 3. The method of claim 1 further comprising identifying a minimum amount of the cache memory for each of the plurality of processing jobs, and wherein assigning the cache memory to each of the plurality of data requests based on the prioritization comprises assigning at least the minimum amount of the cache memory to at least one data request associated with each processing job in the plurality of processing jobs. 4. The method of claim 1 wherein the plurality of processing jobs comprises a plurality of large scale processing framework (LSPF) jobs executing on one or more virtual machines. 5. The method of claim 4 wherein the computing system comprises a host computing system, and wherein the one or more virtual machines execute via the host computing system. 6. The method of claim 5 wherein the cache memory comprises shared memory locations accessible by at least one process on the host computing system and the plurality of LSPF jobs executing on the one or more virtual machines. 7. The method of claim 1 further comprising identifying the quality of service from an administrator. 8. The method of claim 1 wherein assigning the cache memory in the computing system to each of the plurality of data requests based on the prioritization comprises assigning the cache memory in the computing system to each of the plurality of data requests based on the prioritization and availability of the cache memory. 9. A computer apparatus to prioritize a plurality of data requests for a plurality of processing jobs, the computer apparatus comprising:
processing instructions that direct a computing system, when executed by the computing system, to:
identify the plurality of data requests from the plurality of processing jobs;
prioritize the plurality of data requests based on a quality of service assessed to each of the plurality of processing jobs; and
assign cache memory to each of the plurality of data requests based on the prioritization; and
one or more non-transitory computer readable media that store the processing instructions. 10. The computer apparatus of claim 9 wherein the processing instructions further direct the computing system to retrieve data from one or more data repositories to service the plurality of data requests based on the prioritization, and cache the data in the cache memory. 11. The computer apparatus of claim 9 wherein the processing instructions further direct the computing system to identify a minimum amount of the cache memory for each of the processing jobs, and wherein the processing instructions to assign the cache memory to each of the plurality of data requests based on the prioritization direct the computing system to assign at least the minimum amount of the cache memory to at least one data request associated with each processing job in the plurality of processing jobs. 12. The computer apparatus of claim 9 wherein the plurality of processing jobs comprises a plurality of large scale processing framework (LSPF) jobs executing on one or more virtual machines. 13. The computer apparatus of claim 12 wherein the one or more virtual machines execute via a host computing system. 14. The computer apparatus of claim 13 wherein the cache memory comprises shared memory locations accessible by at least one process on the host computing system and the plurality of LSPF jobs executing on the one or more virtual machines. 15. The computer apparatus of claim 14 wherein the LSPF framework jobs comprise Hadoop jobs. 16. The computer apparatus of claim 9 further comprising identifying the quality of service from an administrator. 17. The computer apparatus of claim 9 wherein the processing instructions to assign the cache memory to each of the plurality of data requests based on the prioritization direct the computing system to assign the cache memory to each of the plurality of data requests based on the prioritization and availability of the cache memory. 18. A system to prioritize and service data requests, the system comprising
a plurality of processing jobs executing on a computing device configured to initiate a plurality of data requests; a cache service configured to:
identify the plurality of data requests;
prioritize the plurality of data requests based on a quality of service assessed to each of the plurality of processing jobs; and
assign cache memory to each of the plurality of data requests based on the prioritization, wherein the cache memory comprises memory locations accessible by each processing job of the plurality of processing jobs. 19. The system of claim 18 wherein the cache service is further configured to:
retrieve data from one or more data repositories to service the plurality of data requests based on the prioritization; and
cache the data in the cache memory. 20. The system of claim 18 wherein the plurality of processing jobs comprise a plurality of large scale processing framework (LSPF) jobs executing via one or more virtual machines, and wherein the cache memory comprises shared memory locations accessible by the cache service and the plurality of LSPF jobs executing via the one or more virtual machines. | Systems, methods, and software described herein facilitate servicing of data requests based on quality of service assigned to processing jobs. In one example, a method of prioritizing data requests in a computing system based on quality of service includes identifying a plurality of data requests from a plurality of processing jobs. The method further includes prioritizing the plurality of data requests based on a quality of service assessed to each of the plurality of processing jobs, and assigning cache memory in the computing system to each of the plurality of data requests based on the prioritization.1. A method of prioritizing data requests in a computing system, the method comprising:
identifying a plurality of data requests from a plurality of processing jobs; prioritizing the plurality of data requests based on a quality of service assessed to each of the plurality of processing jobs; and assigning cache memory in the computing system to each of the plurality of data requests based on the prioritization. 2. The method of claim 1 further comprising retrieving data from one or more data repositories to service the plurality of data requests based on the prioritization, and caching the data in the cache memory. 3. The method of claim 1 further comprising identifying a minimum amount of the cache memory for each of the plurality of processing jobs, and wherein assigning the cache memory to each of the plurality of data requests based on the prioritization comprises assigning at least the minimum amount of the cache memory to at least one data request associated with each processing job in the plurality of processing jobs. 4. The method of claim 1 wherein the plurality of processing jobs comprises a plurality of large scale processing framework (LSPF) jobs executing on one or more virtual machines. 5. The method of claim 4 wherein the computing system comprises a host computing system, and wherein the one or more virtual machines execute via the host computing system. 6. The method of claim 5 wherein the cache memory comprises shared memory locations accessible by at least one process on the host computing system and the plurality of LSPF jobs executing on the one or more virtual machines. 7. The method of claim 1 further comprising identifying the quality of service from an administrator. 8. The method of claim 1 wherein assigning the cache memory in the computing system to each of the plurality of data requests based on the prioritization comprises assigning the cache memory in the computing system to each of the plurality of data requests based on the prioritization and availability of the cache memory. 9. A computer apparatus to prioritize a plurality of data requests for a plurality of processing jobs, the computer apparatus comprising:
processing instructions that direct a computing system, when executed by the computing system, to:
identify the plurality of data requests from the plurality of processing jobs;
prioritize the plurality of data requests based on a quality of service assessed to each of the plurality of processing jobs; and
assign cache memory to each of the plurality of data requests based on the prioritization; and
one or more non-transitory computer readable media that store the processing instructions. 10. The computer apparatus of claim 9 wherein the processing instructions further direct the computing system to retrieve data from one or more data repositories to service the plurality of data requests based on the prioritization, and cache the data in the cache memory. 11. The computer apparatus of claim 9 wherein the processing instructions further direct the computing system to identify a minimum amount of the cache memory for each of the processing jobs, and wherein the processing instructions to assign the cache memory to each of the plurality of data requests based on the prioritization direct the computing system to assign at least the minimum amount of the cache memory to at least one data request associated with each processing job in the plurality of processing jobs. 12. The computer apparatus of claim 9 wherein the plurality of processing jobs comprises a plurality of large scale processing framework (LSPF) jobs executing on one or more virtual machines. 13. The computer apparatus of claim 12 wherein the one or more virtual machines execute via a host computing system. 14. The computer apparatus of claim 13 wherein the cache memory comprises shared memory locations accessible by at least one process on the host computing system and the plurality of LSPF jobs executing on the one or more virtual machines. 15. The computer apparatus of claim 14 wherein the LSPF framework jobs comprise Hadoop jobs. 16. The computer apparatus of claim 9 further comprising identifying the quality of service from an administrator. 17. The computer apparatus of claim 9 wherein the processing instructions to assign the cache memory to each of the plurality of data requests based on the prioritization direct the computing system to assign the cache memory to each of the plurality of data requests based on the prioritization and availability of the cache memory. 18. A system to prioritize and service data requests, the system comprising
a plurality of processing jobs executing on a computing device configured to initiate a plurality of data requests; a cache service configured to:
identify the plurality of data requests;
prioritize the plurality of data requests based on a quality of service assessed to each of the plurality of processing jobs; and
assign cache memory to each of the plurality of data requests based on the prioritization, wherein the cache memory comprises memory locations accessible by each processing job of the plurality of processing jobs. 19. The system of claim 18 wherein the cache service is further configured to:
retrieve data from one or more data repositories to service the plurality of data requests based on the prioritization; and
cache the data in the cache memory. 20. The system of claim 18 wherein the plurality of processing jobs comprise a plurality of large scale processing framework (LSPF) jobs executing via one or more virtual machines, and wherein the cache memory comprises shared memory locations accessible by the cache service and the plurality of LSPF jobs executing via the one or more virtual machines. | 2,100 |
5,310 | 5,310 | 13,252,418 | 2,163 | A method begins by a processing module receiving a retrieval request for a file and determining whether the file is being migrated from a legacy storage system to a dispersed error coding storage system. The method continues with the processing module determining a retrieval option for the file when the file is being migrated from the legacy storage system to the dispersed error coding storage system. The method continues with the processing module retrieving the file, based on the retrieval option, in at least one of a legacy format from the legacy storage system and a plurality of sets of encoded data slices from the dispersed error coding storage system. | 1. A method comprises:
receiving a retrieval request for a file; determining whether the file is being migrated from a legacy storage system to a dispersed error coding storage system; when, the file is being migrated from the legacy storage system to the dispersed error coding storage system, determining a retrieval option for the file; and based on the retrieval option, retrieving the file in at least one of:
a legacy format from the legacy storage system; and
a plurality of sets of encoded data slices from the dispersed error coding storage system. 2. The method of claim 1, wherein the determining whether the file is being migrated further comprises:
determining whether that the file is stored in a legacy format in the legacy storage system and is stored as a plurality of sets of encoded data slices in the dispersed error coding storage system. 3. The method of claim 1, wherein the retrieval option comprises at least one of:
retrieve the legacy format from the legacy storage system only; retrieve the plurality of sets of encoded data slices from the dispersed error coding storage system only; and retrieve both the legacy format from the legacy storage system and the plurality of sets of encoded data slices from the dispersed error coding storage system and outputting, based on first available, the legacy format or the plurality of sets of encoded data slices. 4. The method of claim 3 further comprises:
when retrieving the plurality of sets of encoded data slices, decoding the plurality of sets of encoded data slices to produce reconstructed data; and
outputting the reconstructed data in accordance with the retrieval option. 5. The method of claim 1 further comprises:
decoding the plurality of sets of encoded data slices to produce reconstructed data;
comparing the reconstructed data with the legacy format of the file; and
overwriting the legacy format of the file with the reconstructed data when the legacy format of the file does not substantially match the reconstructed data. 6. The method of claim 1 further comprises:
decoding the plurality of sets of encoded data slices to produce reconstructed data;
comparing the reconstructed data with the legacy format of the file;
deleting the legacy format of the file when the legacy format of the file substantially matches the reconstructed data; and
updating a data location table to indicate that the file is not stored in the legacy storage system. 7. The method of claim 1, wherein the determining the retrieval option for the file is based on at least one of:
a retrieval latency requirement; a retrieval reliability requirement; a memory availability requirement; and a maximum bandwidth utilization requirement. 8. A computer comprises:
an interface; a memory; and a processing module operable to:
receive, via the interface, a retrieval request for a file;
determine whether the file is being migrated from a legacy storage system to a dispersed error coding storage system;
when, the file is being migrated from the legacy storage system to the dispersed error coding storage system, determine a retrieval option for the file; and
based on the retrieval option, retrieve, via the interface, the file in at least one of:
a legacy format from the legacy storage system; and
a plurality of sets of encoded data slices from the dispersed error coding storage system. 9. The computer of claim 8, wherein the processing module functions to determine whether the file is being migrated further by:
determining whether that the file is stored in a legacy format in the legacy storage system and is stored as a plurality of sets of encoded data slices in the dispersed error coding storage system. 10. The computer of claim 8, wherein the retrieval option comprises at least one of:
retrieve the legacy format from the legacy storage system only; retrieve the plurality of sets of encoded data slices from the dispersed error coding storage system only; and retrieve both the legacy format from the legacy storage system and the plurality of sets of encoded data slices from the dispersed error coding storage system and outputting, based on first available, the legacy format or the plurality of sets of encoded data slices. 11. The computer of claim 10, wherein the processing module further functions to:
when retrieving the plurality of sets of encoded data slices, decode the plurality of sets of encoded data slices to produce reconstructed data; and output, via the interface, the reconstructed data in accordance with the retrieval option. 12. The computer of claim 8, wherein the processing module further functions to:
decode the plurality of sets of encoded data slices to produce reconstructed data; compare the reconstructed data with the legacy format of the file; and overwrite, via the interface, the legacy format of the file with the reconstructed data when the legacy format of the file does not substantially match the reconstructed data. 13. The computer of claim 8, wherein the processing module further functions to:
decode the plurality of sets of encoded data slices to produce reconstructed data; compare the reconstructed data with the legacy format of the file; delete the legacy format of the file when the legacy format of the file substantially matches the reconstructed data; and update a data location table to indicate that the file is not stored in the legacy storage system. 14. The computer of claim 8, wherein the processing module functions to determine the retrieval option for the file based on at least one of:
a retrieval latency requirement; a retrieval reliability requirement; a memory availability requirement; and a maximum bandwidth utilization requirement. | A method begins by a processing module receiving a retrieval request for a file and determining whether the file is being migrated from a legacy storage system to a dispersed error coding storage system. The method continues with the processing module determining a retrieval option for the file when the file is being migrated from the legacy storage system to the dispersed error coding storage system. The method continues with the processing module retrieving the file, based on the retrieval option, in at least one of a legacy format from the legacy storage system and a plurality of sets of encoded data slices from the dispersed error coding storage system.1. A method comprises:
receiving a retrieval request for a file; determining whether the file is being migrated from a legacy storage system to a dispersed error coding storage system; when, the file is being migrated from the legacy storage system to the dispersed error coding storage system, determining a retrieval option for the file; and based on the retrieval option, retrieving the file in at least one of:
a legacy format from the legacy storage system; and
a plurality of sets of encoded data slices from the dispersed error coding storage system. 2. The method of claim 1, wherein the determining whether the file is being migrated further comprises:
determining whether that the file is stored in a legacy format in the legacy storage system and is stored as a plurality of sets of encoded data slices in the dispersed error coding storage system. 3. The method of claim 1, wherein the retrieval option comprises at least one of:
retrieve the legacy format from the legacy storage system only; retrieve the plurality of sets of encoded data slices from the dispersed error coding storage system only; and retrieve both the legacy format from the legacy storage system and the plurality of sets of encoded data slices from the dispersed error coding storage system and outputting, based on first available, the legacy format or the plurality of sets of encoded data slices. 4. The method of claim 3 further comprises:
when retrieving the plurality of sets of encoded data slices, decoding the plurality of sets of encoded data slices to produce reconstructed data; and
outputting the reconstructed data in accordance with the retrieval option. 5. The method of claim 1 further comprises:
decoding the plurality of sets of encoded data slices to produce reconstructed data;
comparing the reconstructed data with the legacy format of the file; and
overwriting the legacy format of the file with the reconstructed data when the legacy format of the file does not substantially match the reconstructed data. 6. The method of claim 1 further comprises:
decoding the plurality of sets of encoded data slices to produce reconstructed data;
comparing the reconstructed data with the legacy format of the file;
deleting the legacy format of the file when the legacy format of the file substantially matches the reconstructed data; and
updating a data location table to indicate that the file is not stored in the legacy storage system. 7. The method of claim 1, wherein the determining the retrieval option for the file is based on at least one of:
a retrieval latency requirement; a retrieval reliability requirement; a memory availability requirement; and a maximum bandwidth utilization requirement. 8. A computer comprises:
an interface; a memory; and a processing module operable to:
receive, via the interface, a retrieval request for a file;
determine whether the file is being migrated from a legacy storage system to a dispersed error coding storage system;
when, the file is being migrated from the legacy storage system to the dispersed error coding storage system, determine a retrieval option for the file; and
based on the retrieval option, retrieve, via the interface, the file in at least one of:
a legacy format from the legacy storage system; and
a plurality of sets of encoded data slices from the dispersed error coding storage system. 9. The computer of claim 8, wherein the processing module functions to determine whether the file is being migrated further by:
determining whether that the file is stored in a legacy format in the legacy storage system and is stored as a plurality of sets of encoded data slices in the dispersed error coding storage system. 10. The computer of claim 8, wherein the retrieval option comprises at least one of:
retrieve the legacy format from the legacy storage system only; retrieve the plurality of sets of encoded data slices from the dispersed error coding storage system only; and retrieve both the legacy format from the legacy storage system and the plurality of sets of encoded data slices from the dispersed error coding storage system and outputting, based on first available, the legacy format or the plurality of sets of encoded data slices. 11. The computer of claim 10, wherein the processing module further functions to:
when retrieving the plurality of sets of encoded data slices, decode the plurality of sets of encoded data slices to produce reconstructed data; and output, via the interface, the reconstructed data in accordance with the retrieval option. 12. The computer of claim 8, wherein the processing module further functions to:
decode the plurality of sets of encoded data slices to produce reconstructed data; compare the reconstructed data with the legacy format of the file; and overwrite, via the interface, the legacy format of the file with the reconstructed data when the legacy format of the file does not substantially match the reconstructed data. 13. The computer of claim 8, wherein the processing module further functions to:
decode the plurality of sets of encoded data slices to produce reconstructed data; compare the reconstructed data with the legacy format of the file; delete the legacy format of the file when the legacy format of the file substantially matches the reconstructed data; and update a data location table to indicate that the file is not stored in the legacy storage system. 14. The computer of claim 8, wherein the processing module functions to determine the retrieval option for the file based on at least one of:
a retrieval latency requirement; a retrieval reliability requirement; a memory availability requirement; and a maximum bandwidth utilization requirement. | 2,100 |
5,311 | 5,311 | 14,569,937 | 2,162 | A system and method for searching and displaying contextual data respective of an event is provided. The system comprises receiving a request to analyze calendar data stored on a user device, wherein the calendar data comprises the event; generating metadata for the event based on the analyzed calendar date; identifying at least one parameter related to the event; searching through a plurality of web sources for contextual data related to the at least one identified parameter; and providing the contextual data to the user device. | 1. A method for searching and displaying contextual data respective of an event, comprising:
receiving a request to analyze calendar data stored on a user device, wherein the calendar data comprises the event; generating metadata for the event based on the analyzed calendar date; identifying at least one parameter related to the event; searching through a plurality of web sources for contextual data related to the at least one identified parameter; and providing the contextual data to the user device. 2. The method of claim 1, wherein the at least one identified parameter is any one of:
a participant in the event, a location of the event, a subject of the event, and a type of the event. 3. The method of claim 1, further comprising:
storing the contextual data and the at least one parameter in a database. 4. The method of claim 1, wherein the plurality of web sources comprises at least one of: public web sources and private web sources, wherein private web sources are limited to an enterprise the user belongs to. 5. The method of claim 1, wherein searching through the plurality of web sources for contextual data further comprises:
identifying at least one the of plurality of web sources from which contextual data may be extracted; determining whether each web source of the plurality of web sources the identified at least one web source are appropriate respective of the identified parameters; and upon determining a web source of data is appropriate respective of the identified parameters, searching through the appropriate source of data for contextual data. 6. The method of claim 5, further comprising:
determining whether each appropriate source of data is a private web source; upon determining that an appropriate source of data is a private web source, obtaining at least a user identifier for accessing the appropriate private web source; and accessing the appropriate private web source using the at least a user identifier. 7. The method of claim 6, wherein obtaining at least a user identifier for accessing the appropriate private web source further comprises:
prompting a user for the at least a user identifier; and receiving the at least a user identifier from the user. 8. The method of claim 1, further comprising:
identifying at least one environmental variable; determining, based on the identified at least one environmental variable, a time to display the contextual data on the user device; and displaying the contextual data at the determined time. 9. The method of claim 8, wherein the at least one environmental variable is at least one of: a time of day and a location of the user device. 10. A non-transitory computer readable medium having stored thereon instructions for causing one or more processing units to execute the method according to claim 1. 11. A system for searching and displaying contextual data respective of an event, comprising:
a processor; and a memory, the memory containing instructions that, when executed by the processor, configure the system to: receive a request to analyze calendar data stored on a user device, wherein the calendar data comprises the event; generate metadata for the event based on the analyzed calendar date; identify at least one parameter related to the event; search through a plurality of web sources for contextual data is related to the at least one or more identified parameters; and provide the contextual data to the user device. 12. The system of claim 11, wherein the one parameter is at least one of: a participant in the event, a location of the event, a subject of the event, and a type of the event. 13. The system of claim 11, wherein the system is further configured to:
store the contextual data and the at least one parameter in a database. 14. The system of claim 11, wherein the plurality of web sources comprises at least one of: public web sources and private web sources, wherein private web sources are limited to an enterprise the user belongs to. 15. The system of claim 11, wherein the system is further configured to:
identify one the of plurality of web sources from which contextual data may be extracted; determine whether each web source of the plurality of web sources the identified at least one web source are appropriate respective of the identified parameters; and upon determining a web source of data is appropriate respective of the identified parameters, search through the appropriate source of data for contextual data. 16. The system of claim 15, wherein the system is further configured to:
determine whether each appropriate source of data is a private web source; upon determining that an appropriate source of data is a private web source, obtain at least a user identifier for accessing the appropriate private web source; and access the appropriate private web source using the at least a user identifier. 17. The system of claim 16, wherein the system is further configured to:
prompt a user for the at least a user identifier; and receive the at least a user identifier from the user. 18. The system of claim 11, wherein the system is further configured to:
identify at least one environmental variable; determine, based on the identified at least one environmental variable, a time to display the contextual data on the user device; and displaying the contextual data at the determined time. 19. The system of claim 18, wherein the at least on environmental variable at least one any of: a time of day, and a location of the user device. | A system and method for searching and displaying contextual data respective of an event is provided. The system comprises receiving a request to analyze calendar data stored on a user device, wherein the calendar data comprises the event; generating metadata for the event based on the analyzed calendar date; identifying at least one parameter related to the event; searching through a plurality of web sources for contextual data related to the at least one identified parameter; and providing the contextual data to the user device.1. A method for searching and displaying contextual data respective of an event, comprising:
receiving a request to analyze calendar data stored on a user device, wherein the calendar data comprises the event; generating metadata for the event based on the analyzed calendar date; identifying at least one parameter related to the event; searching through a plurality of web sources for contextual data related to the at least one identified parameter; and providing the contextual data to the user device. 2. The method of claim 1, wherein the at least one identified parameter is any one of:
a participant in the event, a location of the event, a subject of the event, and a type of the event. 3. The method of claim 1, further comprising:
storing the contextual data and the at least one parameter in a database. 4. The method of claim 1, wherein the plurality of web sources comprises at least one of: public web sources and private web sources, wherein private web sources are limited to an enterprise the user belongs to. 5. The method of claim 1, wherein searching through the plurality of web sources for contextual data further comprises:
identifying at least one the of plurality of web sources from which contextual data may be extracted; determining whether each web source of the plurality of web sources the identified at least one web source are appropriate respective of the identified parameters; and upon determining a web source of data is appropriate respective of the identified parameters, searching through the appropriate source of data for contextual data. 6. The method of claim 5, further comprising:
determining whether each appropriate source of data is a private web source; upon determining that an appropriate source of data is a private web source, obtaining at least a user identifier for accessing the appropriate private web source; and accessing the appropriate private web source using the at least a user identifier. 7. The method of claim 6, wherein obtaining at least a user identifier for accessing the appropriate private web source further comprises:
prompting a user for the at least a user identifier; and receiving the at least a user identifier from the user. 8. The method of claim 1, further comprising:
identifying at least one environmental variable; determining, based on the identified at least one environmental variable, a time to display the contextual data on the user device; and displaying the contextual data at the determined time. 9. The method of claim 8, wherein the at least one environmental variable is at least one of: a time of day and a location of the user device. 10. A non-transitory computer readable medium having stored thereon instructions for causing one or more processing units to execute the method according to claim 1. 11. A system for searching and displaying contextual data respective of an event, comprising:
a processor; and a memory, the memory containing instructions that, when executed by the processor, configure the system to: receive a request to analyze calendar data stored on a user device, wherein the calendar data comprises the event; generate metadata for the event based on the analyzed calendar date; identify at least one parameter related to the event; search through a plurality of web sources for contextual data is related to the at least one or more identified parameters; and provide the contextual data to the user device. 12. The system of claim 11, wherein the one parameter is at least one of: a participant in the event, a location of the event, a subject of the event, and a type of the event. 13. The system of claim 11, wherein the system is further configured to:
store the contextual data and the at least one parameter in a database. 14. The system of claim 11, wherein the plurality of web sources comprises at least one of: public web sources and private web sources, wherein private web sources are limited to an enterprise the user belongs to. 15. The system of claim 11, wherein the system is further configured to:
identify one the of plurality of web sources from which contextual data may be extracted; determine whether each web source of the plurality of web sources the identified at least one web source are appropriate respective of the identified parameters; and upon determining a web source of data is appropriate respective of the identified parameters, search through the appropriate source of data for contextual data. 16. The system of claim 15, wherein the system is further configured to:
determine whether each appropriate source of data is a private web source; upon determining that an appropriate source of data is a private web source, obtain at least a user identifier for accessing the appropriate private web source; and access the appropriate private web source using the at least a user identifier. 17. The system of claim 16, wherein the system is further configured to:
prompt a user for the at least a user identifier; and receive the at least a user identifier from the user. 18. The system of claim 11, wherein the system is further configured to:
identify at least one environmental variable; determine, based on the identified at least one environmental variable, a time to display the contextual data on the user device; and displaying the contextual data at the determined time. 19. The system of claim 18, wherein the at least on environmental variable at least one any of: a time of day, and a location of the user device. | 2,100 |
5,312 | 5,312 | 13,627,738 | 2,165 | An exemplary method comprises describing a plurality of wines, each wine of the plurality of wines being described using descriptors, receiving at least one predetermined intensity value associated with each descriptor, storing the descriptors within a wine database, generating a consumer wine preference profile that includes a plurality of user preference intensity values, at least one of the plurality of user preference intensity values being associated with at least one of the descriptors, selecting at least one wine from the plurality of wines by correlating at least a subset of the plurality of user preference intensity values with at least a subset of the predetermined intensity values, and providing identification of the selected at least one wine from the plurality of wines. | 1. A method comprising:
describing a plurality of wines, each wine of the plurality of wines being described using descriptors; receiving at least one predetermined intensity value associated with each descriptor; storing the descriptors within a wine database; generating a consumer wine preference profile that includes a plurality of user preference intensity values, at least one of the plurality of user preference intensity values being associated with at least one of the descriptors; selecting at least one wine from the plurality of wines by correlating at least a subset of the plurality of user preference intensity values with at least a subset of the predetermined intensity values; and providing identification of the selected at least one wine from the plurality of wines. 2. The method of claim 1 wherein the consumer wine preference profile is associated with a consumer who is provided the identification of the selected at least one wine. 3. The method of claim 1 further comprising:
receiving a wine request, the wine request including an identifier and at least one wine categorical classification;
retrieving a subset of the descriptors from the wine database based on the wine categorical classification to identify the at least the subset of the predetermined intensity values; and
retrieving the consumer wine preference profile based on the identifier. 4. The method of claim 3 wherein the at least one wine categorical classification is a wine varietal. 5. The method of claim 3 wherein the at least one wine categorical classification is a wine color. 6. The method of claim 3 wherein the wine request comprises location information and the subset of the descriptors is associated with the location information. 7. The method of claim 1 wherein selecting the at least one wine comprises selecting the at least one wine based on a similarity of the subset of the plurality of user preference intensity values with the at least the subset of the predetermined intensity values. 8. The method of claim 1 wherein selecting the at least one wine from the plurality of wines comprises selecting a subset of the plurality of wines. 9. The method of claim 8 wherein correlating the at least the subset of the plurality of user preference intensity values with the at least the subset of the predetermined intensity values comprises:
correlating a first subset of the plurality of user preference intensity values associated with a first wine of the subset of the plurality of wines with the at least the subset of the plurality of user preference intensity values; and
correlating a second subset of the plurality of user preference intensity values associated with a second wine of the subset of the plurality of wines with the at least the subset of the plurality of user preference intensity values. 10. The method of claim 9 further comprising ranking the first and second wines based on the correlations. 11. The method of claim 10 wherein providing information of the selected at least one wine from the plurality of wines comprises providing the ranked first and second wines. 12. The method of claim 1 further comprising:
receiving a wine profile update request comprising an identifier and a wine attribute;
retrieving the consumer wine preference profile based on the identifier; and
updating the plurality of user preference intensity values based on the wine attribute. 13. A system comprising:
a wine description module configured to describe a plurality of wines, each wine of the plurality of wines being described using descriptors, to receive at least one predetermined intensity value associated with each descriptor, and to store the descriptors within a wine database; a training module configured to generate a consumer wine preference profile that includes a plurality of user preference intensity values, at least one of the plurality of user preference intensity values being associated with at least one of the descriptors; and a ranking module configured to select at least one wine from the plurality of wines by correlating at least a subset of the plurality of user preference intensity values with at least a subset of the predetermined intensity values, and provide identification of the selected at least one wine from the plurality of wines. 14. The system of claim 13 wherein the consumer wine preference profile is associated with a consumer who is provided the identification of the selected at least one wine. 15. The system of claim 13 wherein the ranking module is further configured to:
receive a wine request, the wine request including an identifier and at least one wine categorical classification;
retrieve a subset of the descriptors from the wine database based on the wine categorical classification to identify the at least the subset of the predetermined intensity values; and
retrieve the consumer wine preference profile based on the identifier. 16. The system of claim 15 wherein the at least one wine categorical classification is a wine varietal. 17. The system of claim 15 wherein the at least one wine categorical classification is a winery. 18. The system of claim 15 wherein the at least one wine categorical classification is a wine country. 19. The system of claim 15 wherein the at least one wine categorical classification is a wine geographic region. 20. The system of claim 15 wherein the at least one wine categorical classification is a wine color. 21. The system of claim 15 wherein the wine request comprises location information and the subset of the descriptors is associated with the location information. 22. The system of claim 13 wherein the wine ranking module configured to select the at least one wine comprises the wine ranking module configured to select the at least one wine based on a similarity of the subset of the plurality of user preference intensity values with the at least the subset of the predetermined intensity values. 23. The system of claim 13 wherein the wine ranking module configured to select at least one wine from the plurality of wines comprises the wine ranking module configured to select a subset of the plurality of wines. 24. The system of claim 20 wherein the wine ranking module configured to correlate the at least the subset of the plurality of user preference intensity values with the at least the subset of the predetermined intensity values comprises the wine ranking module configured to:
correlate a first subset of the plurality of user preference intensity values associated with a first wine of the subset of the plurality of wines with the at least the subset of the plurality of user preference intensity values; and
correlate a second subset of the plurality of user preference intensity values associated with a second wine of the subset of the plurality of wines with the at least the subset of the plurality of user preference intensity values. 25. The system of claim 21 wherein the wine ranking module is further configured to rank the first and second wines based on the correlations. 26. The system of claim 22 wherein the wine ranking module configured to provide information of the selected at least one wine from the plurality of wines comprises the wine ranking module configured to provide the ranked first and second wines. 27. The system of claim 13 further comprising:
an update module configured to receive a wine profile update request comprising an identifier and a wine attribute, to retrieve the consumer wine preference profile based on the identifier, and to update the plurality of user preference intensity values based on the wine attribute. 28. A non-transitory computer readable medium comprising instructions executable by a processor for performing a method, the method comprising:
describing a plurality of wines, each wine of the plurality of wines being described using descriptors; receiving at least one predetermined intensity value associated with each descriptor; storing the descriptors within a wine database; generating a consumer wine preference profile that includes a plurality of user preference intensity values, at least one of the plurality of user preference intensity values being associated with at least one of the descriptors; selecting at least one wine from the plurality of wines by correlating at least a subset of the plurality of user preference intensity values with at least a subset of the predetermined intensity values; and providing identification of the selected at least one wine from the plurality of wines. | An exemplary method comprises describing a plurality of wines, each wine of the plurality of wines being described using descriptors, receiving at least one predetermined intensity value associated with each descriptor, storing the descriptors within a wine database, generating a consumer wine preference profile that includes a plurality of user preference intensity values, at least one of the plurality of user preference intensity values being associated with at least one of the descriptors, selecting at least one wine from the plurality of wines by correlating at least a subset of the plurality of user preference intensity values with at least a subset of the predetermined intensity values, and providing identification of the selected at least one wine from the plurality of wines.1. A method comprising:
describing a plurality of wines, each wine of the plurality of wines being described using descriptors; receiving at least one predetermined intensity value associated with each descriptor; storing the descriptors within a wine database; generating a consumer wine preference profile that includes a plurality of user preference intensity values, at least one of the plurality of user preference intensity values being associated with at least one of the descriptors; selecting at least one wine from the plurality of wines by correlating at least a subset of the plurality of user preference intensity values with at least a subset of the predetermined intensity values; and providing identification of the selected at least one wine from the plurality of wines. 2. The method of claim 1 wherein the consumer wine preference profile is associated with a consumer who is provided the identification of the selected at least one wine. 3. The method of claim 1 further comprising:
receiving a wine request, the wine request including an identifier and at least one wine categorical classification;
retrieving a subset of the descriptors from the wine database based on the wine categorical classification to identify the at least the subset of the predetermined intensity values; and
retrieving the consumer wine preference profile based on the identifier. 4. The method of claim 3 wherein the at least one wine categorical classification is a wine varietal. 5. The method of claim 3 wherein the at least one wine categorical classification is a wine color. 6. The method of claim 3 wherein the wine request comprises location information and the subset of the descriptors is associated with the location information. 7. The method of claim 1 wherein selecting the at least one wine comprises selecting the at least one wine based on a similarity of the subset of the plurality of user preference intensity values with the at least the subset of the predetermined intensity values. 8. The method of claim 1 wherein selecting the at least one wine from the plurality of wines comprises selecting a subset of the plurality of wines. 9. The method of claim 8 wherein correlating the at least the subset of the plurality of user preference intensity values with the at least the subset of the predetermined intensity values comprises:
correlating a first subset of the plurality of user preference intensity values associated with a first wine of the subset of the plurality of wines with the at least the subset of the plurality of user preference intensity values; and
correlating a second subset of the plurality of user preference intensity values associated with a second wine of the subset of the plurality of wines with the at least the subset of the plurality of user preference intensity values. 10. The method of claim 9 further comprising ranking the first and second wines based on the correlations. 11. The method of claim 10 wherein providing information of the selected at least one wine from the plurality of wines comprises providing the ranked first and second wines. 12. The method of claim 1 further comprising:
receiving a wine profile update request comprising an identifier and a wine attribute;
retrieving the consumer wine preference profile based on the identifier; and
updating the plurality of user preference intensity values based on the wine attribute. 13. A system comprising:
a wine description module configured to describe a plurality of wines, each wine of the plurality of wines being described using descriptors, to receive at least one predetermined intensity value associated with each descriptor, and to store the descriptors within a wine database; a training module configured to generate a consumer wine preference profile that includes a plurality of user preference intensity values, at least one of the plurality of user preference intensity values being associated with at least one of the descriptors; and a ranking module configured to select at least one wine from the plurality of wines by correlating at least a subset of the plurality of user preference intensity values with at least a subset of the predetermined intensity values, and provide identification of the selected at least one wine from the plurality of wines. 14. The system of claim 13 wherein the consumer wine preference profile is associated with a consumer who is provided the identification of the selected at least one wine. 15. The system of claim 13 wherein the ranking module is further configured to:
receive a wine request, the wine request including an identifier and at least one wine categorical classification;
retrieve a subset of the descriptors from the wine database based on the wine categorical classification to identify the at least the subset of the predetermined intensity values; and
retrieve the consumer wine preference profile based on the identifier. 16. The system of claim 15 wherein the at least one wine categorical classification is a wine varietal. 17. The system of claim 15 wherein the at least one wine categorical classification is a winery. 18. The system of claim 15 wherein the at least one wine categorical classification is a wine country. 19. The system of claim 15 wherein the at least one wine categorical classification is a wine geographic region. 20. The system of claim 15 wherein the at least one wine categorical classification is a wine color. 21. The system of claim 15 wherein the wine request comprises location information and the subset of the descriptors is associated with the location information. 22. The system of claim 13 wherein the wine ranking module configured to select the at least one wine comprises the wine ranking module configured to select the at least one wine based on a similarity of the subset of the plurality of user preference intensity values with the at least the subset of the predetermined intensity values. 23. The system of claim 13 wherein the wine ranking module configured to select at least one wine from the plurality of wines comprises the wine ranking module configured to select a subset of the plurality of wines. 24. The system of claim 20 wherein the wine ranking module configured to correlate the at least the subset of the plurality of user preference intensity values with the at least the subset of the predetermined intensity values comprises the wine ranking module configured to:
correlate a first subset of the plurality of user preference intensity values associated with a first wine of the subset of the plurality of wines with the at least the subset of the plurality of user preference intensity values; and
correlate a second subset of the plurality of user preference intensity values associated with a second wine of the subset of the plurality of wines with the at least the subset of the plurality of user preference intensity values. 25. The system of claim 21 wherein the wine ranking module is further configured to rank the first and second wines based on the correlations. 26. The system of claim 22 wherein the wine ranking module configured to provide information of the selected at least one wine from the plurality of wines comprises the wine ranking module configured to provide the ranked first and second wines. 27. The system of claim 13 further comprising:
an update module configured to receive a wine profile update request comprising an identifier and a wine attribute, to retrieve the consumer wine preference profile based on the identifier, and to update the plurality of user preference intensity values based on the wine attribute. 28. A non-transitory computer readable medium comprising instructions executable by a processor for performing a method, the method comprising:
describing a plurality of wines, each wine of the plurality of wines being described using descriptors; receiving at least one predetermined intensity value associated with each descriptor; storing the descriptors within a wine database; generating a consumer wine preference profile that includes a plurality of user preference intensity values, at least one of the plurality of user preference intensity values being associated with at least one of the descriptors; selecting at least one wine from the plurality of wines by correlating at least a subset of the plurality of user preference intensity values with at least a subset of the predetermined intensity values; and providing identification of the selected at least one wine from the plurality of wines. | 2,100 |
5,313 | 5,313 | 14,017,431 | 2,145 | Providing for using presence information for an object in a digital image is provided. An association between an identifier and an object depicted in a portion of a digital image is indicated. Whether the identifier is sufficient to identify presence information for the object is determined. In association with displaying the digital image, a user interface control configured is provided to perform an action using the identified presence information if the identifier is sufficient to identify the presence information. | 1. A method for providing for using presence information for an object in a digital image, comprising:
indicating an association between an identifier and an object depicted in a portion of a digital image; determining whether the identifier is sufficient to identify presence information for the object; and providing, in association with displaying the digital image, a user interface control configured to perform an action using the identified presence information if the identifier is sufficient to identify the presence information; wherein at least one of the preceding actions is performed on at least one electronic hardware component. 2. The method of claim 1, comprising receiving user input for associating the identifier with the object depicted in the portion of the digital image. 3. The method of claim 1, wherein indicating an association between an identifier and an object depicted in a portion of a digital image includes presenting a graphic overlay indicating the object in the portion of the digital image. 4. The method of claim 1, wherein determining whether the identifier is sufficient to identify presence information for the object includes identifying presence information from one of a presence application and a roster list. 5. The method of claim 1, wherein the presence information includes contact information and providing a user interface control includes providing a user interface control configured to initiate a communication using the contact information. 6. The method of claim 5, wherein the communication is one of an email, a text message, and a phone call. 7. The method of claim 6 wherein in response to receiving a communication selection, the user interface control is further configured to initiate the communication based on the received communication selection. 8. The method of claim 1, wherein providing a user interface control includes displaying an indicator indicating that presence information is available if the identifier is sufficient to identify the presence information. 9. The method of claim 8 wherein in response to receiving a selection of the indicator, providing a second interface control configured to display at least one of status and connection options. 10. The method of claim 1 wherein providing the user interface control includes displaying the presence information. 11. The method of claim 1 wherein providing, in association with displaying the digital image, a user interface control configured to perform an action using the identified presence information includes displaying the user interface control in place of at least part of the digital image. 12. The method of claim 11 wherein displaying the user interface control in place of at least part of the digital image includes displaying the user interface control in place of the at least part of the digital image in response to user input. 13. The method of claim 11 wherein displaying the user interface control in place of at least part of the digital image includes displaying at least one of an icon and text. 14. A non-transitory computer readable medium storing a computer program, executable by a machine, for obtaining presence information for at least one object in a digital image, the computer program comprising executable instructions for:
indicating an association between an identifier and an object depicted in a portion of a digital image; determining whether the identifier is sufficient to identify presence information for the object; and providing, in association with displaying the digital image, a user interface control configured to perform an action using the identified presence information if the identifier is sufficient to identify the presence information; wherein at least one of the preceding actions is performed on at least one electronic hardware component. 15. An image system for providing for using presence information for an object in a digital image, comprising system components including:
an image presence component configured to indicate an association between an identifier and an object depicted in a portion of a digital image; the image presence component further configured to determine whether the identifier is sufficient to identify presence information for the object; and an image component configured to provide, in association with displaying the digital image, a user interface control configured to perform an action using the identified presence information if the identifier is sufficient to identify the presence information; wherein at least one of the preceding actions is performed on at least one electronic hardware component. 16. The system of claim 15, wherein the image component is further configured to receive user input for associating the identifier with the object depicted in the portion of the digital image. 17. The system of claim 15, wherein in indicating an association between an identifier and an object depicted in a portion of a digital image, the image component is configured to present a graphic overlay indicating the object in the portion of the digital image. 18. The system of claim 15, wherein in determining whether the identifier is sufficient to identify presence information for the object, the image presence component is configured to identify presence information from one of a presence application and a roster list. 19. The system of claim 18, wherein the presence information includes contact information and in providing a user interface control, the image component is configured to provide a user interface control configured to initiate a communication using the contact information. 20. The system of claim 19, wherein the communication is one of an email, a text message, and a phone call. 21. The system of claim 20, wherein in response to receiving a communication selection, the user interface control is further configured to initiate the communication based on the received communication selection. 22. The system of claim 15 wherein in providing, in association with displaying the digital image, a user interface control configured to perform an action using the identified presence information, the image component is further configured to display the user interface control in place of at least part of the digital image. 23. The system of claim 22 wherein in displaying the user interface control in place of at least part of the digital image, the image component is further configured to display the user interface control in place of the at least part of the digital image in response to user input. 24. The system of claim 22 wherein in displaying the user interface control in place of at least part of the digital image, the image component is further configured to display at least one of an icon and text. | Providing for using presence information for an object in a digital image is provided. An association between an identifier and an object depicted in a portion of a digital image is indicated. Whether the identifier is sufficient to identify presence information for the object is determined. In association with displaying the digital image, a user interface control configured is provided to perform an action using the identified presence information if the identifier is sufficient to identify the presence information.1. A method for providing for using presence information for an object in a digital image, comprising:
indicating an association between an identifier and an object depicted in a portion of a digital image; determining whether the identifier is sufficient to identify presence information for the object; and providing, in association with displaying the digital image, a user interface control configured to perform an action using the identified presence information if the identifier is sufficient to identify the presence information; wherein at least one of the preceding actions is performed on at least one electronic hardware component. 2. The method of claim 1, comprising receiving user input for associating the identifier with the object depicted in the portion of the digital image. 3. The method of claim 1, wherein indicating an association between an identifier and an object depicted in a portion of a digital image includes presenting a graphic overlay indicating the object in the portion of the digital image. 4. The method of claim 1, wherein determining whether the identifier is sufficient to identify presence information for the object includes identifying presence information from one of a presence application and a roster list. 5. The method of claim 1, wherein the presence information includes contact information and providing a user interface control includes providing a user interface control configured to initiate a communication using the contact information. 6. The method of claim 5, wherein the communication is one of an email, a text message, and a phone call. 7. The method of claim 6 wherein in response to receiving a communication selection, the user interface control is further configured to initiate the communication based on the received communication selection. 8. The method of claim 1, wherein providing a user interface control includes displaying an indicator indicating that presence information is available if the identifier is sufficient to identify the presence information. 9. The method of claim 8 wherein in response to receiving a selection of the indicator, providing a second interface control configured to display at least one of status and connection options. 10. The method of claim 1 wherein providing the user interface control includes displaying the presence information. 11. The method of claim 1 wherein providing, in association with displaying the digital image, a user interface control configured to perform an action using the identified presence information includes displaying the user interface control in place of at least part of the digital image. 12. The method of claim 11 wherein displaying the user interface control in place of at least part of the digital image includes displaying the user interface control in place of the at least part of the digital image in response to user input. 13. The method of claim 11 wherein displaying the user interface control in place of at least part of the digital image includes displaying at least one of an icon and text. 14. A non-transitory computer readable medium storing a computer program, executable by a machine, for obtaining presence information for at least one object in a digital image, the computer program comprising executable instructions for:
indicating an association between an identifier and an object depicted in a portion of a digital image; determining whether the identifier is sufficient to identify presence information for the object; and providing, in association with displaying the digital image, a user interface control configured to perform an action using the identified presence information if the identifier is sufficient to identify the presence information; wherein at least one of the preceding actions is performed on at least one electronic hardware component. 15. An image system for providing for using presence information for an object in a digital image, comprising system components including:
an image presence component configured to indicate an association between an identifier and an object depicted in a portion of a digital image; the image presence component further configured to determine whether the identifier is sufficient to identify presence information for the object; and an image component configured to provide, in association with displaying the digital image, a user interface control configured to perform an action using the identified presence information if the identifier is sufficient to identify the presence information; wherein at least one of the preceding actions is performed on at least one electronic hardware component. 16. The system of claim 15, wherein the image component is further configured to receive user input for associating the identifier with the object depicted in the portion of the digital image. 17. The system of claim 15, wherein in indicating an association between an identifier and an object depicted in a portion of a digital image, the image component is configured to present a graphic overlay indicating the object in the portion of the digital image. 18. The system of claim 15, wherein in determining whether the identifier is sufficient to identify presence information for the object, the image presence component is configured to identify presence information from one of a presence application and a roster list. 19. The system of claim 18, wherein the presence information includes contact information and in providing a user interface control, the image component is configured to provide a user interface control configured to initiate a communication using the contact information. 20. The system of claim 19, wherein the communication is one of an email, a text message, and a phone call. 21. The system of claim 20, wherein in response to receiving a communication selection, the user interface control is further configured to initiate the communication based on the received communication selection. 22. The system of claim 15 wherein in providing, in association with displaying the digital image, a user interface control configured to perform an action using the identified presence information, the image component is further configured to display the user interface control in place of at least part of the digital image. 23. The system of claim 22 wherein in displaying the user interface control in place of at least part of the digital image, the image component is further configured to display the user interface control in place of the at least part of the digital image in response to user input. 24. The system of claim 22 wherein in displaying the user interface control in place of at least part of the digital image, the image component is further configured to display at least one of an icon and text. | 2,100 |
5,314 | 5,314 | 12,973,781 | 2,166 | Individual blocks of data associated with a file are compressed into sub-blocks according to a compression type. For block compression type, an entire block of data is compressed and stored in the sub-block. For substream compression type, a block of data is first divided into multiple substreams that are each individually compressed and stored within the sub-block. | 1. A method of storing compressed data within a file system, comprising:
identifying a first block of data within the file system that should be compressed; compressing the first block of data according to a first compression type; allocating a first sub-block within the file system for storing the compressed first block of data; and storing the compressed first block of data within the first sub-block, wherein the first block of data is associated with a file, and a reference to the first block of data is stored within a file descriptor of the file and a size of the first sub-block is smaller than a size of the first block. 2. The method of claim 1, further comprising the step of determining that the first block of data can be compressed according to the first compression type. 3. The method of claim 2, wherein the first block of data can be compressed according to the first compression type when the first block of data, when compressed, fits into the first sub-block. 4. The method of claim 1, wherein the file descriptor is an inode associated with the file. 5. The method of claim 4, further comprising:
after storing the compressed first block of data within the first sub-block, updating the inode to remove the reference to the first block of data from the inode and to insert a reference to the first sub-block into the inode as well as a compression bit indicating the first compression type. 6. The method of claim 1, wherein the first block of data is identified based on a frequency of input/output operations performed on the first block of data. 7. The method of claim 1, wherein the first block of data is identified based on an average size of input/output operations performed on the first block of data. 8. The method of claim 1, further comprising:
receiving an input/output operation associated with the first sub-block; decompressing data stored within the first sub-block; and performing the input/output operation on the decompressed data. 9. The method of claim 8, wherein the input/output operation is a store operation that comprises:
patching the decompressed data with data associated with the store operation; compressing the patched decompressed data; and storing the patched decompressed data into the first sub-block. 10. A method of compressing a block of data within a file system, comprising:
dividing a first block of data into a plurality of sub streams; compressing each substream included in the plurality of substreams; and storing each compressed substream in a different portion of a first sub-block. 11. The method of claim 10, further comprising:
determining that the each substream, when compressed, fits into a fixed size portion of the first sub-block. 12. The method of claim 11, further comprising:
padding each compressed substream such that the compressed substream, when padded, fills the fixed size portion of the first sub-block. 13. The method of claim 10, further comprising:
generating a dictionary that stores a start offset for each compressed substream stored within the first sub-block. 14. The method of claim 10, further comprising:
receiving an input/output operation associated with the first sub-block; based on an address associated with the input/output operation, identifying a first substream within the first sub-block that stores data associated with the input/output operation; decompressing the data stored within the first substream; and performing the input/output operation on the decompressed data. 15. The method of claim 14, further comprising:
after performing the input/output operation, recompressing the decompressed data. 16. The method of claim 15, further comprising:
determining whether the recompressed data fits in the first substream. 17. The method of claim 16, further comprising:
storing the recompressed data in the first substream when the recompressed data fits in the first substream. 18. The method of claim 16, further comprising:
compressing data stored in each substream within the first sub-block according to a different compression type. 19. A file inode associated with a file of a file system, comprising:
one or more file attributes; a set of block references, wherein each block reference is associated with a different block within a data storage unit (DSU) that stores a portion of the file; and a set of sub-block references, wherein each sub-block reference is associated with a different sub-block within the DSU that stores a portion of the file. 20. The file inode of claim 19, wherein the file inode further comprises:
a compression attribute that is stored with each sub-block reference, wherein the compression attribute indicates the type of compression performed on data stored within the sub-block. 21. The file inode of claim 19, wherein the one or more file attributes include a first attribute indicating a first fixed size of each block associated with the set of block references. 22. The file inode of claim 21, wherein the one or more file attributes include a second attribute indicating a second fixed size of each sub-block associated with the set of sub-block references. 23. The file inode of claim 22, wherein the first fixed size is larger than the second fixed size. | Individual blocks of data associated with a file are compressed into sub-blocks according to a compression type. For block compression type, an entire block of data is compressed and stored in the sub-block. For substream compression type, a block of data is first divided into multiple substreams that are each individually compressed and stored within the sub-block.1. A method of storing compressed data within a file system, comprising:
identifying a first block of data within the file system that should be compressed; compressing the first block of data according to a first compression type; allocating a first sub-block within the file system for storing the compressed first block of data; and storing the compressed first block of data within the first sub-block, wherein the first block of data is associated with a file, and a reference to the first block of data is stored within a file descriptor of the file and a size of the first sub-block is smaller than a size of the first block. 2. The method of claim 1, further comprising the step of determining that the first block of data can be compressed according to the first compression type. 3. The method of claim 2, wherein the first block of data can be compressed according to the first compression type when the first block of data, when compressed, fits into the first sub-block. 4. The method of claim 1, wherein the file descriptor is an inode associated with the file. 5. The method of claim 4, further comprising:
after storing the compressed first block of data within the first sub-block, updating the inode to remove the reference to the first block of data from the inode and to insert a reference to the first sub-block into the inode as well as a compression bit indicating the first compression type. 6. The method of claim 1, wherein the first block of data is identified based on a frequency of input/output operations performed on the first block of data. 7. The method of claim 1, wherein the first block of data is identified based on an average size of input/output operations performed on the first block of data. 8. The method of claim 1, further comprising:
receiving an input/output operation associated with the first sub-block; decompressing data stored within the first sub-block; and performing the input/output operation on the decompressed data. 9. The method of claim 8, wherein the input/output operation is a store operation that comprises:
patching the decompressed data with data associated with the store operation; compressing the patched decompressed data; and storing the patched decompressed data into the first sub-block. 10. A method of compressing a block of data within a file system, comprising:
dividing a first block of data into a plurality of sub streams; compressing each substream included in the plurality of substreams; and storing each compressed substream in a different portion of a first sub-block. 11. The method of claim 10, further comprising:
determining that the each substream, when compressed, fits into a fixed size portion of the first sub-block. 12. The method of claim 11, further comprising:
padding each compressed substream such that the compressed substream, when padded, fills the fixed size portion of the first sub-block. 13. The method of claim 10, further comprising:
generating a dictionary that stores a start offset for each compressed substream stored within the first sub-block. 14. The method of claim 10, further comprising:
receiving an input/output operation associated with the first sub-block; based on an address associated with the input/output operation, identifying a first substream within the first sub-block that stores data associated with the input/output operation; decompressing the data stored within the first substream; and performing the input/output operation on the decompressed data. 15. The method of claim 14, further comprising:
after performing the input/output operation, recompressing the decompressed data. 16. The method of claim 15, further comprising:
determining whether the recompressed data fits in the first substream. 17. The method of claim 16, further comprising:
storing the recompressed data in the first substream when the recompressed data fits in the first substream. 18. The method of claim 16, further comprising:
compressing data stored in each substream within the first sub-block according to a different compression type. 19. A file inode associated with a file of a file system, comprising:
one or more file attributes; a set of block references, wherein each block reference is associated with a different block within a data storage unit (DSU) that stores a portion of the file; and a set of sub-block references, wherein each sub-block reference is associated with a different sub-block within the DSU that stores a portion of the file. 20. The file inode of claim 19, wherein the file inode further comprises:
a compression attribute that is stored with each sub-block reference, wherein the compression attribute indicates the type of compression performed on data stored within the sub-block. 21. The file inode of claim 19, wherein the one or more file attributes include a first attribute indicating a first fixed size of each block associated with the set of block references. 22. The file inode of claim 21, wherein the one or more file attributes include a second attribute indicating a second fixed size of each sub-block associated with the set of sub-block references. 23. The file inode of claim 22, wherein the first fixed size is larger than the second fixed size. | 2,100 |
5,315 | 5,315 | 14,244,935 | 2,164 | Example apparatus and methods process data that is going to be stored in an object store. The object store may have multiple data destinations (e.g., “buckets”). Different buckets have different data storage policies that control, for example, how many copies of the data will be made, whether the data will be stored onsite or offsite, or other storage parameters. Data may be classified by identifying a value for an attribute (e.g., file type, file source) of the data. A storage policy associated with a bucket may then be selected based on the attribute. Once the storage policy has been selected, then the data may be provided to a bucket associated with the storage policy. The number of buckets, data classifications, or storage policies may be updated by adaptive parameterization that considers the amount or type of data observed and stored in the object store. | 1. A non-transitory computer-readable storage medium storing computer-executable instructions that when executed by a computer cause the computer to perform a method, the method comprising:
accessing data that is to be stored in an object store, where the object store is configured with two or more data destinations, where different data destinations have different data storage policies; classifying the data by identifying a value for an attribute of the data; selecting a data storage policy associated with a member of the two or more data destinations based, at least in part, on the value of the attribute, and providing the data to a member of the two or more data destinations that is associated with the data storage policy. 2. The non-transitory computer-readable storage medium of claim 1, where classifying the data by identifying the value for the attribute includes examining metadata associated with the data or examining the contents of the data. 3. The non-transitory computer-readable storage medium of claim 2, where the attribute is a file type, a file size, a file owner, an origin of the data, an age of the data, or a velocity of the data. 4. The non-transitory computer-readable storage medium of claim 1, where the data storage policy describes a number of copies to be made of the data, whether the data is to be stored onsite, whether the data is to be stored offsite, whether the data is to be compressed, a type of compression to be performed on the data, whether the data is to be encrypted, or a type of encryption to be performed on the data. 5. The non-transitory computer-readable storage medium of claim 1, where the data storage policy controls whether the data will be stored using erasure codes. 6. The non-transitory computer-readable storage medium of claim 5, where the data storage policy controls a parity level used with erasure code based storage. 7. The non-transitory computer-readable storage medium of claim 1, where classifying the data is performed in an apparatus located external to the object store, where the object store exposes two or more namespaces to the apparatus located external to the object store, and where members of the two or more data destinations have unique namespaces. 8. The non-transitory computer-readable storage medium of claim 1, where classifying the data is performed in an apparatus located internal to the object store, where the object store exposes two or more namespaces to the apparatus located internal to the object store, where the object store exposes a single namespace to apparatus located outside the object store, and where members of the two or more data destinations have unique namespaces. 9. The non-transitory computer-readable storage medium of claim 1, where classifying the data is performed in-line in an apparatus integrated into the object store, where the object store exposes two or more namespaces to the apparatus integrated into the object store, where the object store exposes a single namespace to apparatus located outside the object store, and where members of the two or more data destinations have unique namespaces. 10. The non-transitory computer-readable storage medium of claim 1, where providing the data to the member includes providing the data directly to the member. 11. The non-transitory computer-readable storage medium of claim 1, where providing the data to the member includes sending the data to the member indirectly via an intermediate data store. 12. The non-transitory computer-readable storage medium of claim 11, the method comprising controlling a separate process to move the data from the intermediate data store to the member. 13. The non-transitory computer-readable storage medium of claim 12, the method comprising:
selectively triggering the separate process periodically or upon determining that a threshold amount of data is being stored in the intermediate data store. 14. The non-transitory computer-readable storage medium of claim 1, the method comprising:
selectively adding a new data destination to the two or more data destinations, where adding the new data destination includes providing an additional data storage policy associated with the new data destination, or selectively removing a data destination from the two or more data destinations, where removing the data destination includes deactivating a data storage policy associated with the data destination being removed. 15. The non-transitory computer-readable storage medium of claim 1, the method comprising:
selectively modifying a data storage policy based, at least in part, on an observation of a threshold amount of data that has been stored in the object store. 16. An apparatus, comprising:
a processor; a memory; a set of logics that control storage of data in an object store configured with two or more buckets, where the set of logics cause an item to be stored in a member of the two or more buckets based, at least in part, on a set of data classifications; and an interface that connects the processor, the memory, and the set of logics; the set of logics comprising:
a first logic that produces a classification of the item to be stored by the object store;
a second logic that selects a bucket from the two or more buckets based, at least in part, on the classification; and
a third logic that controls the item to be provided to the bucket. 17. The apparatus of claim 16, where the first logic produces the classification from the contents of the item or from metadata associated with the item. 18. The apparatus of claim 17, where the second logic selects the bucket by matching the classification to storage parameters associated with members of the two or more buckets. 19. The apparatus of claim 18, where the third logic controls the item to be provided to the bucket indirectly via a network attached storage. 20. The apparatus of claim 17, comprising a fourth logic that:
selectively reconfigures the number of buckets available in the object store upon determining that a threshold number of buckets are being utilized below an under-utilization threshold or upon determining that a threshold number of buckets are being utilized above an over-utilization threshold, and selectively reconfigures a storage parameter associated with a bucket upon determining that less than a lower threshold amount of data has been stored according to the storage parameter or upon determining that more than an upper threshold amount of data has been stored according to the storage parameter. 21. An object store, comprising:
means for partitioning an object store into a plurality of data stores, where a member of the plurality of data stores is associated with a unique addressable namespace and a set of storage parameters; means for dynamically establishing the set of storage parameters for a member of the plurality of data stores; means for identifying a set of attributes for a file to be stored in a member of the plurality of data stores; and means for selecting a member of the plurality of data stores to store the file based, at least in part, on a comparison of the set of attributes and the set of storage parameters for the member of the plurality of data stores. | Example apparatus and methods process data that is going to be stored in an object store. The object store may have multiple data destinations (e.g., “buckets”). Different buckets have different data storage policies that control, for example, how many copies of the data will be made, whether the data will be stored onsite or offsite, or other storage parameters. Data may be classified by identifying a value for an attribute (e.g., file type, file source) of the data. A storage policy associated with a bucket may then be selected based on the attribute. Once the storage policy has been selected, then the data may be provided to a bucket associated with the storage policy. The number of buckets, data classifications, or storage policies may be updated by adaptive parameterization that considers the amount or type of data observed and stored in the object store.1. A non-transitory computer-readable storage medium storing computer-executable instructions that when executed by a computer cause the computer to perform a method, the method comprising:
accessing data that is to be stored in an object store, where the object store is configured with two or more data destinations, where different data destinations have different data storage policies; classifying the data by identifying a value for an attribute of the data; selecting a data storage policy associated with a member of the two or more data destinations based, at least in part, on the value of the attribute, and providing the data to a member of the two or more data destinations that is associated with the data storage policy. 2. The non-transitory computer-readable storage medium of claim 1, where classifying the data by identifying the value for the attribute includes examining metadata associated with the data or examining the contents of the data. 3. The non-transitory computer-readable storage medium of claim 2, where the attribute is a file type, a file size, a file owner, an origin of the data, an age of the data, or a velocity of the data. 4. The non-transitory computer-readable storage medium of claim 1, where the data storage policy describes a number of copies to be made of the data, whether the data is to be stored onsite, whether the data is to be stored offsite, whether the data is to be compressed, a type of compression to be performed on the data, whether the data is to be encrypted, or a type of encryption to be performed on the data. 5. The non-transitory computer-readable storage medium of claim 1, where the data storage policy controls whether the data will be stored using erasure codes. 6. The non-transitory computer-readable storage medium of claim 5, where the data storage policy controls a parity level used with erasure code based storage. 7. The non-transitory computer-readable storage medium of claim 1, where classifying the data is performed in an apparatus located external to the object store, where the object store exposes two or more namespaces to the apparatus located external to the object store, and where members of the two or more data destinations have unique namespaces. 8. The non-transitory computer-readable storage medium of claim 1, where classifying the data is performed in an apparatus located internal to the object store, where the object store exposes two or more namespaces to the apparatus located internal to the object store, where the object store exposes a single namespace to apparatus located outside the object store, and where members of the two or more data destinations have unique namespaces. 9. The non-transitory computer-readable storage medium of claim 1, where classifying the data is performed in-line in an apparatus integrated into the object store, where the object store exposes two or more namespaces to the apparatus integrated into the object store, where the object store exposes a single namespace to apparatus located outside the object store, and where members of the two or more data destinations have unique namespaces. 10. The non-transitory computer-readable storage medium of claim 1, where providing the data to the member includes providing the data directly to the member. 11. The non-transitory computer-readable storage medium of claim 1, where providing the data to the member includes sending the data to the member indirectly via an intermediate data store. 12. The non-transitory computer-readable storage medium of claim 11, the method comprising controlling a separate process to move the data from the intermediate data store to the member. 13. The non-transitory computer-readable storage medium of claim 12, the method comprising:
selectively triggering the separate process periodically or upon determining that a threshold amount of data is being stored in the intermediate data store. 14. The non-transitory computer-readable storage medium of claim 1, the method comprising:
selectively adding a new data destination to the two or more data destinations, where adding the new data destination includes providing an additional data storage policy associated with the new data destination, or selectively removing a data destination from the two or more data destinations, where removing the data destination includes deactivating a data storage policy associated with the data destination being removed. 15. The non-transitory computer-readable storage medium of claim 1, the method comprising:
selectively modifying a data storage policy based, at least in part, on an observation of a threshold amount of data that has been stored in the object store. 16. An apparatus, comprising:
a processor; a memory; a set of logics that control storage of data in an object store configured with two or more buckets, where the set of logics cause an item to be stored in a member of the two or more buckets based, at least in part, on a set of data classifications; and an interface that connects the processor, the memory, and the set of logics; the set of logics comprising:
a first logic that produces a classification of the item to be stored by the object store;
a second logic that selects a bucket from the two or more buckets based, at least in part, on the classification; and
a third logic that controls the item to be provided to the bucket. 17. The apparatus of claim 16, where the first logic produces the classification from the contents of the item or from metadata associated with the item. 18. The apparatus of claim 17, where the second logic selects the bucket by matching the classification to storage parameters associated with members of the two or more buckets. 19. The apparatus of claim 18, where the third logic controls the item to be provided to the bucket indirectly via a network attached storage. 20. The apparatus of claim 17, comprising a fourth logic that:
selectively reconfigures the number of buckets available in the object store upon determining that a threshold number of buckets are being utilized below an under-utilization threshold or upon determining that a threshold number of buckets are being utilized above an over-utilization threshold, and selectively reconfigures a storage parameter associated with a bucket upon determining that less than a lower threshold amount of data has been stored according to the storage parameter or upon determining that more than an upper threshold amount of data has been stored according to the storage parameter. 21. An object store, comprising:
means for partitioning an object store into a plurality of data stores, where a member of the plurality of data stores is associated with a unique addressable namespace and a set of storage parameters; means for dynamically establishing the set of storage parameters for a member of the plurality of data stores; means for identifying a set of attributes for a file to be stored in a member of the plurality of data stores; and means for selecting a member of the plurality of data stores to store the file based, at least in part, on a comparison of the set of attributes and the set of storage parameters for the member of the plurality of data stores. | 2,100 |
5,316 | 5,316 | 15,304,074 | 2,116 | A method for load balancing of charging stations for mobile loads within a charging stations network includes performing, based on a prediction of a charging demand of the mobile loads, a distribution of an energy-power-range limitation (ΔE, ΔP) p, lim for each of the charging stations p under consideration of a definable optimization parameter, wherein p=1, . . . , n and wherein n and p are integers. Under consideration of the distribution, an adaptation and/or selection of at least one transportation parameter of a mobile load is performed so as to at least partially fulfill the energy-power-range limitation (ΔE, ΔP) p, lim for each of the charging stations p or for a definable number of the charging stations p. | 1. A method for load balancing of charging stations for mobile loads within a charging stations network, the method comprising:
based on a prediction of a charging demand of the mobile loads, performing a distribution of an energy-power-range limitation (ΔE, ΔP)k, lim for each of the charging station p under consideration of a definable optimization parameter, wherein p=1, . . . , n and wherein n and p are integers, and under consideration of the distribution, performing at least one of an adaptation or a selection of at least one transportation parameter of at least one of the mobile loads so as to at least partially fulfill the energy-puwer-range limitation (ΔE, ΔP)p, lim for each of the charging stations p or for a definable number of the charging stations p. 2. The method according to claim 1, wherein the at least one of the adaptation or the selection of the at least one transportation parameter results in a modification of the prediction of the charging demand of at least one of the mobile loads. 3. The method according to claim 1, wherein the optimization parameter is defined so as to find a low cost distribution or a lowest cost distribution. 4. The method according to claim 1, wherein at least one of the mobile loads is transformed into at least one time tolerant and capacity tolerant mobile load. 5. The method according to claim 1, wherein the energy-power-range limitation (ΔE, ΔP)p, lim is equally distributed for each of the charging stations p. 6. The method according to claim 1, wherein the energy-power-range limitation (ΔE, ΔP)p, lim is distributed for each of the charging stations p under consideration of a factor in a form of at least one of a past balancing potential, economical strength within a network grid or a strategic location. 7. The method according to claim 1, wherein the prediction of the charging demand is performed depending on at least one transportation parameter. 8. The method according to claim 1, wherein the charging demand regarding energy and power to be provided to one of the mobile loads is a function of time and location. 9. The method according to claim 1, wherein the charging demand considers at least one of a route requirement, route requirements of different routes, a location, a direction, a time condition, a travel time, an estimated arrival time, ETA, a speed, a driving pattern, a current charging need, a predicted charging need, a charging time, a charging mode, a charging level or a battery level. 10. The method according to claim 1, wherein the at least one transportation parameter is at least one of a user preference, a route, a route guidance, a routing information, a distance, a direction, a charging time, a travel time, a speed, a waiting time or a break. 11. The method according to claim 1, wherein the at least one transportation parameter is received from an. intelligent transport system or service, ITS. 12. The method according to claim 1, wherein the method is performed in a reactive manner on or after cause of a load exceeding or having exceeded a definable threshold. 13. The method according to claim 1, wherein the method is performed dynamically. 14. The method according to claim 1, wherein, during the at least one of the adaptation or selection, at least one of a user preference, a traffic condition or a weather condition is considered. 15. The method according to claim 1, wherein, during the at least one of the adaptation or selection, an intelligent transport system or service, ITS, or data from the ITS is exploited. 16. The method according to claim 1, wherein the energy-power-range limitation (ΔE, ΔP)p, lim for each of the charging stations p is adapted under consideration of at least one of a user interaction/feedback, a user preference or a real-time traffic condition. 17. The method according to claim 1, wherein the at least one of the adaptation or the selection is performed by a de-centralized management scheme. 18. The method according to claim 1, wherein the at least one of the adaptation or the selection is performed by neighbored charging stations in a bi-lateral manner. 19. A charging stations network comprising:
means for load balancing of charging stations for mobile loads, means for distributing an energy-power-range limitation (ΔE, ΔP)k, lim for each of the charging stations p based on a prediction of a charging demand of the mobile loads and under consideration of a definable optimization parameter, wherein p=1, . . . , n and wherein n and p are integers, and means for at least one of adapting or selecting of at least one transportation parameter of at least one of the mobile loads under consideration of the distribution so as to at least partially fulfill the energy-power-range limitation (ΔE, ΔP)p, lim for each of the charging stations p or for a definable number of the charging stations p. 20. The charging stations network according to claim 19, wherein the balancing means, the distributing means or the adapting and/or selecting means comprises at least one of a communication system, route guidance or online route guidance, charging demand predictor, Energy Management System, EMS, of charging station or EMS control center. | A method for load balancing of charging stations for mobile loads within a charging stations network includes performing, based on a prediction of a charging demand of the mobile loads, a distribution of an energy-power-range limitation (ΔE, ΔP) p, lim for each of the charging stations p under consideration of a definable optimization parameter, wherein p=1, . . . , n and wherein n and p are integers. Under consideration of the distribution, an adaptation and/or selection of at least one transportation parameter of a mobile load is performed so as to at least partially fulfill the energy-power-range limitation (ΔE, ΔP) p, lim for each of the charging stations p or for a definable number of the charging stations p.1. A method for load balancing of charging stations for mobile loads within a charging stations network, the method comprising:
based on a prediction of a charging demand of the mobile loads, performing a distribution of an energy-power-range limitation (ΔE, ΔP)k, lim for each of the charging station p under consideration of a definable optimization parameter, wherein p=1, . . . , n and wherein n and p are integers, and under consideration of the distribution, performing at least one of an adaptation or a selection of at least one transportation parameter of at least one of the mobile loads so as to at least partially fulfill the energy-puwer-range limitation (ΔE, ΔP)p, lim for each of the charging stations p or for a definable number of the charging stations p. 2. The method according to claim 1, wherein the at least one of the adaptation or the selection of the at least one transportation parameter results in a modification of the prediction of the charging demand of at least one of the mobile loads. 3. The method according to claim 1, wherein the optimization parameter is defined so as to find a low cost distribution or a lowest cost distribution. 4. The method according to claim 1, wherein at least one of the mobile loads is transformed into at least one time tolerant and capacity tolerant mobile load. 5. The method according to claim 1, wherein the energy-power-range limitation (ΔE, ΔP)p, lim is equally distributed for each of the charging stations p. 6. The method according to claim 1, wherein the energy-power-range limitation (ΔE, ΔP)p, lim is distributed for each of the charging stations p under consideration of a factor in a form of at least one of a past balancing potential, economical strength within a network grid or a strategic location. 7. The method according to claim 1, wherein the prediction of the charging demand is performed depending on at least one transportation parameter. 8. The method according to claim 1, wherein the charging demand regarding energy and power to be provided to one of the mobile loads is a function of time and location. 9. The method according to claim 1, wherein the charging demand considers at least one of a route requirement, route requirements of different routes, a location, a direction, a time condition, a travel time, an estimated arrival time, ETA, a speed, a driving pattern, a current charging need, a predicted charging need, a charging time, a charging mode, a charging level or a battery level. 10. The method according to claim 1, wherein the at least one transportation parameter is at least one of a user preference, a route, a route guidance, a routing information, a distance, a direction, a charging time, a travel time, a speed, a waiting time or a break. 11. The method according to claim 1, wherein the at least one transportation parameter is received from an. intelligent transport system or service, ITS. 12. The method according to claim 1, wherein the method is performed in a reactive manner on or after cause of a load exceeding or having exceeded a definable threshold. 13. The method according to claim 1, wherein the method is performed dynamically. 14. The method according to claim 1, wherein, during the at least one of the adaptation or selection, at least one of a user preference, a traffic condition or a weather condition is considered. 15. The method according to claim 1, wherein, during the at least one of the adaptation or selection, an intelligent transport system or service, ITS, or data from the ITS is exploited. 16. The method according to claim 1, wherein the energy-power-range limitation (ΔE, ΔP)p, lim for each of the charging stations p is adapted under consideration of at least one of a user interaction/feedback, a user preference or a real-time traffic condition. 17. The method according to claim 1, wherein the at least one of the adaptation or the selection is performed by a de-centralized management scheme. 18. The method according to claim 1, wherein the at least one of the adaptation or the selection is performed by neighbored charging stations in a bi-lateral manner. 19. A charging stations network comprising:
means for load balancing of charging stations for mobile loads, means for distributing an energy-power-range limitation (ΔE, ΔP)k, lim for each of the charging stations p based on a prediction of a charging demand of the mobile loads and under consideration of a definable optimization parameter, wherein p=1, . . . , n and wherein n and p are integers, and means for at least one of adapting or selecting of at least one transportation parameter of at least one of the mobile loads under consideration of the distribution so as to at least partially fulfill the energy-power-range limitation (ΔE, ΔP)p, lim for each of the charging stations p or for a definable number of the charging stations p. 20. The charging stations network according to claim 19, wherein the balancing means, the distributing means or the adapting and/or selecting means comprises at least one of a communication system, route guidance or online route guidance, charging demand predictor, Energy Management System, EMS, of charging station or EMS control center. | 2,100 |
5,317 | 5,317 | 14,994,298 | 2,199 | The method includes modifying a routing rule of a load balancer of the system, the rule representing at least one parameter for communications between a client device and the first VM to specify that data from the client device destined for the first VM instance is queued, suspending processing, at the first VM instance, of pending requests from the client device, transmitting data, from the first VM instance, to the load balancer representing the state of the or each suspended request, modifying the routing rule to specify that the endpoint for a communication channel from the second VM instance is the client device, transmitting the or each suspended request to the second VM instance, and modifying the routing rule to specify transmission of data from the client device directly to the second VM instance. | 1. A method, in a virtualized system comprising multiple virtual machine (VM) instances executing over physical hardware, for migrating a data session from a first VM to a second VM, the method comprising:
modifying a routing rule of a load balancer of the system, the rule representing at least one parameter for communications between a client device and the first VM to specify that data from the client device destined for the first VM instance is queued; suspending processing, at the first VM instance, of pending requests from the client device; transmitting data, from the first VM instance, to the load balancer representing the state of the or each suspended request; modifying the routing rule to specify that the endpoint for a communication channel from the second VM instance is the client device; transmitting the or each suspended request to the second VM instance; and modifying the routing rule to specify transmission of data from the client device directly to the second VM instance. 2. A method as claimed in claim 1, wherein data relating to a suspended request is queued in a buffer device of the load balancer. 3. A method as claimed in claim 1, wherein the load balancer is a software defined networking element, and wherein modifying the routing rule includes updating a routing table to specify an IP or MAC address of a device or VM instance. 4. A method as claimed in claim 1, wherein the load balancer is inhibited from forwarding data from the client device to the first VM instance. 5. A method as claimed in claim 1, wherein a data session is migrated in response to scaling of the number of VM instances of the system due to a variation in system load. 6. A method as claimed in claim 1, wherein the load balancer maintains a table of inhibited sessions representing sessions to be migrated or being migrated, the load balancer operable to queue data from the client device relating to an inhibited session. 7. A method as claimed claim 6, wherein the table of inhibited sessions includes a queue for incoming packets that arrive while a session is inhibited. 8. A system comprising multiple virtual machine (VM) instances executing over physical hardware, the system including a network element operable to migrate a data session from a first VM to a second VM by:
modifying or receiving data representing a modified routing rule representing at least one parameter for communications between a client device and the first VM to specify that data from the client device destined for the first VM instance is queued; suspending processing, at the first VM instance, of pending requests from the client device; transmitting data, from the first VM instance, to the load balancer representing the state of the or each suspended request; modifying the routing rule to specify that the endpoint for a communication channel from the second VM instance is the client device; transmitting the or each suspended request to the second VM instance; and modifying the routing rule to specify transmission of data from the client device directly to the second VM instance. 9. A system as claimed in claim 8, wherein the network element includes a buffer operable to receive data to be queued from the client device. 10. A system as claimed in claim 8, wherein the system is operable to inhibit the network element from forwarding data from the client device to the first VM instance. 11. A system as claimed in claim 8, wherein the network element is operable to maintain a table of inhibited sessions representing sessions to be migrated or being migrated, the network element operable to queue data from the client device relating to an inhibited session. 12. A network element in a virtualized system comprising multiple virtual machine (VM) instances executing over physical hardware, the network element operable to migrate a data session from a first VM to a second VM, by:
modifying or receiving data representing a modified routing rule representing at least one parameter for communications between a client device and the first VM to specify that data from the client device destined for the first VM instance is queued; suspending processing, at the first VM instance, of pending requests from the client device; transmitting data, from the first VM instance, to the load balancer representing the state of the or each suspended request; modifying the routing rule to specify that the endpoint for a communication channel from the second VM instance is the client device; transmitting the or each suspended request to the second VM instance; and modifying the routing rule to specify transmission of data from the client device directly to the second VM instance. 13. A network element as claimed in claim 12, further including a buffer device operable to store data representing a pending request from the client device. 14. A network element as claimed in claim 12, further including a memory operable to store multiple routing rules including an IP or MAC address of a device or VM instance. 15. A computer program product, comprising a computer usable medium having computer readable program code embodied therein, said computer readable program code adapted to be executed to implement a method for migrating a data session as claimed in claim 1. | The method includes modifying a routing rule of a load balancer of the system, the rule representing at least one parameter for communications between a client device and the first VM to specify that data from the client device destined for the first VM instance is queued, suspending processing, at the first VM instance, of pending requests from the client device, transmitting data, from the first VM instance, to the load balancer representing the state of the or each suspended request, modifying the routing rule to specify that the endpoint for a communication channel from the second VM instance is the client device, transmitting the or each suspended request to the second VM instance, and modifying the routing rule to specify transmission of data from the client device directly to the second VM instance.1. A method, in a virtualized system comprising multiple virtual machine (VM) instances executing over physical hardware, for migrating a data session from a first VM to a second VM, the method comprising:
modifying a routing rule of a load balancer of the system, the rule representing at least one parameter for communications between a client device and the first VM to specify that data from the client device destined for the first VM instance is queued; suspending processing, at the first VM instance, of pending requests from the client device; transmitting data, from the first VM instance, to the load balancer representing the state of the or each suspended request; modifying the routing rule to specify that the endpoint for a communication channel from the second VM instance is the client device; transmitting the or each suspended request to the second VM instance; and modifying the routing rule to specify transmission of data from the client device directly to the second VM instance. 2. A method as claimed in claim 1, wherein data relating to a suspended request is queued in a buffer device of the load balancer. 3. A method as claimed in claim 1, wherein the load balancer is a software defined networking element, and wherein modifying the routing rule includes updating a routing table to specify an IP or MAC address of a device or VM instance. 4. A method as claimed in claim 1, wherein the load balancer is inhibited from forwarding data from the client device to the first VM instance. 5. A method as claimed in claim 1, wherein a data session is migrated in response to scaling of the number of VM instances of the system due to a variation in system load. 6. A method as claimed in claim 1, wherein the load balancer maintains a table of inhibited sessions representing sessions to be migrated or being migrated, the load balancer operable to queue data from the client device relating to an inhibited session. 7. A method as claimed claim 6, wherein the table of inhibited sessions includes a queue for incoming packets that arrive while a session is inhibited. 8. A system comprising multiple virtual machine (VM) instances executing over physical hardware, the system including a network element operable to migrate a data session from a first VM to a second VM by:
modifying or receiving data representing a modified routing rule representing at least one parameter for communications between a client device and the first VM to specify that data from the client device destined for the first VM instance is queued; suspending processing, at the first VM instance, of pending requests from the client device; transmitting data, from the first VM instance, to the load balancer representing the state of the or each suspended request; modifying the routing rule to specify that the endpoint for a communication channel from the second VM instance is the client device; transmitting the or each suspended request to the second VM instance; and modifying the routing rule to specify transmission of data from the client device directly to the second VM instance. 9. A system as claimed in claim 8, wherein the network element includes a buffer operable to receive data to be queued from the client device. 10. A system as claimed in claim 8, wherein the system is operable to inhibit the network element from forwarding data from the client device to the first VM instance. 11. A system as claimed in claim 8, wherein the network element is operable to maintain a table of inhibited sessions representing sessions to be migrated or being migrated, the network element operable to queue data from the client device relating to an inhibited session. 12. A network element in a virtualized system comprising multiple virtual machine (VM) instances executing over physical hardware, the network element operable to migrate a data session from a first VM to a second VM, by:
modifying or receiving data representing a modified routing rule representing at least one parameter for communications between a client device and the first VM to specify that data from the client device destined for the first VM instance is queued; suspending processing, at the first VM instance, of pending requests from the client device; transmitting data, from the first VM instance, to the load balancer representing the state of the or each suspended request; modifying the routing rule to specify that the endpoint for a communication channel from the second VM instance is the client device; transmitting the or each suspended request to the second VM instance; and modifying the routing rule to specify transmission of data from the client device directly to the second VM instance. 13. A network element as claimed in claim 12, further including a buffer device operable to store data representing a pending request from the client device. 14. A network element as claimed in claim 12, further including a memory operable to store multiple routing rules including an IP or MAC address of a device or VM instance. 15. A computer program product, comprising a computer usable medium having computer readable program code embodied therein, said computer readable program code adapted to be executed to implement a method for migrating a data session as claimed in claim 1. | 2,100 |
5,318 | 5,318 | 15,408,333 | 2,136 | Methods for read request bypassing a last level cache which interfaces with an external fabric are disclosed. A method includes identifying a read request for a read transaction, generating a phantom read transaction identifier for the read transaction and forwarding said read transaction with said phantom read transaction identifier beyond a last level cache before detection of a hit or miss with respect to said read transaction, and wherein said read transaction is canceled if said read transaction is a hit in said last level cache or does not access said last level cache. | 1. A method for read request bypassing a last level cache which interfaces with an external fabric, comprising:
accessing a read request for a read transaction; generating a phantom read transaction identifier for said read transaction; and forwarding said read transaction with said phantom read transaction identifier beyond a last level cache before detection of a hit or miss with respect to said read transaction, and wherein said read transaction is canceled if said read transaction is a hit in said last level cache or does not access said last level cache. 2. The method of claim 1, wherein said phantom read transaction identifier is converted to a pointer to a real read transaction identifier if said read transaction is a miss in said last level cache. 3. The method of claim 1 wherein said phantom read transaction identifier comprises a bit set to differentiate said phantom read transaction identifier from said read transaction identifier. 4. The method of claim 1 wherein for a 32 entry load queue said phantom read transaction identifier is associated with one bit of six bits. 5. The method of claim 1 wherein said phantom read transaction identifier is supplied from said last level cache. 6. The method of claim 1 wherein said phantom read transaction identifier acts as a pointer to said read transaction identifier. 7. The method of claim 1 wherein said read transaction identifier is a pointer to a read queue in said last level cache. 8. A cache controller, comprising:
an accessor for accessing a read request for a read transaction; a generator for generating a phantom read transaction identifier for said read transaction; and a forwarder for forwarding said read transaction with said phantom read transaction identifier beyond a last level cache before detection of a hit or miss with respect to said read transaction, and wherein said read transaction is canceled if said read transaction is a hit in said last level cache or does not access said last level cache. 9. The cache controller of claim 8 wherein said phantom read transaction identifier is converted to a pointer to a real read transaction identifier if said read transaction is a miss in said last level cache. 10. The cache controller of claim 8 wherein said phantom read transaction identifier comprises a bit set to differentiate said phantom read transaction identifier from said read transaction identifier. 11. The cache controller of claim 8 wherein for a 32 entry load queue said phantom read transaction identifier is one bit of six bits. 12. The cache controller of claim 8 wherein said phantom read transaction identifier is supplied from said last level cache. 13. The cache controller of claim 8 wherein said phantom read transaction identifier acts as a pointer to said read transaction identifier. 14. The cache controller of claim 8 wherein said read transaction identifier is a pointer to a read queue in said last level cache. 15. A processor, comprising:
a CPU; a cache system; and a cache controller, wherein said cache controller comprises: an accessor for accessing a read request for a read transaction; a generator for generating a phantom read transaction identifier for said read transaction; and a forwarder for forwarding said read transaction with said phantom read transaction identifier beyond a last level cache before detection of a hit or miss with respect to said read transaction, and wherein said read transaction is canceled if said read transaction is a hit in said last level cache or does not access said last level cache. 16. The processor of claim 15 wherein said phantom read transaction identifier is converted to a pointer to a real read transaction identifier if said read transaction is a miss in said last level cache. 17. The processor of claim 15 wherein said phantom read transaction identifier comprises a bit set to differentiate said phantom read transaction identifier from said read transaction identifier. 18. The processor of claim 15 wherein for a 32 entry load queue said phantom read transaction identifier is one bit of six bits. 19. The processor of claim 15 wherein said phantom read transaction identifier is supplied from said last level cache. 20. The processor of claim 15 wherein said phantom read transaction identifier acts as a pointer to said read transaction identifier. | Methods for read request bypassing a last level cache which interfaces with an external fabric are disclosed. A method includes identifying a read request for a read transaction, generating a phantom read transaction identifier for the read transaction and forwarding said read transaction with said phantom read transaction identifier beyond a last level cache before detection of a hit or miss with respect to said read transaction, and wherein said read transaction is canceled if said read transaction is a hit in said last level cache or does not access said last level cache.1. A method for read request bypassing a last level cache which interfaces with an external fabric, comprising:
accessing a read request for a read transaction; generating a phantom read transaction identifier for said read transaction; and forwarding said read transaction with said phantom read transaction identifier beyond a last level cache before detection of a hit or miss with respect to said read transaction, and wherein said read transaction is canceled if said read transaction is a hit in said last level cache or does not access said last level cache. 2. The method of claim 1, wherein said phantom read transaction identifier is converted to a pointer to a real read transaction identifier if said read transaction is a miss in said last level cache. 3. The method of claim 1 wherein said phantom read transaction identifier comprises a bit set to differentiate said phantom read transaction identifier from said read transaction identifier. 4. The method of claim 1 wherein for a 32 entry load queue said phantom read transaction identifier is associated with one bit of six bits. 5. The method of claim 1 wherein said phantom read transaction identifier is supplied from said last level cache. 6. The method of claim 1 wherein said phantom read transaction identifier acts as a pointer to said read transaction identifier. 7. The method of claim 1 wherein said read transaction identifier is a pointer to a read queue in said last level cache. 8. A cache controller, comprising:
an accessor for accessing a read request for a read transaction; a generator for generating a phantom read transaction identifier for said read transaction; and a forwarder for forwarding said read transaction with said phantom read transaction identifier beyond a last level cache before detection of a hit or miss with respect to said read transaction, and wherein said read transaction is canceled if said read transaction is a hit in said last level cache or does not access said last level cache. 9. The cache controller of claim 8 wherein said phantom read transaction identifier is converted to a pointer to a real read transaction identifier if said read transaction is a miss in said last level cache. 10. The cache controller of claim 8 wherein said phantom read transaction identifier comprises a bit set to differentiate said phantom read transaction identifier from said read transaction identifier. 11. The cache controller of claim 8 wherein for a 32 entry load queue said phantom read transaction identifier is one bit of six bits. 12. The cache controller of claim 8 wherein said phantom read transaction identifier is supplied from said last level cache. 13. The cache controller of claim 8 wherein said phantom read transaction identifier acts as a pointer to said read transaction identifier. 14. The cache controller of claim 8 wherein said read transaction identifier is a pointer to a read queue in said last level cache. 15. A processor, comprising:
a CPU; a cache system; and a cache controller, wherein said cache controller comprises: an accessor for accessing a read request for a read transaction; a generator for generating a phantom read transaction identifier for said read transaction; and a forwarder for forwarding said read transaction with said phantom read transaction identifier beyond a last level cache before detection of a hit or miss with respect to said read transaction, and wherein said read transaction is canceled if said read transaction is a hit in said last level cache or does not access said last level cache. 16. The processor of claim 15 wherein said phantom read transaction identifier is converted to a pointer to a real read transaction identifier if said read transaction is a miss in said last level cache. 17. The processor of claim 15 wherein said phantom read transaction identifier comprises a bit set to differentiate said phantom read transaction identifier from said read transaction identifier. 18. The processor of claim 15 wherein for a 32 entry load queue said phantom read transaction identifier is one bit of six bits. 19. The processor of claim 15 wherein said phantom read transaction identifier is supplied from said last level cache. 20. The processor of claim 15 wherein said phantom read transaction identifier acts as a pointer to said read transaction identifier. | 2,100 |
5,319 | 5,319 | 13,836,191 | 2,142 | A console includes a console surface, an interactive touch bar disposed within the console, the touch bar configured to move from a position recessed within the console surface to a position raised above the console surface and the touch bar being configured to receive user touch input, and a proximity sensor disposed on the console surface, the proximity sensor configured to detect a user gesture. The touch bar is configured to rise above the console surface when the proximity sensor detects the user gesture. The interactive surface comprising a capacitive surface zone configured to detect user touch input. The interactive touch surface is configured to receive sliding user input across the interactive touch surface to navigate through content options and is configured to receive pressing user input for selecting the content options. | 1. A touch bar, comprising:
an interactive touch surface, the interactive surface comprising a capacitive surface zone configured to detect user touch input for controlling a vehicle-mounted display screen, wherein the interactive touch surface is configured to receive sliding user input across the interactive touch surface to navigate through content options and is configured to receiving pressing user input for selecting the content options. 2. The touch bar according to claim 1, further comprising a plurality of inputs along the interactive touch surface. 3. The touch bar according to claim 1, wherein the interactive touch surface comprises a plurality of segments corresponding to the content options. 4. The touch bar according to claim 1, further comprising a sensor configured to detect a presence of a user input gesture. 5. A console, comprising:
a console surface; an interactive touch bar disposed within the console, the touch bar configured to move from a position recessed within the console surface to a position raised above the console surface and the touch bar being configured to receive user touch input; and a sensor disposed on the console surface, the sensor configured to detect a user gesture, wherein the touch bar is configured to rise above the console surface when the sensor detects the user gesture. 6. The console according to claim 5, wherein the touch bar comprises an interactive touch surface. 7. The console according to claim 6, wherein the interactive surface comprises a capacitive surface zone configured to detect user touch input. 8. The console according to claim 6, wherein the interactive touch surface is configured to receive sliding user input across the interactive touch surface to navigate through content options and user pressing input for selecting the content options. 9. The console according to claim 6, wherein the interactive touch surface is configured to receive sliding user input across the interactive touch surface to navigate through content options or user pressing input for selecting the content options. 10. The console according to claim 5, further comprising a plurality of inputs along the interactive touch surface. 11. The console according to claim 6, wherein the interactive touch surface comprises a plurality of capacitive surface zones configured to detect user touch input. 12. The console according to claim 5, wherein the sensor is disposed on the console surface. 13. The console according to claim 5, wherein the sensor is disposed on the touch bar. 14. The console according to claim 5, wherein the sensor comprises a proximity sensor. 15. A system, comprising:
a display screen; and a console, the console comprising:
a console surface;
an interactive touch bar disposed within the console, the touch bar configured to move from a position recessed within the console surface to a position raised above the console surface and the touch bar being configured to receive user touch input for controlling content on the display screen; and
a sensor disposed on the console surface, the sensor configured to detect a user gesture,
wherein the touch bar is configured to rise above the console surface when the sensor detects the user gesture. 16. The system according to claim 15, wherein, when the touch bar is recessed, a top surface of the touch bar is flush with the console surface. 17. The system according to claim 15, wherein, when the touch bar is recessed, an entirety of the touch bar is concealed from view. 18. The system according to claim 15, wherein the touch bar comprises an interactive touch surface. 19. The system according to claim 18, wherein the interactive surface comprises a plurality of capacitive surface zones configured to detect user touch input. 20. The system according to claim 19, wherein each capacitive surface zone corresponds to an icon displayed on the display screen. | A console includes a console surface, an interactive touch bar disposed within the console, the touch bar configured to move from a position recessed within the console surface to a position raised above the console surface and the touch bar being configured to receive user touch input, and a proximity sensor disposed on the console surface, the proximity sensor configured to detect a user gesture. The touch bar is configured to rise above the console surface when the proximity sensor detects the user gesture. The interactive surface comprising a capacitive surface zone configured to detect user touch input. The interactive touch surface is configured to receive sliding user input across the interactive touch surface to navigate through content options and is configured to receive pressing user input for selecting the content options.1. A touch bar, comprising:
an interactive touch surface, the interactive surface comprising a capacitive surface zone configured to detect user touch input for controlling a vehicle-mounted display screen, wherein the interactive touch surface is configured to receive sliding user input across the interactive touch surface to navigate through content options and is configured to receiving pressing user input for selecting the content options. 2. The touch bar according to claim 1, further comprising a plurality of inputs along the interactive touch surface. 3. The touch bar according to claim 1, wherein the interactive touch surface comprises a plurality of segments corresponding to the content options. 4. The touch bar according to claim 1, further comprising a sensor configured to detect a presence of a user input gesture. 5. A console, comprising:
a console surface; an interactive touch bar disposed within the console, the touch bar configured to move from a position recessed within the console surface to a position raised above the console surface and the touch bar being configured to receive user touch input; and a sensor disposed on the console surface, the sensor configured to detect a user gesture, wherein the touch bar is configured to rise above the console surface when the sensor detects the user gesture. 6. The console according to claim 5, wherein the touch bar comprises an interactive touch surface. 7. The console according to claim 6, wherein the interactive surface comprises a capacitive surface zone configured to detect user touch input. 8. The console according to claim 6, wherein the interactive touch surface is configured to receive sliding user input across the interactive touch surface to navigate through content options and user pressing input for selecting the content options. 9. The console according to claim 6, wherein the interactive touch surface is configured to receive sliding user input across the interactive touch surface to navigate through content options or user pressing input for selecting the content options. 10. The console according to claim 5, further comprising a plurality of inputs along the interactive touch surface. 11. The console according to claim 6, wherein the interactive touch surface comprises a plurality of capacitive surface zones configured to detect user touch input. 12. The console according to claim 5, wherein the sensor is disposed on the console surface. 13. The console according to claim 5, wherein the sensor is disposed on the touch bar. 14. The console according to claim 5, wherein the sensor comprises a proximity sensor. 15. A system, comprising:
a display screen; and a console, the console comprising:
a console surface;
an interactive touch bar disposed within the console, the touch bar configured to move from a position recessed within the console surface to a position raised above the console surface and the touch bar being configured to receive user touch input for controlling content on the display screen; and
a sensor disposed on the console surface, the sensor configured to detect a user gesture,
wherein the touch bar is configured to rise above the console surface when the sensor detects the user gesture. 16. The system according to claim 15, wherein, when the touch bar is recessed, a top surface of the touch bar is flush with the console surface. 17. The system according to claim 15, wherein, when the touch bar is recessed, an entirety of the touch bar is concealed from view. 18. The system according to claim 15, wherein the touch bar comprises an interactive touch surface. 19. The system according to claim 18, wherein the interactive surface comprises a plurality of capacitive surface zones configured to detect user touch input. 20. The system according to claim 19, wherein each capacitive surface zone corresponds to an icon displayed on the display screen. | 2,100 |
5,320 | 5,320 | 14,830,471 | 2,118 | A method of operating a hydrocarbon extraction field with the aid of a computer includes programming the computer with a virtual flow meter model. The model may be written with a notation that represents at least one of mass flow, temperature and pressure at extremities of a plurality of pressure loss elements (PLEs). The PLEs may include a plurality of wells located in the hydrocarbon extraction field. The method may further include the computer estimating, with use of the model, respective mass flow rates from a plurality of the wells. The method may further include controlling elements of the hydrocarbon extraction field based at least in part on the estimated mass flow rates. | 1. A method of operating a hydrocarbon extraction field with the aid of a computer, the method comprising:
programming the computer with a virtual flow meter model, said model written with a notation that represents at least one of mass flow, temperature and pressure at extremities of a plurality of pressure loss elements (PLEs), said PLEs including a plurality of wells located in said hydrocarbon extraction field; estimating, by said computer, using said model, respective mass flow rates from a plurality of said wells; and controlling elements of the hydrocarbon extraction field based at least in part on said estimated mass flow rates. 2. The method of claim 1, further comprising:
receiving sensor data from sensors installed in association with said PLEs; and providing the sensor data to the computer as a basis for said estimating. 3. The method of claim 2, wherein said estimating includes solving an optimization problem for minimizing a difference between said sensor data and expected values of said sensor data. 4. The method of claim 3, wherein said optimization problem is stated as a deterministic optimization problem. 5. The method of claim 3, wherein said optimization problem is written as:
m
*
=
argmin
{
m
j
(
i
)
}
,
j
∈
W
∑
i
=
k
-
H
k
z
(
i
)
-
z
^
(
i
)
2
,
where m* is a vector of mass flow rates, W is a set of said wells, z is a vector of sensor data and {circumflex over (z)} is a vector of expected values of said sensor data. 6. The method of claim 3, wherein said optimization problem is stated as a probabilistic optimization problem. 7. The method of claim 1, wherein said hydrocarbon extraction field is an undersea field. 8. The method of claim 1, wherein said controlled elements include at least one of: (a) an effluent injection element; and (b) a valve. 9. The method of claim 8, wherein said controlled elements include a plurality of valves. 10. The method of claim 1, wherein each of said wells is represented in said model as a PLE having only one respective extremity, said only one respective extremity being a respective outlet. 11. The method of claim 1, wherein the model is in a form of a directed graph that is formed of edges and nodes that represent said PLEs. 12. The method of claim 11, wherein each of said nodes is subject to at least a constraint that, at a given time, the total of mass flow at inlets of said each node is equal to a total of mass flow at outlets of said node. 13. The method of claim 12, wherein some of said nodes are junction points, said junction points subject to at least one additional constraint that, for each junction point, at a given time, respective pressure values are equal at all extremities of said each junction point. 14. A method of operating a hydrocarbon extraction field with the aid of a computer, the method comprising:
programming the computer with a virtual flow meter model, said model at least partially in the form of equations that represent a directed graph, said directed graph formed of edges and nodes, each of said edges and nodes representative of a respective pressure loss element (PLE) that is part of an equipment installation in said hydrocarbon extraction field, a plurality of said PLEs each representing a respective well located in said hydrocarbon extraction field; estimating, by said computer, using said model, respective mass flow rates from a plurality of said wells; and controlling elements of said equipment installation based at least in part on said estimated mass flow rates. 15. The method of claim 14, further comprising:
receiving sensor data from sensors installed in association with said PLEs; and providing the sensor data to the computer as a basis for said estimating. 16. The method of claim 15, wherein said estimating includes solving an optimization problem for minimizing a difference between said sensor data and expected values of said sensor data. 17. The method of claim 14, wherein said controlled elements include at least one of: (a) an effluent injection element; and (b) a valve. 18. A method of operating a hydrocarbon extraction field with the aid of a computer, the method comprising:
programming the computer with a virtual flow meter model, said model at least partially in the form of equations that represent a directed graph, said directed graph formed of edges and nodes, each of said edges and nodes representative of a respective pressure loss element (PLE) that is part of an equipment installation in said hydrocarbon extraction field, a plurality of said PLEs each being a respective well located in said hydrocarbon extraction field, some but not all of said PLEs each having at least one sensor installed in association with said each PLE, said model written with a notation that represents at least one of mass flow, temperature and pressure at extremities of said PLEs that are represented by said nodes and edges of the directed graph, said model including a plurality of constraint equations, said PLEs including at least one valve, at least one pipe and at least one junction, said sensors for providing data indicative of at least one of pressure, temperature and mass flow at each of some but not all of said extremities of said PLEs; receiving, by said computer, said data from said sensors; estimating, by said computer, using said model, based at least in part on said received data, respective mass flow rates from a plurality of said wells; and controlling elements of the hydrocarbon extraction field based at least in part on said estimated mass flow rates. 19. The method of claim 18, wherein the plurality of constraint equations include a mass flow constraint equation. 20. The method of claim 19, wherein said estimating includes solving an estimation problem for minimizing a difference between said received data and expected values of said data. | A method of operating a hydrocarbon extraction field with the aid of a computer includes programming the computer with a virtual flow meter model. The model may be written with a notation that represents at least one of mass flow, temperature and pressure at extremities of a plurality of pressure loss elements (PLEs). The PLEs may include a plurality of wells located in the hydrocarbon extraction field. The method may further include the computer estimating, with use of the model, respective mass flow rates from a plurality of the wells. The method may further include controlling elements of the hydrocarbon extraction field based at least in part on the estimated mass flow rates.1. A method of operating a hydrocarbon extraction field with the aid of a computer, the method comprising:
programming the computer with a virtual flow meter model, said model written with a notation that represents at least one of mass flow, temperature and pressure at extremities of a plurality of pressure loss elements (PLEs), said PLEs including a plurality of wells located in said hydrocarbon extraction field; estimating, by said computer, using said model, respective mass flow rates from a plurality of said wells; and controlling elements of the hydrocarbon extraction field based at least in part on said estimated mass flow rates. 2. The method of claim 1, further comprising:
receiving sensor data from sensors installed in association with said PLEs; and providing the sensor data to the computer as a basis for said estimating. 3. The method of claim 2, wherein said estimating includes solving an optimization problem for minimizing a difference between said sensor data and expected values of said sensor data. 4. The method of claim 3, wherein said optimization problem is stated as a deterministic optimization problem. 5. The method of claim 3, wherein said optimization problem is written as:
m
*
=
argmin
{
m
j
(
i
)
}
,
j
∈
W
∑
i
=
k
-
H
k
z
(
i
)
-
z
^
(
i
)
2
,
where m* is a vector of mass flow rates, W is a set of said wells, z is a vector of sensor data and {circumflex over (z)} is a vector of expected values of said sensor data. 6. The method of claim 3, wherein said optimization problem is stated as a probabilistic optimization problem. 7. The method of claim 1, wherein said hydrocarbon extraction field is an undersea field. 8. The method of claim 1, wherein said controlled elements include at least one of: (a) an effluent injection element; and (b) a valve. 9. The method of claim 8, wherein said controlled elements include a plurality of valves. 10. The method of claim 1, wherein each of said wells is represented in said model as a PLE having only one respective extremity, said only one respective extremity being a respective outlet. 11. The method of claim 1, wherein the model is in a form of a directed graph that is formed of edges and nodes that represent said PLEs. 12. The method of claim 11, wherein each of said nodes is subject to at least a constraint that, at a given time, the total of mass flow at inlets of said each node is equal to a total of mass flow at outlets of said node. 13. The method of claim 12, wherein some of said nodes are junction points, said junction points subject to at least one additional constraint that, for each junction point, at a given time, respective pressure values are equal at all extremities of said each junction point. 14. A method of operating a hydrocarbon extraction field with the aid of a computer, the method comprising:
programming the computer with a virtual flow meter model, said model at least partially in the form of equations that represent a directed graph, said directed graph formed of edges and nodes, each of said edges and nodes representative of a respective pressure loss element (PLE) that is part of an equipment installation in said hydrocarbon extraction field, a plurality of said PLEs each representing a respective well located in said hydrocarbon extraction field; estimating, by said computer, using said model, respective mass flow rates from a plurality of said wells; and controlling elements of said equipment installation based at least in part on said estimated mass flow rates. 15. The method of claim 14, further comprising:
receiving sensor data from sensors installed in association with said PLEs; and providing the sensor data to the computer as a basis for said estimating. 16. The method of claim 15, wherein said estimating includes solving an optimization problem for minimizing a difference between said sensor data and expected values of said sensor data. 17. The method of claim 14, wherein said controlled elements include at least one of: (a) an effluent injection element; and (b) a valve. 18. A method of operating a hydrocarbon extraction field with the aid of a computer, the method comprising:
programming the computer with a virtual flow meter model, said model at least partially in the form of equations that represent a directed graph, said directed graph formed of edges and nodes, each of said edges and nodes representative of a respective pressure loss element (PLE) that is part of an equipment installation in said hydrocarbon extraction field, a plurality of said PLEs each being a respective well located in said hydrocarbon extraction field, some but not all of said PLEs each having at least one sensor installed in association with said each PLE, said model written with a notation that represents at least one of mass flow, temperature and pressure at extremities of said PLEs that are represented by said nodes and edges of the directed graph, said model including a plurality of constraint equations, said PLEs including at least one valve, at least one pipe and at least one junction, said sensors for providing data indicative of at least one of pressure, temperature and mass flow at each of some but not all of said extremities of said PLEs; receiving, by said computer, said data from said sensors; estimating, by said computer, using said model, based at least in part on said received data, respective mass flow rates from a plurality of said wells; and controlling elements of the hydrocarbon extraction field based at least in part on said estimated mass flow rates. 19. The method of claim 18, wherein the plurality of constraint equations include a mass flow constraint equation. 20. The method of claim 19, wherein said estimating includes solving an estimation problem for minimizing a difference between said received data and expected values of said data. | 2,100 |
5,321 | 5,321 | 14,719,246 | 2,166 | Systems and methods are provided for ranking and querying statistical analysis results of database contents for the purpose of populating search engine query results with novel content. | 1. An engine for ranking and querying statistical analysis results of database contents for the purpose of populating search engine query results with novel content, comprising:
a scalar data field for each record; a categorization of each record or a network of relationships among records; natural language that describes the scalar in 1a and the categories or records in 1 b; a statistical test for each record in 1 b, category of records in 1 b, or vertex of records in the network in 1 b; a rank of statistical test results in Id, possibly weighted by strength of effect, category size, or sub-network size; a ranking of test results across multiple analyses of data in 1a-e in which results are statistical test computations in Id normalized by rank in 1 e; and a final ranking of findings consisting of the rank of the record, category, or network finding in if, adjusted for query term hits on the natural language in 1 c, and serving as a relevance score. 2. The system described in claim 1, wherein the statistical test is the Coincident Extreme Ranks in Numerical Observations (CERNO) test, the Wilcoxon Sum Rank (or Mann-Whitney U) test, the Komogorov-Smirnov test, a gene set enrichment analysis test, or other population comparison test. 3. The system in claim 1, wherein the scalar summarizes changed, increased, or decreased gene expression represented as a paired-test p-value, between-groups p-value, ratio, T-statistic, proportional hazards p-value, time-course statistic, linear model statistic, including mixed effects models, principal components analysis or independent components analysis weightings or machine learning summary statistics, or other statistic. 4. The system in claim 3, wherein the scalar summarizes changed, increased, or decreased proteins or protein expression represented by statistics. 5. The system in claim 1, wherein scalar summarizes association of single nucleotide polymorphisms (SNPs) with population samples, as in genome-wide association studies (GWAS), or in occurrence of SNPs in disease or other phenotype affected families. 6. The system in claim 1, where scalar is used to study genes, gene transcripts, or proteins occurring in disease or other phenotypes. | Systems and methods are provided for ranking and querying statistical analysis results of database contents for the purpose of populating search engine query results with novel content.1. An engine for ranking and querying statistical analysis results of database contents for the purpose of populating search engine query results with novel content, comprising:
a scalar data field for each record; a categorization of each record or a network of relationships among records; natural language that describes the scalar in 1a and the categories or records in 1 b; a statistical test for each record in 1 b, category of records in 1 b, or vertex of records in the network in 1 b; a rank of statistical test results in Id, possibly weighted by strength of effect, category size, or sub-network size; a ranking of test results across multiple analyses of data in 1a-e in which results are statistical test computations in Id normalized by rank in 1 e; and a final ranking of findings consisting of the rank of the record, category, or network finding in if, adjusted for query term hits on the natural language in 1 c, and serving as a relevance score. 2. The system described in claim 1, wherein the statistical test is the Coincident Extreme Ranks in Numerical Observations (CERNO) test, the Wilcoxon Sum Rank (or Mann-Whitney U) test, the Komogorov-Smirnov test, a gene set enrichment analysis test, or other population comparison test. 3. The system in claim 1, wherein the scalar summarizes changed, increased, or decreased gene expression represented as a paired-test p-value, between-groups p-value, ratio, T-statistic, proportional hazards p-value, time-course statistic, linear model statistic, including mixed effects models, principal components analysis or independent components analysis weightings or machine learning summary statistics, or other statistic. 4. The system in claim 3, wherein the scalar summarizes changed, increased, or decreased proteins or protein expression represented by statistics. 5. The system in claim 1, wherein scalar summarizes association of single nucleotide polymorphisms (SNPs) with population samples, as in genome-wide association studies (GWAS), or in occurrence of SNPs in disease or other phenotype affected families. 6. The system in claim 1, where scalar is used to study genes, gene transcripts, or proteins occurring in disease or other phenotypes. | 2,100 |
5,322 | 5,322 | 13,335,648 | 2,194 | An unsupported event module may install one or more event handlers in an application, wherein the one or more event handlers are configured to catch user interface events not otherwise handled by the application. During execution of the application, one or more unsupported event handlers may record user interface events not otherwise handled by the application. The method further includes storing or transmitting one or more records of the user interface events recorded by the one or more unsupported event handlers. Other embodiments may include receiving, from a plurality of remote computing devices, records of user interface events. The recorded user interface events from a plurality of computers implementing instances of an application may be aggregated to generate a report indicting the number of user interface events not otherwise handled for the application. | 1. A method, comprising:
performing, by one or more computing devices: installing one or more unsupported event handlers in an application, the application operable to receive user interface events; and during execution of the application, by the one or more event handlers:
identifying unsupported user interface events received by the application by determining which received user interface events the application is not configured to handle,
recording one or more records of the unsupported user interface events received by the application, and
storing or transmitting the one or more records of the unsupported user interface events received by the application. 2. The method of claim 1, wherein the application does not respond to the user interface events recorded by the one or more unsupported event handlers. 3. The method of claim 1, wherein said installing the one or more unsupported event handlers comprises installing a plug-in to the application. 4. The method of claim 1, wherein said recording comprises:
recording an event type for each of the unsupported user interface events; and recording an event context for each of the unsupported user interface events. 5. The method of claim 4, wherein the event context comprises one or more screen coordinates of the unsupported user interface event, window coordinates of the unsupported user interface event, page coordinates of the unsupported user interface event, user interface view for the unsupported user interface event, or user interface element for the unsupported user interface event. 6. The method of claim 1, further comprising recording, during execution of the application, usage metrics data for the application, wherein the usage metrics data comprise one or more of visitor or user identifier, page views, visits, or time spent on view. 7. The method of claim 1, wherein the unsupported user interface events comprise one or more of: touch screen event, mouse click event, keyboard event, device movement event, or voice command event. 8. The method of claim 1, wherein said storing or transmitting one or more records comprises transmitting the one or more records to a collection server. 9. The method of claim 1, wherein the application comprises an event handling system in which events are propagated through an event handling hierarchy such that user interface events not handled at one level of the hierarchy are passed to a next level, wherein said installing the one or more unsupported event handlers comprises installing the one or more unsupported event handlers at an end of the hierarchy so that user interface events the application is not configured to handle are recorded by the one or more unsupported event handlers. 10. A method, comprising:
performing, by one or more computing devices: receiving, from a plurality of remote computing devices, user interface event records of user interface events recorded during use of respective instances of an application on the plurality of remote computing devices, wherein the recorded user interface events are user interface events the application is not configured to handle aggregating the user interface event records for the application; and generating a report, based on the aggregated user interface event records for the application. 11. The method of claim 10, further comprising receiving usage metric data, from the plurality of remote computing devices, for the respective instances of the application on the plurality of remote computing devices. 12. The method of claim 11, wherein the usage metrics data comprises visitor identifiers or user identifiers for each remote computing device or instance of the application. 13. The method of claim 12, wherein said generating a report comprises determining a number of unsupported user interface action attempts per user or visitor. 14. The method of claim 13, wherein said determining a number of unsupported user interface action attempts per user or visitor is performed for each of a plurality of user interface events, wherein said generating a report comprises generating a ranked list or table of the plurality of user interface action attempts not supported by the application ranked according to a percentage of unsupported action attempts per user or visitor. 15. The method of claim 10, wherein the user interface events the application is not configured to handle comprise one or more of: touch screen event, mouse click event, keyboard event, device movement event, or voice command event. 16. A system, comprising:
a processor; and a memory storing an unsupported events module executable by the processor to:
install one or more unsupported event handlers in an application, the application operable to receive user interface events;
during execution of the application, by the one or more unsupported event handlers:
identify unsupported user interface events received by the application by determining which received user interface events the application is not configured to handle,
record one or more records of the unsupported user interface events received by the application, and
store or transmit the one or more records of the unsupported user interface events received by the application. 17. The system of claim 16, wherein the unsupported user interface events comprise one or more of: touch screen event, mouse click event, keyboard event, device movement event, or voice command event. 18. The system of claim 16, wherein the application does not respond to the user interface events recorded by the one or more unsupported event handlers. 19. The system of claim 16, wherein the unsupported events module is a plug-in to the application. 20. The system of claim 16, wherein said record comprises:
record an event type for each of the unsupported user interface events; and record an event context for each of the unsupported user interface events. 21. The system of claim 20, wherein the event context comprises one or more of a screen coordinates of the unsupported user interface event, window coordinates of the unsupported user interface event, page coordinates of the unsupported user interface event, user interface view for the unsupported user interface event, or user interface element for the unsupported user interface event. 22. The system of claim 16, wherein said store or transmit one or more records comprises transmit the one or more records to a collection server. 23. The system of claim 16, wherein the application comprises an event handling system in which events are propagated through an event handling hierarchy such that user interface events not handled at one level of the hierarchy are passed to a next level, wherein said install the one or more unsupported event handlers comprises install the one or more unsupported event handlers at an end of the hierarchy so that user interface events the application is not configured to handle are recorded by the one or more unsupported event handlers. 24. A non-transitory computer readable storage medium storing computer-executable program instructions that when executed by a computer are configured to cause:
installing one or more unsupported event handlers in an application, wherein the one or more unsupported event handlers are configured to only receive user interface events not handled by the application; during execution of the application, recording, by the one or more unsupported event handlers, user interface events not handled by the application; and storing or transmitting one or more records of the user interface events recorded by the one or more unsupported event handlers. 25. The medium of claim 24, wherein the application does not respond to the user interface events recorded by the one or more event handlers. 26. The medium of claim 24, wherein said installing the one or more event handlers comprises installing a plug-in to the application. 27. The medium of claim 24, wherein said recording comprises:
recording an event type for each of the user interface events not handled by the application; and recording an event context for each of the user interface events not handled by the application. 28. The medium of claim 24, wherein the event context comprises one or more of a screen coordinates of the user interface event, window coordinates of the user interface event, page coordinates of the user interface event, user interface view for the user interface event, or user interface element for the user interface event. 29. The medium of claim 24, further comprising recording, during execution of the application, usage metrics data for the application, wherein the usage metrics data comprise one or more of visitor or user identifier, page views, visits, or time spent on view. 30. The medium of claim 24, wherein the user interface events not handled by the application comprise one or more of: touch screen event, mouse click event, keyboard event, device movement event, or voice command event. 31. The medium of claim 24, wherein said storing or transmitting one or more records comprises transmitting the one or more records to a collection server. 32. The medium of claim 24, wherein the application comprises an event handling system in which events are propagated through an event handling hierarchy such that user interface events not handled at one level of the hierarchy are passed to a next level, wherein said installing the one or more unsupported event handlers comprises installing the one or more unsupported event handlers at an end of the hierarchy so that user interface events not handled by the application are recorded by the one or more unsupported event handlers. | An unsupported event module may install one or more event handlers in an application, wherein the one or more event handlers are configured to catch user interface events not otherwise handled by the application. During execution of the application, one or more unsupported event handlers may record user interface events not otherwise handled by the application. The method further includes storing or transmitting one or more records of the user interface events recorded by the one or more unsupported event handlers. Other embodiments may include receiving, from a plurality of remote computing devices, records of user interface events. The recorded user interface events from a plurality of computers implementing instances of an application may be aggregated to generate a report indicting the number of user interface events not otherwise handled for the application.1. A method, comprising:
performing, by one or more computing devices: installing one or more unsupported event handlers in an application, the application operable to receive user interface events; and during execution of the application, by the one or more event handlers:
identifying unsupported user interface events received by the application by determining which received user interface events the application is not configured to handle,
recording one or more records of the unsupported user interface events received by the application, and
storing or transmitting the one or more records of the unsupported user interface events received by the application. 2. The method of claim 1, wherein the application does not respond to the user interface events recorded by the one or more unsupported event handlers. 3. The method of claim 1, wherein said installing the one or more unsupported event handlers comprises installing a plug-in to the application. 4. The method of claim 1, wherein said recording comprises:
recording an event type for each of the unsupported user interface events; and recording an event context for each of the unsupported user interface events. 5. The method of claim 4, wherein the event context comprises one or more screen coordinates of the unsupported user interface event, window coordinates of the unsupported user interface event, page coordinates of the unsupported user interface event, user interface view for the unsupported user interface event, or user interface element for the unsupported user interface event. 6. The method of claim 1, further comprising recording, during execution of the application, usage metrics data for the application, wherein the usage metrics data comprise one or more of visitor or user identifier, page views, visits, or time spent on view. 7. The method of claim 1, wherein the unsupported user interface events comprise one or more of: touch screen event, mouse click event, keyboard event, device movement event, or voice command event. 8. The method of claim 1, wherein said storing or transmitting one or more records comprises transmitting the one or more records to a collection server. 9. The method of claim 1, wherein the application comprises an event handling system in which events are propagated through an event handling hierarchy such that user interface events not handled at one level of the hierarchy are passed to a next level, wherein said installing the one or more unsupported event handlers comprises installing the one or more unsupported event handlers at an end of the hierarchy so that user interface events the application is not configured to handle are recorded by the one or more unsupported event handlers. 10. A method, comprising:
performing, by one or more computing devices: receiving, from a plurality of remote computing devices, user interface event records of user interface events recorded during use of respective instances of an application on the plurality of remote computing devices, wherein the recorded user interface events are user interface events the application is not configured to handle aggregating the user interface event records for the application; and generating a report, based on the aggregated user interface event records for the application. 11. The method of claim 10, further comprising receiving usage metric data, from the plurality of remote computing devices, for the respective instances of the application on the plurality of remote computing devices. 12. The method of claim 11, wherein the usage metrics data comprises visitor identifiers or user identifiers for each remote computing device or instance of the application. 13. The method of claim 12, wherein said generating a report comprises determining a number of unsupported user interface action attempts per user or visitor. 14. The method of claim 13, wherein said determining a number of unsupported user interface action attempts per user or visitor is performed for each of a plurality of user interface events, wherein said generating a report comprises generating a ranked list or table of the plurality of user interface action attempts not supported by the application ranked according to a percentage of unsupported action attempts per user or visitor. 15. The method of claim 10, wherein the user interface events the application is not configured to handle comprise one or more of: touch screen event, mouse click event, keyboard event, device movement event, or voice command event. 16. A system, comprising:
a processor; and a memory storing an unsupported events module executable by the processor to:
install one or more unsupported event handlers in an application, the application operable to receive user interface events;
during execution of the application, by the one or more unsupported event handlers:
identify unsupported user interface events received by the application by determining which received user interface events the application is not configured to handle,
record one or more records of the unsupported user interface events received by the application, and
store or transmit the one or more records of the unsupported user interface events received by the application. 17. The system of claim 16, wherein the unsupported user interface events comprise one or more of: touch screen event, mouse click event, keyboard event, device movement event, or voice command event. 18. The system of claim 16, wherein the application does not respond to the user interface events recorded by the one or more unsupported event handlers. 19. The system of claim 16, wherein the unsupported events module is a plug-in to the application. 20. The system of claim 16, wherein said record comprises:
record an event type for each of the unsupported user interface events; and record an event context for each of the unsupported user interface events. 21. The system of claim 20, wherein the event context comprises one or more of a screen coordinates of the unsupported user interface event, window coordinates of the unsupported user interface event, page coordinates of the unsupported user interface event, user interface view for the unsupported user interface event, or user interface element for the unsupported user interface event. 22. The system of claim 16, wherein said store or transmit one or more records comprises transmit the one or more records to a collection server. 23. The system of claim 16, wherein the application comprises an event handling system in which events are propagated through an event handling hierarchy such that user interface events not handled at one level of the hierarchy are passed to a next level, wherein said install the one or more unsupported event handlers comprises install the one or more unsupported event handlers at an end of the hierarchy so that user interface events the application is not configured to handle are recorded by the one or more unsupported event handlers. 24. A non-transitory computer readable storage medium storing computer-executable program instructions that when executed by a computer are configured to cause:
installing one or more unsupported event handlers in an application, wherein the one or more unsupported event handlers are configured to only receive user interface events not handled by the application; during execution of the application, recording, by the one or more unsupported event handlers, user interface events not handled by the application; and storing or transmitting one or more records of the user interface events recorded by the one or more unsupported event handlers. 25. The medium of claim 24, wherein the application does not respond to the user interface events recorded by the one or more event handlers. 26. The medium of claim 24, wherein said installing the one or more event handlers comprises installing a plug-in to the application. 27. The medium of claim 24, wherein said recording comprises:
recording an event type for each of the user interface events not handled by the application; and recording an event context for each of the user interface events not handled by the application. 28. The medium of claim 24, wherein the event context comprises one or more of a screen coordinates of the user interface event, window coordinates of the user interface event, page coordinates of the user interface event, user interface view for the user interface event, or user interface element for the user interface event. 29. The medium of claim 24, further comprising recording, during execution of the application, usage metrics data for the application, wherein the usage metrics data comprise one or more of visitor or user identifier, page views, visits, or time spent on view. 30. The medium of claim 24, wherein the user interface events not handled by the application comprise one or more of: touch screen event, mouse click event, keyboard event, device movement event, or voice command event. 31. The medium of claim 24, wherein said storing or transmitting one or more records comprises transmitting the one or more records to a collection server. 32. The medium of claim 24, wherein the application comprises an event handling system in which events are propagated through an event handling hierarchy such that user interface events not handled at one level of the hierarchy are passed to a next level, wherein said installing the one or more unsupported event handlers comprises installing the one or more unsupported event handlers at an end of the hierarchy so that user interface events not handled by the application are recorded by the one or more unsupported event handlers. | 2,100 |
5,323 | 5,323 | 13,862,481 | 2,179 | A deferred placement prompt is provided in a user interface when an application window is launched. Responsive to the presentation of the deferred placement prompt, the user can provide a directional placement instruction (e.g., a “drag” of the prompt, a selection of a screen region, a keyboard input) to indicate the user's preference for placement of the launched window. The user interface can give cooperative feedback to the user during the deferred placement prompt operation, such as highlighting an application window to be replaced, responsive to a directional placement instruction, animating the deferred placement prompt, etc. | 1. A method comprising:
presenting a deferred placement prompt in a user interface, the deferred placement prompt being associated with presentation of an application window into the user interface; receiving a directional placement instruction associated with the deferred placement prompt; and presenting the application window in the user interface based on the directional placement instruction. 2. The method of claim 1 further comprising:
displaying the application window in the user interface in place of another application window indicated by the deferred placement instruction. 3. The method of claim 1 further comprising:
receiving selection of a launch control associated with the application window, prior to presenting the deferred placement prompt. 4. The method of claim 1, wherein the operation of presenting the deferred placement prompt comprises:
presenting the deferred presentation prompt as a notification from an application not concurrently visible in an application window of the user interface. 5. The method of claim 1, further comprising:
receiving a selection of a notification from an application not concurrently visible in an application window of the user interface, prior to presenting the deferred placement prompt. 6. The method of claim 1, wherein the directional placement instruction includes a drag of the deferred placement prompt. 7. The method of claim 1, wherein the directional placement instruction includes keyboard input associated with the deferred placement prompt. 8. The method of claim 1, wherein the directional placement instruction includes at least one of selection of another application window to be replaced by the application window associated with the deferred placement prompt or selection of a portion of the deferred placement prompt overlaying another application window to be replaced by the application window associated with the deferred placement prompt. 9. One or more tangible computer-readable storage media encoding computer-executable instructions for executing on a computer system a computer process, the computer process comprising:
presenting a deferred placement prompt in a user interface, the deferred placement prompt being associated with presentation of an application window into the user interface; receiving a directional placement instruction associated with the deferred placement prompt; and presenting the application window in the user interface based on the directional placement instruction. 10. The one or more tangible computer-readable storage media of claim 9, wherein the computer process further comprises:
receiving selection of a launch control associated with the application window, prior to presenting the deferred placement prompt. 11. The one or more tangible computer-readable storage media of claim 9, wherein the operation of presenting the deferred placement prompt comprises:
presenting the deferred presentation prompt as a notification from an application not concurrently visible in an application window of the user interface. 12. The one or more tangible computer-readable storage media of claim 9, wherein the computer process further comprises:
receiving a selection of a notification from an application not concurrently visible in an application window of the user interface, prior to presenting the deferred placement prompt. 13. The one or more tangible computer-readable storage media of claim 9, wherein the directional placement instruction includes a drag of the deferred placement prompt. 14. The one or more tangible computer-readable storage media of claim 9, wherein the directional placement instruction includes selection of two other visible application windows between which the application window is inserted within the user interface. 15. The one or more tangible computer-readable storage media of claim 9, wherein the directional placement instruction includes selection of another application window to be replaced by the application window associated with the deferred placement prompt. 16. The one or more tangible computer-readable storage media of claim 9, wherein the directional placement instruction includes at least one of selection of another application window to be replaced by the application window associated with the deferred placement prompt or selection of a portion of the deferred placement prompt overlaying another application window to be replaced by the application window associated with the deferred placement prompt. 17. A system comprising:
a computing device presenting a user interface; a window management system configured to present a deferred placement prompt in the user interface, the deferred placement prompt being associated with presentation of an application window into the user interface and to present the application window in the user interface based on a directional placement instruction received in associated with the deferred placement prompt. 18. The system of claim 17, wherein the window management system is further configured to receive selection of a launch control associated with the application window, prior to presenting the deferred placement prompt. 19. The system of claim 17, wherein the directional placement instruction includes a drag of the deferred placement prompt. 20. The system of claim 17, wherein the window management system is configured to present the application window by displaying the application window in the user interface in place of another application window indicated by the deferred placement instruction. | A deferred placement prompt is provided in a user interface when an application window is launched. Responsive to the presentation of the deferred placement prompt, the user can provide a directional placement instruction (e.g., a “drag” of the prompt, a selection of a screen region, a keyboard input) to indicate the user's preference for placement of the launched window. The user interface can give cooperative feedback to the user during the deferred placement prompt operation, such as highlighting an application window to be replaced, responsive to a directional placement instruction, animating the deferred placement prompt, etc.1. A method comprising:
presenting a deferred placement prompt in a user interface, the deferred placement prompt being associated with presentation of an application window into the user interface; receiving a directional placement instruction associated with the deferred placement prompt; and presenting the application window in the user interface based on the directional placement instruction. 2. The method of claim 1 further comprising:
displaying the application window in the user interface in place of another application window indicated by the deferred placement instruction. 3. The method of claim 1 further comprising:
receiving selection of a launch control associated with the application window, prior to presenting the deferred placement prompt. 4. The method of claim 1, wherein the operation of presenting the deferred placement prompt comprises:
presenting the deferred presentation prompt as a notification from an application not concurrently visible in an application window of the user interface. 5. The method of claim 1, further comprising:
receiving a selection of a notification from an application not concurrently visible in an application window of the user interface, prior to presenting the deferred placement prompt. 6. The method of claim 1, wherein the directional placement instruction includes a drag of the deferred placement prompt. 7. The method of claim 1, wherein the directional placement instruction includes keyboard input associated with the deferred placement prompt. 8. The method of claim 1, wherein the directional placement instruction includes at least one of selection of another application window to be replaced by the application window associated with the deferred placement prompt or selection of a portion of the deferred placement prompt overlaying another application window to be replaced by the application window associated with the deferred placement prompt. 9. One or more tangible computer-readable storage media encoding computer-executable instructions for executing on a computer system a computer process, the computer process comprising:
presenting a deferred placement prompt in a user interface, the deferred placement prompt being associated with presentation of an application window into the user interface; receiving a directional placement instruction associated with the deferred placement prompt; and presenting the application window in the user interface based on the directional placement instruction. 10. The one or more tangible computer-readable storage media of claim 9, wherein the computer process further comprises:
receiving selection of a launch control associated with the application window, prior to presenting the deferred placement prompt. 11. The one or more tangible computer-readable storage media of claim 9, wherein the operation of presenting the deferred placement prompt comprises:
presenting the deferred presentation prompt as a notification from an application not concurrently visible in an application window of the user interface. 12. The one or more tangible computer-readable storage media of claim 9, wherein the computer process further comprises:
receiving a selection of a notification from an application not concurrently visible in an application window of the user interface, prior to presenting the deferred placement prompt. 13. The one or more tangible computer-readable storage media of claim 9, wherein the directional placement instruction includes a drag of the deferred placement prompt. 14. The one or more tangible computer-readable storage media of claim 9, wherein the directional placement instruction includes selection of two other visible application windows between which the application window is inserted within the user interface. 15. The one or more tangible computer-readable storage media of claim 9, wherein the directional placement instruction includes selection of another application window to be replaced by the application window associated with the deferred placement prompt. 16. The one or more tangible computer-readable storage media of claim 9, wherein the directional placement instruction includes at least one of selection of another application window to be replaced by the application window associated with the deferred placement prompt or selection of a portion of the deferred placement prompt overlaying another application window to be replaced by the application window associated with the deferred placement prompt. 17. A system comprising:
a computing device presenting a user interface; a window management system configured to present a deferred placement prompt in the user interface, the deferred placement prompt being associated with presentation of an application window into the user interface and to present the application window in the user interface based on a directional placement instruction received in associated with the deferred placement prompt. 18. The system of claim 17, wherein the window management system is further configured to receive selection of a launch control associated with the application window, prior to presenting the deferred placement prompt. 19. The system of claim 17, wherein the directional placement instruction includes a drag of the deferred placement prompt. 20. The system of claim 17, wherein the window management system is configured to present the application window by displaying the application window in the user interface in place of another application window indicated by the deferred placement instruction. | 2,100 |
5,324 | 5,324 | 14,506,112 | 2,192 | Systems and processes for prototyping and designing natively rendered multi-channel applications across diverse platforms are disclosed. The method of prototyping an application with a computing device includes providing a library of native design elements which are reproducible in different design layouts on an interface associated with different, predefined platforms. The method further includes converting a first design layout comprising one or more native design elements which fits within an interface associated with a first platform of the different, predefined platforms to a second design layout comprising the one or more native design elements which fits within an interface associated with a second platform of the different, predefined platforms, and which is in proportion to the first design layout. | 1. A method of prototyping an application with a computing device, comprising:
providing a library of native design elements which are reproducible in different design layouts on an interface associated with different, predefined platforms; and converting a first design layout comprising one or more native design elements which fits within an interface associated with a first platform of the different, predefined platforms to a second design layout comprising the one or more native design elements which fits within an interface associated with a second platform of the different, predefined platforms, and which is in proportion to the first design layout. 2. The method of claim 1, wherein the interface associated with the different, predefined platforms is a canvas representing a virtual interface. 3. The method of claim 1, wherein the first platform and the second platform are different computing devices. 4. The method of claim 1, wherein the first design layout and the second design layout are fully functional prototype applications for different platforms. 5. The method of claim 4, wherein the first platform is representative of at least one of a first operating system and a first device and the second platform is representative of at least one of a second operating system and a second device. 6. The method of claim 1, wherein the providing of the library of native design elements includes providing underlying functionality and respective code of the native design elements such that a functional prototype application is created in a virtual interface associated with any of the different, predefined platforms. 7. The method of claim 1, wherein the converting comprises automatically reformatting the one or more design elements to fit within a virtually interface associated with the second platform. 8. The method of claim 1, wherein the converting the first design layout to the second layout does not require rewriting code for it to be functional. 9. The method of claim 1, further comprising collaboratively designing the design layout by tagging comments to any particular design element of the native design elements. 10. The method of claim 9, wherein the tagged comments are accessible on any native platform and the computing device comprising the library of the native design elements. 11. The method of claim 9, wherein the tagged comments are transferrable between any native platform and the computing device using a server such that comments can be made and tagged to the any particular design element of the native design elements on the native platform and the computing device. 12. The method of claim 1, further comprising changing properties of the native design elements, separately, for any combination of the different, predefined platforms. 13. The method of claim 1, wherein the first design layout with its corresponding one or more native design elements and the second design layout with the corresponding one or more native design elements are natively rendered on a device respectively associated with the first platform and the second platform. 14. A method comprising:
representing a design layout with native design elements on a canvas provided on a first computing device regardless of platform and which can be natively rendered on a second computer device; and transferring the design layout with the native design elements to the second computing device to natively render the native design elements as a functional prototype application in its interface. 15. The method of claim 14, wherein the step of transferring is provided by a service provider. 16. The method of claim 14, wherein the representing a design layout with native design elements comprises providing a library of predefined coded native design elements which can be selected, dragged and dropped into the canvas, as functional design elements. 17. The method of claim 16, wherein properties of the native design elements are selectively customizable for different platforms. 18. The method of claim 16, further comprising tagging comments to native design elements and collaboratively sharing the tagged comments associated with the native design elements to different computing devices, including a native platform. 19. The method of claim 18, wherein the tagged comments are transferrable between the native platform and another computing device using a server such that comments can be made and tagged to the native design elements on the native platform and the computing devices. 20. A computer system for generating functional prototype applications in different platforms without rewriting code for each different platform comprising:
a hardware memory device that stores program instructions; and a processor that executes the program instructions and causes the computer system to: design, modify, and update design layouts for prototype applications using a library of native design elements, which are visually rendered with its related functionality in a relative layout on a canvas of different platforms; navigate between different pages of the prototype application; publish the design layouts for the prototype applications with the native design elements; and associate comments with specific native design elements for which it pertains and share the comments amongst different computing devices including a native computing device which renders the native device elements as a functional prototype application. | Systems and processes for prototyping and designing natively rendered multi-channel applications across diverse platforms are disclosed. The method of prototyping an application with a computing device includes providing a library of native design elements which are reproducible in different design layouts on an interface associated with different, predefined platforms. The method further includes converting a first design layout comprising one or more native design elements which fits within an interface associated with a first platform of the different, predefined platforms to a second design layout comprising the one or more native design elements which fits within an interface associated with a second platform of the different, predefined platforms, and which is in proportion to the first design layout.1. A method of prototyping an application with a computing device, comprising:
providing a library of native design elements which are reproducible in different design layouts on an interface associated with different, predefined platforms; and converting a first design layout comprising one or more native design elements which fits within an interface associated with a first platform of the different, predefined platforms to a second design layout comprising the one or more native design elements which fits within an interface associated with a second platform of the different, predefined platforms, and which is in proportion to the first design layout. 2. The method of claim 1, wherein the interface associated with the different, predefined platforms is a canvas representing a virtual interface. 3. The method of claim 1, wherein the first platform and the second platform are different computing devices. 4. The method of claim 1, wherein the first design layout and the second design layout are fully functional prototype applications for different platforms. 5. The method of claim 4, wherein the first platform is representative of at least one of a first operating system and a first device and the second platform is representative of at least one of a second operating system and a second device. 6. The method of claim 1, wherein the providing of the library of native design elements includes providing underlying functionality and respective code of the native design elements such that a functional prototype application is created in a virtual interface associated with any of the different, predefined platforms. 7. The method of claim 1, wherein the converting comprises automatically reformatting the one or more design elements to fit within a virtually interface associated with the second platform. 8. The method of claim 1, wherein the converting the first design layout to the second layout does not require rewriting code for it to be functional. 9. The method of claim 1, further comprising collaboratively designing the design layout by tagging comments to any particular design element of the native design elements. 10. The method of claim 9, wherein the tagged comments are accessible on any native platform and the computing device comprising the library of the native design elements. 11. The method of claim 9, wherein the tagged comments are transferrable between any native platform and the computing device using a server such that comments can be made and tagged to the any particular design element of the native design elements on the native platform and the computing device. 12. The method of claim 1, further comprising changing properties of the native design elements, separately, for any combination of the different, predefined platforms. 13. The method of claim 1, wherein the first design layout with its corresponding one or more native design elements and the second design layout with the corresponding one or more native design elements are natively rendered on a device respectively associated with the first platform and the second platform. 14. A method comprising:
representing a design layout with native design elements on a canvas provided on a first computing device regardless of platform and which can be natively rendered on a second computer device; and transferring the design layout with the native design elements to the second computing device to natively render the native design elements as a functional prototype application in its interface. 15. The method of claim 14, wherein the step of transferring is provided by a service provider. 16. The method of claim 14, wherein the representing a design layout with native design elements comprises providing a library of predefined coded native design elements which can be selected, dragged and dropped into the canvas, as functional design elements. 17. The method of claim 16, wherein properties of the native design elements are selectively customizable for different platforms. 18. The method of claim 16, further comprising tagging comments to native design elements and collaboratively sharing the tagged comments associated with the native design elements to different computing devices, including a native platform. 19. The method of claim 18, wherein the tagged comments are transferrable between the native platform and another computing device using a server such that comments can be made and tagged to the native design elements on the native platform and the computing devices. 20. A computer system for generating functional prototype applications in different platforms without rewriting code for each different platform comprising:
a hardware memory device that stores program instructions; and a processor that executes the program instructions and causes the computer system to: design, modify, and update design layouts for prototype applications using a library of native design elements, which are visually rendered with its related functionality in a relative layout on a canvas of different platforms; navigate between different pages of the prototype application; publish the design layouts for the prototype applications with the native design elements; and associate comments with specific native design elements for which it pertains and share the comments amongst different computing devices including a native computing device which renders the native device elements as a functional prototype application. | 2,100 |
5,325 | 5,325 | 11,836,254 | 2,174 | A font changing method for the subtitles of a video is provided. The method utilizes a playback program, which is implemented as a software application or a program embedded in a playback device, to provide a font selection function for the subtitles of the video. Therefore, a user can configure the subtitles easily. This method is used for a DVD that allows separating video streaming and subtitle data. After the playback program has received an activation signal, several steps for changing the font before playing the video are included. Firstly, the playback program receives a subtitle settings signal, and then receives a font selection signal in the settings item. Next, the program accesses a font database built in a storage medium. After that, the program links up to a selected font data. Consequently, the program can play the video after incorporating the font data into the video stream. | 1. A font changing method for subtitles of a video, wherein a user interface is introduced to allow a font for a video subtitle to be changed, and the video and the font are two separated files, comprising:
reading data from a disc; retrieving a disc menu from the disc; setting up a font option item for the subtitle from the menu; introducing the user interface to browse font files from a storage medium; selecting one of the font files; and joining the font file and the video. 2. The font changing method of claim 1, wherein the user interface is provided by a playback program. 3. The font changing method of claim 2, wherein the playback program is a packaged disc playback application. 4. The font changing method of claim 2, wherein the playback program is a playing program embedded in a video player. 5. The font changing method of claim 1, wherein the disc supports a playback format with separated video and font files. 6. The font changing method of claim 1, wherein before the step of setting up the font option item, the method further comprising a step of determining whether or not the disc supports the format with separated the video streaming and subtitle data. 7. The font changing method of claim 5, wherein a Blu-ray DVD embodies the disc. 8. The font changing method of claim 5, wherein a High-Density DVD embodies the disc. 9. The font changing method of claim 2, wherein an operating system and a playback device are utilized to process signals while the playback program is being configured. 10. The font changing method of claim 1, wherein a hard disk embodies the storage medium. 11. The font changing method of claim 1, wherein the storage medium is a network-based disk space. 12. The font changing method of claim 1, wherein the storage medium is removable. 13. A font changing method for subtitles of a video, wherein a playback program is introduced to provide a font selection function for changing the font of subtitles, comprising:
receiving a signal for activating the playback program; reading data from a disc that supports a disc format with separated video streaming and font file; receiving a signal for setting up the subtitle font; accessing a storage medium that includes a font database; receiving a signal for selecting the subtitle font; linking to a file with the selected subtitle font; and joining the video streaming and the font file. 14. The font changing method of claim 13, wherein the method adopts a graphic-user-interface to browse the font files stored in the storage medium. 15. The font changing method of claim 13, wherein the playback program is a packaged disc playback application. 16. The font changing method of claim 13, wherein the playback program is embedded in a player. 17. The font changing method of claim 13, wherein at the step of reading data from the disc, the method further comprising:
determining whether or not the disc supports a format with separated video streaming and subtitles font files. 18. The font changing method of claim 13, wherein the disc is a Blu-ray DVD. 19. The font changing method of claim 13, wherein the disc is a High-Density DVD. 20. The font changing method of claim 13, wherein the playback program processes signals through an operating system and a video playback device. 21. The font changing method of claim 13, wherein a hard disk embodies the storage medium. 22. The font changing method of claim 13, wherein a network-based disk space embodies the storage medium. 23. The font changing method of claim 13, wherein the storage medium is removable. | A font changing method for the subtitles of a video is provided. The method utilizes a playback program, which is implemented as a software application or a program embedded in a playback device, to provide a font selection function for the subtitles of the video. Therefore, a user can configure the subtitles easily. This method is used for a DVD that allows separating video streaming and subtitle data. After the playback program has received an activation signal, several steps for changing the font before playing the video are included. Firstly, the playback program receives a subtitle settings signal, and then receives a font selection signal in the settings item. Next, the program accesses a font database built in a storage medium. After that, the program links up to a selected font data. Consequently, the program can play the video after incorporating the font data into the video stream.1. A font changing method for subtitles of a video, wherein a user interface is introduced to allow a font for a video subtitle to be changed, and the video and the font are two separated files, comprising:
reading data from a disc; retrieving a disc menu from the disc; setting up a font option item for the subtitle from the menu; introducing the user interface to browse font files from a storage medium; selecting one of the font files; and joining the font file and the video. 2. The font changing method of claim 1, wherein the user interface is provided by a playback program. 3. The font changing method of claim 2, wherein the playback program is a packaged disc playback application. 4. The font changing method of claim 2, wherein the playback program is a playing program embedded in a video player. 5. The font changing method of claim 1, wherein the disc supports a playback format with separated video and font files. 6. The font changing method of claim 1, wherein before the step of setting up the font option item, the method further comprising a step of determining whether or not the disc supports the format with separated the video streaming and subtitle data. 7. The font changing method of claim 5, wherein a Blu-ray DVD embodies the disc. 8. The font changing method of claim 5, wherein a High-Density DVD embodies the disc. 9. The font changing method of claim 2, wherein an operating system and a playback device are utilized to process signals while the playback program is being configured. 10. The font changing method of claim 1, wherein a hard disk embodies the storage medium. 11. The font changing method of claim 1, wherein the storage medium is a network-based disk space. 12. The font changing method of claim 1, wherein the storage medium is removable. 13. A font changing method for subtitles of a video, wherein a playback program is introduced to provide a font selection function for changing the font of subtitles, comprising:
receiving a signal for activating the playback program; reading data from a disc that supports a disc format with separated video streaming and font file; receiving a signal for setting up the subtitle font; accessing a storage medium that includes a font database; receiving a signal for selecting the subtitle font; linking to a file with the selected subtitle font; and joining the video streaming and the font file. 14. The font changing method of claim 13, wherein the method adopts a graphic-user-interface to browse the font files stored in the storage medium. 15. The font changing method of claim 13, wherein the playback program is a packaged disc playback application. 16. The font changing method of claim 13, wherein the playback program is embedded in a player. 17. The font changing method of claim 13, wherein at the step of reading data from the disc, the method further comprising:
determining whether or not the disc supports a format with separated video streaming and subtitles font files. 18. The font changing method of claim 13, wherein the disc is a Blu-ray DVD. 19. The font changing method of claim 13, wherein the disc is a High-Density DVD. 20. The font changing method of claim 13, wherein the playback program processes signals through an operating system and a video playback device. 21. The font changing method of claim 13, wherein a hard disk embodies the storage medium. 22. The font changing method of claim 13, wherein a network-based disk space embodies the storage medium. 23. The font changing method of claim 13, wherein the storage medium is removable. | 2,100 |
5,326 | 5,326 | 14,294,825 | 2,125 | A computer-implemented method, by its execution
realizing an “Innovation Expert System, IES”—comprising at least a processor, a memory for storing the method's executable code for the processor, at least one I/O device for IES's interactions with an IES user, an “Items/Events Memory, I/EM” for storing all items and events the method refers to, and a “User Interface Entity, UIE” ::={<KR-UIE, HI-UIE, IC-UIE>.Y|YεY UIE }—
in its config-mode generating and customizing a set of “legal argument chain, LAC”, {LAC},
for a given “PTR Data Structure, PTR FFOLLIN -DS” determined by the FSTP FFOLLIN -Test, and an “Arguable Subtest, AST”εFSTP FFOLLIN -Test—omitting “ FFOLLIN ” in the future—with {LAC}::={LAC AST .Z|LAC AST .Z proves TT.0 passes AST∀ZεZ AST }, whereby ∀ZεZ AST ⊂Y UIE holds
KR-UIE.Z comprises the AST, HI-UIE.Z is input by a user, and IC-UIE.Z is determined by a user;
in its realtime-mode presenting an invoked generated and/or customized LAC AST .Z, ZεZ AST ;
when executed by the IES, the latter repeatedly consecutively invokes and completely executes, for any IES user separately, the action A) when the IES is in a config-mode resp. the action B) when the IES is in a realtime-mode, which means that for an IES user the IES then A) i. automatically identifies a ZεZ AST for which a LAC AST exists already or an ASTεFSTP-Test(PTR) to be transformed into a LAC,
ii. automatically prompts a user to input into said identified KR-UIE.Z said AST, into its HI-UIE.Z what the representation shall be of this AST on what I/O device, and into its IC-UIE.Z what interactive control a user shall have during said representation of said AST, iii. automatically may accept information from at least one IES user to be communicated to at least one other IES user's I/O device(s), iv. on request of an IES user toggles this IES user's mode of the IES to the realtime-mode.
B) i. automatically identifies a LACε{LAC AST },
ii. automatically identifies an AST then automatically identifies a LACε{LAC AST }, iii. on having determined said LAC, presents it as defined in A)ii. or predefined, iv. automatically may accept information from at least one IES user to be communicated to at least one other IES user's I/O device(s); v. on request of an IES user toggles this IES user's mode of the IES to the config-mode. | 1. A computer-implemented method, by its execution
realizing an “Innovation Expert System, IES”—comprising at least a processor, a memory for storing the method's executable code for the processor, at least one I/O device for IES's interactions with an IES user, an “Items/Events Memory, I/EM” for storing all items and events the method refers to, and a “User Interface Entity, UIE” ::={<KR-UIE, HI-UIE, IC-UIE>.Y|YεYUIE}—
in its config-mode generating and customizing a set of “legal argument chain, LAC”, {LAC},
for a given “PTR Data Structure, PTRFFOLLIN-DS” determined by the FSTPFFOLLIN-Test,
and an “Arguable Subtest, AST”εFSTPFFOLLIN-Test—omitting “FFOLLIN” in the future—with {LAC}::={LACAST.Z|LACAST.Z proves TT.0 passes AST∀ZεZAST}, whereby ∀ZεZAST⊂YUIE holds
KR-UIE.Z comprises the AST,
HI-UIE.Z is input by a user, and
IC-UIE.Z is determined by a user;
in its realtime-mode presenting an invoked generated and/or customized LACAST.Z, ZεZAST;
when executed by the IES, the latter repeatedly consecutively invokes and completely executes, for any IES user separately, the action A) when the IES is in a config-mode resp. the action B) when the IES is in a realtime-mode, which means that for an IES user the IES then A) i. automatically identifies a ZεZAST for which a LACAST exists already or an ASTεFSTP-Test(PTR) to be transformed into a LAC,
ii. automatically prompts a user to input into said identified KR-UIE.Z said AST, into its HI-UIE.Z what the representation shall be of this AST on what I/O device, and into its IC-UIE.Z what interactive control a user shall have during said representation of said AST,
iii. automatically may accept information from at least one IES user to be communicated to at least one other IES user's I/O device(s),
iv. on request of an IES user toggles this IES user's mode of the IES to the realtime-mode.
B) i. automatically identifies a LACε{LACAST},
ii. automatically identifies an AST then automatically identifies a LACε{LACAST},
iii. on having determined said LAC, presents it as defined in A)ii. or predefined,
iv. automatically may accept information from at least one IES user to be communicated to at least one other IES user's I/O device(s);
v. on request of an IES user toggles this IES user's mode of the IES to the config-mode. 2. A computer-implemented method according to claim 1), whereby the representation of a user input that the IES requires may be identified by a user, either by selecting said representation from an IES given set of such representations or by describing it in an IES given notation. 3. A computer-implemented method according to claim 1), whereby the representation of an IES output for use by at least one IES user may be identified by a user, either by selecting said representation from an IES given set of such representations or by describing it in an IES given notation. 4. A computer-implemented method according to claim 1), whereby a user input triggers an IES function that automatically or interactively with a user generates or modifies at least a part of a KR-UIE.Y or HI-UIE.Y or IC-UIE.Y. 5. A computer-implemented method according to claim 1), whereby the IES provides to a user, for a UIE.Y, the capability of subdividing it or a step of it into steps and to remove such a subdivision, whereby performing a subdivision or removing it may be determined by the IES controlled by a user or by an IES user and any operation defined in A) and B) may be applied to a step. 6. A computer-implemented method according to claim 1), whereby at least one AST may be completely input by an IES user, or derived by the IES from at least one PTR-DS part identified by an IES user interactively with an IES user, or automatically. 7. A computer-implemented method according to claim 1), whereby the PTR-DS may be partially input or modified or verified by an IES user and—if incomplete—completed by the IES interactively with an IES user. 8. A computer-implemented method according to claim 1), whereby the FFOLLIN may be provided by the PTR-DS, or input by an IES user either by selecting a FFOLLN from an IES given set of such FFOLLNs and complete the selected FFOLLN to a FFOLLIN by inCs of the TT.0 of the given PTR, alternatively by describing it or a FFOLLN in an IES given notation. 9. A computer-implemented method according to claim 1), whereby an IES user may limit its SPL by a document, the additional limitations of which on the TT.0 under test are described in some notation provided by the IES, whereby the IES checks that the FFOL property of the resulting set of limitations is preserved. 10. A computer-implemented method according to claim 1), whereby an IES user may—by IES given procedures—mark-up at least one part of the PTR-DS and of the UIE used by the TT.0 test at issue and sign it in an authenticable way, just as identify any such part and authenticate it, just as to have the IES monitor its use by such IES procedures, write a log file as to its use, and inform an IES user about its use instantly or if an IES user configurable IES given event occurs. 11. A computer-implemented method according to claim 1), whereby an IES user may identify the actual state of the IES, toggle between different such identified states, and thereby get from the IES the description of differences between both states, presented as configured by an IES user in a notation provided by the IES. 12. A computer-implemented method according to claim 1), whereby an IES user may undo its most recent interaction with the IES, which changed its I/EM. 13. A computer-implemented method according to claim 1), whereby an IES user may enable/disable at least one other IES user to/from at least one interaction with an IES user. 14. A computer-implemented method according to claim 1), whereby an IES user may synchronize a part—selectable by an IES user from a set of parts provided by the IES or described by an IES user in a notation provided by the IES—of the presentation of the IES to at least two IES users. 15. A computer-implemented method according to claim 1), whereby an IES user may request a part—selectable by an IES user from a set of parts provided by the IES or described by an IES user in a notation provided by the IES—of the log-file of a period of the IES execution for a TT.0 test. 16. A computer-implemented system, by its execution
realizing an “Innovation Expert System, IES”—comprising at least a processor, a memory for storing the method's executable code for the processor, at least one I/O device for IES's interactions with an IES user, an “Items/Events Memory, I/EM” for storing all items and events the method refers to, and a “User Interface Entity, UIE” ::={<KR-UIE, HI-UIE, IC-UIE>.Y|YεYUIE}—
in its config-mode generating and customizing a set of “legal argument chain, LAC”, {LAC},
for a given “PTR Data Structure, PTRFFOLLIN-DS” determined by the FSTPFFOLLIN-Test,
and an “Arguable Subtest, AST”εFSTPFFOLLIN-Test—omitting “FFOLLIN” in the future—with {LAC}::={LACAST.Z|LACAST.Z proves TT.0 passes AST∀ZεZAST}, whereby ∀ZεZAST⊂YUIE holds
KR-UIE.Z comprises the AST,
HI-UIE.Z is input by a user, and
IC-UIE.Z is determined by a user;
in its realtime-mode presenting an invoked generated and/or customized LACAST.Z, ZεZAST;
when executed by the IES, the latter repeatedly consecutively invokes and completely executes, for any IES user separately, the action A) when the IES is in a config-mode resp. the action B) when the IES is in a realtime-mode, which means that for an IES user the IES then A) i. automatically identifies a ZεZAST for which a LACAST exists already or an AST E FSTP-Test(PTR) to be transformed into a LAC,
ii. automatically prompts a user to input into said identified KR-UIE.Z said AST, into its HI-UIE.Z what the representation shall be of this AST on what I/O device, and into its IC-UIE.Z what interactive control a user shall have during said representation of said AST,
iii. automatically may accept information from at least one IES user to be communicated to at least one other IES user's I/O device(s),
iv. on request of an IES user toggles this IES user's mode of the IES to the realtime-mode.
B) i. automatically identifies a LACε{LACAST},
ii. automatically identifies an AST then automatically identifies a LACε{LACAST},
iii. on having determined said LAC, presents it as defined in A)ii. or predefined,
iv. automatically may accept information from at least one IES user to be communicated to at least one other IES user's I/O device(s);
v. on request of an IES user toggles this IES user's mode of the IES to the config-mode. 17. A computer-implemented system according to claim 16), whereby the representation of a user input that the IES requires may be identified by a user, either by selecting said representation from an IES given set of such representations or by describing it in an IES given notation. 18. A computer-implemented system according to claim 16), whereby the representation of an IES output for use by at least one IES user may be identified by a user, either by selecting said representation from an IES given set of such representations or by describing it in an IES given notation. 19. A computer-implemented system according to claim 16), whereby a user input triggers an IES function that automatically or interactively with a user generates or modifies at least a part of a KR-UIE.Y or HI-UIE.Y or IC-UIE.Y. 20. A computer-implemented system according to claim 16), whereby the IES provides to a user, for a UIE.Y, the capability of subdividing it or a step of it into steps and to remove such a subdivision, whereby performing a subdivision or removing it may be determined by the IES controlled by a user or by an IES user and any operation defined in A) and B) may be applied to a step. 21. A computer-implemented system according to claim 16), whereby at least one AST may be completely input by an IES user, or derived by the IES from at least one PTR-DS part identified by an IES user interactively with an IES user, or automatically. 22. A computer-implemented system according to claim 16), whereby the PTR-DS may be partially input or modified or verified by an IES user and—if incomplete—completed by the IES interactively with an IES user. 23. A computer-implemented system according to claim 16), whereby the FFOLLIN may be provided by the PTR-DS, or input by an IES user either by selecting a FFOLLN from an IES given set of such FFOLLNs and complete the selected FFOLLN to a FFOLLIN by inCs of the TT.0 of the given PTR, alternatively by describing it or a FFOLLN in an IES given notation. 24. A computer-implemented system according to claim 16), whereby an IES user may limit its SPL by a document, the additional limitations of which on the TT.0 under test are described in some notation provided by the IES, whereby the IES checks that the FFOL property of the resulting set of limitations is preserved. 25. A computer-implemented system according to claim 16), whereby an IES user may—by IES given procedures—mark-up at least one part of the PTR-DS and of the UIE used by the TT.0 test at issue and sign it in an authenticable way, just as identify any such part and authenticate it, just as to have the IES monitor its use by such IES procedures, write a log file as to its use, and inform an IES user about its use instantly or if an IES user configurable IES given event occurs. 26. A computer-implemented system according to claim 16), whereby an IES user may identify the actual state of the IES, toggle between different such identified states, and thereby get from the IES the description of differences between both states, presented as configured by an IES user in a notation provided by the IES. 27. A computer-implemented system according to claim 16), whereby an IES user may undo its most recent interaction with the IES, which changed its I/EM. 28. A computer-implemented system according to claim 16), whereby an IES user may enable/disable at least one other IES user to/from at least one interaction with an IES user. 29. A computer-implemented system according to claim 16), whereby an IES user may synchronize a part—selectable by an IES user from a set of parts provided by the IES or described by an IES user in a notation provided by the IES—of the presentation of the IES to at least two IES users. 30. A computer-implemented system according to claim 16), whereby an IES user may request a part—selectable by an IES user from a set of parts provided by the IES or described by an IES user in a notation provided by the IES—of the log-file of a period of the IES execution for a TT.0 test. | A computer-implemented method, by its execution
realizing an “Innovation Expert System, IES”—comprising at least a processor, a memory for storing the method's executable code for the processor, at least one I/O device for IES's interactions with an IES user, an “Items/Events Memory, I/EM” for storing all items and events the method refers to, and a “User Interface Entity, UIE” ::={<KR-UIE, HI-UIE, IC-UIE>.Y|YεY UIE }—
in its config-mode generating and customizing a set of “legal argument chain, LAC”, {LAC},
for a given “PTR Data Structure, PTR FFOLLIN -DS” determined by the FSTP FFOLLIN -Test, and an “Arguable Subtest, AST”εFSTP FFOLLIN -Test—omitting “ FFOLLIN ” in the future—with {LAC}::={LAC AST .Z|LAC AST .Z proves TT.0 passes AST∀ZεZ AST }, whereby ∀ZεZ AST ⊂Y UIE holds
KR-UIE.Z comprises the AST, HI-UIE.Z is input by a user, and IC-UIE.Z is determined by a user;
in its realtime-mode presenting an invoked generated and/or customized LAC AST .Z, ZεZ AST ;
when executed by the IES, the latter repeatedly consecutively invokes and completely executes, for any IES user separately, the action A) when the IES is in a config-mode resp. the action B) when the IES is in a realtime-mode, which means that for an IES user the IES then A) i. automatically identifies a ZεZ AST for which a LAC AST exists already or an ASTεFSTP-Test(PTR) to be transformed into a LAC,
ii. automatically prompts a user to input into said identified KR-UIE.Z said AST, into its HI-UIE.Z what the representation shall be of this AST on what I/O device, and into its IC-UIE.Z what interactive control a user shall have during said representation of said AST, iii. automatically may accept information from at least one IES user to be communicated to at least one other IES user's I/O device(s), iv. on request of an IES user toggles this IES user's mode of the IES to the realtime-mode.
B) i. automatically identifies a LACε{LAC AST },
ii. automatically identifies an AST then automatically identifies a LACε{LAC AST }, iii. on having determined said LAC, presents it as defined in A)ii. or predefined, iv. automatically may accept information from at least one IES user to be communicated to at least one other IES user's I/O device(s); v. on request of an IES user toggles this IES user's mode of the IES to the config-mode.1. A computer-implemented method, by its execution
realizing an “Innovation Expert System, IES”—comprising at least a processor, a memory for storing the method's executable code for the processor, at least one I/O device for IES's interactions with an IES user, an “Items/Events Memory, I/EM” for storing all items and events the method refers to, and a “User Interface Entity, UIE” ::={<KR-UIE, HI-UIE, IC-UIE>.Y|YεYUIE}—
in its config-mode generating and customizing a set of “legal argument chain, LAC”, {LAC},
for a given “PTR Data Structure, PTRFFOLLIN-DS” determined by the FSTPFFOLLIN-Test,
and an “Arguable Subtest, AST”εFSTPFFOLLIN-Test—omitting “FFOLLIN” in the future—with {LAC}::={LACAST.Z|LACAST.Z proves TT.0 passes AST∀ZεZAST}, whereby ∀ZεZAST⊂YUIE holds
KR-UIE.Z comprises the AST,
HI-UIE.Z is input by a user, and
IC-UIE.Z is determined by a user;
in its realtime-mode presenting an invoked generated and/or customized LACAST.Z, ZεZAST;
when executed by the IES, the latter repeatedly consecutively invokes and completely executes, for any IES user separately, the action A) when the IES is in a config-mode resp. the action B) when the IES is in a realtime-mode, which means that for an IES user the IES then A) i. automatically identifies a ZεZAST for which a LACAST exists already or an ASTεFSTP-Test(PTR) to be transformed into a LAC,
ii. automatically prompts a user to input into said identified KR-UIE.Z said AST, into its HI-UIE.Z what the representation shall be of this AST on what I/O device, and into its IC-UIE.Z what interactive control a user shall have during said representation of said AST,
iii. automatically may accept information from at least one IES user to be communicated to at least one other IES user's I/O device(s),
iv. on request of an IES user toggles this IES user's mode of the IES to the realtime-mode.
B) i. automatically identifies a LACε{LACAST},
ii. automatically identifies an AST then automatically identifies a LACε{LACAST},
iii. on having determined said LAC, presents it as defined in A)ii. or predefined,
iv. automatically may accept information from at least one IES user to be communicated to at least one other IES user's I/O device(s);
v. on request of an IES user toggles this IES user's mode of the IES to the config-mode. 2. A computer-implemented method according to claim 1), whereby the representation of a user input that the IES requires may be identified by a user, either by selecting said representation from an IES given set of such representations or by describing it in an IES given notation. 3. A computer-implemented method according to claim 1), whereby the representation of an IES output for use by at least one IES user may be identified by a user, either by selecting said representation from an IES given set of such representations or by describing it in an IES given notation. 4. A computer-implemented method according to claim 1), whereby a user input triggers an IES function that automatically or interactively with a user generates or modifies at least a part of a KR-UIE.Y or HI-UIE.Y or IC-UIE.Y. 5. A computer-implemented method according to claim 1), whereby the IES provides to a user, for a UIE.Y, the capability of subdividing it or a step of it into steps and to remove such a subdivision, whereby performing a subdivision or removing it may be determined by the IES controlled by a user or by an IES user and any operation defined in A) and B) may be applied to a step. 6. A computer-implemented method according to claim 1), whereby at least one AST may be completely input by an IES user, or derived by the IES from at least one PTR-DS part identified by an IES user interactively with an IES user, or automatically. 7. A computer-implemented method according to claim 1), whereby the PTR-DS may be partially input or modified or verified by an IES user and—if incomplete—completed by the IES interactively with an IES user. 8. A computer-implemented method according to claim 1), whereby the FFOLLIN may be provided by the PTR-DS, or input by an IES user either by selecting a FFOLLN from an IES given set of such FFOLLNs and complete the selected FFOLLN to a FFOLLIN by inCs of the TT.0 of the given PTR, alternatively by describing it or a FFOLLN in an IES given notation. 9. A computer-implemented method according to claim 1), whereby an IES user may limit its SPL by a document, the additional limitations of which on the TT.0 under test are described in some notation provided by the IES, whereby the IES checks that the FFOL property of the resulting set of limitations is preserved. 10. A computer-implemented method according to claim 1), whereby an IES user may—by IES given procedures—mark-up at least one part of the PTR-DS and of the UIE used by the TT.0 test at issue and sign it in an authenticable way, just as identify any such part and authenticate it, just as to have the IES monitor its use by such IES procedures, write a log file as to its use, and inform an IES user about its use instantly or if an IES user configurable IES given event occurs. 11. A computer-implemented method according to claim 1), whereby an IES user may identify the actual state of the IES, toggle between different such identified states, and thereby get from the IES the description of differences between both states, presented as configured by an IES user in a notation provided by the IES. 12. A computer-implemented method according to claim 1), whereby an IES user may undo its most recent interaction with the IES, which changed its I/EM. 13. A computer-implemented method according to claim 1), whereby an IES user may enable/disable at least one other IES user to/from at least one interaction with an IES user. 14. A computer-implemented method according to claim 1), whereby an IES user may synchronize a part—selectable by an IES user from a set of parts provided by the IES or described by an IES user in a notation provided by the IES—of the presentation of the IES to at least two IES users. 15. A computer-implemented method according to claim 1), whereby an IES user may request a part—selectable by an IES user from a set of parts provided by the IES or described by an IES user in a notation provided by the IES—of the log-file of a period of the IES execution for a TT.0 test. 16. A computer-implemented system, by its execution
realizing an “Innovation Expert System, IES”—comprising at least a processor, a memory for storing the method's executable code for the processor, at least one I/O device for IES's interactions with an IES user, an “Items/Events Memory, I/EM” for storing all items and events the method refers to, and a “User Interface Entity, UIE” ::={<KR-UIE, HI-UIE, IC-UIE>.Y|YεYUIE}—
in its config-mode generating and customizing a set of “legal argument chain, LAC”, {LAC},
for a given “PTR Data Structure, PTRFFOLLIN-DS” determined by the FSTPFFOLLIN-Test,
and an “Arguable Subtest, AST”εFSTPFFOLLIN-Test—omitting “FFOLLIN” in the future—with {LAC}::={LACAST.Z|LACAST.Z proves TT.0 passes AST∀ZεZAST}, whereby ∀ZεZAST⊂YUIE holds
KR-UIE.Z comprises the AST,
HI-UIE.Z is input by a user, and
IC-UIE.Z is determined by a user;
in its realtime-mode presenting an invoked generated and/or customized LACAST.Z, ZεZAST;
when executed by the IES, the latter repeatedly consecutively invokes and completely executes, for any IES user separately, the action A) when the IES is in a config-mode resp. the action B) when the IES is in a realtime-mode, which means that for an IES user the IES then A) i. automatically identifies a ZεZAST for which a LACAST exists already or an AST E FSTP-Test(PTR) to be transformed into a LAC,
ii. automatically prompts a user to input into said identified KR-UIE.Z said AST, into its HI-UIE.Z what the representation shall be of this AST on what I/O device, and into its IC-UIE.Z what interactive control a user shall have during said representation of said AST,
iii. automatically may accept information from at least one IES user to be communicated to at least one other IES user's I/O device(s),
iv. on request of an IES user toggles this IES user's mode of the IES to the realtime-mode.
B) i. automatically identifies a LACε{LACAST},
ii. automatically identifies an AST then automatically identifies a LACε{LACAST},
iii. on having determined said LAC, presents it as defined in A)ii. or predefined,
iv. automatically may accept information from at least one IES user to be communicated to at least one other IES user's I/O device(s);
v. on request of an IES user toggles this IES user's mode of the IES to the config-mode. 17. A computer-implemented system according to claim 16), whereby the representation of a user input that the IES requires may be identified by a user, either by selecting said representation from an IES given set of such representations or by describing it in an IES given notation. 18. A computer-implemented system according to claim 16), whereby the representation of an IES output for use by at least one IES user may be identified by a user, either by selecting said representation from an IES given set of such representations or by describing it in an IES given notation. 19. A computer-implemented system according to claim 16), whereby a user input triggers an IES function that automatically or interactively with a user generates or modifies at least a part of a KR-UIE.Y or HI-UIE.Y or IC-UIE.Y. 20. A computer-implemented system according to claim 16), whereby the IES provides to a user, for a UIE.Y, the capability of subdividing it or a step of it into steps and to remove such a subdivision, whereby performing a subdivision or removing it may be determined by the IES controlled by a user or by an IES user and any operation defined in A) and B) may be applied to a step. 21. A computer-implemented system according to claim 16), whereby at least one AST may be completely input by an IES user, or derived by the IES from at least one PTR-DS part identified by an IES user interactively with an IES user, or automatically. 22. A computer-implemented system according to claim 16), whereby the PTR-DS may be partially input or modified or verified by an IES user and—if incomplete—completed by the IES interactively with an IES user. 23. A computer-implemented system according to claim 16), whereby the FFOLLIN may be provided by the PTR-DS, or input by an IES user either by selecting a FFOLLN from an IES given set of such FFOLLNs and complete the selected FFOLLN to a FFOLLIN by inCs of the TT.0 of the given PTR, alternatively by describing it or a FFOLLN in an IES given notation. 24. A computer-implemented system according to claim 16), whereby an IES user may limit its SPL by a document, the additional limitations of which on the TT.0 under test are described in some notation provided by the IES, whereby the IES checks that the FFOL property of the resulting set of limitations is preserved. 25. A computer-implemented system according to claim 16), whereby an IES user may—by IES given procedures—mark-up at least one part of the PTR-DS and of the UIE used by the TT.0 test at issue and sign it in an authenticable way, just as identify any such part and authenticate it, just as to have the IES monitor its use by such IES procedures, write a log file as to its use, and inform an IES user about its use instantly or if an IES user configurable IES given event occurs. 26. A computer-implemented system according to claim 16), whereby an IES user may identify the actual state of the IES, toggle between different such identified states, and thereby get from the IES the description of differences between both states, presented as configured by an IES user in a notation provided by the IES. 27. A computer-implemented system according to claim 16), whereby an IES user may undo its most recent interaction with the IES, which changed its I/EM. 28. A computer-implemented system according to claim 16), whereby an IES user may enable/disable at least one other IES user to/from at least one interaction with an IES user. 29. A computer-implemented system according to claim 16), whereby an IES user may synchronize a part—selectable by an IES user from a set of parts provided by the IES or described by an IES user in a notation provided by the IES—of the presentation of the IES to at least two IES users. 30. A computer-implemented system according to claim 16), whereby an IES user may request a part—selectable by an IES user from a set of parts provided by the IES or described by an IES user in a notation provided by the IES—of the log-file of a period of the IES execution for a TT.0 test. | 2,100 |
5,327 | 5,327 | 13,731,918 | 2,176 | Content management for virtual tours including exposing, within a virtual tour, a hotspot, the hotspot having an associated a hyperlink to a third-party content management provider and access code for accessing content from third-party content management provider; receiving an invocation of the hotspot; invoking the hyperlink associated with the hotspot; invoking the access code for accessing content from third-party content management provider; receiving, from the third-party content management provider, content; and displaying the received content within the virtual tour. | 1. A method of content management for virtual tours, the method comprising:
exposing, within a virtual tour, a hotspot, the hotspot having an associated a hyperlink to a third-party content management provider and access code for accessing content from third-party content management provider; receiving an invocation of the hotspot; invoking the hyperlink associated with the hotspot; invoking the access code for accessing content from third-party content management provider; receiving, from the third-party content management provider, content; and displaying the received content within the virtual tour. 2. The method of claim 1 wherein access code for accessing content from third-party content management provider further comprises an application programming interface (‘API’) call to the third-party content management provider. 3. The method of claim 1 wherein access code for accessing content from third-party content management provider further comprises a widget provided by the third-party content management provider. 4. The method of claim 1 wherein access code for accessing content from third-party content management provider further comprises HyperText Markup Language (‘HTML’) elements provided by the third-party content management provider. 5. The method of claim 1 wherein the location of the hotspot in the virtual tour indicates a relationship between one or more visual elements of the virtual tour and the content received from the third-party content management provider for display in the virtual tour. 6. The method of claim 1 wherein the virtual tour owner has an account with the content management provider and provides through the content management provider content related to the hotspot. 7. The method of claim 1 wherein the third-party content management provider comprises a social media website. 8. The method of claim 1 wherein the virtual tour comprises a plurality of images stitched together to create a 360 degree image of a location. 9. A virtual tour, the virtual tour comprising:
a rotatable image of a location to be toured; and an in-context hotspot, the hotspot having an associated hyperlink to a third-party content management provider and access code for accessing content from third-party content management provider; 10. The virtual tour of claim 5 wherein the location of the in-context hotspot in the virtual tour indicates a relationship between one or more visual elements of the virtual tour and content available from the third-party content management provider for display in the virtual tour. 11. The virtual tour of claim 5 wherein a virtual tour owner has an account with the content management provider and provides through the content management provider content related to the in-context hotspot. 12. The virtual tour of claim 1 wherein the third-party content management provider comprises a social media website. 13. The virtual tour of claim 1 wherein access code for accessing content from third-party content management provider further comprises an application programming interface (‘API’) call to the third-party content management provider. 14. The virtual tour of claim 1 wherein access code for accessing content from third-party content management provider further comprises a widget provided by the third-party content management provider. 15. The virtual tour of claim 1 wherein access code for accessing content from third-party content management provider further comprises HyperText Markup Language (‘HTML’) elements provided by the third-party content management provider. | Content management for virtual tours including exposing, within a virtual tour, a hotspot, the hotspot having an associated a hyperlink to a third-party content management provider and access code for accessing content from third-party content management provider; receiving an invocation of the hotspot; invoking the hyperlink associated with the hotspot; invoking the access code for accessing content from third-party content management provider; receiving, from the third-party content management provider, content; and displaying the received content within the virtual tour.1. A method of content management for virtual tours, the method comprising:
exposing, within a virtual tour, a hotspot, the hotspot having an associated a hyperlink to a third-party content management provider and access code for accessing content from third-party content management provider; receiving an invocation of the hotspot; invoking the hyperlink associated with the hotspot; invoking the access code for accessing content from third-party content management provider; receiving, from the third-party content management provider, content; and displaying the received content within the virtual tour. 2. The method of claim 1 wherein access code for accessing content from third-party content management provider further comprises an application programming interface (‘API’) call to the third-party content management provider. 3. The method of claim 1 wherein access code for accessing content from third-party content management provider further comprises a widget provided by the third-party content management provider. 4. The method of claim 1 wherein access code for accessing content from third-party content management provider further comprises HyperText Markup Language (‘HTML’) elements provided by the third-party content management provider. 5. The method of claim 1 wherein the location of the hotspot in the virtual tour indicates a relationship between one or more visual elements of the virtual tour and the content received from the third-party content management provider for display in the virtual tour. 6. The method of claim 1 wherein the virtual tour owner has an account with the content management provider and provides through the content management provider content related to the hotspot. 7. The method of claim 1 wherein the third-party content management provider comprises a social media website. 8. The method of claim 1 wherein the virtual tour comprises a plurality of images stitched together to create a 360 degree image of a location. 9. A virtual tour, the virtual tour comprising:
a rotatable image of a location to be toured; and an in-context hotspot, the hotspot having an associated hyperlink to a third-party content management provider and access code for accessing content from third-party content management provider; 10. The virtual tour of claim 5 wherein the location of the in-context hotspot in the virtual tour indicates a relationship between one or more visual elements of the virtual tour and content available from the third-party content management provider for display in the virtual tour. 11. The virtual tour of claim 5 wherein a virtual tour owner has an account with the content management provider and provides through the content management provider content related to the in-context hotspot. 12. The virtual tour of claim 1 wherein the third-party content management provider comprises a social media website. 13. The virtual tour of claim 1 wherein access code for accessing content from third-party content management provider further comprises an application programming interface (‘API’) call to the third-party content management provider. 14. The virtual tour of claim 1 wherein access code for accessing content from third-party content management provider further comprises a widget provided by the third-party content management provider. 15. The virtual tour of claim 1 wherein access code for accessing content from third-party content management provider further comprises HyperText Markup Language (‘HTML’) elements provided by the third-party content management provider. | 2,100 |
5,328 | 5,328 | 14,754,519 | 2,194 | Techniques for preserving the state of virtual machine instances during a migration from a source location to a target location are described herein. A set of credentials configured to provide access to a storage device by a virtual machine instance at the source location is provided to the virtual machine instance. When the migration from the source location to the target location starts, a second set of credentials configured to provide access to a storage device by a virtual machine instance at the source location is provided to the virtual machine instance. During the migration, state information associated with the block storage device is copied from the source location to the target location based on the migration phase. | 1. A computer-implemented method, comprising:
under the control of a block-level storage service computer system configured with executable instructions,
obtaining a first lease associating a virtual machine instance with a block storage device, the block storage device provided by the block-level storage service, the first lease specifying a first policy of access to the block storage device by the virtual machine instance and having a first status of active;
receiving an indicator of a start of a migration of the virtual machine instance from a source computing device to a target computing device;
obtaining a second lease associating the virtual machine instance in the target computing device with the block storage device, the second lease specifying a second policy of access to the block storage device by the virtual machine instance, the second lease having a second status of standby;
copying a first set of state information associated with the block storage device from the source computing device to the target computing device;
updating the first status based at least in part on an indicator of progress of the migration;
copying a second set of state information associated with the block storage device from the source computing device to the target computing device; and
updating the second status to active based at least in part on an indicator of progress of the migration. 2. The computer-implemented method of claim 1, wherein:
the first set of state information includes a first subset of a set of performance metrics; the second set of state information includes a second subset of the set of performance metrics; and the set of performance metrics includes at least one of: input-output operations per second, bandwidth used, bytes read, bytes written, time spent idle, or throttling percentage. 3. The computer-implemented method of claim 2, wherein the set of performance metrics includes:
a set of customer facing performance metrics configured to be presented to a customer of a computing resource service provider; and a set of internal performance metrics usable by a service of the computing resource service provider to at least determine a health measurement of the block storage device. 4. The computer-implemented method of claim 3, wherein the service of the computing resource service provider is the block-level storage service. 5. A system, comprising at least one computing device configured to implement one or more services, wherein the one or more services are configured to:
in response to a start of a migration of a virtual machine instance from a first location to a second location, the virtual machine instance having a first lease associating the virtual machine instance with a block storage device provided by a block-level storage service, at least:
obtain a second lease associating the virtual machine instance in the second location with the block storage device, the second lease specifying a second policy of access to the block storage device by the virtual machine instance;
copy a first set of state information associated with the block storage device from the first location to the second location; and
copy a second set of state information associated with the block storage device from the first location to the second location, the second set of state information including one or more changes to a subset of the first set of state information. 6. The system of claim 5, wherein:
the first lease specifies a first policy of access to the block storage device; and the second lease specifies a second policy of access to the block storage device. 7. The system of claim 5, wherein:
the first lease is an active lease; and the second lease is a standby lease. 8. The system of claim 5, wherein the first set of state information includes a set of performance metrics of the block storage device. 9. The system of claim 5, wherein the second set of state information includes a throttling percentage, the throttling percentage specifying a percentage of available bandwidth that the block storage device can use. 10. The system of claim 5, wherein the first set of state information includes cryptographic information associated with the block storage device. 11. The system of claim 5, wherein the first set of state information includes a set of policies associated with access to the block storage device by the virtual machine instance. 12. The system of claim 5, wherein:
the first location is a computing device; and the second location is a different computing device. 13. A non-transitory computer-readable storage medium having stored thereon executable instructions that, when executed by one or more processors of a computer system, cause the computer system to at least:
during a first phase of a migration of a virtual machine instance from a first location to a second location, copy a first set of state information associated with a block storage device from the first location to the second location, the block storage device provided to the virtual machine instance; detect a critical phase of the migration; and copy a second set of state information associated with the block storage device. 14. The non-transitory computer-readable storage medium of claim 13, wherein the second set of state information includes one or more changes to a subset of the first set of state information. 15. The non-transitory computer-readable storage medium of claim 13, wherein the instructions further comprise instructions that, when executed by the one or more processors, cause the computer system to at least detect a completion of the migration and determine, based on the completion of the migration, that the migration has failed. 16. The non-transitory computer-readable storage medium of claim 15, wherein the instructions that cause the computer system to determine that the migration has failed further include instructions that, when executed by the one or more processors, cause the computer system to update a third set of state information associated with the block storage device from the first location based at least in part on the first set of state information and the second set of state information. 17. The non-transitory computer-readable storage medium of claim 13, wherein the virtual machine instance is provided with:
a first set of credentials associating the virtual machine instance running in the first location with the block storage device; and a second set of credentials associating the virtual machine instance running in the second location with a block storage device. 18. The non-transitory computer-readable storage medium of claim 17, wherein the first set of credentials is a temporary set of credentials and the second set of credentials is a temporary set of credentials. 19. The non-transitory computer-readable storage medium of claim 17, wherein:
the first set of credentials is specified by a first lease obtained from a block-level storage service associated with the block storage device; and the second set of credentials is specified by a second lease generated by the block-level storage service associated with the block storage device in response to the migration. 20. The non-transitory computer-readable storage medium of claim 19, wherein the instructions further comprise instructions that, when executed by the one or more processors, cause the computer system to set the first lease to inactive upon detecting the critical phase of the migration. | Techniques for preserving the state of virtual machine instances during a migration from a source location to a target location are described herein. A set of credentials configured to provide access to a storage device by a virtual machine instance at the source location is provided to the virtual machine instance. When the migration from the source location to the target location starts, a second set of credentials configured to provide access to a storage device by a virtual machine instance at the source location is provided to the virtual machine instance. During the migration, state information associated with the block storage device is copied from the source location to the target location based on the migration phase.1. A computer-implemented method, comprising:
under the control of a block-level storage service computer system configured with executable instructions,
obtaining a first lease associating a virtual machine instance with a block storage device, the block storage device provided by the block-level storage service, the first lease specifying a first policy of access to the block storage device by the virtual machine instance and having a first status of active;
receiving an indicator of a start of a migration of the virtual machine instance from a source computing device to a target computing device;
obtaining a second lease associating the virtual machine instance in the target computing device with the block storage device, the second lease specifying a second policy of access to the block storage device by the virtual machine instance, the second lease having a second status of standby;
copying a first set of state information associated with the block storage device from the source computing device to the target computing device;
updating the first status based at least in part on an indicator of progress of the migration;
copying a second set of state information associated with the block storage device from the source computing device to the target computing device; and
updating the second status to active based at least in part on an indicator of progress of the migration. 2. The computer-implemented method of claim 1, wherein:
the first set of state information includes a first subset of a set of performance metrics; the second set of state information includes a second subset of the set of performance metrics; and the set of performance metrics includes at least one of: input-output operations per second, bandwidth used, bytes read, bytes written, time spent idle, or throttling percentage. 3. The computer-implemented method of claim 2, wherein the set of performance metrics includes:
a set of customer facing performance metrics configured to be presented to a customer of a computing resource service provider; and a set of internal performance metrics usable by a service of the computing resource service provider to at least determine a health measurement of the block storage device. 4. The computer-implemented method of claim 3, wherein the service of the computing resource service provider is the block-level storage service. 5. A system, comprising at least one computing device configured to implement one or more services, wherein the one or more services are configured to:
in response to a start of a migration of a virtual machine instance from a first location to a second location, the virtual machine instance having a first lease associating the virtual machine instance with a block storage device provided by a block-level storage service, at least:
obtain a second lease associating the virtual machine instance in the second location with the block storage device, the second lease specifying a second policy of access to the block storage device by the virtual machine instance;
copy a first set of state information associated with the block storage device from the first location to the second location; and
copy a second set of state information associated with the block storage device from the first location to the second location, the second set of state information including one or more changes to a subset of the first set of state information. 6. The system of claim 5, wherein:
the first lease specifies a first policy of access to the block storage device; and the second lease specifies a second policy of access to the block storage device. 7. The system of claim 5, wherein:
the first lease is an active lease; and the second lease is a standby lease. 8. The system of claim 5, wherein the first set of state information includes a set of performance metrics of the block storage device. 9. The system of claim 5, wherein the second set of state information includes a throttling percentage, the throttling percentage specifying a percentage of available bandwidth that the block storage device can use. 10. The system of claim 5, wherein the first set of state information includes cryptographic information associated with the block storage device. 11. The system of claim 5, wherein the first set of state information includes a set of policies associated with access to the block storage device by the virtual machine instance. 12. The system of claim 5, wherein:
the first location is a computing device; and the second location is a different computing device. 13. A non-transitory computer-readable storage medium having stored thereon executable instructions that, when executed by one or more processors of a computer system, cause the computer system to at least:
during a first phase of a migration of a virtual machine instance from a first location to a second location, copy a first set of state information associated with a block storage device from the first location to the second location, the block storage device provided to the virtual machine instance; detect a critical phase of the migration; and copy a second set of state information associated with the block storage device. 14. The non-transitory computer-readable storage medium of claim 13, wherein the second set of state information includes one or more changes to a subset of the first set of state information. 15. The non-transitory computer-readable storage medium of claim 13, wherein the instructions further comprise instructions that, when executed by the one or more processors, cause the computer system to at least detect a completion of the migration and determine, based on the completion of the migration, that the migration has failed. 16. The non-transitory computer-readable storage medium of claim 15, wherein the instructions that cause the computer system to determine that the migration has failed further include instructions that, when executed by the one or more processors, cause the computer system to update a third set of state information associated with the block storage device from the first location based at least in part on the first set of state information and the second set of state information. 17. The non-transitory computer-readable storage medium of claim 13, wherein the virtual machine instance is provided with:
a first set of credentials associating the virtual machine instance running in the first location with the block storage device; and a second set of credentials associating the virtual machine instance running in the second location with a block storage device. 18. The non-transitory computer-readable storage medium of claim 17, wherein the first set of credentials is a temporary set of credentials and the second set of credentials is a temporary set of credentials. 19. The non-transitory computer-readable storage medium of claim 17, wherein:
the first set of credentials is specified by a first lease obtained from a block-level storage service associated with the block storage device; and the second set of credentials is specified by a second lease generated by the block-level storage service associated with the block storage device in response to the migration. 20. The non-transitory computer-readable storage medium of claim 19, wherein the instructions further comprise instructions that, when executed by the one or more processors, cause the computer system to set the first lease to inactive upon detecting the critical phase of the migration. | 2,100 |
5,329 | 5,329 | 13,644,878 | 2,122 | Method, apparatus and product for content-based demographic estimation of users of mobile devices and usage thereof. One method comprising: obtaining a list of applications that are installed on a mobile device; and estimating, based on the list of applications, one or more demographic parameter of a user of the mobile device. Another method, that is performed by a mobile device, comprising: obtaining a list of applications that are installed on said mobile device, wherein based on the list of applications, one or more demographic parameters of a user of said mobile device are determined; and performing a user engagement based on the estimated one or more demographic parameters. | 1. A computer-implemented method performed by a processing unit, said method comprising:
obtaining a list of applications that are installed on a mobile device; and estimating, based on the list of applications, one or more demographic parameter of a user of the mobile device. 2. The computer-implemented method of claim 1, wherein the applications are downloadable applications, and wherein the applications are listed in an electronic catalog. 3. The computer-implemented method of claim 2, wherein the electronic catalog is associated with a mobile applications repository connectable over a computerized network. 4. The computer-implemented method of claim 1, wherein said obtaining comprises receiving from the mobile device the list of applications, and wherein said estimating is performed by a server comprising said processing unit, wherein the server is connectable via a network to the mobile device. 5. The computer-implemented method of claim 1 further comprises obtaining usage statistics associated with the applications, and wherein said estimating is further based on the usage statistics. 6. The computer-implemented method of claim 5, wherein the usage statistics comprising at least one of the following information:
installation time; order of installation; usage count; and last usage time. 7. The computer-implemented method of claim 1 further comprises obtaining non-application data, and wherein said estimating is further based on the non-application data. 8. The computer-implemented method of claim 7, wherein the non-application data comprises at least one of the following items:
statistics relating to non-application content in the mobile device; meta-data obtainable from digital files retained in the mobile device; a number of media files retained in the mobile device; one or more types of media files retained in the mobile device; origin of media files retained in the mobile device; and information relating to the mobile device. 9. The computer-implemented method of claim 1, wherein said estimating is performed using a classification algorithm. 10. The computer-implemented method of claim 9, wherein the classification algorithm is a supervised classification algorithm which is trained with respect to a training set. 11. The computer-implemented method of claim 10, wherein the training set comprises information relating to mobile devices for which demographic information relating to users using the mobile devices is obtainable from an installed application that requires a registration process or from an association with a profile of an online service. 12. The computer-implemented method of claim 1, wherein the list of applications that are installed on a mobile device is a partial list that excludes at least one application that is installed on the mobile device. 13. The computer-implemented method of claim 1, wherein the one or more demographic parameter comprises a user preference. 14. A computerized apparatus having a processor, the processor being adapted to perform the steps of:
obtaining a list of applications that are installed on a mobile device; and estimating, based on the list of applications, one or more demographic parameter of a user of the mobile device. 15. The apparatus of claim 14, wherein the applications are downloadable applications, wherein the applications are listed in an electronic catalog, and wherein the electronic catalog is associated with a mobile applications repository connectable over a computerized network. 16. The apparatus of claim 14, wherein said obtaining comprises receiving from the mobile device the list of applications. 17. The apparatus of claim 14, wherein the processor is adapted to:
obtain usage statistics associated with the applications; obtain non-application data; and wherein said estimating is further based on the usage statistics and the non-application data. 18. The apparatus of claim 14, wherein said estimating is performed using a supervised classification algorithm which is trained with respect to a training set; wherein the training set comprises information relating to mobile devices for which demographic information relating to users using the mobile devices is obtainable from an installed application that requires a registration process or from an association with a profile of an online service. 19. A computer-implemented method performed by a mobile device having a processing unit, said method comprising:
obtaining a list of applications that are installed on said mobile device, wherein based on the list of applications, one or more demographic parameters of a user of said mobile device are determined; and performing a user engagement based on the estimated one or more demographic parameters. 20. The computer-implemented method of claim 19, wherein the user engagement is an advertisement serving. 21. The computer-implemented method of claim 19, wherein the user engagement is a User Interface manipulation. 22. A computer program product comprising:
a non-transitory computer readable medium retaining program instructions, which instructions when read by a processor of a mobile device, cause the processor to perform the steps of: obtaining a list of applications that are installed on the mobile device, wherein based on the list of applications, one or more demographic parameters of a user of said mobile device are determined; and performing a user engagement based on the estimated one or more demographic parameters. | Method, apparatus and product for content-based demographic estimation of users of mobile devices and usage thereof. One method comprising: obtaining a list of applications that are installed on a mobile device; and estimating, based on the list of applications, one or more demographic parameter of a user of the mobile device. Another method, that is performed by a mobile device, comprising: obtaining a list of applications that are installed on said mobile device, wherein based on the list of applications, one or more demographic parameters of a user of said mobile device are determined; and performing a user engagement based on the estimated one or more demographic parameters.1. A computer-implemented method performed by a processing unit, said method comprising:
obtaining a list of applications that are installed on a mobile device; and estimating, based on the list of applications, one or more demographic parameter of a user of the mobile device. 2. The computer-implemented method of claim 1, wherein the applications are downloadable applications, and wherein the applications are listed in an electronic catalog. 3. The computer-implemented method of claim 2, wherein the electronic catalog is associated with a mobile applications repository connectable over a computerized network. 4. The computer-implemented method of claim 1, wherein said obtaining comprises receiving from the mobile device the list of applications, and wherein said estimating is performed by a server comprising said processing unit, wherein the server is connectable via a network to the mobile device. 5. The computer-implemented method of claim 1 further comprises obtaining usage statistics associated with the applications, and wherein said estimating is further based on the usage statistics. 6. The computer-implemented method of claim 5, wherein the usage statistics comprising at least one of the following information:
installation time; order of installation; usage count; and last usage time. 7. The computer-implemented method of claim 1 further comprises obtaining non-application data, and wherein said estimating is further based on the non-application data. 8. The computer-implemented method of claim 7, wherein the non-application data comprises at least one of the following items:
statistics relating to non-application content in the mobile device; meta-data obtainable from digital files retained in the mobile device; a number of media files retained in the mobile device; one or more types of media files retained in the mobile device; origin of media files retained in the mobile device; and information relating to the mobile device. 9. The computer-implemented method of claim 1, wherein said estimating is performed using a classification algorithm. 10. The computer-implemented method of claim 9, wherein the classification algorithm is a supervised classification algorithm which is trained with respect to a training set. 11. The computer-implemented method of claim 10, wherein the training set comprises information relating to mobile devices for which demographic information relating to users using the mobile devices is obtainable from an installed application that requires a registration process or from an association with a profile of an online service. 12. The computer-implemented method of claim 1, wherein the list of applications that are installed on a mobile device is a partial list that excludes at least one application that is installed on the mobile device. 13. The computer-implemented method of claim 1, wherein the one or more demographic parameter comprises a user preference. 14. A computerized apparatus having a processor, the processor being adapted to perform the steps of:
obtaining a list of applications that are installed on a mobile device; and estimating, based on the list of applications, one or more demographic parameter of a user of the mobile device. 15. The apparatus of claim 14, wherein the applications are downloadable applications, wherein the applications are listed in an electronic catalog, and wherein the electronic catalog is associated with a mobile applications repository connectable over a computerized network. 16. The apparatus of claim 14, wherein said obtaining comprises receiving from the mobile device the list of applications. 17. The apparatus of claim 14, wherein the processor is adapted to:
obtain usage statistics associated with the applications; obtain non-application data; and wherein said estimating is further based on the usage statistics and the non-application data. 18. The apparatus of claim 14, wherein said estimating is performed using a supervised classification algorithm which is trained with respect to a training set; wherein the training set comprises information relating to mobile devices for which demographic information relating to users using the mobile devices is obtainable from an installed application that requires a registration process or from an association with a profile of an online service. 19. A computer-implemented method performed by a mobile device having a processing unit, said method comprising:
obtaining a list of applications that are installed on said mobile device, wherein based on the list of applications, one or more demographic parameters of a user of said mobile device are determined; and performing a user engagement based on the estimated one or more demographic parameters. 20. The computer-implemented method of claim 19, wherein the user engagement is an advertisement serving. 21. The computer-implemented method of claim 19, wherein the user engagement is a User Interface manipulation. 22. A computer program product comprising:
a non-transitory computer readable medium retaining program instructions, which instructions when read by a processor of a mobile device, cause the processor to perform the steps of: obtaining a list of applications that are installed on the mobile device, wherein based on the list of applications, one or more demographic parameters of a user of said mobile device are determined; and performing a user engagement based on the estimated one or more demographic parameters. | 2,100 |
5,330 | 5,330 | 14,098,033 | 2,154 | An aspect provides a method, including: accessing, using a processor, a user profile based on user context information, wherein the user context information utilizes user device events; preparing, using the processor, a list of items based on the user profile related to a particular time period organized according to importance based on the user profile; and presenting, using the processor, the list of items related to the particular time period. Other aspects are described and claimed. | 1. A method, comprising:
accessing, using a processor, a user profile based on user context information, wherein the user context information utilizes user device events; preparing, using the processor, a list of items based on the user profile related to a particular time period organized according to importance based on the user profile; and presenting, using the processor, the list of items related to the particular time period. 2. The method of claim 1, wherein the user device events include events selected from the group of events consisting of calendar entry events, device location related events, purchase events, and communication events. 3. The method of claim 1, wherein the presenting occurs at a predetermined time in the day. 4. The method of claim 3, wherein the predetermined time is user selectable. 5. The method of claim 1, wherein:
the user profile includes priority information; and the preparing comprises organizing the list of items according to the priority information. 6. The method of claim 5, wherein the priority information is user selectable. 7. The method of claim 6, wherein the priority information is associated with one or more device contacts selected by the user as important. 8. The method of claim 5, wherein the priority information is associated with one or more device events based on a frequency metric. 9. The method of claim 1, wherein the accessing is performed according to a timing policy. 10. The method of claim 9, wherein the preparing and presenting are performed daily. 11. An information handling device, comprising:
a processor; a memory device which stores instructions accessible to the processor, the instructions being executable by the processor to: access a user profile based on user context information, wherein the user context information utilizes user device events; prepare a list of items based on the user profile related to a particular time period organized according to importance based on the user profile; and present the list of items related to the particular time period. 12. The information handling device of claim 11, wherein the user device events include events selected from the group of events consisting of calendar entry events, device location related events, purchase events, and communication events. 13. The information handling device of claim 11, wherein the list of items is presented at a predetermined time in the day. 14. The information handling device of claim 13, wherein the predetermined time is user selectable. 15. The information handling device of claim 11, wherein:
the user profile includes priority information; and to prepare comprises organizing the list of items according to the priority information. 16. The information handling device of claim 15, wherein the priority information is user selectable. 17. The information handling device of claim 16, wherein the priority information is associated with one or more device contacts selected by the user as important. 18. The information handling device of claim 15, wherein the priority information is associated with one or more device events based on a frequency metric. 19. The information handling device of claim 11, wherein the user profile is accessed according to a timing policy. 20. A product, comprising:
a storage device having code stored therewith, the code comprising: code that accesses, using a processor, a user profile based on user context information, wherein the user context information utilizes user device events; code that prepares, using the processor, a list of items based on the user profile related to a particular time period organized according to importance based on the user profile; and code that presents, using the processor, the list of items related to the particular time period. | An aspect provides a method, including: accessing, using a processor, a user profile based on user context information, wherein the user context information utilizes user device events; preparing, using the processor, a list of items based on the user profile related to a particular time period organized according to importance based on the user profile; and presenting, using the processor, the list of items related to the particular time period. Other aspects are described and claimed.1. A method, comprising:
accessing, using a processor, a user profile based on user context information, wherein the user context information utilizes user device events; preparing, using the processor, a list of items based on the user profile related to a particular time period organized according to importance based on the user profile; and presenting, using the processor, the list of items related to the particular time period. 2. The method of claim 1, wherein the user device events include events selected from the group of events consisting of calendar entry events, device location related events, purchase events, and communication events. 3. The method of claim 1, wherein the presenting occurs at a predetermined time in the day. 4. The method of claim 3, wherein the predetermined time is user selectable. 5. The method of claim 1, wherein:
the user profile includes priority information; and the preparing comprises organizing the list of items according to the priority information. 6. The method of claim 5, wherein the priority information is user selectable. 7. The method of claim 6, wherein the priority information is associated with one or more device contacts selected by the user as important. 8. The method of claim 5, wherein the priority information is associated with one or more device events based on a frequency metric. 9. The method of claim 1, wherein the accessing is performed according to a timing policy. 10. The method of claim 9, wherein the preparing and presenting are performed daily. 11. An information handling device, comprising:
a processor; a memory device which stores instructions accessible to the processor, the instructions being executable by the processor to: access a user profile based on user context information, wherein the user context information utilizes user device events; prepare a list of items based on the user profile related to a particular time period organized according to importance based on the user profile; and present the list of items related to the particular time period. 12. The information handling device of claim 11, wherein the user device events include events selected from the group of events consisting of calendar entry events, device location related events, purchase events, and communication events. 13. The information handling device of claim 11, wherein the list of items is presented at a predetermined time in the day. 14. The information handling device of claim 13, wherein the predetermined time is user selectable. 15. The information handling device of claim 11, wherein:
the user profile includes priority information; and to prepare comprises organizing the list of items according to the priority information. 16. The information handling device of claim 15, wherein the priority information is user selectable. 17. The information handling device of claim 16, wherein the priority information is associated with one or more device contacts selected by the user as important. 18. The information handling device of claim 15, wherein the priority information is associated with one or more device events based on a frequency metric. 19. The information handling device of claim 11, wherein the user profile is accessed according to a timing policy. 20. A product, comprising:
a storage device having code stored therewith, the code comprising: code that accesses, using a processor, a user profile based on user context information, wherein the user context information utilizes user device events; code that prepares, using the processor, a list of items based on the user profile related to a particular time period organized according to importance based on the user profile; and code that presents, using the processor, the list of items related to the particular time period. | 2,100 |
5,331 | 5,331 | 14,337,519 | 2,179 | Implementations of the present disclosure include methods, systems, and computer-readable storage mediums for dynamically configuring a user interface for interacting with an application. Actions can include: receiving user input, the user input having been provided through the user interface; in response to receiving the user input, determining one or more expected user-actions based on a graph and the user input, the graph modeling user interactions with the application; obtaining one or more modifications based on the one or more expected user-actions; and transmitting instructions to modify the user interface based on the one or more modifications. | 1. A computer-implemented method for dynamically configuring a user interface for interacting with an application, the method being executed using one or more processors and comprising:
receiving, by the one or more processors, user input, the user input having been provided through the user interface; in response to receiving the user input, determining, by the one or more processors, one or more expected user-actions based on a graph and the user input, the graph modeling user interactions with the application; obtaining, by the one or more processors, one or more modifications based on the one or more expected user-actions; and transmitting, by the one or more processors, instructions to modify the user interface based on the one or more modifications. 2. The method of claim 1, wherein determining one or more expected user-actions comprises generating the graph based on the user input. 3. The method of claim 1, wherein the one or more modifications comprise at least one of:
combining two or more elements of the user interface; rearranging two or more elements of the user interface; and constructing one or more new user-interface elements. 4. The method of claim 1, wherein the graph comprises a node graph comprising:
a plurality of nodes, each of the nodes representing a respective element of the user interface; and a plurality of edges, each of the edges connecting a respective pair of nodes and representing a sequential interaction by one or more users with the pair of nodes. 5. The method of claim 4, wherein the edges of the graph comprise directed edges. 6. The method of claim 4, wherein the edges of the graph comprises time-weighted edges. 7. The method of claim 4, wherein determining one or more expected user-actions comprises implementing a clustering technique on the node graph. 8. The method of claim 1, wherein the graph corresponds to previous interactions with the application by a user that provided the user input through the user interface. 9. The method of claim 1, wherein the graph corresponds to previous interactions with the application by a class of multiple users. 10. The method of claim 9, wherein a user that provided the user interface is outside the class of multiple users. 11. The method of claim 1, wherein the user input was provided during a previous user session, and wherein transmitting instructions to modify the user interface occurs between user sessions. 12. The method of claim 1, wherein the user input was provided during a current user session, and wherein transmitting instructions to modify the user interface occurs in real time during the current user session as a user interacts with the application. 13. The method of claim 1, wherein the user interface comprises a default user interface. 14. The method of claim 1, wherein the user interface comprises a previously modified user interface. 15. The method of claim 1, wherein the application comprises a stock trading application facilitating buying and selling of securities by the user via the user interface. 16. The method of claim 1, wherein determining one or more expected user-actions based on the graph comprises accessing the graph via an in-memory database. 17. The method of claim 1, wherein the one or more modifications comprise a first set of modifications, and wherein the method further comprises:
providing a first modified user interface based on the first set of modifications; providing a second modified user interface based on a second set of modifications; and selecting, from the first and second modified user interfaces, a preferred user interface by implementing an A/B testing technique. 18. The method of claim 17, wherein the second set of modifications is obtained based on the one or more expected user-actions. 19. A non-transitory computer-readable storage medium coupled to one or more processors and having instructions stored thereon which, when executed by the one or more processors, cause the one or more processors to perform operations for dynamically configuring a user interface for interacting with an application, the operations comprising:
receiving, by the one or more processors, user input, the user input having been provided through the user interface; in response to receiving the user input, determining, by the one or more processors, one or more expected user-actions based on a graph and the user input, the graph modeling user interactions with the application; obtaining, by the one or more processors, one or more modifications based on the one or more expected user-actions; and transmitting, by the one or more processors, instructions to modify the user interface based on the one or more modifications. 20. A system, comprising:
a client-side computing device; and a computer-readable storage device coupled to the client-side computing device and having instructions stored thereon which, when executed by the client-side computing device, cause the client-side computing device to perform operations for dynamically configuring a user interface for interacting with an application, the operations comprising:
receiving, by the one or more processors, user input, the user input having been provided through the user interface;
in response to receiving the user input, determining, by the one or more processors, one or more expected user-actions based on a graph and the user input, the graph modeling user interactions with the application;
obtaining, by the one or more processors, one or more modifications based on the one or more expected user-actions; and
transmitting, by the one or more processors, instructions to modify the user interface based on the one or more modifications. | Implementations of the present disclosure include methods, systems, and computer-readable storage mediums for dynamically configuring a user interface for interacting with an application. Actions can include: receiving user input, the user input having been provided through the user interface; in response to receiving the user input, determining one or more expected user-actions based on a graph and the user input, the graph modeling user interactions with the application; obtaining one or more modifications based on the one or more expected user-actions; and transmitting instructions to modify the user interface based on the one or more modifications.1. A computer-implemented method for dynamically configuring a user interface for interacting with an application, the method being executed using one or more processors and comprising:
receiving, by the one or more processors, user input, the user input having been provided through the user interface; in response to receiving the user input, determining, by the one or more processors, one or more expected user-actions based on a graph and the user input, the graph modeling user interactions with the application; obtaining, by the one or more processors, one or more modifications based on the one or more expected user-actions; and transmitting, by the one or more processors, instructions to modify the user interface based on the one or more modifications. 2. The method of claim 1, wherein determining one or more expected user-actions comprises generating the graph based on the user input. 3. The method of claim 1, wherein the one or more modifications comprise at least one of:
combining two or more elements of the user interface; rearranging two or more elements of the user interface; and constructing one or more new user-interface elements. 4. The method of claim 1, wherein the graph comprises a node graph comprising:
a plurality of nodes, each of the nodes representing a respective element of the user interface; and a plurality of edges, each of the edges connecting a respective pair of nodes and representing a sequential interaction by one or more users with the pair of nodes. 5. The method of claim 4, wherein the edges of the graph comprise directed edges. 6. The method of claim 4, wherein the edges of the graph comprises time-weighted edges. 7. The method of claim 4, wherein determining one or more expected user-actions comprises implementing a clustering technique on the node graph. 8. The method of claim 1, wherein the graph corresponds to previous interactions with the application by a user that provided the user input through the user interface. 9. The method of claim 1, wherein the graph corresponds to previous interactions with the application by a class of multiple users. 10. The method of claim 9, wherein a user that provided the user interface is outside the class of multiple users. 11. The method of claim 1, wherein the user input was provided during a previous user session, and wherein transmitting instructions to modify the user interface occurs between user sessions. 12. The method of claim 1, wherein the user input was provided during a current user session, and wherein transmitting instructions to modify the user interface occurs in real time during the current user session as a user interacts with the application. 13. The method of claim 1, wherein the user interface comprises a default user interface. 14. The method of claim 1, wherein the user interface comprises a previously modified user interface. 15. The method of claim 1, wherein the application comprises a stock trading application facilitating buying and selling of securities by the user via the user interface. 16. The method of claim 1, wherein determining one or more expected user-actions based on the graph comprises accessing the graph via an in-memory database. 17. The method of claim 1, wherein the one or more modifications comprise a first set of modifications, and wherein the method further comprises:
providing a first modified user interface based on the first set of modifications; providing a second modified user interface based on a second set of modifications; and selecting, from the first and second modified user interfaces, a preferred user interface by implementing an A/B testing technique. 18. The method of claim 17, wherein the second set of modifications is obtained based on the one or more expected user-actions. 19. A non-transitory computer-readable storage medium coupled to one or more processors and having instructions stored thereon which, when executed by the one or more processors, cause the one or more processors to perform operations for dynamically configuring a user interface for interacting with an application, the operations comprising:
receiving, by the one or more processors, user input, the user input having been provided through the user interface; in response to receiving the user input, determining, by the one or more processors, one or more expected user-actions based on a graph and the user input, the graph modeling user interactions with the application; obtaining, by the one or more processors, one or more modifications based on the one or more expected user-actions; and transmitting, by the one or more processors, instructions to modify the user interface based on the one or more modifications. 20. A system, comprising:
a client-side computing device; and a computer-readable storage device coupled to the client-side computing device and having instructions stored thereon which, when executed by the client-side computing device, cause the client-side computing device to perform operations for dynamically configuring a user interface for interacting with an application, the operations comprising:
receiving, by the one or more processors, user input, the user input having been provided through the user interface;
in response to receiving the user input, determining, by the one or more processors, one or more expected user-actions based on a graph and the user input, the graph modeling user interactions with the application;
obtaining, by the one or more processors, one or more modifications based on the one or more expected user-actions; and
transmitting, by the one or more processors, instructions to modify the user interface based on the one or more modifications. | 2,100 |
5,332 | 5,332 | 13,816,753 | 2,176 | A method and apparatus are described for controlling a highlighting of one of a plurality of operational objects on a display. A spatially continuous movement of a pointing position on the display, which is provided by a user by means of a user input interface is converted in the highlighting of one of the plurality of objects. If the pointing position coincides with one of the plurality of objects, this object is highlighted ( 130 ). When the pointing position is on empty space between the objects, an appropriate one of the plurality of objects is highlighted ( 160 ). The parameter used to determine the object to be highlighted is at least the distance from the pointing position to the objects. | 1. A method of controlling a highlighting of one of a plurality of objects on a display comprising the step of:
obtaining a spatially continuous movement of a pointing position on the display, the pointing position being provided via a user input interface; as long as the pointing position coincides with a first one of the plurality of objects, controlling the first one of the plurality of objects to be highlighted; and when the pointing position approaches a second one of the plurality of objects, controlling the highlighting to jump from the first one to the second one of the plurality of objects (160), wherein the jumping of the highlighting is controlled based on a distance of the pointing position to at least said second one of the plurality of objects and on a direction of the movement of the being avoided if the direction of the movement moves away from the objects. 2. (canceled) 3. The method according to claim 1, wherein the jumping of the highlighting is controlled based on a distance of the pointing position to said first one of the plurality of objects. 4. (canceled) 5. The method according to claim 1, wherein the jumping of the highlighting is controlled based on a velocity, an acceleration, or an deceleration of the movement of the pointing position. 6. The method according to claim 1, wherein the pointing position is not displayed. 7. The method according to claim 1, wherein the pointing position is beyond the display. 8. The method according to claim 7, wherein at least some of the plurality of objects are placed in a row and wherein if the pointing position is beyond the display in a prolongation of the row, the plurality of objects in the row are controlled to scroll over the display. 9. The method according to claim 8, wherein a speed of scrolling is dependent on a distance of the pointing position to the display. 10. The method according to claim 1, wherein after the continuous movement of the pointing position has ended, a last highlighted object is controlled to remain highlighted. 11. The method according to claim 1, wherein when the continuous movement of the pointing position is started, the pointing position is controlled to be at the center of a currently highlighted object. 12. A computer readable tangible medium having a computer program code stored thereon adapted to perform a method according to claim 1. 13. An apparatus comprising a controller for controlling a highlighting of one of a plurality of objects on a display, the controller being configured for:
obtaining a spatially continuous movement of a pointing position on the display, the pointing position being provided via a user input interface; as long as the pointing position coincides with a first one of the plurality of objects, controlling the first one of the plurality of objects to be highlighted; and when the pointing position approaches a second one of the plurality of objects, controlling the highlighting to jump from the first one to the second one of the plurality of objects), wherein the jumping of the highlighting is controlled based on a distance of the pointing position to at least said second one of the plurality of objects and on a direction of the movement of the pointing avoided if the direction of the movement moves away from the objects. 14. The apparatus according to claim 13, wherein the controller is configured for:
controlling the jumping of the highlighting based on at least one of: a distance of the pointing position to said first one of the plurality of objects, a direction of the movement of the pointing position, a velocity thereof, an acceleration thereof and an deceleration thereof. 15. The apparatus according to claim 13, wherein the controller is configured for:
after the continuous movement of the pointing position has ended, controlling a last highlighted object to remain highlighted and when the continuous movement of the pointing position is started, controlling the pointing position to be at the center of a currently highlighted object. 16. The method according to claim 3, wherein a hysteresis is added to the calculated distances in order to avoid the highlighting jumping back and forth. | A method and apparatus are described for controlling a highlighting of one of a plurality of operational objects on a display. A spatially continuous movement of a pointing position on the display, which is provided by a user by means of a user input interface is converted in the highlighting of one of the plurality of objects. If the pointing position coincides with one of the plurality of objects, this object is highlighted ( 130 ). When the pointing position is on empty space between the objects, an appropriate one of the plurality of objects is highlighted ( 160 ). The parameter used to determine the object to be highlighted is at least the distance from the pointing position to the objects.1. A method of controlling a highlighting of one of a plurality of objects on a display comprising the step of:
obtaining a spatially continuous movement of a pointing position on the display, the pointing position being provided via a user input interface; as long as the pointing position coincides with a first one of the plurality of objects, controlling the first one of the plurality of objects to be highlighted; and when the pointing position approaches a second one of the plurality of objects, controlling the highlighting to jump from the first one to the second one of the plurality of objects (160), wherein the jumping of the highlighting is controlled based on a distance of the pointing position to at least said second one of the plurality of objects and on a direction of the movement of the being avoided if the direction of the movement moves away from the objects. 2. (canceled) 3. The method according to claim 1, wherein the jumping of the highlighting is controlled based on a distance of the pointing position to said first one of the plurality of objects. 4. (canceled) 5. The method according to claim 1, wherein the jumping of the highlighting is controlled based on a velocity, an acceleration, or an deceleration of the movement of the pointing position. 6. The method according to claim 1, wherein the pointing position is not displayed. 7. The method according to claim 1, wherein the pointing position is beyond the display. 8. The method according to claim 7, wherein at least some of the plurality of objects are placed in a row and wherein if the pointing position is beyond the display in a prolongation of the row, the plurality of objects in the row are controlled to scroll over the display. 9. The method according to claim 8, wherein a speed of scrolling is dependent on a distance of the pointing position to the display. 10. The method according to claim 1, wherein after the continuous movement of the pointing position has ended, a last highlighted object is controlled to remain highlighted. 11. The method according to claim 1, wherein when the continuous movement of the pointing position is started, the pointing position is controlled to be at the center of a currently highlighted object. 12. A computer readable tangible medium having a computer program code stored thereon adapted to perform a method according to claim 1. 13. An apparatus comprising a controller for controlling a highlighting of one of a plurality of objects on a display, the controller being configured for:
obtaining a spatially continuous movement of a pointing position on the display, the pointing position being provided via a user input interface; as long as the pointing position coincides with a first one of the plurality of objects, controlling the first one of the plurality of objects to be highlighted; and when the pointing position approaches a second one of the plurality of objects, controlling the highlighting to jump from the first one to the second one of the plurality of objects), wherein the jumping of the highlighting is controlled based on a distance of the pointing position to at least said second one of the plurality of objects and on a direction of the movement of the pointing avoided if the direction of the movement moves away from the objects. 14. The apparatus according to claim 13, wherein the controller is configured for:
controlling the jumping of the highlighting based on at least one of: a distance of the pointing position to said first one of the plurality of objects, a direction of the movement of the pointing position, a velocity thereof, an acceleration thereof and an deceleration thereof. 15. The apparatus according to claim 13, wherein the controller is configured for:
after the continuous movement of the pointing position has ended, controlling a last highlighted object to remain highlighted and when the continuous movement of the pointing position is started, controlling the pointing position to be at the center of a currently highlighted object. 16. The method according to claim 3, wherein a hysteresis is added to the calculated distances in order to avoid the highlighting jumping back and forth. | 2,100 |
5,333 | 5,333 | 13,899,305 | 2,163 | In one embodiment, a method includes receiving an update of activity associated with one or more content objects associated with a search term. The search term is associated with a number of content objects exceeding a pre-determined threshold number. The content objects associated with the search term are indexed on a list of one or more index servers. The list includes identifier information corresponding to the content objects. The method also includes modifying the list of one or more of the index servers in response to the update. | 1. A method comprising:
by one or more computing devices, receiving an update of activity associated with one or more content objects associated with a search term, the search term being associated with a number of content objects exceeding a pre-determined threshold number, the content objects associated with the search term being indexed on one or more index servers comprising a list of identifier information corresponding to the content objects; and by one or more computing devices, modifying the list of one or more of the index servers in response to the update. 2. The method of claim 1, wherein the list comprises a base layer and an update layer, identifier information of the base layer being updated at a pre-determined interval, identifier information of the update layer being updated prior to the pre-determined interval. 3. The method of claim 2, wherein the modification comprises, by one or more computing devices, adding identifier information of the content object associated with the activity to the update layer in response to the activity being uploading the content object. 4. The method of claim 2, wherein the modification comprises, by one or more computing devices, providing an indication in the update layer that the content object associated with the activity is no longer associated with the search term in response to the activity deleting the content object. 5. The method of claim 1, further comprises, by one or more computing devices, returning one or more search results of a search query comprising the search term and another search term associated with one or more content objects indexed by a term server, the search result being determined at least in part on the content object associated with the activity and one or more content objects determined through an intersection of identifier information of the list and identifier information of a list of content objects associated with the other search term. 6. The method of claim 1, wherein the list comprises identifier information associated with content objects of a single content object type. 7. The method of claim 1, further comprising:
by one or more computing devices, generating a list associated with another search term on one or more index servers in response to a number content objects associated with the other search term exceeding the pre-determined threshold number; and by one or more computing devices, populating the list of one or more of the index servers associated with the other search term with identifier information of one or more content objects indexed by a term server. 8. The method of claim 7, further comprising, by one or more computing device, deleting the search term and list of the term server associated with the other search term. 9. One or more computer-readable non-transitory storage media embodying software configured when executed to:
receive an update of activity associated with one or more content objects associated with a search term, the search term being associated with a number of content objects exceeding a pre-determined threshold number, the content objects associated with the search term being indexed on one or more index servers comprising a list identifier information corresponding to the content objects; and modify the list of one or more of the index servers in response to the update. 10. The media of claim 9, wherein the list comprises a base layer and an update layer, identifier information of the base layer being updated at a pre-determined interval, identifier information of the update layer being updated prior to the pre-determined interval. 11. The media of claim 10, wherein the software is further configured to add identifier information of the content object associated with the activity to the update layer in response to the activity being uploading the content object. 12. The media of claim 10, wherein the software is further configured to provide an indication in the update layer that the content object associated with the activity is no longer associated with the search term in response to the activity deleting the content object. 13. The media of claim 9, wherein the software is further configured to return one or more search results of a search query comprising the search term and another search term associated with one or more content objects indexed by a term server, the search result being determined at least in part on the content object associated with the activity and one or more content objects determined through an intersection of identifier information of the list and identifier information of a list of content objects associated with the other search term. 14. The media of claim 9, wherein the list comprises identifier information associated with content objects of a single content object type. 15. The media of claim 9, wherein the software is further configured to:
generate a list associated with another search term on one or more index servers in response to a number content objects associated with the other search term exceeding the pre-determined threshold number; and populate the list of one or more of the index servers associated with the other search term with identifier information of one or more content objects indexed by a term server. 16. The media of claim 15, wherein the software is further configured to delete the search term and list of the term server associated with the other search term. 17. A device comprising:
a processor; and one or more computer-readable non-transitory storage media coupled to the processor and embodying software that:
receive an update of activity associated with one or more content objects associated with a search term, the search term being associated with a number of content objects exceeding a pre-determined threshold number, the content objects associated with the search term being indexed on one or more index servers comprising a list of identifier information corresponding to the content objects; and
modify the list of one or more of the index servers in response to the update. 18. The device of claim 17, wherein the list comprises a base layer and an update layer, identifier information of the base layer being updated at a pre-determined interval, identifier information of the update layer being updated prior to the pre-determined interval. 19. The device of claim 18, wherein the software is further configured to add identifier information of the content object associated with the activity to the update layer in response to the activity being uploading the content object. 20. The device of claim 18, wherein the software is further configured to add identifier information of the content object associated with the activity to the update layer in response to the activity being uploading the content object. | In one embodiment, a method includes receiving an update of activity associated with one or more content objects associated with a search term. The search term is associated with a number of content objects exceeding a pre-determined threshold number. The content objects associated with the search term are indexed on a list of one or more index servers. The list includes identifier information corresponding to the content objects. The method also includes modifying the list of one or more of the index servers in response to the update.1. A method comprising:
by one or more computing devices, receiving an update of activity associated with one or more content objects associated with a search term, the search term being associated with a number of content objects exceeding a pre-determined threshold number, the content objects associated with the search term being indexed on one or more index servers comprising a list of identifier information corresponding to the content objects; and by one or more computing devices, modifying the list of one or more of the index servers in response to the update. 2. The method of claim 1, wherein the list comprises a base layer and an update layer, identifier information of the base layer being updated at a pre-determined interval, identifier information of the update layer being updated prior to the pre-determined interval. 3. The method of claim 2, wherein the modification comprises, by one or more computing devices, adding identifier information of the content object associated with the activity to the update layer in response to the activity being uploading the content object. 4. The method of claim 2, wherein the modification comprises, by one or more computing devices, providing an indication in the update layer that the content object associated with the activity is no longer associated with the search term in response to the activity deleting the content object. 5. The method of claim 1, further comprises, by one or more computing devices, returning one or more search results of a search query comprising the search term and another search term associated with one or more content objects indexed by a term server, the search result being determined at least in part on the content object associated with the activity and one or more content objects determined through an intersection of identifier information of the list and identifier information of a list of content objects associated with the other search term. 6. The method of claim 1, wherein the list comprises identifier information associated with content objects of a single content object type. 7. The method of claim 1, further comprising:
by one or more computing devices, generating a list associated with another search term on one or more index servers in response to a number content objects associated with the other search term exceeding the pre-determined threshold number; and by one or more computing devices, populating the list of one or more of the index servers associated with the other search term with identifier information of one or more content objects indexed by a term server. 8. The method of claim 7, further comprising, by one or more computing device, deleting the search term and list of the term server associated with the other search term. 9. One or more computer-readable non-transitory storage media embodying software configured when executed to:
receive an update of activity associated with one or more content objects associated with a search term, the search term being associated with a number of content objects exceeding a pre-determined threshold number, the content objects associated with the search term being indexed on one or more index servers comprising a list identifier information corresponding to the content objects; and modify the list of one or more of the index servers in response to the update. 10. The media of claim 9, wherein the list comprises a base layer and an update layer, identifier information of the base layer being updated at a pre-determined interval, identifier information of the update layer being updated prior to the pre-determined interval. 11. The media of claim 10, wherein the software is further configured to add identifier information of the content object associated with the activity to the update layer in response to the activity being uploading the content object. 12. The media of claim 10, wherein the software is further configured to provide an indication in the update layer that the content object associated with the activity is no longer associated with the search term in response to the activity deleting the content object. 13. The media of claim 9, wherein the software is further configured to return one or more search results of a search query comprising the search term and another search term associated with one or more content objects indexed by a term server, the search result being determined at least in part on the content object associated with the activity and one or more content objects determined through an intersection of identifier information of the list and identifier information of a list of content objects associated with the other search term. 14. The media of claim 9, wherein the list comprises identifier information associated with content objects of a single content object type. 15. The media of claim 9, wherein the software is further configured to:
generate a list associated with another search term on one or more index servers in response to a number content objects associated with the other search term exceeding the pre-determined threshold number; and populate the list of one or more of the index servers associated with the other search term with identifier information of one or more content objects indexed by a term server. 16. The media of claim 15, wherein the software is further configured to delete the search term and list of the term server associated with the other search term. 17. A device comprising:
a processor; and one or more computer-readable non-transitory storage media coupled to the processor and embodying software that:
receive an update of activity associated with one or more content objects associated with a search term, the search term being associated with a number of content objects exceeding a pre-determined threshold number, the content objects associated with the search term being indexed on one or more index servers comprising a list of identifier information corresponding to the content objects; and
modify the list of one or more of the index servers in response to the update. 18. The device of claim 17, wherein the list comprises a base layer and an update layer, identifier information of the base layer being updated at a pre-determined interval, identifier information of the update layer being updated prior to the pre-determined interval. 19. The device of claim 18, wherein the software is further configured to add identifier information of the content object associated with the activity to the update layer in response to the activity being uploading the content object. 20. The device of claim 18, wherein the software is further configured to add identifier information of the content object associated with the activity to the update layer in response to the activity being uploading the content object. | 2,100 |
5,334 | 5,334 | 13,899,353 | 2,163 | In one embodiment, a method includes receiving an update of activity associated with one or more content objects associated with a search term. The content objects associated with the search term are indexed on a list of one or more index servers or a term server. The list of the term server include identifier information of one or more content object types. The list of the index servers include identifier information of a single content object type. The method also includes determining whether the search term has a number of associated content objects exceeding a pre-determined threshold number; and modifying the list associated with the search term of a term server or one or more of the index servers based at least in part on the determination and in response to the update. | 1. A method comprising:
by one or more computing devices, receiving an update of activity associated with one or more content objects associated with a search term, the content objects associated with the search term being indexed on one or more index servers or a term server, the term server comprising a list of identifier information of one or more content object types, each index server comprising a list identifier information of a single content object type; by one or more computing devices, determining whether the search term has a number of associated content objects exceeding a pre-determined threshold number; and by one or more computing devices, modifying the list associated with the search term of a term server or one or more of the index servers based at least in part on the determination and in response to the update. 2. The method of claim 1, wherein each list comprises a base layer and an update layer, identifier information of the base layer being updated at a pre-determined interval, identifier information of the update layer being updated prior to the pre-determined interval. 3. The method of claim 2, wherein the modification comprises, by one or more computing devices, adding identifier information of the content object associated with the activity to the update layer of the list of one or more of the index servers associated with the search term based at least in part on the number of content objects associated with the search term exceeding the pre-determined threshold number. 4. The method of claim 2, wherein the modification comprises, by one or more computing devices, adding identifier information of the content object associated with the activity to the update layer of the list of the term server associated with the search term based at least in part on the number of content objects associated with the search term being less than the pre-determined threshold number. 5. The method of claim 1, further comprises, by one or more computing devices, providing an indication to the term and index servers that the content object associated with the activity is no longer associated with the search term in response to the activity deleting the content object. 6. The method of claim 1, further comprises, by one or more computing devices, generating a new list associated with a new search term on a particular term server in response to the new search term being added to a search index. 7. The method of claim 1, further comprises:
by one or more computing devices, receiving a search query comprising the search term and the other search term; by one or more computing devices, accessing the list of the term server or one or more index servers associated with the search term and the other search term based at least in part on the determination; by one or more computing devices, determining one or more search results based at least in part on an intersection of the identifier information of one or more lists associated with the search term and one or more list associated with the other search term; and by one or more computing device, providing for presentation one or more content objects corresponding to the search results of the search query. 8. The method of claim 1, further comprising:
by one or more computing devices, generating a list associated with the search term on one or more index servers in response to the number content objects associated with the search term exceeding the pre-determined threshold number due to the update; and by one or more computing devices, populating the list of one or more of the index servers associated with the other search term with identifier information of one or more content objects indexed by a term server; and by one or more computing device, deleting the search term and a list associated with the search term from of the term server. 9. One or more computer-readable non-transitory storage media embodying software configured when executed to:
receive an update of activity associated with one or more content objects associated with a search term, the content objects associated with the search term being indexed on one or more index servers or a term server, the term server comprising a list of identifier information of one or more content object types, each index server comprising a list identifier information of a single content object type; determine whether the search term has a number of associated content objects exceeding a pre-determined threshold number; and modify the list associated with the search term of a term server or one or more of the index servers based at least in part on the determination and in response to the update. 10. The media of claim 9, wherein each list comprises a base layer and an update layer, identifier information of the base layer being updated at a pre-determined interval, identifier information of the update layer being updated prior to the pre-determined interval. 11. The media of claim 10, wherein the software is further configured to add identifier information of the content object associated with the activity to the update layer of the list of one or more of the index servers associated with the search term based at least in part on the number of content objects associated with the search term exceeding the pre-determined threshold number. 12. The media of claim 10, wherein the software is further configured to add identifier information of the content object associated with the activity to the update layer of the list of the term server associated with the search term based at least in part on the number of content objects associated with the search term being less than the pre-determined threshold number. 13. The media of claim 9, wherein the software is further configured to provide an indication to the term and index servers that the content object associated with the activity is no longer associated with the search term in response to the activity deleting the content object. 14. The media of claim 9, wherein the software is further configured to generate a new list associated with a new search term on a particular term server in response to the new search term being added to a search index. 15. The media of claim 9, wherein the software is further configured to:
receive a search query comprising the search term and other search term; access the list of the term server or one or more index servers associated with the search term and the other search term based at least in part on the determination; determine one or more search results based at least in part on an intersection of the identifier information of one or more lists associated with the search term and one or more list associated with the other search term; and provide for presentation one or more content objects corresponding to the search results of the search query. 16. The media of claim 9, wherein the software is further configured to:
generate a list associated with the search term on one or more index servers in response to the number content objects associated with the search term exceeding the pre-determined threshold number due to the update; and populate the list of one or more of the index servers associated with the other search term with identifier information of one or more content objects indexed by a term server; and delete the search term and a list associated with the search term from of the term server. 17. A device comprising:
a processor; and one or more computer-readable non-transitory storage media coupled to the processor and embodying software that:
receive an update of activity associated with one or more content objects associated with a search term, the content objects associated with the search term being indexed on one or more index servers or a term server, the term server comprising a list of identifier information of one or more content object types, each index server comprising a list identifier information of a single content object type;
determine whether the search term has a number of associated content objects exceeding a pre-determined threshold number; and
modify the list associated with the search term of a term server or one or more of the index servers based at least in part on the determination and in response to the update. 18. The device of claim 17, wherein each list comprises a base layer and an update layer, identifier information of the base layer being updated at a pre-determined interval, identifier information of the update layer being updated prior to the pre-determined interval. 19. The device of claim 18, wherein the software is further configured to add identifier information of the content object associated with the activity to the update layer of the list of one or more of the index servers associated with the search term based at least in part on the number of content objects associated with the search term exceeding the pre-determined threshold number. 20. The device of claim 18, wherein the software is further configured to add identifier information of the content object associated with the activity to the update layer of the list of the term server associated with the search term based at least in part on the number of content objects associated with the search term being less than the pre-determined threshold number. | In one embodiment, a method includes receiving an update of activity associated with one or more content objects associated with a search term. The content objects associated with the search term are indexed on a list of one or more index servers or a term server. The list of the term server include identifier information of one or more content object types. The list of the index servers include identifier information of a single content object type. The method also includes determining whether the search term has a number of associated content objects exceeding a pre-determined threshold number; and modifying the list associated with the search term of a term server or one or more of the index servers based at least in part on the determination and in response to the update.1. A method comprising:
by one or more computing devices, receiving an update of activity associated with one or more content objects associated with a search term, the content objects associated with the search term being indexed on one or more index servers or a term server, the term server comprising a list of identifier information of one or more content object types, each index server comprising a list identifier information of a single content object type; by one or more computing devices, determining whether the search term has a number of associated content objects exceeding a pre-determined threshold number; and by one or more computing devices, modifying the list associated with the search term of a term server or one or more of the index servers based at least in part on the determination and in response to the update. 2. The method of claim 1, wherein each list comprises a base layer and an update layer, identifier information of the base layer being updated at a pre-determined interval, identifier information of the update layer being updated prior to the pre-determined interval. 3. The method of claim 2, wherein the modification comprises, by one or more computing devices, adding identifier information of the content object associated with the activity to the update layer of the list of one or more of the index servers associated with the search term based at least in part on the number of content objects associated with the search term exceeding the pre-determined threshold number. 4. The method of claim 2, wherein the modification comprises, by one or more computing devices, adding identifier information of the content object associated with the activity to the update layer of the list of the term server associated with the search term based at least in part on the number of content objects associated with the search term being less than the pre-determined threshold number. 5. The method of claim 1, further comprises, by one or more computing devices, providing an indication to the term and index servers that the content object associated with the activity is no longer associated with the search term in response to the activity deleting the content object. 6. The method of claim 1, further comprises, by one or more computing devices, generating a new list associated with a new search term on a particular term server in response to the new search term being added to a search index. 7. The method of claim 1, further comprises:
by one or more computing devices, receiving a search query comprising the search term and the other search term; by one or more computing devices, accessing the list of the term server or one or more index servers associated with the search term and the other search term based at least in part on the determination; by one or more computing devices, determining one or more search results based at least in part on an intersection of the identifier information of one or more lists associated with the search term and one or more list associated with the other search term; and by one or more computing device, providing for presentation one or more content objects corresponding to the search results of the search query. 8. The method of claim 1, further comprising:
by one or more computing devices, generating a list associated with the search term on one or more index servers in response to the number content objects associated with the search term exceeding the pre-determined threshold number due to the update; and by one or more computing devices, populating the list of one or more of the index servers associated with the other search term with identifier information of one or more content objects indexed by a term server; and by one or more computing device, deleting the search term and a list associated with the search term from of the term server. 9. One or more computer-readable non-transitory storage media embodying software configured when executed to:
receive an update of activity associated with one or more content objects associated with a search term, the content objects associated with the search term being indexed on one or more index servers or a term server, the term server comprising a list of identifier information of one or more content object types, each index server comprising a list identifier information of a single content object type; determine whether the search term has a number of associated content objects exceeding a pre-determined threshold number; and modify the list associated with the search term of a term server or one or more of the index servers based at least in part on the determination and in response to the update. 10. The media of claim 9, wherein each list comprises a base layer and an update layer, identifier information of the base layer being updated at a pre-determined interval, identifier information of the update layer being updated prior to the pre-determined interval. 11. The media of claim 10, wherein the software is further configured to add identifier information of the content object associated with the activity to the update layer of the list of one or more of the index servers associated with the search term based at least in part on the number of content objects associated with the search term exceeding the pre-determined threshold number. 12. The media of claim 10, wherein the software is further configured to add identifier information of the content object associated with the activity to the update layer of the list of the term server associated with the search term based at least in part on the number of content objects associated with the search term being less than the pre-determined threshold number. 13. The media of claim 9, wherein the software is further configured to provide an indication to the term and index servers that the content object associated with the activity is no longer associated with the search term in response to the activity deleting the content object. 14. The media of claim 9, wherein the software is further configured to generate a new list associated with a new search term on a particular term server in response to the new search term being added to a search index. 15. The media of claim 9, wherein the software is further configured to:
receive a search query comprising the search term and other search term; access the list of the term server or one or more index servers associated with the search term and the other search term based at least in part on the determination; determine one or more search results based at least in part on an intersection of the identifier information of one or more lists associated with the search term and one or more list associated with the other search term; and provide for presentation one or more content objects corresponding to the search results of the search query. 16. The media of claim 9, wherein the software is further configured to:
generate a list associated with the search term on one or more index servers in response to the number content objects associated with the search term exceeding the pre-determined threshold number due to the update; and populate the list of one or more of the index servers associated with the other search term with identifier information of one or more content objects indexed by a term server; and delete the search term and a list associated with the search term from of the term server. 17. A device comprising:
a processor; and one or more computer-readable non-transitory storage media coupled to the processor and embodying software that:
receive an update of activity associated with one or more content objects associated with a search term, the content objects associated with the search term being indexed on one or more index servers or a term server, the term server comprising a list of identifier information of one or more content object types, each index server comprising a list identifier information of a single content object type;
determine whether the search term has a number of associated content objects exceeding a pre-determined threshold number; and
modify the list associated with the search term of a term server or one or more of the index servers based at least in part on the determination and in response to the update. 18. The device of claim 17, wherein each list comprises a base layer and an update layer, identifier information of the base layer being updated at a pre-determined interval, identifier information of the update layer being updated prior to the pre-determined interval. 19. The device of claim 18, wherein the software is further configured to add identifier information of the content object associated with the activity to the update layer of the list of one or more of the index servers associated with the search term based at least in part on the number of content objects associated with the search term exceeding the pre-determined threshold number. 20. The device of claim 18, wherein the software is further configured to add identifier information of the content object associated with the activity to the update layer of the list of the term server associated with the search term based at least in part on the number of content objects associated with the search term being less than the pre-determined threshold number. | 2,100 |
5,335 | 5,335 | 15,152,509 | 2,193 | Techniques are described herein that are capable of providing backend custom code extensibility. Such extensibility allows custom code to be automatically loaded dynamically (e.g., on-demand) in a runtime that is hosted by a backend-as-a-service (BaaS) module while the runtime is running to provide custom backend features that are defined by the custom code to an application in response to receipt of a request from the application. | 1. A method of providing backend custom code extensibility, the method comprising:
receiving custom code from a user for incorporation into a backend-as-a-service module that is configured to provide a backend service to a corresponding application; and in response to receipt of a request from the corresponding application, automatically loading the custom code dynamically in a runtime hosted by the backend-as-a-service module while the runtime is running, using at least one element that includes at least one of (a) one or more processors, (b) physical hardware, or (c) electrical circuitry, to provide custom backend features that are defined by the custom code to the corresponding application. 2. The method of claim 1, wherein the runtime is a native runtime of the custom code. 3. The method of claim 1, wherein automatically loading the custom code dynamically in the runtime comprises:
automatically loading the custom code dynamically in the runtime without necessitating that the runtime be re-loaded. 4. The method of claim 1, wherein automatically loading the custom code dynamically in the runtime comprises:
automatically loading the custom code, which is operable to explicitly invoke a default operation and to modify one or more inputs of the default operation before the default operation is performed, dynamically in the runtime while the runtime is running. 5. The method of claim 1, wherein automatically loading the custom code dynamically in the runtime comprises:
automatically loading the custom code, which is operable to explicitly invoke a default operation and to modify one or more outputs of the default operation by the custom code after the default operation is performed, dynamically in the runtime while the runtime is running. 6. The method of claim 1, wherein automatically loading the custom code dynamically in the runtime comprises:
automatically loading the custom code, which is operable to call into the runtime to use one or more services that are provided by the runtime, dynamically in the runtime while the runtime is running. 7. The method of claim 1, further comprising:
monitoring the custom code, using the runtime, while the custom code runs to determine whether at least one of a failure of the custom code or a bug in the custom code causes the corresponding application to become unresponsive. 8. The method of claim 1, further comprising:
provisioning a website, a database, and a set of uniform resource identifiers that correspond to the custom code in response to receiving the custom code; receiving a URI request at the back-end-as-a-service module that identifies at least one of the uniform resource identifiers in response to receipt of the request from the corresponding application; and executing the custom code in response to receiving the URI request. 9. A system to provide backend custom code extensibility, the system comprising:
at least one element comprising at least one of (a) a processor, (b) hardware logic, or (c) electrical circuitry; an interface configured to receive custom code for incorporation into a backend-as-a-service module that is configured to provide a backend service to a corresponding application; and auto-load logic, implemented using the at least one element, configured to automatically load the custom code dynamically in a runtime hosted by the backend-as-a-service module while the runtime is running to provide custom backend features that are defined by the custom code to the corresponding application in response to receipt of a request from the corresponding application. 10. The system of claim 9, wherein the runtime is a native runtime of the custom code. 11. The system of claim 9, wherein the custom code is operable to access code modules that are external to the custom code. 12. The system of claim 9, wherein the custom code is operable to explicitly invoke a default operation and to modify one or more inputs of the default operation before the default operation is performed. 13. The system of claim 9, wherein the runtime is configured to monitor the custom code while the custom code runs to determine whether at least one of a failure of the custom code or a bug in the custom code causes the corresponding application to become unresponsive. 14. The system of claim 9, wherein the custom code is operable to call into the runtime to use one or more services that are provided by the runtime. 15. The system of claim 9, wherein the auto-load logic is configured to automatically load the custom code dynamically in the runtime without necessitating that the runtime be re-loaded. 16. The system of claim 9, further comprising:
provisioning logic configured to provision a website, a database, and a set of uniform resource identifiers that correspond to the custom code in response to receipt of the custom code; and execution logic configured to execute the custom code in response to receipt of the request from the corresponding application and further in response to receipt of a URI request that identifies at least one of the uniform resource identifiers. 17. A computer program product comprising a computer-readable storage medium having computer program logic recorded thereon for enabling a processor-based system to provide backend custom code extensibility, the computer program product comprising:
a program logic module for enabling the processor-based system to automatically load custom code, which is configured for incorporation into a backend-as-a-service module, dynamically in a runtime hosted by the backend-as-a-service module while the runtime is running to provide custom backend features that are defined by the custom code to a corresponding application in response to receipt of a request from the corresponding application, the backend-as-a-service module configured to provide a backend service to the corresponding application. 18. The computer program product of claim 17, wherein the runtime is a native runtime of the custom code. 19. The computer program product of claim 17, wherein the custom code is operable to explicitly invoke a default operation and to modify one or more inputs of the default operation before the default operation is performed. 20. The computer program product of claim 17, wherein the custom code is operable to call into the runtime to use one or more services that are provided by the runtime. | Techniques are described herein that are capable of providing backend custom code extensibility. Such extensibility allows custom code to be automatically loaded dynamically (e.g., on-demand) in a runtime that is hosted by a backend-as-a-service (BaaS) module while the runtime is running to provide custom backend features that are defined by the custom code to an application in response to receipt of a request from the application.1. A method of providing backend custom code extensibility, the method comprising:
receiving custom code from a user for incorporation into a backend-as-a-service module that is configured to provide a backend service to a corresponding application; and in response to receipt of a request from the corresponding application, automatically loading the custom code dynamically in a runtime hosted by the backend-as-a-service module while the runtime is running, using at least one element that includes at least one of (a) one or more processors, (b) physical hardware, or (c) electrical circuitry, to provide custom backend features that are defined by the custom code to the corresponding application. 2. The method of claim 1, wherein the runtime is a native runtime of the custom code. 3. The method of claim 1, wherein automatically loading the custom code dynamically in the runtime comprises:
automatically loading the custom code dynamically in the runtime without necessitating that the runtime be re-loaded. 4. The method of claim 1, wherein automatically loading the custom code dynamically in the runtime comprises:
automatically loading the custom code, which is operable to explicitly invoke a default operation and to modify one or more inputs of the default operation before the default operation is performed, dynamically in the runtime while the runtime is running. 5. The method of claim 1, wherein automatically loading the custom code dynamically in the runtime comprises:
automatically loading the custom code, which is operable to explicitly invoke a default operation and to modify one or more outputs of the default operation by the custom code after the default operation is performed, dynamically in the runtime while the runtime is running. 6. The method of claim 1, wherein automatically loading the custom code dynamically in the runtime comprises:
automatically loading the custom code, which is operable to call into the runtime to use one or more services that are provided by the runtime, dynamically in the runtime while the runtime is running. 7. The method of claim 1, further comprising:
monitoring the custom code, using the runtime, while the custom code runs to determine whether at least one of a failure of the custom code or a bug in the custom code causes the corresponding application to become unresponsive. 8. The method of claim 1, further comprising:
provisioning a website, a database, and a set of uniform resource identifiers that correspond to the custom code in response to receiving the custom code; receiving a URI request at the back-end-as-a-service module that identifies at least one of the uniform resource identifiers in response to receipt of the request from the corresponding application; and executing the custom code in response to receiving the URI request. 9. A system to provide backend custom code extensibility, the system comprising:
at least one element comprising at least one of (a) a processor, (b) hardware logic, or (c) electrical circuitry; an interface configured to receive custom code for incorporation into a backend-as-a-service module that is configured to provide a backend service to a corresponding application; and auto-load logic, implemented using the at least one element, configured to automatically load the custom code dynamically in a runtime hosted by the backend-as-a-service module while the runtime is running to provide custom backend features that are defined by the custom code to the corresponding application in response to receipt of a request from the corresponding application. 10. The system of claim 9, wherein the runtime is a native runtime of the custom code. 11. The system of claim 9, wherein the custom code is operable to access code modules that are external to the custom code. 12. The system of claim 9, wherein the custom code is operable to explicitly invoke a default operation and to modify one or more inputs of the default operation before the default operation is performed. 13. The system of claim 9, wherein the runtime is configured to monitor the custom code while the custom code runs to determine whether at least one of a failure of the custom code or a bug in the custom code causes the corresponding application to become unresponsive. 14. The system of claim 9, wherein the custom code is operable to call into the runtime to use one or more services that are provided by the runtime. 15. The system of claim 9, wherein the auto-load logic is configured to automatically load the custom code dynamically in the runtime without necessitating that the runtime be re-loaded. 16. The system of claim 9, further comprising:
provisioning logic configured to provision a website, a database, and a set of uniform resource identifiers that correspond to the custom code in response to receipt of the custom code; and execution logic configured to execute the custom code in response to receipt of the request from the corresponding application and further in response to receipt of a URI request that identifies at least one of the uniform resource identifiers. 17. A computer program product comprising a computer-readable storage medium having computer program logic recorded thereon for enabling a processor-based system to provide backend custom code extensibility, the computer program product comprising:
a program logic module for enabling the processor-based system to automatically load custom code, which is configured for incorporation into a backend-as-a-service module, dynamically in a runtime hosted by the backend-as-a-service module while the runtime is running to provide custom backend features that are defined by the custom code to a corresponding application in response to receipt of a request from the corresponding application, the backend-as-a-service module configured to provide a backend service to the corresponding application. 18. The computer program product of claim 17, wherein the runtime is a native runtime of the custom code. 19. The computer program product of claim 17, wherein the custom code is operable to explicitly invoke a default operation and to modify one or more inputs of the default operation before the default operation is performed. 20. The computer program product of claim 17, wherein the custom code is operable to call into the runtime to use one or more services that are provided by the runtime. | 2,100 |
5,336 | 5,336 | 13,408,853 | 2,156 | Searching is assisted by recognizing a selection of text from a document as an indication that a user wishes to initiate a search based on the selected text. The user is provided with query suggestions based on the selected text and the query suggestions are ranked based on a context provided by the document. The user may select the text by using a mouse, drawing a circle around the text on a touch screen, or by other input techniques. The query suggestions may be based on query reformulation or query expansion techniques applied to the selected text. Context provided by the document is used by a language model and/or an artificial intelligence system to rank the query suggestions in predicted order of relevance based on the selected text and the context. | 1. A system comprising:
one or more processing elements; a search initiation module communicatively coupled to or integrated with the one or more processing elements, the search initiation module configured to receive a single input from a user indicating both text selected by the user from a document displayed to the user and a command to generate a search query based at least in part on the text selected by the user; a candidate query generator coupled to or integrated with the one or more processing elements and configured to identify a plurality of candidate queries based at least in part on the text selected by the user and a query log of queries associated with the document; and a query ranking module coupled to or integrated with the one or more processing elements and configured to rank the one or more candidate queries based at least in part on:
(1) a language model that creates a bi-gram representation of a portion of text in the document that includes at least part of the text selected by the user and is based at least in part on a number of words in a one of the plurality of candidate queries, a number of words in the text selected by the user, and a number of words in the portion of text, or
(2) an artificial intelligence system created at least in part from training data comprising a corpus of <document, query> tuples obtained from past document consumption and searches initiated by one or more users, the tuples labeled by human-labelers indicating a probability that content of a document in a respective tuple caused a respective user to submit the corresponding query in the tuple. 2. The information-processing system of claim 1, wherein the candidate query generator is further configured to include, in one or more candidate queries, synonyms of words in the text selected by the user, alternate morphological forms of words in the text selected by the user, correct spellings of misspelled words in the text selected by the user, and/or alternative spellings of words in the text selected by the user. 3. The information-processing system of claim 1, wherein the query ranking module is configured to rank the one or more candidate queries based at least in part on (1) the language model and at least in part on (2) the artificial intelligence system. 4. A method comprising:
receiving a selection made by a user of text in a document; obtaining a plurality of candidate queries that includes queries generated at least in part by applying one or more query expansion techniques to the selected text; and ranking, by one or more processing elements, the plurality of candidate queries based at least in part on (1) a language model derived from a context comprising text in the document that includes some or all of the selected text and additional text, or (2) an artificial intelligence system that is trained with a set of document and query pairs that have been identified by human-reviewers as having a query that is related to content of a document paired with the query. 5. The method of claim 4, wherein the document comprises a mark-up language document. 6. The method of claim 4, wherein the plurality of candidate queries includes pre-formulated queries associated with the document. 7. The method of claim 4, wherein the query expansion techniques comprise at least one of applying a K-means algorithm to a query log, conducting a random walk on a bipartite query-document graph generated by parsing a query log, running a PageRank algorithm on a query-flow graph generated from a query log, or mining term association patterns from a query log. 8. The method of claim 4, wherein the context comprises a portion of text of the document having a predefined number of words or characters, the portion of text positioned in the document such that the selected text is in the middle 50% of the portion of text. 9. The method of claim 4, wherein the context comprises one of the entire document, a paragraph of the document, a column of the document, a sentence of the document, a cell of the document, or a frame of the document. 10. The method of claim 4, wherein the ranking is based at least in part on the language model, and the language model is based at least in part on a number of words in a one of the plurality of candidate queries, a number of words in the selected text, and a number of words in the context. 11. The method of claim 4, wherein the ranking is based at least in part on the language model, and the language model comprises a bi-gram language model in which a word in a query from the plurality of candidate queries depends on the immediately preceding word in the query. 12. The method of claim 4, wherein the ranking is based at least in part on the artificial intelligence system, and the artificial intelligence system learns a function that predicts a level of confidence in one or more of the plurality of candidate queries given a query, the selected text, and the context comprising text in the document that includes the selected text. 13. The method of claim 4 further comprising:
presenting the plurality of candidate queries to the user in a list ordered at least partly according to the ranking;
receiving a selection by the user of one of the plurality of candidate queries; and
submitting the selected one of the candidate queries to a search engine. 14. One or more computer storage media having computer-executable instructions which, when executed by a processor, cause a computing system to:
interpret selection of text in a document by a user as a command to provide the user with one or more search queries based at least in part on the selected text; obtain a plurality of candidate queries based at least in part on the selected text; rank the candidate queries based at least in part on context provided by the document. 15. The one or more computer storage of claim 14, wherein the selection of the text comprises the user dragging a pointing implement across text displayed on a touch-screen display. 16. The one or more computer storage media of claim 14, wherein the selection of the text comprises the user moving a pointing implement in a circular or oval shape around text displayed on a touch-screen display. 17. The one or more computer storage media of claim 14, wherein at least part of the plurality of candidate queries obtained are one or more pre-formulated queries associated with the document prior to the selection of the text by the user. 18. The one or more computer storage media of claim 17, wherein the pre-formulated queries are associated with a portion of the document that includes the selected text. 19. The one or more computer storage media of claim 14, wherein the context comprises a section of text from the document that includes at least a part of the selected text and the ranking comprises using a bi-gram language model that ranks the candidate queries based at least in part on a number of words in a one of the candidate queries and a query corpus. 20. The one or more computer storage media of claim 14, wherein the context comprises a section of text from the document that includes the selected text and the ranking comprises using an artificial intelligence system that uses a data set of document/query tuples, a correspondence between a document and a query in a respective one of the document/query tuples having been verified by a human reviewer. | Searching is assisted by recognizing a selection of text from a document as an indication that a user wishes to initiate a search based on the selected text. The user is provided with query suggestions based on the selected text and the query suggestions are ranked based on a context provided by the document. The user may select the text by using a mouse, drawing a circle around the text on a touch screen, or by other input techniques. The query suggestions may be based on query reformulation or query expansion techniques applied to the selected text. Context provided by the document is used by a language model and/or an artificial intelligence system to rank the query suggestions in predicted order of relevance based on the selected text and the context.1. A system comprising:
one or more processing elements; a search initiation module communicatively coupled to or integrated with the one or more processing elements, the search initiation module configured to receive a single input from a user indicating both text selected by the user from a document displayed to the user and a command to generate a search query based at least in part on the text selected by the user; a candidate query generator coupled to or integrated with the one or more processing elements and configured to identify a plurality of candidate queries based at least in part on the text selected by the user and a query log of queries associated with the document; and a query ranking module coupled to or integrated with the one or more processing elements and configured to rank the one or more candidate queries based at least in part on:
(1) a language model that creates a bi-gram representation of a portion of text in the document that includes at least part of the text selected by the user and is based at least in part on a number of words in a one of the plurality of candidate queries, a number of words in the text selected by the user, and a number of words in the portion of text, or
(2) an artificial intelligence system created at least in part from training data comprising a corpus of <document, query> tuples obtained from past document consumption and searches initiated by one or more users, the tuples labeled by human-labelers indicating a probability that content of a document in a respective tuple caused a respective user to submit the corresponding query in the tuple. 2. The information-processing system of claim 1, wherein the candidate query generator is further configured to include, in one or more candidate queries, synonyms of words in the text selected by the user, alternate morphological forms of words in the text selected by the user, correct spellings of misspelled words in the text selected by the user, and/or alternative spellings of words in the text selected by the user. 3. The information-processing system of claim 1, wherein the query ranking module is configured to rank the one or more candidate queries based at least in part on (1) the language model and at least in part on (2) the artificial intelligence system. 4. A method comprising:
receiving a selection made by a user of text in a document; obtaining a plurality of candidate queries that includes queries generated at least in part by applying one or more query expansion techniques to the selected text; and ranking, by one or more processing elements, the plurality of candidate queries based at least in part on (1) a language model derived from a context comprising text in the document that includes some or all of the selected text and additional text, or (2) an artificial intelligence system that is trained with a set of document and query pairs that have been identified by human-reviewers as having a query that is related to content of a document paired with the query. 5. The method of claim 4, wherein the document comprises a mark-up language document. 6. The method of claim 4, wherein the plurality of candidate queries includes pre-formulated queries associated with the document. 7. The method of claim 4, wherein the query expansion techniques comprise at least one of applying a K-means algorithm to a query log, conducting a random walk on a bipartite query-document graph generated by parsing a query log, running a PageRank algorithm on a query-flow graph generated from a query log, or mining term association patterns from a query log. 8. The method of claim 4, wherein the context comprises a portion of text of the document having a predefined number of words or characters, the portion of text positioned in the document such that the selected text is in the middle 50% of the portion of text. 9. The method of claim 4, wherein the context comprises one of the entire document, a paragraph of the document, a column of the document, a sentence of the document, a cell of the document, or a frame of the document. 10. The method of claim 4, wherein the ranking is based at least in part on the language model, and the language model is based at least in part on a number of words in a one of the plurality of candidate queries, a number of words in the selected text, and a number of words in the context. 11. The method of claim 4, wherein the ranking is based at least in part on the language model, and the language model comprises a bi-gram language model in which a word in a query from the plurality of candidate queries depends on the immediately preceding word in the query. 12. The method of claim 4, wherein the ranking is based at least in part on the artificial intelligence system, and the artificial intelligence system learns a function that predicts a level of confidence in one or more of the plurality of candidate queries given a query, the selected text, and the context comprising text in the document that includes the selected text. 13. The method of claim 4 further comprising:
presenting the plurality of candidate queries to the user in a list ordered at least partly according to the ranking;
receiving a selection by the user of one of the plurality of candidate queries; and
submitting the selected one of the candidate queries to a search engine. 14. One or more computer storage media having computer-executable instructions which, when executed by a processor, cause a computing system to:
interpret selection of text in a document by a user as a command to provide the user with one or more search queries based at least in part on the selected text; obtain a plurality of candidate queries based at least in part on the selected text; rank the candidate queries based at least in part on context provided by the document. 15. The one or more computer storage of claim 14, wherein the selection of the text comprises the user dragging a pointing implement across text displayed on a touch-screen display. 16. The one or more computer storage media of claim 14, wherein the selection of the text comprises the user moving a pointing implement in a circular or oval shape around text displayed on a touch-screen display. 17. The one or more computer storage media of claim 14, wherein at least part of the plurality of candidate queries obtained are one or more pre-formulated queries associated with the document prior to the selection of the text by the user. 18. The one or more computer storage media of claim 17, wherein the pre-formulated queries are associated with a portion of the document that includes the selected text. 19. The one or more computer storage media of claim 14, wherein the context comprises a section of text from the document that includes at least a part of the selected text and the ranking comprises using a bi-gram language model that ranks the candidate queries based at least in part on a number of words in a one of the candidate queries and a query corpus. 20. The one or more computer storage media of claim 14, wherein the context comprises a section of text from the document that includes the selected text and the ranking comprises using an artificial intelligence system that uses a data set of document/query tuples, a correspondence between a document and a query in a respective one of the document/query tuples having been verified by a human reviewer. | 2,100 |
5,337 | 5,337 | 14,959,498 | 2,156 | Embodiments relate to systems, devices, and computer-implemented methods for predicting social media trends by receiving multiple sets of social media data from a social media service, wherein each set of social media data includes multiple entries and each entry is associated with a user identifier. For each set of social media data: labels can be extracted; a social media data graph can be generated with nodes representing labels and user identifiers and edges representing a co-occurrence of labels or a co-occurrence of a label and a user identifier; and the social media data graph can be analyzed to determine a graph metric score for nodes corresponding to a label. The graph metric scores of a node across multiple sets of social media data can be used to predict that the label corresponding to the node will be significant to trending, e.g., will begin trending. | 1. A computer-implemented method, comprising:
receiving a set of social media data comprising a plurality of entries, wherein each entry of the plurality of entries is associated with a user identifier; extracting, using one or more processors, a plurality of labels from the set of social media data; generating a social media data graph comprising a plurality of nodes and a plurality of edges, wherein:
each node of the plurality of nodes corresponds to one of a unique label of the plurality of labels or a user identifier associated with an entry of the plurality of entries; and
each edge of the plurality of edges corresponds to a co-occurrence, in a single entry of the plurality of entries, of two labels of the plurality of labels or a label of the plurality of labels and a user identifier;
determining a graph metric score of a node, of the plurality of nodes, corresponding to a label; and predicting that the label will begin trending based on the graph metric score of the node corresponding to the label. 2. The computer-implemented method of claim 1, further comprising:
receiving a second set of social media data; extracting a second plurality of labels from the second set of social media data, wherein the second plurality of labels includes the label; generating a second social media data graph based on the second plurality of labels, wherein the second social media data graph comprises a second plurality of nodes and a second plurality of edges; determining a second graph metric score of a node, of the second plurality of nodes, corresponding to the label; and wherein predicting that the label will begin trending based on the graph metric score of the node corresponding to the label comprises determining that the second graph metric score is a threshold number greater than the graph metric score. 3. The computer-implemented method of claim 1, wherein predicting that the label will begin trending comprises predicting that the label will begin trending widely based on geographic locations of users associated with entries, of the plurality of entries, associated with the label. 4. The computer-implemented method of claim 3, further comprising:
alerting a user that the label will begin trending widely in response to the predicting. 5. The computer-implemented method of claim 1, further comprising:
receiving, from a user, a request to monitor the label; alerting the user that the label will begin trending; and wherein determining the graph metric score and predicting that the label will begin trending are performed in response to receiving the request. 6. The computer-implemented method of claim 1, further comprising:
receiving, from a user, a request to monitor a second label; determining that the label is within a 2-hop neighborhood of the second label; alerting the user that the label will begin trending; and wherein determining the graph metric score and predicting that the label will begin trending are performed in response to determining that the label is within the 2-hop neighborhood of the second label. 7. The computer-implemented method of claim 1, further comprising:
receiving, from a user, a request for information about a second label; determining a list of labels within a 2-hop neighborhood of the second label; and providing the list of labels to the user. 8. A system comprising:
a processing system of a device comprising one or more processors; and a memory system comprising one or more computer-readable media, wherein the one or more computer-readable media contain instructions that, when executed by the processing system, cause the processing system to perform operations comprising:
receiving a set of social media data comprising a plurality of entries, wherein each entry of the plurality of entries is associated with a user identifier;
extracting, using one or more processors, a plurality of labels from the set of social media data;
generating a social media data graph comprising a plurality of nodes and a plurality of edges, wherein:
each node of the plurality of nodes corresponds to one of a unique label of the plurality of labels or a user identifier associated with an entry of the plurality of entries; and
each edge of the plurality of edges corresponds to a co-occurrence, in a single entry of the plurality of entries, of two labels of the plurality of labels or a label of the plurality of labels and a user identifier;
determining a graph metric score of a node, of the plurality of nodes, corresponding to a label; and
predicting that the label will begin trending based on the graph metric score of the node corresponding to the label. 9. The system of claim 8, the operations further comprising:
receiving a second set of social media data; extracting a second plurality of labels from the second set of social media data, wherein the second plurality of labels includes the label; generating a second social media data graph based on the second plurality of labels, wherein the second social media data graph comprises a second plurality of nodes and a second plurality of edges; determining a second graph metric score of a node, of the second plurality of nodes, corresponding to the label; and wherein predicting that the label will begin trending based on the graph metric score of the node corresponding to the label comprises determining that the second graph metric score is a threshold number greater than the graph metric score. 10. The system of claim 8, wherein predicting that the label will begin trending comprises predicting that the label will begin trending widely based on geographic locations of users associated with entries, of the plurality of entries, associated with the label. 11. The system of claim 10, the operations further comprising:
alerting a user that the label will begin trending widely in response to the predicting. 12. The system of claim 8, the operations further comprising:
receiving, from a user, a request to monitor the label; alerting the user that the label will begin trending; and wherein determining the graph metric score and predicting that the label will begin trending are performed in response to receiving the request. 13. The system of claim 8, the operations further comprising:
receiving, from a user, a request to monitor a second label; determining that the label is within a 2-hop neighborhood of the second label; alerting the user that the label will begin trending; and wherein determining the graph metric score and predicting that the label will begin trending are performed in response to determining that the label is within the 2-hop neighborhood of the second label. 14. The system of claim 8, the operations further comprising:
receiving, from a user, a request for information about a second label; determining a list of labels within a 2-hop neighborhood of the second label; and providing the list of labels to the user. 15. A non-transitory computer readable storage medium comprising instructions for causing one or more processors to:
receiving a set of social media data comprising a plurality of entries, wherein each entry of the plurality of entries is associated with a user identifier; extracting, using one or more processors, a plurality of labels from the set of social media data; generating a social media data graph comprising a plurality of nodes and a plurality of edges, wherein:
each node of the plurality of nodes corresponds to one of a unique label of the plurality of labels or a user identifier associated with an entry of the plurality of entries; and
each edge of the plurality of edges corresponds to a co-occurrence, in a single entry of the plurality of entries, of two labels of the plurality of labels or a label of the plurality of labels and a user identifier;
determining a graph metric score of a node, of the plurality of nodes, corresponding to a label; and predicting that the label will begin trending based on the graph metric score of the node corresponding to the label. 16. The non-transitory computer readable storage medium of claim 15, the instructions further comprising:
receiving a second set of social media data; extracting a second plurality of labels from the second set of social media data, wherein the second plurality of labels includes the label; generating a second social media data graph based on the second plurality of labels, wherein the second social media data graph comprises a second plurality of nodes and a second plurality of edges; determining a second graph metric score of a node, of the second plurality of nodes, corresponding to the label; and wherein predicting that the label will begin trending based on the graph metric score of the node corresponding to the label comprises determining that the second graph metric score is a threshold number greater than the graph metric score. 17. The non-transitory computer readable storage medium of claim 15, wherein predicting that the label will begin trending comprises predicting that the label will begin trending widely based on geographic locations of users associated with entries, of the plurality of entries, associated with the label. 18. The non-transitory computer readable storage medium of claim 15, the instructions further comprising:
receiving, from a user, a request to monitor the label; alerting the user that the label will begin trending; and wherein determining the graph metric score and predicting that the label will begin trending are performed in response to receiving the request. 19. The non-transitory computer readable storage medium of claim 15, the instructions further comprising:
receiving, from a user, a request to monitor a second label; determining that the label is within a 2-hop neighborhood of the second label; alerting the user that the label will begin trending; and wherein determining the graph metric score and predicting that the label will begin trending are performed in response to determining that the label is within the 2-hop neighborhood of the second label. 20. The non-transitory computer readable storage medium of claim 15, the instructions further comprising:
receiving, from a user, a request for information about a second label; determining a list of labels within a 2-hop neighborhood of the second label; and providing the list of labels to the user. | Embodiments relate to systems, devices, and computer-implemented methods for predicting social media trends by receiving multiple sets of social media data from a social media service, wherein each set of social media data includes multiple entries and each entry is associated with a user identifier. For each set of social media data: labels can be extracted; a social media data graph can be generated with nodes representing labels and user identifiers and edges representing a co-occurrence of labels or a co-occurrence of a label and a user identifier; and the social media data graph can be analyzed to determine a graph metric score for nodes corresponding to a label. The graph metric scores of a node across multiple sets of social media data can be used to predict that the label corresponding to the node will be significant to trending, e.g., will begin trending.1. A computer-implemented method, comprising:
receiving a set of social media data comprising a plurality of entries, wherein each entry of the plurality of entries is associated with a user identifier; extracting, using one or more processors, a plurality of labels from the set of social media data; generating a social media data graph comprising a plurality of nodes and a plurality of edges, wherein:
each node of the plurality of nodes corresponds to one of a unique label of the plurality of labels or a user identifier associated with an entry of the plurality of entries; and
each edge of the plurality of edges corresponds to a co-occurrence, in a single entry of the plurality of entries, of two labels of the plurality of labels or a label of the plurality of labels and a user identifier;
determining a graph metric score of a node, of the plurality of nodes, corresponding to a label; and predicting that the label will begin trending based on the graph metric score of the node corresponding to the label. 2. The computer-implemented method of claim 1, further comprising:
receiving a second set of social media data; extracting a second plurality of labels from the second set of social media data, wherein the second plurality of labels includes the label; generating a second social media data graph based on the second plurality of labels, wherein the second social media data graph comprises a second plurality of nodes and a second plurality of edges; determining a second graph metric score of a node, of the second plurality of nodes, corresponding to the label; and wherein predicting that the label will begin trending based on the graph metric score of the node corresponding to the label comprises determining that the second graph metric score is a threshold number greater than the graph metric score. 3. The computer-implemented method of claim 1, wherein predicting that the label will begin trending comprises predicting that the label will begin trending widely based on geographic locations of users associated with entries, of the plurality of entries, associated with the label. 4. The computer-implemented method of claim 3, further comprising:
alerting a user that the label will begin trending widely in response to the predicting. 5. The computer-implemented method of claim 1, further comprising:
receiving, from a user, a request to monitor the label; alerting the user that the label will begin trending; and wherein determining the graph metric score and predicting that the label will begin trending are performed in response to receiving the request. 6. The computer-implemented method of claim 1, further comprising:
receiving, from a user, a request to monitor a second label; determining that the label is within a 2-hop neighborhood of the second label; alerting the user that the label will begin trending; and wherein determining the graph metric score and predicting that the label will begin trending are performed in response to determining that the label is within the 2-hop neighborhood of the second label. 7. The computer-implemented method of claim 1, further comprising:
receiving, from a user, a request for information about a second label; determining a list of labels within a 2-hop neighborhood of the second label; and providing the list of labels to the user. 8. A system comprising:
a processing system of a device comprising one or more processors; and a memory system comprising one or more computer-readable media, wherein the one or more computer-readable media contain instructions that, when executed by the processing system, cause the processing system to perform operations comprising:
receiving a set of social media data comprising a plurality of entries, wherein each entry of the plurality of entries is associated with a user identifier;
extracting, using one or more processors, a plurality of labels from the set of social media data;
generating a social media data graph comprising a plurality of nodes and a plurality of edges, wherein:
each node of the plurality of nodes corresponds to one of a unique label of the plurality of labels or a user identifier associated with an entry of the plurality of entries; and
each edge of the plurality of edges corresponds to a co-occurrence, in a single entry of the plurality of entries, of two labels of the plurality of labels or a label of the plurality of labels and a user identifier;
determining a graph metric score of a node, of the plurality of nodes, corresponding to a label; and
predicting that the label will begin trending based on the graph metric score of the node corresponding to the label. 9. The system of claim 8, the operations further comprising:
receiving a second set of social media data; extracting a second plurality of labels from the second set of social media data, wherein the second plurality of labels includes the label; generating a second social media data graph based on the second plurality of labels, wherein the second social media data graph comprises a second plurality of nodes and a second plurality of edges; determining a second graph metric score of a node, of the second plurality of nodes, corresponding to the label; and wherein predicting that the label will begin trending based on the graph metric score of the node corresponding to the label comprises determining that the second graph metric score is a threshold number greater than the graph metric score. 10. The system of claim 8, wherein predicting that the label will begin trending comprises predicting that the label will begin trending widely based on geographic locations of users associated with entries, of the plurality of entries, associated with the label. 11. The system of claim 10, the operations further comprising:
alerting a user that the label will begin trending widely in response to the predicting. 12. The system of claim 8, the operations further comprising:
receiving, from a user, a request to monitor the label; alerting the user that the label will begin trending; and wherein determining the graph metric score and predicting that the label will begin trending are performed in response to receiving the request. 13. The system of claim 8, the operations further comprising:
receiving, from a user, a request to monitor a second label; determining that the label is within a 2-hop neighborhood of the second label; alerting the user that the label will begin trending; and wherein determining the graph metric score and predicting that the label will begin trending are performed in response to determining that the label is within the 2-hop neighborhood of the second label. 14. The system of claim 8, the operations further comprising:
receiving, from a user, a request for information about a second label; determining a list of labels within a 2-hop neighborhood of the second label; and providing the list of labels to the user. 15. A non-transitory computer readable storage medium comprising instructions for causing one or more processors to:
receiving a set of social media data comprising a plurality of entries, wherein each entry of the plurality of entries is associated with a user identifier; extracting, using one or more processors, a plurality of labels from the set of social media data; generating a social media data graph comprising a plurality of nodes and a plurality of edges, wherein:
each node of the plurality of nodes corresponds to one of a unique label of the plurality of labels or a user identifier associated with an entry of the plurality of entries; and
each edge of the plurality of edges corresponds to a co-occurrence, in a single entry of the plurality of entries, of two labels of the plurality of labels or a label of the plurality of labels and a user identifier;
determining a graph metric score of a node, of the plurality of nodes, corresponding to a label; and predicting that the label will begin trending based on the graph metric score of the node corresponding to the label. 16. The non-transitory computer readable storage medium of claim 15, the instructions further comprising:
receiving a second set of social media data; extracting a second plurality of labels from the second set of social media data, wherein the second plurality of labels includes the label; generating a second social media data graph based on the second plurality of labels, wherein the second social media data graph comprises a second plurality of nodes and a second plurality of edges; determining a second graph metric score of a node, of the second plurality of nodes, corresponding to the label; and wherein predicting that the label will begin trending based on the graph metric score of the node corresponding to the label comprises determining that the second graph metric score is a threshold number greater than the graph metric score. 17. The non-transitory computer readable storage medium of claim 15, wherein predicting that the label will begin trending comprises predicting that the label will begin trending widely based on geographic locations of users associated with entries, of the plurality of entries, associated with the label. 18. The non-transitory computer readable storage medium of claim 15, the instructions further comprising:
receiving, from a user, a request to monitor the label; alerting the user that the label will begin trending; and wherein determining the graph metric score and predicting that the label will begin trending are performed in response to receiving the request. 19. The non-transitory computer readable storage medium of claim 15, the instructions further comprising:
receiving, from a user, a request to monitor a second label; determining that the label is within a 2-hop neighborhood of the second label; alerting the user that the label will begin trending; and wherein determining the graph metric score and predicting that the label will begin trending are performed in response to determining that the label is within the 2-hop neighborhood of the second label. 20. The non-transitory computer readable storage medium of claim 15, the instructions further comprising:
receiving, from a user, a request for information about a second label; determining a list of labels within a 2-hop neighborhood of the second label; and providing the list of labels to the user. | 2,100 |
5,338 | 5,338 | 15,167,746 | 2,191 | Methods, systems, and computer-readable storage media for deploying upgrade packages during zero downtime upgrade of production systems include actions of receiving an upgrade package, the upgrade package defining one or more changes to be deployed to a system that has already undergone partial deployment during a zero downtime upgrade, and including one or more objects having respective object types, receiving a deployment configuration, the deployment configuration providing a plurality of lists of object types for respective constraints and, for each list of object types, specifying a deployment option for object types in the respective list of object types, determining a set of object types included in the upgrade package, the set of object types comprising one or more object types, and selectively permitting deployment of the upgrade package to execute the one or more changes based on the set of object types and the plurality of lists of object types. | 1. A computer-implemented method for deploying upgrade packages during a zero downtime upgrade of a production software system, the method being executed using one or more processors and comprising:
receiving, by the one or more processors, an upgrade package, the upgrade package defining one or more changes to be deployed to a system that has already undergone partial deployment during a zero downtime upgrade, and comprising one or more objects having respective object types; receiving, by the one or more processors, a deployment configuration, the deployment configuration providing a plurality of lists of object types for respective constraints and, for each list of object types, specifying a deployment option for object types in the respective list of object types; determining, by the one or more processors, a set of object types included in the upgrade package, the set of object types comprising one or more object types; and selectively permitting, by the one or more processors, deployment of the upgrade package to execute the one or more changes based on the set of object types and the plurality of lists of object types. 2. The method of claim 1, wherein selectively permitting deployment of the upgrade package comprises:
determining that the upgrade package includes one or more grey-listed object types; and deploying the one or more grey-listed object types using an extension to a standard deployment procedure. 3. The method of claim 2, wherein the extension is provided in the deployment configuration. 4. The method of claim 1, wherein selectively permitting deployment of the upgrade package comprises:
determining that the upgrade package includes one or more white-listed object types; and deploying the one or more white-listed object types using a standard deployment procedure. 5. The method of claim 1, wherein selectively permitting deployment of the upgrade package comprises:
determining that the upgrade package includes at least one black-listed object type, and in response, rejecting the upgrade package for deployment. 6. The method of claim 1, wherein the upgrade package is received in response to a test indicating one or more corrections are to be deployed to the system. 7. The method of claim 1, wherein the zero downtime upgrade procedure is conducted to upgrade a production system, while the production system remains in production use. 8. A non-transitory computer-readable storage medium coupled to one or more processors and having instructions stored thereon which, when executed by the one or more processors, cause the one or more processors to perform operations for deploying upgrade packages during a zero downtime upgrade of a production software system, the operations comprising:
receiving an upgrade package, the upgrade package defining one or more changes to be deployed to a system that has already undergone partial deployment during a zero downtime upgrade, and comprising one or more objects having respective object types; receiving a deployment configuration, the deployment configuration providing a plurality of lists of object types for respective constraints and, for each list of object types, specifying a deployment option for object types in the respective list of object types; determining a set of object types included in the upgrade package, the set of object types comprising one or more object types; and selectively permitting deployment of the upgrade package to execute the one or more changes based on the set of object types and the plurality of lists of object types. 9. The computer-readable storage medium of claim 8, wherein selectively permitting deployment of the upgrade package comprises:
determining that the upgrade package includes one or more grey-listed object types; and deploying the one or more grey-listed object types using an extension to a standard deployment procedure. 10. The computer-readable storage medium of claim 9, wherein the extension is provided in the deployment configuration. 11. The computer-readable storage medium of claim 8, wherein selectively permitting deployment of the upgrade package comprises:
determining that the upgrade package includes one or more white-listed object types; and deploying the one or more white-listed object types using a standard deployment procedure. 12. The computer-readable storage medium of claim 8, wherein selectively permitting deployment of the upgrade package comprises:
determining that the upgrade package includes at least one black-listed object type, and in response, rejecting the upgrade package for deployment. 13. The computer-readable storage medium of claim 8, wherein the upgrade package is received in response to a test indicating one or more corrections are to be deployed to the system. 14. The computer-readable storage medium of claim 8, wherein the zero downtime upgrade procedure is conducted to upgrade a production system, while the production system remains in production use. 15. A system, comprising:
a computing device; and a computer-readable storage device coupled to the computing device and having instructions stored thereon which, when executed by the computing device, cause the computing device to perform operations for deploying upgrade packages during a zero downtime upgrade of a production software system, the operations comprising:
receiving an upgrade package, the upgrade package defining one or more changes to be deployed to a system that has already undergone partial deployment during a zero downtime upgrade, and comprising one or more objects having respective object types;
receiving a deployment configuration, the deployment configuration providing a plurality of lists of object types for respective constraints and, for each list of object types, specifying a deployment option for object types in the respective list of object types;
determining a set of object types included in the upgrade package, the set of object types comprising one or more object types; and
selectively permitting deployment of the upgrade package to execute the one or more changes based on the set of object types and the plurality of lists of object types. 16. The system of claim 15, wherein selectively permitting deployment of the upgrade package comprises:
determining that the upgrade package includes one or more grey-listed object types; and deploying the one or more grey-listed object types using an extension to a standard deployment procedure. 17. The system of claim 16, wherein the extension is provided in the deployment configuration. 18. The system of claim 15, wherein selectively permitting deployment of the upgrade package comprises:
determining that the upgrade package includes one or more white-listed object types; and deploying the one or more white-listed object types using a standard deployment procedure. 19. The system of claim 15, wherein selectively permitting deployment of the upgrade package comprises:
determining that the upgrade package includes at least one black-listed object type, and in response, rejecting the upgrade package for deployment. 20. The system of claim 15, wherein the upgrade package is received in response to a test indicating one or more corrections are to be deployed to the system. | Methods, systems, and computer-readable storage media for deploying upgrade packages during zero downtime upgrade of production systems include actions of receiving an upgrade package, the upgrade package defining one or more changes to be deployed to a system that has already undergone partial deployment during a zero downtime upgrade, and including one or more objects having respective object types, receiving a deployment configuration, the deployment configuration providing a plurality of lists of object types for respective constraints and, for each list of object types, specifying a deployment option for object types in the respective list of object types, determining a set of object types included in the upgrade package, the set of object types comprising one or more object types, and selectively permitting deployment of the upgrade package to execute the one or more changes based on the set of object types and the plurality of lists of object types.1. A computer-implemented method for deploying upgrade packages during a zero downtime upgrade of a production software system, the method being executed using one or more processors and comprising:
receiving, by the one or more processors, an upgrade package, the upgrade package defining one or more changes to be deployed to a system that has already undergone partial deployment during a zero downtime upgrade, and comprising one or more objects having respective object types; receiving, by the one or more processors, a deployment configuration, the deployment configuration providing a plurality of lists of object types for respective constraints and, for each list of object types, specifying a deployment option for object types in the respective list of object types; determining, by the one or more processors, a set of object types included in the upgrade package, the set of object types comprising one or more object types; and selectively permitting, by the one or more processors, deployment of the upgrade package to execute the one or more changes based on the set of object types and the plurality of lists of object types. 2. The method of claim 1, wherein selectively permitting deployment of the upgrade package comprises:
determining that the upgrade package includes one or more grey-listed object types; and deploying the one or more grey-listed object types using an extension to a standard deployment procedure. 3. The method of claim 2, wherein the extension is provided in the deployment configuration. 4. The method of claim 1, wherein selectively permitting deployment of the upgrade package comprises:
determining that the upgrade package includes one or more white-listed object types; and deploying the one or more white-listed object types using a standard deployment procedure. 5. The method of claim 1, wherein selectively permitting deployment of the upgrade package comprises:
determining that the upgrade package includes at least one black-listed object type, and in response, rejecting the upgrade package for deployment. 6. The method of claim 1, wherein the upgrade package is received in response to a test indicating one or more corrections are to be deployed to the system. 7. The method of claim 1, wherein the zero downtime upgrade procedure is conducted to upgrade a production system, while the production system remains in production use. 8. A non-transitory computer-readable storage medium coupled to one or more processors and having instructions stored thereon which, when executed by the one or more processors, cause the one or more processors to perform operations for deploying upgrade packages during a zero downtime upgrade of a production software system, the operations comprising:
receiving an upgrade package, the upgrade package defining one or more changes to be deployed to a system that has already undergone partial deployment during a zero downtime upgrade, and comprising one or more objects having respective object types; receiving a deployment configuration, the deployment configuration providing a plurality of lists of object types for respective constraints and, for each list of object types, specifying a deployment option for object types in the respective list of object types; determining a set of object types included in the upgrade package, the set of object types comprising one or more object types; and selectively permitting deployment of the upgrade package to execute the one or more changes based on the set of object types and the plurality of lists of object types. 9. The computer-readable storage medium of claim 8, wherein selectively permitting deployment of the upgrade package comprises:
determining that the upgrade package includes one or more grey-listed object types; and deploying the one or more grey-listed object types using an extension to a standard deployment procedure. 10. The computer-readable storage medium of claim 9, wherein the extension is provided in the deployment configuration. 11. The computer-readable storage medium of claim 8, wherein selectively permitting deployment of the upgrade package comprises:
determining that the upgrade package includes one or more white-listed object types; and deploying the one or more white-listed object types using a standard deployment procedure. 12. The computer-readable storage medium of claim 8, wherein selectively permitting deployment of the upgrade package comprises:
determining that the upgrade package includes at least one black-listed object type, and in response, rejecting the upgrade package for deployment. 13. The computer-readable storage medium of claim 8, wherein the upgrade package is received in response to a test indicating one or more corrections are to be deployed to the system. 14. The computer-readable storage medium of claim 8, wherein the zero downtime upgrade procedure is conducted to upgrade a production system, while the production system remains in production use. 15. A system, comprising:
a computing device; and a computer-readable storage device coupled to the computing device and having instructions stored thereon which, when executed by the computing device, cause the computing device to perform operations for deploying upgrade packages during a zero downtime upgrade of a production software system, the operations comprising:
receiving an upgrade package, the upgrade package defining one or more changes to be deployed to a system that has already undergone partial deployment during a zero downtime upgrade, and comprising one or more objects having respective object types;
receiving a deployment configuration, the deployment configuration providing a plurality of lists of object types for respective constraints and, for each list of object types, specifying a deployment option for object types in the respective list of object types;
determining a set of object types included in the upgrade package, the set of object types comprising one or more object types; and
selectively permitting deployment of the upgrade package to execute the one or more changes based on the set of object types and the plurality of lists of object types. 16. The system of claim 15, wherein selectively permitting deployment of the upgrade package comprises:
determining that the upgrade package includes one or more grey-listed object types; and deploying the one or more grey-listed object types using an extension to a standard deployment procedure. 17. The system of claim 16, wherein the extension is provided in the deployment configuration. 18. The system of claim 15, wherein selectively permitting deployment of the upgrade package comprises:
determining that the upgrade package includes one or more white-listed object types; and deploying the one or more white-listed object types using a standard deployment procedure. 19. The system of claim 15, wherein selectively permitting deployment of the upgrade package comprises:
determining that the upgrade package includes at least one black-listed object type, and in response, rejecting the upgrade package for deployment. 20. The system of claim 15, wherein the upgrade package is received in response to a test indicating one or more corrections are to be deployed to the system. | 2,100 |
5,339 | 5,339 | 14,747,384 | 2,173 | A system for providing an audio processing interface at a mobile device configured to detect an audio processor, present, via a user interface, a display screen to receive user input to initiate audio testing, iteratively present a series of testing screens, each including at least one instruction and test status, and present another instruction and test status in response to receiving and indicative of a successful sample at a previous microphone location. | 1. A non-transitory computer-readable medium tangibly embodying computer-executable instructions of a software program, the software program being executable by a processor of a computing device to provide operations, comprising:
detecting an audio processor; presenting, via a mobile device, a display screen to receive user input to initiate audio testing; and presenting a series of testing screens, each including at least one instruction and test status, and wherein at least one of the testing screens provides a selectable option for acquiring at least one audio sample to be analyzed and processed to increase audio sound quality of a loudspeaker. 2. The medium of claim 1, presenting, via at least one of the series of testing screens, an ideal first location for a microphone for acquiring the at least one audio sample from one or more sound system loudspeakers. 3. The medium of claim 2, presenting, via at least one of the series of testing screens, a testing status at the ideal location. 4. The medium of claim 3, presenting, at another one of the at least one of the series of testing screens, an ideal second location for the microphone for acquiring the at least one audio sample in response to receiving an indication of a successful audio sample at the ideal first location. 5. The medium of claim 1, presenting a plurality of selectable features, via the display screen. 6. The medium of claim 5, wherein the display screen to initiate audio testing includes at least one selectable automated equalization feature for initiating audio processing. 7. A system for providing an audio processing interface at a mobile device, comprising:
a mobile device including an interface configured to:
detect an audio processor;
present, via a user interface, a display screen to receive user input to initiate audio testing;
iteratively present a series of testing screens, each including at least one instruction and test status associated with one of a plurality of microphone locations; and
present another instruction and test status associated with another one of the plurality of microphone locations in response to receiving an indication of a successful sample at a previous microphone location. 8. The system of claim 7, the mobile device further configured to present a testing status icon during testing at the one of the microphone locations. 9. The system of claim 7, the mobile device further configured to update each of the testing screens to indicate testing is complete at the respective microphone location in response to receiving an indication of a successful sample at that respective microphone location, the successful sample having a signal to noise ratio above a predefined ratio. 10. The system of claim 7, the mobile device further configured to provide a selectable option on at least one of the testing screens to acquire at least one audio sample to be analyzed and processed to increase audio sound quality of a loudspeaker. 11. The system of claim 7, wherein the display screen includes at least one selectable auto equalization feature. 12. A method, comprising:
recognizing an audio processor; presenting a first testing screen indicating a first microphone location; presenting a first testing status at the first microphone location; receiving a testing complete status for the first microphone location; and presenting, in response to the testing complete status, a second testing screen indicating a second microphone location distinct from the first microphone location. 13. The method of claim 12, further comprising updating the first testing screen to indicate testing is complete for the first microphone location. 14. The method of claim 13, wherein updating the first testing screen to indicate testing is complete includes a testing complete icon associated with the first microphone location. 15. The method of claim 12, wherein the first testing status includes a dynamically updated icon indicating a current level of completion of testing at the first microphone location. 16. The method of claim 12, presenting a testing complete screen in response to testing at each of a plurality of microphone locations being complete. 17. The method of claim 16, wherein the testing complete screen includes a textual indication. 18. The method of claim 16, wherein the testing complete screen includes a testing complete icon associated with the first microphone location and the second microphone location. 19. The method of claim 12, wherein at least one of the first and second testing screens includes textual instructions related to testing at the respective microphone location. 20. The method of claim 12, wherein at least one of the first and second testing screens includes at least one shortcut selectable option. | A system for providing an audio processing interface at a mobile device configured to detect an audio processor, present, via a user interface, a display screen to receive user input to initiate audio testing, iteratively present a series of testing screens, each including at least one instruction and test status, and present another instruction and test status in response to receiving and indicative of a successful sample at a previous microphone location.1. A non-transitory computer-readable medium tangibly embodying computer-executable instructions of a software program, the software program being executable by a processor of a computing device to provide operations, comprising:
detecting an audio processor; presenting, via a mobile device, a display screen to receive user input to initiate audio testing; and presenting a series of testing screens, each including at least one instruction and test status, and wherein at least one of the testing screens provides a selectable option for acquiring at least one audio sample to be analyzed and processed to increase audio sound quality of a loudspeaker. 2. The medium of claim 1, presenting, via at least one of the series of testing screens, an ideal first location for a microphone for acquiring the at least one audio sample from one or more sound system loudspeakers. 3. The medium of claim 2, presenting, via at least one of the series of testing screens, a testing status at the ideal location. 4. The medium of claim 3, presenting, at another one of the at least one of the series of testing screens, an ideal second location for the microphone for acquiring the at least one audio sample in response to receiving an indication of a successful audio sample at the ideal first location. 5. The medium of claim 1, presenting a plurality of selectable features, via the display screen. 6. The medium of claim 5, wherein the display screen to initiate audio testing includes at least one selectable automated equalization feature for initiating audio processing. 7. A system for providing an audio processing interface at a mobile device, comprising:
a mobile device including an interface configured to:
detect an audio processor;
present, via a user interface, a display screen to receive user input to initiate audio testing;
iteratively present a series of testing screens, each including at least one instruction and test status associated with one of a plurality of microphone locations; and
present another instruction and test status associated with another one of the plurality of microphone locations in response to receiving an indication of a successful sample at a previous microphone location. 8. The system of claim 7, the mobile device further configured to present a testing status icon during testing at the one of the microphone locations. 9. The system of claim 7, the mobile device further configured to update each of the testing screens to indicate testing is complete at the respective microphone location in response to receiving an indication of a successful sample at that respective microphone location, the successful sample having a signal to noise ratio above a predefined ratio. 10. The system of claim 7, the mobile device further configured to provide a selectable option on at least one of the testing screens to acquire at least one audio sample to be analyzed and processed to increase audio sound quality of a loudspeaker. 11. The system of claim 7, wherein the display screen includes at least one selectable auto equalization feature. 12. A method, comprising:
recognizing an audio processor; presenting a first testing screen indicating a first microphone location; presenting a first testing status at the first microphone location; receiving a testing complete status for the first microphone location; and presenting, in response to the testing complete status, a second testing screen indicating a second microphone location distinct from the first microphone location. 13. The method of claim 12, further comprising updating the first testing screen to indicate testing is complete for the first microphone location. 14. The method of claim 13, wherein updating the first testing screen to indicate testing is complete includes a testing complete icon associated with the first microphone location. 15. The method of claim 12, wherein the first testing status includes a dynamically updated icon indicating a current level of completion of testing at the first microphone location. 16. The method of claim 12, presenting a testing complete screen in response to testing at each of a plurality of microphone locations being complete. 17. The method of claim 16, wherein the testing complete screen includes a textual indication. 18. The method of claim 16, wherein the testing complete screen includes a testing complete icon associated with the first microphone location and the second microphone location. 19. The method of claim 12, wherein at least one of the first and second testing screens includes textual instructions related to testing at the respective microphone location. 20. The method of claim 12, wherein at least one of the first and second testing screens includes at least one shortcut selectable option. | 2,100 |
5,340 | 5,340 | 14,291,132 | 2,163 | The present subject matter relates to techniques and equipment for creating and managing a directory of individuals and businesses/enterprises by their mobile phone number, and using the directory to effectively store, manage and direct mail communication information to the individuals and businesses using preferred delivery methods of the individuals and businesses/enterprises. An electronic communication system is configured to use a mobile phone number to reference data and to manage communications to a corresponding recipient. | 1. A method for electronically recording data of a recipient by an information delivery service to format and deliver communications to the recipient, the method comprising steps of:
receiving and storing recipient data in a database by way of a programmed computer; electronically enrolling the recipient data into a database of the information delivery service database; receiving a recipient selection of enterprises authorized to send the communications to the recipient; identifying preferred delivery channels for delivery of the communications; and associating the recipient data with a mobile phone number of the recipient, such that the mobile phone number permits access of the recipient data within the database. 2. The method of claim 1, wherein the step of electronic enrolling is performed by one of: a mobile device, computer interface, or tablet interface via network connection to a web site for the delivery service. 3. The method of claim 1, wherein the preferred delivery channels for the communications are dependent upon content of the communications. 4. The method of claim 3, wherein the communications content is varied based on the distance between the enterprise and the recipient. 5. The method of claim 1, wherein the delivery channels include at least one of: e-mail, web site access, network connected television, social media, mobile smart phone, text message or a consolidator. 6. The method of claim 1, wherein confirmation of the recipient data is forwarded to the mobile phone number of the recipient. 7. A method of transmitting one or more communications from an enterprise to at least one recipient by way of an information delivery service, the method comprising steps of:
receiving a communication request from the enterprise at an information delivery service communication manager computer and storing communication content and instructions in a database referenced to a mobile phone number of the recipient; identifying delivery preferences for each type of communication content as specified by the recipient, referenced by the mobile phone number; formatting communication content based on the identified delivery preferences and requirements of one or more communication delivery channels; establishing connectivity to the one or more delivery channels that are required for each pending communication to the recipient; and transmitting each communication to the associated delivery channel. 8. The method of claim 7, wherein a record of each transmitted communication is archived in an archive directory by the mobile phone number of the recipient. 9. The method of claim 7, further comprising the steps of:
referencing metadata of the recipient by the mobile phone number in a metadata directory; and extracting any demographic data required from the metadata directory or from the archive directory. 10. The method of claim 9, wherein the demographic metadata is selected form at least one of:
a recipient location, recent transaction with the enterprise, specified black out times, frequency of messages, content of critical alerts, blackout dates due to unavailability or spam control. 11. The method of claim 7, wherein a plurality of delivery channels and contents are required for a communication to the recipient. 12. The method of claim 11, wherein the communication is selected from one or more of:
a coupon delivered by way of a mobile phone text message including a barcode to be scanned at the enterprise; a reward card; physical mail to the recipient; a confirmation invoice by way of an email; an order status alert; an automated mobile phone call or text. 13. A method of executing a marketing communication by an enterprise to target a plurality of recipients through delivery channels, the method comprising steps of:
developing a list of the recipients by the enterprise, and associating demographic data with each recipient to establish a marketing communications plan; sending the recipient list and demographics data to an information delivery service; receiving enterprise communication requirement data and storing the data in at least one database of the information delivery service; associating the recipient list with respective mobile phone numbers of each recipient to reference entries in the database; and transmitting the communications to the respective recipients by way of the delivery channels. 14. The method of claim 13, wherein the demographic data includes at least one of:
recipient preferred delivery channels, geographic data, marketing data authorization, specified black out times, frequency of messages, content of critical alerts, blackout dates due to unavailability and spam control. 15. The method of claim 14, wherein upon transmission of each communication, an electronic response is transmitted back to the information delivery service through the delivery channel and forwarded to the enterprise. 16. The method of claim 15, wherein parameters associated with the communications are archived and referenced to the mobile phone number in communications content record. 17. An electronic communication system for transmitting one or more communications from an enterprise to at least one recipient by way of an information delivery service, the system comprising:
an information delivery service communication manager computer that is configured to receive a communication request from the enterprise and storing communication content and instructions in a database and referenced to a mobile phone number of the recipient; a delivery preference database configured to store delivery preferences for each type of communication content as specified by the recipient, referenced by the mobile phone number; a communication server configured to:
format communication content based on the delivery preferences and requirements of one or more communication delivery channels;
establish connectivity to the one or more delivery channels that are required for each pending communication to the recipient; and
transmit each communication to the associated delivery channel. 18. The system of claim 17, wherein the delivery channel includes at least one of: e-mail, web site access, network connected television, social media, mobile smart phone, text message or a consolidator. 19. The system of claim 17, wherein the communication is selected from one or more of:
a coupon delivered by way of a mobile phone text message including a barcode to be scanned at the enterprise; a reward card; physical mail to the recipient; a confirmation invoice by way of an email; an order status alert; an automated mobile phone call or text. | The present subject matter relates to techniques and equipment for creating and managing a directory of individuals and businesses/enterprises by their mobile phone number, and using the directory to effectively store, manage and direct mail communication information to the individuals and businesses using preferred delivery methods of the individuals and businesses/enterprises. An electronic communication system is configured to use a mobile phone number to reference data and to manage communications to a corresponding recipient.1. A method for electronically recording data of a recipient by an information delivery service to format and deliver communications to the recipient, the method comprising steps of:
receiving and storing recipient data in a database by way of a programmed computer; electronically enrolling the recipient data into a database of the information delivery service database; receiving a recipient selection of enterprises authorized to send the communications to the recipient; identifying preferred delivery channels for delivery of the communications; and associating the recipient data with a mobile phone number of the recipient, such that the mobile phone number permits access of the recipient data within the database. 2. The method of claim 1, wherein the step of electronic enrolling is performed by one of: a mobile device, computer interface, or tablet interface via network connection to a web site for the delivery service. 3. The method of claim 1, wherein the preferred delivery channels for the communications are dependent upon content of the communications. 4. The method of claim 3, wherein the communications content is varied based on the distance between the enterprise and the recipient. 5. The method of claim 1, wherein the delivery channels include at least one of: e-mail, web site access, network connected television, social media, mobile smart phone, text message or a consolidator. 6. The method of claim 1, wherein confirmation of the recipient data is forwarded to the mobile phone number of the recipient. 7. A method of transmitting one or more communications from an enterprise to at least one recipient by way of an information delivery service, the method comprising steps of:
receiving a communication request from the enterprise at an information delivery service communication manager computer and storing communication content and instructions in a database referenced to a mobile phone number of the recipient; identifying delivery preferences for each type of communication content as specified by the recipient, referenced by the mobile phone number; formatting communication content based on the identified delivery preferences and requirements of one or more communication delivery channels; establishing connectivity to the one or more delivery channels that are required for each pending communication to the recipient; and transmitting each communication to the associated delivery channel. 8. The method of claim 7, wherein a record of each transmitted communication is archived in an archive directory by the mobile phone number of the recipient. 9. The method of claim 7, further comprising the steps of:
referencing metadata of the recipient by the mobile phone number in a metadata directory; and extracting any demographic data required from the metadata directory or from the archive directory. 10. The method of claim 9, wherein the demographic metadata is selected form at least one of:
a recipient location, recent transaction with the enterprise, specified black out times, frequency of messages, content of critical alerts, blackout dates due to unavailability or spam control. 11. The method of claim 7, wherein a plurality of delivery channels and contents are required for a communication to the recipient. 12. The method of claim 11, wherein the communication is selected from one or more of:
a coupon delivered by way of a mobile phone text message including a barcode to be scanned at the enterprise; a reward card; physical mail to the recipient; a confirmation invoice by way of an email; an order status alert; an automated mobile phone call or text. 13. A method of executing a marketing communication by an enterprise to target a plurality of recipients through delivery channels, the method comprising steps of:
developing a list of the recipients by the enterprise, and associating demographic data with each recipient to establish a marketing communications plan; sending the recipient list and demographics data to an information delivery service; receiving enterprise communication requirement data and storing the data in at least one database of the information delivery service; associating the recipient list with respective mobile phone numbers of each recipient to reference entries in the database; and transmitting the communications to the respective recipients by way of the delivery channels. 14. The method of claim 13, wherein the demographic data includes at least one of:
recipient preferred delivery channels, geographic data, marketing data authorization, specified black out times, frequency of messages, content of critical alerts, blackout dates due to unavailability and spam control. 15. The method of claim 14, wherein upon transmission of each communication, an electronic response is transmitted back to the information delivery service through the delivery channel and forwarded to the enterprise. 16. The method of claim 15, wherein parameters associated with the communications are archived and referenced to the mobile phone number in communications content record. 17. An electronic communication system for transmitting one or more communications from an enterprise to at least one recipient by way of an information delivery service, the system comprising:
an information delivery service communication manager computer that is configured to receive a communication request from the enterprise and storing communication content and instructions in a database and referenced to a mobile phone number of the recipient; a delivery preference database configured to store delivery preferences for each type of communication content as specified by the recipient, referenced by the mobile phone number; a communication server configured to:
format communication content based on the delivery preferences and requirements of one or more communication delivery channels;
establish connectivity to the one or more delivery channels that are required for each pending communication to the recipient; and
transmit each communication to the associated delivery channel. 18. The system of claim 17, wherein the delivery channel includes at least one of: e-mail, web site access, network connected television, social media, mobile smart phone, text message or a consolidator. 19. The system of claim 17, wherein the communication is selected from one or more of:
a coupon delivered by way of a mobile phone text message including a barcode to be scanned at the enterprise; a reward card; physical mail to the recipient; a confirmation invoice by way of an email; an order status alert; an automated mobile phone call or text. | 2,100 |
5,341 | 5,341 | 13,723,103 | 2,181 | An arithmetic unit performs store-to-load forwarding based on predicted dependencies between store instructions and load instructions. In some embodiments, the arithmetic unit maintains a table of store instructions that are awaiting movement to a load/store unit of the instruction pipeline. In response to receiving a load instruction that is predicted to be dependent on a store instruction stored at the table, the arithmetic unit causes the data associated with the store instruction to be placed into the physical register targeted by the load instruction. In some embodiments, the arithmetic unit performs the forwarding by mapping the physical register targeted by the load instruction to the physical register where the data associated with the store instruction is located. | 1. A method comprising:
forwarding, at an arithmetic unit of an instruction pipeline, data associated with a store instruction to satisfy a load instruction concurrent with moving the data to a load/store unit of the instruction pipeline. 2. The method of claim 1, wherein forwarding comprises forwarding the data to the load instruction in response to a prediction that the load is dependent on the store instruction. 3. The method of claim 1, wherein forwarding comprises forwarding the data in response to the data having not been moved from the arithmetic unit to a load/store unit of the instruction pipeline. 4. The method of claim 1, wherein forwarding comprises storing the data at a physical register targeted by the load instruction in response to moving the data from the arithmetic unit to a load/store unit of the instruction pipeline. 5. The method of claim 1, further comprising initiating execution of an instruction that depends on the load instruction in response to forwarding the data to the load instruction. 6. The method of claim 1, wherein forwarding comprises forwarding the data in response to determining a size of the data associated with the store instruction matches a size of data associated with the load instruction. 7. A method, comprising:
in response to a prediction at an instruction pipeline that a first load instruction is dependent on a first store instruction, forwarding data associated with the first store instruction to satisfy the first load instruction prior to moving the data to a load/store unit of the instruction pipeline. 8. The method of claim 7, further comprising:
storing the first store instruction at a first table; storing the first load instruction at a second table in response to determining the store instruction is stored at the first table and the data associated with the first store instruction has not been moved to the load/store unit; and forwarding the data to the first load instruction in response to determining that the data associated with the first store instruction is being moved to the load/store unit and the first load instruction is stored at the second table. 9. The method of claim 8, further comprising:
storing a second store instruction at the first table; and suppressing storage of a second load instruction that is dependent on the second store instruction at the second table in response to determining that data associated with the second store instruction has been moved to the load/store unit. 10. The method of claim 9, further comprising forwarding the data associated with the second store instruction to the second load instruction at the load/store unit. 11. A processor comprising:
a cache; and an instruction pipeline comprising:
a load/store unit to load and store data from and to the cache; and
an arithmetic unit to forward data associated with a store instruction to satisfy a load instruction concurrent with moving the data associated with the store instruction to the load/store unit. 12. The processor of claim 11, wherein:
the instruction pipeline further comprises a front end to provide a prediction that the load instruction is dependent on the store instruction; and the arithmetic unit is to forward the data to the load instruction in response to a prediction that the load is dependent on the store instruction. 13. The processor of claim 12, wherein the arithmetic unit is to forward the data in response to determining that the data has not been moved from the arithmetic unit to a load/store unit of the instruction pipeline. 14. The processor of claim 11, wherein the arithmetic unit is to forward the data by remapping a first physical register targeted by the load instruction to a second physical register targeted by the store instruction. 15. The processor of claim 11, wherein the arithmetic unit is to forward the data by storing the data at a physical register targeted by the load instruction in response to moving the data to the load/store unit. 16. The processor of claim 11, wherein the arithmetic unit is to initiate execution of an instruction that depends on the load instruction in response to forwarding the data to the load instruction. 17. The processor of claim 11, wherein the arithmetic unit is to forward the data in response to determining a size of the data associated with the store instruction matches a size of data associated with the load instruction. 18. A computer readable medium storing code to adapt at least one computer system to perform a portion of a process to fabricate at least part of a processor comprising:
a cache; and an instruction pipeline comprising:
a load/store unit to load and store data from and to the cache; and
an arithmetic unit to forward data associated with a store instruction to a load instruction. 19. The computer readable medium of claim 18, wherein:
the instruction pipeline further comprises a front end to provide a prediction that the load instruction is dependent on the store instruction; and the arithmetic unit is to forward the data to the load instruction in response to a prediction that the load is dependent on the store instruction. 20. The computer readable medium of claim 18, wherein the arithmetic unit is to forward the data in response to the data having not been moved from the arithmetic unit to a load/store unit of the instruction pipeline. 21. The computer readable medium of claim 18, wherein the arithmetic unit is to forward the data by remapping a first physical register targeted by the load instruction to a second physical register targeted by the store instruction. 22. The computer readable medium of claim 18, wherein the arithmetic unit is to forward the data by storing the data at a physical register targeted by the load instruction in response to moving the data to the load/store unit. 23. The computer readable medium of claim 18, wherein the arithmetic unit is to initiate execution of an instruction that depends on the load instruction in response to forwarding the data to the load instruction. | An arithmetic unit performs store-to-load forwarding based on predicted dependencies between store instructions and load instructions. In some embodiments, the arithmetic unit maintains a table of store instructions that are awaiting movement to a load/store unit of the instruction pipeline. In response to receiving a load instruction that is predicted to be dependent on a store instruction stored at the table, the arithmetic unit causes the data associated with the store instruction to be placed into the physical register targeted by the load instruction. In some embodiments, the arithmetic unit performs the forwarding by mapping the physical register targeted by the load instruction to the physical register where the data associated with the store instruction is located.1. A method comprising:
forwarding, at an arithmetic unit of an instruction pipeline, data associated with a store instruction to satisfy a load instruction concurrent with moving the data to a load/store unit of the instruction pipeline. 2. The method of claim 1, wherein forwarding comprises forwarding the data to the load instruction in response to a prediction that the load is dependent on the store instruction. 3. The method of claim 1, wherein forwarding comprises forwarding the data in response to the data having not been moved from the arithmetic unit to a load/store unit of the instruction pipeline. 4. The method of claim 1, wherein forwarding comprises storing the data at a physical register targeted by the load instruction in response to moving the data from the arithmetic unit to a load/store unit of the instruction pipeline. 5. The method of claim 1, further comprising initiating execution of an instruction that depends on the load instruction in response to forwarding the data to the load instruction. 6. The method of claim 1, wherein forwarding comprises forwarding the data in response to determining a size of the data associated with the store instruction matches a size of data associated with the load instruction. 7. A method, comprising:
in response to a prediction at an instruction pipeline that a first load instruction is dependent on a first store instruction, forwarding data associated with the first store instruction to satisfy the first load instruction prior to moving the data to a load/store unit of the instruction pipeline. 8. The method of claim 7, further comprising:
storing the first store instruction at a first table; storing the first load instruction at a second table in response to determining the store instruction is stored at the first table and the data associated with the first store instruction has not been moved to the load/store unit; and forwarding the data to the first load instruction in response to determining that the data associated with the first store instruction is being moved to the load/store unit and the first load instruction is stored at the second table. 9. The method of claim 8, further comprising:
storing a second store instruction at the first table; and suppressing storage of a second load instruction that is dependent on the second store instruction at the second table in response to determining that data associated with the second store instruction has been moved to the load/store unit. 10. The method of claim 9, further comprising forwarding the data associated with the second store instruction to the second load instruction at the load/store unit. 11. A processor comprising:
a cache; and an instruction pipeline comprising:
a load/store unit to load and store data from and to the cache; and
an arithmetic unit to forward data associated with a store instruction to satisfy a load instruction concurrent with moving the data associated with the store instruction to the load/store unit. 12. The processor of claim 11, wherein:
the instruction pipeline further comprises a front end to provide a prediction that the load instruction is dependent on the store instruction; and the arithmetic unit is to forward the data to the load instruction in response to a prediction that the load is dependent on the store instruction. 13. The processor of claim 12, wherein the arithmetic unit is to forward the data in response to determining that the data has not been moved from the arithmetic unit to a load/store unit of the instruction pipeline. 14. The processor of claim 11, wherein the arithmetic unit is to forward the data by remapping a first physical register targeted by the load instruction to a second physical register targeted by the store instruction. 15. The processor of claim 11, wherein the arithmetic unit is to forward the data by storing the data at a physical register targeted by the load instruction in response to moving the data to the load/store unit. 16. The processor of claim 11, wherein the arithmetic unit is to initiate execution of an instruction that depends on the load instruction in response to forwarding the data to the load instruction. 17. The processor of claim 11, wherein the arithmetic unit is to forward the data in response to determining a size of the data associated with the store instruction matches a size of data associated with the load instruction. 18. A computer readable medium storing code to adapt at least one computer system to perform a portion of a process to fabricate at least part of a processor comprising:
a cache; and an instruction pipeline comprising:
a load/store unit to load and store data from and to the cache; and
an arithmetic unit to forward data associated with a store instruction to a load instruction. 19. The computer readable medium of claim 18, wherein:
the instruction pipeline further comprises a front end to provide a prediction that the load instruction is dependent on the store instruction; and the arithmetic unit is to forward the data to the load instruction in response to a prediction that the load is dependent on the store instruction. 20. The computer readable medium of claim 18, wherein the arithmetic unit is to forward the data in response to the data having not been moved from the arithmetic unit to a load/store unit of the instruction pipeline. 21. The computer readable medium of claim 18, wherein the arithmetic unit is to forward the data by remapping a first physical register targeted by the load instruction to a second physical register targeted by the store instruction. 22. The computer readable medium of claim 18, wherein the arithmetic unit is to forward the data by storing the data at a physical register targeted by the load instruction in response to moving the data to the load/store unit. 23. The computer readable medium of claim 18, wherein the arithmetic unit is to initiate execution of an instruction that depends on the load instruction in response to forwarding the data to the load instruction. | 2,100 |
5,342 | 5,342 | 14,274,673 | 2,175 | Electronic devices, interfaces for electronic devices, and techniques for interacting with such interfaces and electronic devices are described. For instance, this disclosure describes an example electronic device that includes sensors, such as multiple front-facing cameras to detect orientation and/or location of the electronic device relative to an object and one or more inertial sensors. Users of the device may perform gestures on the device by moving the device in-air and/or by moving their head, face, or eyes relative to the device. In response to these gestures, the device may perform operations. | 1. A handheld electronic device comprising:
a display on which to present one or more graphical user interfaces, a display axis defined perpendicular to the display; one or more sensors to determine an orientation of the handheld electronic device relative to at least a portion of a user's body; one or more processors; and memory storing instructions operable to cause the one or more processors to perform operations comprising:
presenting a first graphical user interface of an application on the display responsive to receiving a signal from the one or more sensors indicating that the handheld electronic device is oriented with the display axis substantially aligned with the portion of the user's body;
presenting a second graphical user interface of the application on the display responsive to receiving a signal from the one or more sensors indicative of a first tilt gesture in which the handheld electronic device is oriented with the display axis offset from the portion of the user's body by a first angle in a first rotational direction; and
presenting a third graphical user interface of the application on the display responsive to receiving a signal from the one or more sensors indicative of a second tilt gesture in which the handheld electronic device is oriented with the display axis offset from the portion of the user's body by a second angle in a second rotational direction opposite the first rotational direction. 2. The handheld electronic device of claim 1, wherein:
the application comprises a shopping application; the first graphical user interface comprises one or more items available for purchase; the second graphical user interface comprises recommendations for additional items available for purchase; and the third graphical user interface comprises a control interface including one or more controls or settings of the shopping application. 3. The handheld electronic device of claim 1, wherein:
the application comprises a content library application; the first graphical user interface comprises one or more content items in a collection of content items available for consumption; the second graphical user interface comprises recommendations for additional content items available for purchase from a content store; and the third graphical user interface comprises a control interface including one or more controls or settings of the content consumption application. 4. The handheld electronic device of claim 1, wherein:
the application comprises a reader application; the first graphical user interface comprises content of an electronic book; the second graphical user interface comprises supplemental information associated with the content of the electronic book presented in the first graphical user interface; and the third graphical user interface comprises a table of contents of the electronic book. 5. The handheld electronic device of claim 1, wherein:
the application comprises a media player application; the first graphical user interface comprises information of a playing audio content item; the second graphical user interface comprises lyrics or a transcript of the playing audio content item and identifies a portion of the lyrics or transcript that is presently being played back; and the third graphical user interface comprises a control interface including one or more controls or settings of the media player application. 6. The handheld electronic device of claim 1, wherein:
the application comprises a browser application; the first graphical user interface comprises content of a website or web search results; the second graphical user interface comprises one or more topics currently trending on one or more search engines; and the third graphical user interface comprises a list of currently open tabs or pages of the browser application. 7. The handheld electronic device of claim 1, wherein:
the application comprises an email application; the first graphical user interface comprises an inbox of the email application; the second graphical user interface comprises one or more attachments attached to one or more emails in the inbox; and the third graphical user interface comprises a control interface including one or more controls or settings of the email application. 8. The handheld electronic device of claim 1, wherein:
the application comprises an email application; the first graphical user interface comprises an open email; the second graphical user interface comprises a list of emails from the sender of the open email; and the third graphical user interface comprises a control interface including one or more controls or settings of the email application. 9. The handheld electronic device of claim 1, wherein:
the application comprises an email application; the first graphical user interface comprises an email reply, reply all, or forward; the second graphical user interface comprises a list of selectable quick reply messages; and the third graphical user interface comprises a control interface including one or more controls or settings of the email application. 10. The handheld electronic device of claim 1, wherein:
the application comprises an email application; the first graphical user interface comprises a new email composition interface; the second graphical user interface comprises a list of contacts from which to select a recipient of the new email; and the third graphical user interface comprises a control interface including one or more controls or settings of the email application. 11. The handheld electronic device of claim 1, the operations further comprising presenting supplemental information on the display concurrently with the first graphical user interface responsive to receiving a signal from the one or more sensors indicative of a peek gesture in which the handheld electronic device is oriented with the display axis offset from the portion of the user's body:
in the first rotational direction by an angle less than the first angle, or in the second rotational direction by an angle less than the second angle. 12. A method comprising:
causing a first pane of a graphical user interface of an application to be presented on a display of an electronic device; detecting a tilt gesture including a change in orientation of the electronic device relative to a user; and causing, responsive to detecting the tilt gesture, a second pane of the graphical user interface of the application to be presented on the display of the electronic device. 13. The method of claim 12, wherein detecting the tilt gesture comprises detecting a first rotational motion of the electronic device in a first rotational direction about an axis parallel to the display followed by a second rotational motion in a second rotational direction opposite the first rotational direction. 14. The method of claim 13, wherein the detecting the tilt gesture is based at least in part on signals from one or more optical sensors and one or more inertial sensors. 15. The method of claim 12, further comprising:
detecting a peek gesture including a second change in orientation of the electronic device relative to the user, the second change in orientation being smaller in magnitude than the change in orientation of the tilt gesture; and overlaying, responsive to detecting the peek gesture, supplemental information on the first pane of the graphical user interface. 16. The method of claim 12, wherein the detecting the peek gesture is based on one or more optical sensors. 17. The method of claim 12, wherein:
the application comprises a shopping application; the first pane of the graphical user interface comprises one or more items available for purchase; and the second pane of the graphical user interface comprises recommendations for additional items available for purchase. 18. The method of claim 12, wherein:
the application comprises a content library application; the first pane of the graphical user interface comprises one or more content items in a collection of content items available for consumption; and the second pane of the graphical user interface comprises recommendations for additional content items available for purchase from a content store. 19. The method of claim 12, wherein:
the application comprises a reader application; the first pane of the graphical user interface comprises content of an electronic book; and the second pane of the graphical user interface comprises:
supplemental information associated with the content of the electronic book presented in the first pane of the graphical user interface; or
a table of contents of the electronic book. 20. The method of claim 12, wherein:
the application comprises a media player application; the first pane of the graphical user interface comprises information of a playing audio content item; and the second pane of the graphical user interface comprises lyrics or a transcript of the playing audio content item and identifies a portion of the lyrics or transcript that is presently being played back. 21. The method of claim 12, wherein:
the application comprises a browser application; the first pane of the graphical user interface comprises content of a website or web search results; and the second pane of the graphical user interface comprises at least one of:
one or more currently trending topics; or
a list of currently open tabs or pages of the browser application. 22. The method of claim 12, wherein:
the application comprises an email application; the first pane of the graphical user interface comprises an inbox of the email application; and the second pane of the graphical user interface comprises one or more attachments attached to one or more emails in the inbox. 23. The method of claim 12, wherein:
the application comprises an email application; the first pane of the graphical user interface comprises an open email; and the second pane of the graphical user interface comprises a list of emails from the sender of the open email. 24. The method of claim 12, wherein:
the application comprises an email application; the first pane of the graphical user interface comprises an email reply, reply all, or forward; and the second pane of the graphical user interface comprises a list of selectable quick reply messages. 25. The method of claim 12, wherein:
the application comprises an email application; the first pane of the graphical user interface comprises a new email composition interface; and the second pane of the graphical user interface comprises a list of contacts from which to select a recipient of the new email. 26. One or more computer-readable storing instructions executable by one or more processors of the electronic device to implement the method of claim 12. 27. An electronic device comprising:
one or more processors; and memory communicatively coupled to the one or more processors and storing instructions that, when executed, configure the one or more processors to implement the method of claim 12. | Electronic devices, interfaces for electronic devices, and techniques for interacting with such interfaces and electronic devices are described. For instance, this disclosure describes an example electronic device that includes sensors, such as multiple front-facing cameras to detect orientation and/or location of the electronic device relative to an object and one or more inertial sensors. Users of the device may perform gestures on the device by moving the device in-air and/or by moving their head, face, or eyes relative to the device. In response to these gestures, the device may perform operations.1. A handheld electronic device comprising:
a display on which to present one or more graphical user interfaces, a display axis defined perpendicular to the display; one or more sensors to determine an orientation of the handheld electronic device relative to at least a portion of a user's body; one or more processors; and memory storing instructions operable to cause the one or more processors to perform operations comprising:
presenting a first graphical user interface of an application on the display responsive to receiving a signal from the one or more sensors indicating that the handheld electronic device is oriented with the display axis substantially aligned with the portion of the user's body;
presenting a second graphical user interface of the application on the display responsive to receiving a signal from the one or more sensors indicative of a first tilt gesture in which the handheld electronic device is oriented with the display axis offset from the portion of the user's body by a first angle in a first rotational direction; and
presenting a third graphical user interface of the application on the display responsive to receiving a signal from the one or more sensors indicative of a second tilt gesture in which the handheld electronic device is oriented with the display axis offset from the portion of the user's body by a second angle in a second rotational direction opposite the first rotational direction. 2. The handheld electronic device of claim 1, wherein:
the application comprises a shopping application; the first graphical user interface comprises one or more items available for purchase; the second graphical user interface comprises recommendations for additional items available for purchase; and the third graphical user interface comprises a control interface including one or more controls or settings of the shopping application. 3. The handheld electronic device of claim 1, wherein:
the application comprises a content library application; the first graphical user interface comprises one or more content items in a collection of content items available for consumption; the second graphical user interface comprises recommendations for additional content items available for purchase from a content store; and the third graphical user interface comprises a control interface including one or more controls or settings of the content consumption application. 4. The handheld electronic device of claim 1, wherein:
the application comprises a reader application; the first graphical user interface comprises content of an electronic book; the second graphical user interface comprises supplemental information associated with the content of the electronic book presented in the first graphical user interface; and the third graphical user interface comprises a table of contents of the electronic book. 5. The handheld electronic device of claim 1, wherein:
the application comprises a media player application; the first graphical user interface comprises information of a playing audio content item; the second graphical user interface comprises lyrics or a transcript of the playing audio content item and identifies a portion of the lyrics or transcript that is presently being played back; and the third graphical user interface comprises a control interface including one or more controls or settings of the media player application. 6. The handheld electronic device of claim 1, wherein:
the application comprises a browser application; the first graphical user interface comprises content of a website or web search results; the second graphical user interface comprises one or more topics currently trending on one or more search engines; and the third graphical user interface comprises a list of currently open tabs or pages of the browser application. 7. The handheld electronic device of claim 1, wherein:
the application comprises an email application; the first graphical user interface comprises an inbox of the email application; the second graphical user interface comprises one or more attachments attached to one or more emails in the inbox; and the third graphical user interface comprises a control interface including one or more controls or settings of the email application. 8. The handheld electronic device of claim 1, wherein:
the application comprises an email application; the first graphical user interface comprises an open email; the second graphical user interface comprises a list of emails from the sender of the open email; and the third graphical user interface comprises a control interface including one or more controls or settings of the email application. 9. The handheld electronic device of claim 1, wherein:
the application comprises an email application; the first graphical user interface comprises an email reply, reply all, or forward; the second graphical user interface comprises a list of selectable quick reply messages; and the third graphical user interface comprises a control interface including one or more controls or settings of the email application. 10. The handheld electronic device of claim 1, wherein:
the application comprises an email application; the first graphical user interface comprises a new email composition interface; the second graphical user interface comprises a list of contacts from which to select a recipient of the new email; and the third graphical user interface comprises a control interface including one or more controls or settings of the email application. 11. The handheld electronic device of claim 1, the operations further comprising presenting supplemental information on the display concurrently with the first graphical user interface responsive to receiving a signal from the one or more sensors indicative of a peek gesture in which the handheld electronic device is oriented with the display axis offset from the portion of the user's body:
in the first rotational direction by an angle less than the first angle, or in the second rotational direction by an angle less than the second angle. 12. A method comprising:
causing a first pane of a graphical user interface of an application to be presented on a display of an electronic device; detecting a tilt gesture including a change in orientation of the electronic device relative to a user; and causing, responsive to detecting the tilt gesture, a second pane of the graphical user interface of the application to be presented on the display of the electronic device. 13. The method of claim 12, wherein detecting the tilt gesture comprises detecting a first rotational motion of the electronic device in a first rotational direction about an axis parallel to the display followed by a second rotational motion in a second rotational direction opposite the first rotational direction. 14. The method of claim 13, wherein the detecting the tilt gesture is based at least in part on signals from one or more optical sensors and one or more inertial sensors. 15. The method of claim 12, further comprising:
detecting a peek gesture including a second change in orientation of the electronic device relative to the user, the second change in orientation being smaller in magnitude than the change in orientation of the tilt gesture; and overlaying, responsive to detecting the peek gesture, supplemental information on the first pane of the graphical user interface. 16. The method of claim 12, wherein the detecting the peek gesture is based on one or more optical sensors. 17. The method of claim 12, wherein:
the application comprises a shopping application; the first pane of the graphical user interface comprises one or more items available for purchase; and the second pane of the graphical user interface comprises recommendations for additional items available for purchase. 18. The method of claim 12, wherein:
the application comprises a content library application; the first pane of the graphical user interface comprises one or more content items in a collection of content items available for consumption; and the second pane of the graphical user interface comprises recommendations for additional content items available for purchase from a content store. 19. The method of claim 12, wherein:
the application comprises a reader application; the first pane of the graphical user interface comprises content of an electronic book; and the second pane of the graphical user interface comprises:
supplemental information associated with the content of the electronic book presented in the first pane of the graphical user interface; or
a table of contents of the electronic book. 20. The method of claim 12, wherein:
the application comprises a media player application; the first pane of the graphical user interface comprises information of a playing audio content item; and the second pane of the graphical user interface comprises lyrics or a transcript of the playing audio content item and identifies a portion of the lyrics or transcript that is presently being played back. 21. The method of claim 12, wherein:
the application comprises a browser application; the first pane of the graphical user interface comprises content of a website or web search results; and the second pane of the graphical user interface comprises at least one of:
one or more currently trending topics; or
a list of currently open tabs or pages of the browser application. 22. The method of claim 12, wherein:
the application comprises an email application; the first pane of the graphical user interface comprises an inbox of the email application; and the second pane of the graphical user interface comprises one or more attachments attached to one or more emails in the inbox. 23. The method of claim 12, wherein:
the application comprises an email application; the first pane of the graphical user interface comprises an open email; and the second pane of the graphical user interface comprises a list of emails from the sender of the open email. 24. The method of claim 12, wherein:
the application comprises an email application; the first pane of the graphical user interface comprises an email reply, reply all, or forward; and the second pane of the graphical user interface comprises a list of selectable quick reply messages. 25. The method of claim 12, wherein:
the application comprises an email application; the first pane of the graphical user interface comprises a new email composition interface; and the second pane of the graphical user interface comprises a list of contacts from which to select a recipient of the new email. 26. One or more computer-readable storing instructions executable by one or more processors of the electronic device to implement the method of claim 12. 27. An electronic device comprising:
one or more processors; and memory communicatively coupled to the one or more processors and storing instructions that, when executed, configure the one or more processors to implement the method of claim 12. | 2,100 |
5,343 | 5,343 | 12,756,202 | 2,159 | A system is described for integrating a search engine and one or more social network resources. The system operates by determining whether a search operation being conducted by a user warrants interaction with a social network resource. If so, the system may provide an invitation to the user to forward a query-related message to the social network resource. The system then sends the message to a group of contacts via the social network resource, where the group of contacts can be defined in various ways. The system receives a response from at least one contact in the group of contacts and presents that response to the user using various delivery mechanisms, as governed by various delivery timings. | 1. A computer readable medium for storing computer readable instructions, the computer readable instructions providing a message preparation module when executed by one or more processing devices, the computer readable instructions comprising:
logic configured to determine whether a search operation being conducted by a user warrants interaction with a social network resource; and logic configured to send a message to a group of contacts via the social network resource, the message presenting a question to the group of contacts, the question pertaining to the search operation. 2. The computer readable medium of claim 1, further comprising:
logic configured to provide an invitation to the user to forward the message to the social network resource; and logic configured to interact with the user to generate the message. 3. A method, implemented using electrical computing functionality, for integrating a search service with a social network resource, comprising:
engaging a user in a search operation using a search engine; determining whether the search operation warrants interaction with the social network resource; if it is determined that the search operation warrants interaction, providing an invitation to the user to forward a message to the social network resource, the message presenting a question to a group of contacts affiliated with the social network resource, the question pertaining to the search operation; interacting with the user to generate the message; and sending the message to the group of contacts via the social network resource. 4. The method of claim 3, wherein the social network resource is at least one of:
a service which maintains at least one of network-accessible profiles of users or relationships among users; an instant messaging service; an Email service; a message distribution service which distributes messages to subscribing users; or a question-answer (QA) service which facilitates the asking and answering of questions. 5. The method of claim 3, wherein the group of contacts is determined in a dynamic manner to include at least one contact which satisfies at least one selection criterion. 6. The method of claim 3, wherein said determining comprises analyzing the search operation to determine whether the search operation pertains to a topic for which interaction with the social network resource is deemed warranted. 7. The method of claim 3, wherein said determining comprises analyzing the search operation to determine whether the search operation pertains to an extended task. 8. The method of claim 3, wherein said determining comprises analyzing the search operation to determine whether the user is determined to have failed in retrieving satisfactory search results. 9. The method of claim 3, wherein said interaction with the user comprises providing a suggestion to the user regarding a phrasing of the message. 10. The method of claim 3, further comprising interacting with a source to provide message data for use in generating the message. 11. The method of claim 10, wherein the source is the search engine. 12. The method of claim 10, wherein the source is a result storage module that stores search results on a temporary basis. 13. The method of claim 3, further comprising:
receiving a social network-originating message that is generated in course of interaction with the social network resource; and using an automated response agent to route the social network-originating message to the search engine, the search engine providing an answer to a question presented in the social network-originating message. 14. The method of claim 3, further comprising receiving at least one response to the message from the group of contacts, wherein said at least one response is received as per a delivery timing, the delivery timing comprising at least one of:
soon after the message is sent based on pre-stored information; in a same search session in which the message is sent; or after the search session in which the message is sent. 15. The method of claim 3, further comprising receiving at least one response to the message from the group of contacts, wherein said at least one response is received by a delivery mechanism, the delivery mechanism comprising at least one of:
a search result page which mixes search results from the search engine with responses from the social network resource; a search result page that is dedicated to the presentation of responses from the social network resource; or a mechanism that is separate from the search engine. 16. The method of claim 3, further comprising:
receiving at least one response to the message from the group of contacts; analyzing said at least one response to determine a topic of said at least one response; storing information obtained from said analyzing in an analysis store; using the information to modify at least one aspect of said method. 17. The method of claim 3, further comprising:
receiving at least one response to the message from the group of contacts; receiving feedback which provides an evaluation of the user of said at least one response. 18. The method of claim 3, further comprising:
identifying and storing search information regarding search operations, each search operation corresponding to an occasion in which the social network resource is deemed to have been more successful than the search engine in satisfying a search objective of an associated user performing the search operation; identifying and storing attribute information regarding characteristics of the search operations; building a model based on the search information and attribute information; and using the model to improve at least one aspect of the search engine. 19. A system, implemented using electrical computing functionality, for integrating a search service with a social network resource, comprising:
functionality configured to determine whether a search operation being conducted by a user warrants interaction with a social network resource via a message-feeder agent, the functionality configured to send a message to the message-feeder agent if it is determined that the search operation warrants interaction, at least one contact affiliated with the social network resource subscribing to the message-feeder agent. 20. The system of claim 19, wherein said message-feeder agent shields an identity to the user from said at least one contact, and shields an identity of said at least one contact from the user. | A system is described for integrating a search engine and one or more social network resources. The system operates by determining whether a search operation being conducted by a user warrants interaction with a social network resource. If so, the system may provide an invitation to the user to forward a query-related message to the social network resource. The system then sends the message to a group of contacts via the social network resource, where the group of contacts can be defined in various ways. The system receives a response from at least one contact in the group of contacts and presents that response to the user using various delivery mechanisms, as governed by various delivery timings.1. A computer readable medium for storing computer readable instructions, the computer readable instructions providing a message preparation module when executed by one or more processing devices, the computer readable instructions comprising:
logic configured to determine whether a search operation being conducted by a user warrants interaction with a social network resource; and logic configured to send a message to a group of contacts via the social network resource, the message presenting a question to the group of contacts, the question pertaining to the search operation. 2. The computer readable medium of claim 1, further comprising:
logic configured to provide an invitation to the user to forward the message to the social network resource; and logic configured to interact with the user to generate the message. 3. A method, implemented using electrical computing functionality, for integrating a search service with a social network resource, comprising:
engaging a user in a search operation using a search engine; determining whether the search operation warrants interaction with the social network resource; if it is determined that the search operation warrants interaction, providing an invitation to the user to forward a message to the social network resource, the message presenting a question to a group of contacts affiliated with the social network resource, the question pertaining to the search operation; interacting with the user to generate the message; and sending the message to the group of contacts via the social network resource. 4. The method of claim 3, wherein the social network resource is at least one of:
a service which maintains at least one of network-accessible profiles of users or relationships among users; an instant messaging service; an Email service; a message distribution service which distributes messages to subscribing users; or a question-answer (QA) service which facilitates the asking and answering of questions. 5. The method of claim 3, wherein the group of contacts is determined in a dynamic manner to include at least one contact which satisfies at least one selection criterion. 6. The method of claim 3, wherein said determining comprises analyzing the search operation to determine whether the search operation pertains to a topic for which interaction with the social network resource is deemed warranted. 7. The method of claim 3, wherein said determining comprises analyzing the search operation to determine whether the search operation pertains to an extended task. 8. The method of claim 3, wherein said determining comprises analyzing the search operation to determine whether the user is determined to have failed in retrieving satisfactory search results. 9. The method of claim 3, wherein said interaction with the user comprises providing a suggestion to the user regarding a phrasing of the message. 10. The method of claim 3, further comprising interacting with a source to provide message data for use in generating the message. 11. The method of claim 10, wherein the source is the search engine. 12. The method of claim 10, wherein the source is a result storage module that stores search results on a temporary basis. 13. The method of claim 3, further comprising:
receiving a social network-originating message that is generated in course of interaction with the social network resource; and using an automated response agent to route the social network-originating message to the search engine, the search engine providing an answer to a question presented in the social network-originating message. 14. The method of claim 3, further comprising receiving at least one response to the message from the group of contacts, wherein said at least one response is received as per a delivery timing, the delivery timing comprising at least one of:
soon after the message is sent based on pre-stored information; in a same search session in which the message is sent; or after the search session in which the message is sent. 15. The method of claim 3, further comprising receiving at least one response to the message from the group of contacts, wherein said at least one response is received by a delivery mechanism, the delivery mechanism comprising at least one of:
a search result page which mixes search results from the search engine with responses from the social network resource; a search result page that is dedicated to the presentation of responses from the social network resource; or a mechanism that is separate from the search engine. 16. The method of claim 3, further comprising:
receiving at least one response to the message from the group of contacts; analyzing said at least one response to determine a topic of said at least one response; storing information obtained from said analyzing in an analysis store; using the information to modify at least one aspect of said method. 17. The method of claim 3, further comprising:
receiving at least one response to the message from the group of contacts; receiving feedback which provides an evaluation of the user of said at least one response. 18. The method of claim 3, further comprising:
identifying and storing search information regarding search operations, each search operation corresponding to an occasion in which the social network resource is deemed to have been more successful than the search engine in satisfying a search objective of an associated user performing the search operation; identifying and storing attribute information regarding characteristics of the search operations; building a model based on the search information and attribute information; and using the model to improve at least one aspect of the search engine. 19. A system, implemented using electrical computing functionality, for integrating a search service with a social network resource, comprising:
functionality configured to determine whether a search operation being conducted by a user warrants interaction with a social network resource via a message-feeder agent, the functionality configured to send a message to the message-feeder agent if it is determined that the search operation warrants interaction, at least one contact affiliated with the social network resource subscribing to the message-feeder agent. 20. The system of claim 19, wherein said message-feeder agent shields an identity to the user from said at least one contact, and shields an identity of said at least one contact from the user. | 2,100 |
5,344 | 5,344 | 13,547,771 | 2,178 | A method and system is provided for facilitating affiliate link generation. A user enables the system by identifying a webpage on an affiliate web site. The system performs an initial assessment of the page to extract webpage information, which is compared to information stored in a database. If the extracted information matches stored information, a record of the webpage is displayed and an affiliate link is dynamically generated for immediate use. If the extracted information does not match stored information, a new record of the webpage is created. If the webpage contains product-specific data, a product-specific record is stored. If the webpage does not contain product-specific data, a non-product record is stored. An affiliate link is then dynamically created. The new record of the product and dynamically created affiliate link is added to the database for immediate use. | 1. A method for dynamically generating affiliate links over the Internet via a facilitator, the method comprising the steps of:
a first step of receiving, from a user, a request to generate an affiliate link for an affiliate webpage; a second step of assessing the affiliate webpage to scrape and extract queried webpage information related to a queried webpage; a third step of displaying the extracted queried webpage information to the user; a fourth step of facilitating the creation of an affiliate link for the affiliate webpage, wherein the affiliate link is unique to the user; and a fifth step of displaying the affiliate link to the user. 2. The method of claim 1, wherein the user requests an affiliate link by engaging a system activator bookmark, when the user is on the affiliate webpage, which initiates execution of an initialization JavaScript. 3. The method of claim 1, further comprising the step of receiving, from an affiliate, information related to a plurality of webpages and storing webpage information in a database. 4. The method of claim 3, further comprising the step of analyzing the queried webpage information against the webpage information stored in the database. 5. The method of claim 4, further comprising the step of, if the queried webpage information is not in the database, storing the extracted queried webpage information in the database. 6. The method of claim 1, further comprising the step of recording the affiliate link as unique to the user in the database. 7. The method of claim 1, further comprising the step of transmitting to the affiliate the affiliate link unique to the user. 8. The method of claim 1, further comprising the step of requesting personally identifiable login information from the user. 9. The method of claim 1, wherein one or more of webpage information and queried webpage information is comprised of at least one of an affiliate product webpage, an affiliate non-product webpage, a product commission, a product description, a product option, a product price, or a product picture. 10. The method of claim 1, wherein the affiliate is comprised of one or more advertisers. 11. The method of claim 1, wherein the method facilitates affiliate link generation for a plurality of browsers and technology systems. 12. A method for dynamically generating affiliate links over the Internet via a facilitator, the method comprising the steps of:
a first step of receiving, from an affiliate, information related to a plurality of webpages and storing webpage information in a database; a second step of receiving, from a user, a request to generate an affiliate link for an affiliate webpage; a third step of assessing the affiliate webpage to scrape and extract queried webpage information related to a queried webpage; a fourth step of analyzing the queried webpage information against the webpage information stored in the database; a fifth step of, if the queried webpage information is in the database, displaying the webpage information stored in the database to the user; a sixth step of, if the queried webpage information is not in the database, displaying the extracted queried webpage information to the user and presenting a query to the user to confirm the request to generate an affiliate link; a seventh step of facilitating the creation of an affiliate link, wherein the affiliate link is unique to the user; and an eighth step of displaying the affiliate link to the user. 13. The method of claim 12, wherein the user requests an affiliate link by engaging a system activator bookmark, when the user is on the affiliate webpage, which initiates execution of an initialization JavaScript. 14. The method of claim 12, further comprising the step of recording the affiliate link as unique to the user in the database. 15. The method of claim 12, further comprising the step of transmitting to the affiliate the affiliate link unique to the user. 16. The method of claim 12, further comprising the step of, if the queried webpage information is not in the database, storing the extracted queried webpage information in the database. 17. The method of claim 12, further comprising the step of requesting personally identifiable login information from the user. 18. The method of claim 12, wherein one or more of webpage information and queried webpage information is comprised of at least one of an affiliate product webpage, an affiliate non-product webpage, a product commission, a product description, a product option, a product price, or a product picture. 19. The method of claim 12, wherein the affiliate is comprised of one or more advertisers. 20. The method of claim 12, wherein the method facilitates affiliate link generation for a plurality of browsers and technology systems. | A method and system is provided for facilitating affiliate link generation. A user enables the system by identifying a webpage on an affiliate web site. The system performs an initial assessment of the page to extract webpage information, which is compared to information stored in a database. If the extracted information matches stored information, a record of the webpage is displayed and an affiliate link is dynamically generated for immediate use. If the extracted information does not match stored information, a new record of the webpage is created. If the webpage contains product-specific data, a product-specific record is stored. If the webpage does not contain product-specific data, a non-product record is stored. An affiliate link is then dynamically created. The new record of the product and dynamically created affiliate link is added to the database for immediate use.1. A method for dynamically generating affiliate links over the Internet via a facilitator, the method comprising the steps of:
a first step of receiving, from a user, a request to generate an affiliate link for an affiliate webpage; a second step of assessing the affiliate webpage to scrape and extract queried webpage information related to a queried webpage; a third step of displaying the extracted queried webpage information to the user; a fourth step of facilitating the creation of an affiliate link for the affiliate webpage, wherein the affiliate link is unique to the user; and a fifth step of displaying the affiliate link to the user. 2. The method of claim 1, wherein the user requests an affiliate link by engaging a system activator bookmark, when the user is on the affiliate webpage, which initiates execution of an initialization JavaScript. 3. The method of claim 1, further comprising the step of receiving, from an affiliate, information related to a plurality of webpages and storing webpage information in a database. 4. The method of claim 3, further comprising the step of analyzing the queried webpage information against the webpage information stored in the database. 5. The method of claim 4, further comprising the step of, if the queried webpage information is not in the database, storing the extracted queried webpage information in the database. 6. The method of claim 1, further comprising the step of recording the affiliate link as unique to the user in the database. 7. The method of claim 1, further comprising the step of transmitting to the affiliate the affiliate link unique to the user. 8. The method of claim 1, further comprising the step of requesting personally identifiable login information from the user. 9. The method of claim 1, wherein one or more of webpage information and queried webpage information is comprised of at least one of an affiliate product webpage, an affiliate non-product webpage, a product commission, a product description, a product option, a product price, or a product picture. 10. The method of claim 1, wherein the affiliate is comprised of one or more advertisers. 11. The method of claim 1, wherein the method facilitates affiliate link generation for a plurality of browsers and technology systems. 12. A method for dynamically generating affiliate links over the Internet via a facilitator, the method comprising the steps of:
a first step of receiving, from an affiliate, information related to a plurality of webpages and storing webpage information in a database; a second step of receiving, from a user, a request to generate an affiliate link for an affiliate webpage; a third step of assessing the affiliate webpage to scrape and extract queried webpage information related to a queried webpage; a fourth step of analyzing the queried webpage information against the webpage information stored in the database; a fifth step of, if the queried webpage information is in the database, displaying the webpage information stored in the database to the user; a sixth step of, if the queried webpage information is not in the database, displaying the extracted queried webpage information to the user and presenting a query to the user to confirm the request to generate an affiliate link; a seventh step of facilitating the creation of an affiliate link, wherein the affiliate link is unique to the user; and an eighth step of displaying the affiliate link to the user. 13. The method of claim 12, wherein the user requests an affiliate link by engaging a system activator bookmark, when the user is on the affiliate webpage, which initiates execution of an initialization JavaScript. 14. The method of claim 12, further comprising the step of recording the affiliate link as unique to the user in the database. 15. The method of claim 12, further comprising the step of transmitting to the affiliate the affiliate link unique to the user. 16. The method of claim 12, further comprising the step of, if the queried webpage information is not in the database, storing the extracted queried webpage information in the database. 17. The method of claim 12, further comprising the step of requesting personally identifiable login information from the user. 18. The method of claim 12, wherein one or more of webpage information and queried webpage information is comprised of at least one of an affiliate product webpage, an affiliate non-product webpage, a product commission, a product description, a product option, a product price, or a product picture. 19. The method of claim 12, wherein the affiliate is comprised of one or more advertisers. 20. The method of claim 12, wherein the method facilitates affiliate link generation for a plurality of browsers and technology systems. | 2,100 |
5,345 | 5,345 | 13,977,605 | 2,185 | Methods, apparatus, and systems for facilitating effective power management through dynamic reconfiguration of interrupts. Interrupt vectors are mapped to various processor cores in a multi-core processor, and interrupt workloads on the processor cores are monitored. When an interrupt workload for a given processor core is detected to fall below a threshold, the interrupt vectors are dynamically reconfigured by remapping interrupt vectors that are currently mapped to the processor core to at least one other processor core, such that there are no interrupt vectors mapped to the processor core after reconfiguration. The core is then enabled to be put in a deeper idle state. Similar operations can be applied to additional processor cores, effecting a collapsing of interrupt vectors onto fewer processor cores. In response to detecting cores emerging from idle states, reconfiguration of interrupt vectors can be performed to rebalance the assignment of the vectors across active cores by remapping a portion of the vectors to those cores. | 1-22. (canceled) 23. A method for configuring interrupts in a computer system employing a multi-core processor having a plurality of processor cores comprising:
mapping interrupt vectors to the plurality of processor cores; detecting that an interrupt workload of a first processor core has fallen below a threshold; and in response thereto, reconfiguring each of the interrupt vectors mapped to the first processor core to be remapped to a processor core other than the first processor core. 24. The method of claim 23, wherein reconfiguration of the interrupt vectors is effected, at least in part, through use of an operating system. 25. The method of claim 24, wherein the operating system is a Linux operating system. 26. The method of claim 24, wherein the operating system effects reconfiguration of the interrupt vectors through use of a device driver that interacts with an interrupt controller on the multi-core processor. 27. The method of claim 26, wherein the device driver reads data in one of a configuration file or data structure accessed by the operating system. 28. The method of claim 23, further comprising load balancing interrupt vector assignments to the plurality of processor cores. 29. The method of claim 23, further comprising:
detecting that an interrupt workload of a second processor core has fallen below a threshold; and in response thereto, reconfiguring each of the interrupt vectors mapped to the second processor core to be remapped to a processor core other than the first processor core and the second processor core. 30. The method of claim 29, wherein the second processor core is operating at a first operating state prior to the interrupt workload of the second processor core falling below the threshold, the method further comprising putting the second processor core into an idle state that is deeper than the first operating state after the interrupt vectors that were mapped to the second processor are reconfigured. 31. The method of claim 23, wherein the interrupt workload threshold is based on a level of interrupt frequency. 32. The method of claim 23, wherein the first processor core is operating at a first idle state prior to the workload of the first processor core falling below the threshold, the method further comprising putting the first processor core into a deeper idle state after the interrupt vectors that were mapped to the first processor are reconfigured. 33. The method of claim 32, further comprising:
detecting that the first processor core has returned to the first idle state; detecting that an interrupt workload threshold on a third processor core has been exceeded; and in response thereto, remapping at least one interrupt vector from the third processor core to the first processor core. 34. The method of claim 33, further comprising, reconfiguring interrupt vectors by selectively remapping a portion of the interrupt vectors to other processor cores to effect interrupt vector load balancing. 35. The method of claim 33, further comprising dynamically adjusting at least one interrupt workload threshold. 36. The method of claim 33, wherein the interrupt workload threshold is based on an interrupt frequency. 37. The method of claim 23, wherein the interrupt vectors comprise Message-Signaled Interrupt (MSI) vectors. 38. The method of claim 23, wherein the interrupt vectors comprise input/output (IO) interrupt vectors generated by an IO device. 39. An apparatus comprising:
a multi-core processor having multiple processor cores; memory, operatively coupled to the multi-core processor; a network interrupt controller (NIC), operatively coupled to the multi-core processor; a storage device, having instructions stored therein configured to be executed by the multi-core processor to cause the apparatus to perform operations including,
mapping interrupt vectors to the plurality of processor cores;
detecting that an interrupt workload of a first processor core has fallen below a threshold;
and in response thereto,
reconfiguring each of the interrupt vectors mapped to the first processor core to be remapped to a processor core other than the first processor core. 40. The apparatus of claim 39, wherein at least a portion of the plurality of instructions comprise an operating system and reconfiguration of the interrupt vectors is effected, at least in part, through use of the operating system. 41. The apparatus of claim 39, wherein the operating system is a Linux operating system. 42. The apparatus of claim 39, wherein the multi-core processor includes an interrupt controller, and wherein the operating system effects reconfiguration of the interrupt vectors through use of a device driver that interacts with the interrupt controller. 43. The apparatus of claim 39, wherein execution of the instructions cause the apparatus to perform further operations comprising load balancing interrupt vector assignments to the plurality of processor cores. 44. The apparatus of claim 39, wherein the interrupt vectors comprise Message-Signaled Interrupt (MSI) vectors generated by the NIC. 45. A tangible non-transient machine readable medium having a plurality of instructions stored thereon comprising an operating system configured to be executed on a multi-core processor including a plurality of processor cores to cause an apparatus including the multi-core processor to perform operations comprising:
mapping interrupt vectors to the plurality of processor cores; detecting that an interrupt workload of a first processor core has fallen below a threshold; and in response thereto, reconfiguring each of the interrupt vectors mapped to the first processor core to be remapped to a processor core other than the first processor core. 46. The tangible non-transient machine readable medium of claim 45, wherein the operating system is a Linux operating system. 47. The tangible non-transient machine readable medium of claim 45, wherein the operating system effects reconfiguration of the interrupt vectors through use of a device driver that interacts with an interrupt controller on the multi-core processor. 48. The tangible non-transient machine readable medium of claim 47, wherein the device driver reads data in one of a configuration file or data structure accessed by the operating system. 49. The tangible non-transient machine readable medium of claim 45, wherein execution of the instructions cause the apparatus to perform further operations comprising:
detecting that an interrupt workload of a second processor core has fallen below a threshold; and in response thereto, reconfiguring each of the interrupt vectors mapped to the second processor core to be remapped to a processor core other than the first processor core and the second processor core. 50. The tangible non-transient machine readable medium of claim 49, wherein the second processor core is operating at a first operating state prior to the interrupt workload of the second processor core falling below the threshold, and wherein execution of the instructions cause the apparatus to perform further operations comprising putting the second processor core into an idle state that is deeper than the first operating state after the interrupt vectors that were mapped to the second processor are reconfigured. 51. The tangible non-transient machine readable medium of claim 45, wherein the apparatus includes a Network Interrupt Controller (NIC) and the interrupt vectors comprise Message-Signaled Interrupt (MSI) vectors generated by the NIC. | Methods, apparatus, and systems for facilitating effective power management through dynamic reconfiguration of interrupts. Interrupt vectors are mapped to various processor cores in a multi-core processor, and interrupt workloads on the processor cores are monitored. When an interrupt workload for a given processor core is detected to fall below a threshold, the interrupt vectors are dynamically reconfigured by remapping interrupt vectors that are currently mapped to the processor core to at least one other processor core, such that there are no interrupt vectors mapped to the processor core after reconfiguration. The core is then enabled to be put in a deeper idle state. Similar operations can be applied to additional processor cores, effecting a collapsing of interrupt vectors onto fewer processor cores. In response to detecting cores emerging from idle states, reconfiguration of interrupt vectors can be performed to rebalance the assignment of the vectors across active cores by remapping a portion of the vectors to those cores.1-22. (canceled) 23. A method for configuring interrupts in a computer system employing a multi-core processor having a plurality of processor cores comprising:
mapping interrupt vectors to the plurality of processor cores; detecting that an interrupt workload of a first processor core has fallen below a threshold; and in response thereto, reconfiguring each of the interrupt vectors mapped to the first processor core to be remapped to a processor core other than the first processor core. 24. The method of claim 23, wherein reconfiguration of the interrupt vectors is effected, at least in part, through use of an operating system. 25. The method of claim 24, wherein the operating system is a Linux operating system. 26. The method of claim 24, wherein the operating system effects reconfiguration of the interrupt vectors through use of a device driver that interacts with an interrupt controller on the multi-core processor. 27. The method of claim 26, wherein the device driver reads data in one of a configuration file or data structure accessed by the operating system. 28. The method of claim 23, further comprising load balancing interrupt vector assignments to the plurality of processor cores. 29. The method of claim 23, further comprising:
detecting that an interrupt workload of a second processor core has fallen below a threshold; and in response thereto, reconfiguring each of the interrupt vectors mapped to the second processor core to be remapped to a processor core other than the first processor core and the second processor core. 30. The method of claim 29, wherein the second processor core is operating at a first operating state prior to the interrupt workload of the second processor core falling below the threshold, the method further comprising putting the second processor core into an idle state that is deeper than the first operating state after the interrupt vectors that were mapped to the second processor are reconfigured. 31. The method of claim 23, wherein the interrupt workload threshold is based on a level of interrupt frequency. 32. The method of claim 23, wherein the first processor core is operating at a first idle state prior to the workload of the first processor core falling below the threshold, the method further comprising putting the first processor core into a deeper idle state after the interrupt vectors that were mapped to the first processor are reconfigured. 33. The method of claim 32, further comprising:
detecting that the first processor core has returned to the first idle state; detecting that an interrupt workload threshold on a third processor core has been exceeded; and in response thereto, remapping at least one interrupt vector from the third processor core to the first processor core. 34. The method of claim 33, further comprising, reconfiguring interrupt vectors by selectively remapping a portion of the interrupt vectors to other processor cores to effect interrupt vector load balancing. 35. The method of claim 33, further comprising dynamically adjusting at least one interrupt workload threshold. 36. The method of claim 33, wherein the interrupt workload threshold is based on an interrupt frequency. 37. The method of claim 23, wherein the interrupt vectors comprise Message-Signaled Interrupt (MSI) vectors. 38. The method of claim 23, wherein the interrupt vectors comprise input/output (IO) interrupt vectors generated by an IO device. 39. An apparatus comprising:
a multi-core processor having multiple processor cores; memory, operatively coupled to the multi-core processor; a network interrupt controller (NIC), operatively coupled to the multi-core processor; a storage device, having instructions stored therein configured to be executed by the multi-core processor to cause the apparatus to perform operations including,
mapping interrupt vectors to the plurality of processor cores;
detecting that an interrupt workload of a first processor core has fallen below a threshold;
and in response thereto,
reconfiguring each of the interrupt vectors mapped to the first processor core to be remapped to a processor core other than the first processor core. 40. The apparatus of claim 39, wherein at least a portion of the plurality of instructions comprise an operating system and reconfiguration of the interrupt vectors is effected, at least in part, through use of the operating system. 41. The apparatus of claim 39, wherein the operating system is a Linux operating system. 42. The apparatus of claim 39, wherein the multi-core processor includes an interrupt controller, and wherein the operating system effects reconfiguration of the interrupt vectors through use of a device driver that interacts with the interrupt controller. 43. The apparatus of claim 39, wherein execution of the instructions cause the apparatus to perform further operations comprising load balancing interrupt vector assignments to the plurality of processor cores. 44. The apparatus of claim 39, wherein the interrupt vectors comprise Message-Signaled Interrupt (MSI) vectors generated by the NIC. 45. A tangible non-transient machine readable medium having a plurality of instructions stored thereon comprising an operating system configured to be executed on a multi-core processor including a plurality of processor cores to cause an apparatus including the multi-core processor to perform operations comprising:
mapping interrupt vectors to the plurality of processor cores; detecting that an interrupt workload of a first processor core has fallen below a threshold; and in response thereto, reconfiguring each of the interrupt vectors mapped to the first processor core to be remapped to a processor core other than the first processor core. 46. The tangible non-transient machine readable medium of claim 45, wherein the operating system is a Linux operating system. 47. The tangible non-transient machine readable medium of claim 45, wherein the operating system effects reconfiguration of the interrupt vectors through use of a device driver that interacts with an interrupt controller on the multi-core processor. 48. The tangible non-transient machine readable medium of claim 47, wherein the device driver reads data in one of a configuration file or data structure accessed by the operating system. 49. The tangible non-transient machine readable medium of claim 45, wherein execution of the instructions cause the apparatus to perform further operations comprising:
detecting that an interrupt workload of a second processor core has fallen below a threshold; and in response thereto, reconfiguring each of the interrupt vectors mapped to the second processor core to be remapped to a processor core other than the first processor core and the second processor core. 50. The tangible non-transient machine readable medium of claim 49, wherein the second processor core is operating at a first operating state prior to the interrupt workload of the second processor core falling below the threshold, and wherein execution of the instructions cause the apparatus to perform further operations comprising putting the second processor core into an idle state that is deeper than the first operating state after the interrupt vectors that were mapped to the second processor are reconfigured. 51. The tangible non-transient machine readable medium of claim 45, wherein the apparatus includes a Network Interrupt Controller (NIC) and the interrupt vectors comprise Message-Signaled Interrupt (MSI) vectors generated by the NIC. | 2,100 |
5,346 | 5,346 | 14,871,816 | 2,145 | Techniques for coordinating movements of various objects in an electronic document are disclosed. A first-type object remains stationary so that it becomes outside a content boundary of the electronic document, as the content boundary is pulled inside an edge of a window displaying the electronic document. A second-type object remains stationary until the content boundary reaches the edge of the window and then moves along with the scrolled electronic document as the content boundary is pulled inside the edge of the window. A third-type object and a fourth-type object may show different movement behaviors. | 1. A non-transitory 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, cause the device to:
display, on the display, an electronic document comprising a first object and a content boundary, while displaying the electronic document, detect an input corresponding to a request to translate the electronic document in a first direction; in response to detecting the input corresponding to a request to translate the electronic document, translate a respective portion of the electronic document in the first direction in accordance with the detected input without translating the first object, so that the first object is outside of the content boundary of the electronic document; after translating the respective portion of the electronic document without translating the first object, detect an end of the input; in response to detecting the end of the input, translate the respective portion of the electronic document in a second direction different from the first direction without translating the first object, so that the first object is within the content boundary of the electronic document. 2. The non-transitory computer-readable storage medium of claim 1, wherein translating the respective portion of the electronic document in the first direction in accordance with the detected input comprises:
translating the respective portion of the electronic document in the first direction in a linear relationship with the detected input until the content boundary of the electronic document reaches an edge of a window displaying the electronic document; and translating the respective portion of the electronic document in the first direction in a non-linear relationship with the detected input as the content boundary of the electronic document is pulled inside the edge of the window. 3. The non-transitory computer-readable storage medium of claim 2, wherein:
the display is a touch-sensitive display; the detected input comprises movement of a finger on the touch-sensitive display; translating the respective portion of the electronic document in the first direction in a linear relationship with the detected input comprises translating the electronic document in the first direction by an amount that is proportional to the distance moved by the finger on the touch-sensitive display; and translating the respective portion of the electronic document in the first direction in a non-linear relationship with the detected input comprises translating the electronic document in the first direction by an amount that has a non-linear relationship with the distance moved by the finger on the touch-sensitive display. 4. The non-transitory computer-readable storage medium of claim 2, wherein:
the electronic document further comprises a second object; and translating the respective portion of the electronic document in the first direction in accordance with the detected input comprises:
maintaining the second object stationary until the content boundary of the electronic document reaches the edge of the window displaying the electronic document; and
translating the second object with the respective portion of the electronic document in the first direction in the non-linear relationship with the detected input as the content boundary of the electronic document is pulled inside the edge of the window. 5. The non-transitory computer-readable storage medium of claim 2, wherein:
the electronic document further comprises a third object; and translating the respective portion of the electronic document in the first direction in accordance with the detected input comprises:
translating the third object with the respective portion of the electronic document in the first direction in the linear relationship with the detected input until the content boundary of the electronic document reaches the edge of the window; and
translating the third object with the respective portion of the electronic document in the first direction in the non-linear relationship with the detected input as the content boundary of the electronic document is pulled inside the edge of the window. 6. The non-transitory computer-readable storage medium of claim 2, wherein:
the electronic document further comprises a fourth object; and translating the respective portion of the electronic document in the first direction in accordance with the detected input comprises:
translating the fourth object with the respective portion of the electronic document in the first direction in the linear relationship with the detected input until the content boundary of the electronic document reaches the edge of the window; and
maintaining the fourth object stationary as the content boundary of the electronic document is pulled inside the edge of the window. 7. The non-transitory computer-readable storage medium of claim 1, wherein the first object is fixed relative to the edge of the window displaying the electronic document. 8. The non-transitory computer-readable storage medium of claim 1, wherein:
translating the respective portion of the electronic document in the first direction in accordance with the detected input without translating the first object comprises passing a portion of the electronic document under the first object. 9. The non-transitory computer-readable storage medium of claim 1, wherein the second direction is opposite the first direction. 10. The non-transitory computer-readable storage medium of claim 1, wherein in response to detecting the end of the input, the respective portion of the electronic document is translated in the second direction at a speed faster than a speed of the translation of the respective portion of the electronic document in the first direction in accordance with the detected input. 11. The non-transitory computer-readable storage medium of claim 1, wherein in response to detecting the end of the input, the respective portion of the electronic document is translated in the second direction until the content boundary of the electronic document reaches the edge of the window. 12. A method, comprising:
at an electronic device with a display:
displaying, on the display, an electronic document comprising a first object and a content boundary,
while displaying the electronic document, detecting an input corresponding to a request to translate the electronic document in a first direction;
in response to detecting the input corresponding to a request to translate the electronic document, translating a respective portion of the electronic document in the first direction in accordance with the detected input without translating the first object, so that the first object is outside of the content boundary of the electronic document;
after translating the respective portion of the electronic document without translating the first object, detecting an end of the input;
in response to detecting the end of the input, translating the respective portion of the electronic document in a second direction different from the first direction without translating the first object, so that the first object is within the content boundary of the electronic document. 13. The method of claim 12, wherein translating the respective portion of the electronic document in the first direction in accordance with the detected input comprises:
translating the respective portion of the electronic document in the first direction in a linear relationship with the detected input until the content boundary of the electronic document reaches an edge of a window displaying the electronic document; and translating the respective portion of the electronic document in the first direction in a non-linear relationship with the detected input as the content boundary of the electronic document is pulled inside the edge of the window. 14. The method of claim 13, wherein:
the display is a touch-sensitive display; the detected input comprises movement of a finger on the touch-sensitive display; translating the respective portion of the electronic document in the first direction in a linear relationship with the detected input comprises translating the electronic document in the first direction by an amount that is proportional to the distance moved by the finger on the touch-sensitive display; and translating the respective portion of the electronic document in the first direction in a non-linear relationship with the detected input comprises translating the electronic document in the first direction by an amount that has a non-linear relationship with the distance moved by the finger on the touch-sensitive display. 15. The method of claim 13, wherein:
the electronic document further comprises a second object; and translating the respective portion of the electronic document in the first direction in accordance with the detected input comprises:
maintaining the second object stationary until the content boundary of the electronic document reaches the edge of the window displaying the electronic document; and
translating the second object with the respective portion of the electronic document in the first direction in the non-linear relationship with the detected input as the content boundary of the electronic document is pulled inside the edge of the window. 16. The method of claim 13, wherein:
the electronic document further comprises a third object; and translating the respective portion of the electronic document in the first direction in accordance with the detected input comprises:
translating the third object with the respective portion of the electronic document in the first direction in the linear relationship with the detected input until the content boundary of the electronic document reaches the edge of the window; and
translating the third object with the respective portion of the electronic document in the first direction in the non-linear relationship with the detected input as the content boundary of the electronic document is pulled inside the edge of the window. 17. The method of claim 13, wherein:
the electronic document further comprises a fourth object; and translating the respective portion of the electronic document in the first direction in accordance with the detected input comprises:
translating the fourth object with the respective portion of the electronic document in the first direction in the linear relationship with the detected input until the content boundary of the electronic document reaches the edge of the window; and
maintaining the fourth object stationary as the content boundary of the electronic document is pulled inside the edge of the window. 18. The method of claim 12, wherein the first object is fixed relative to the edge of the window displaying the electronic document. 19. The method of claim 12, wherein
translating the respective portion of the electronic document in the first direction in accordance with the detected input without moving the first object comprises passing a portion of the electronic document under the first object. 20. The method of claim 12, wherein the second direction is opposite the first direction. 21. The method of claim 12, wherein
in response to detecting the end of the input, the respective portion of the electronic document is translated in the second direction at a speed faster than a speed of the translation of the respective portion of the electronic document in the first direction in accordance with the detected input. 22. The method of claim 12, wherein in response to detecting the end of the input, the respective portion of the electronic document is translated in the second direction until the content boundary of the electronic document reaches the edge of the window. 23. An electronic device, comprising:
a display; a memory; and one or more processors coupled to the display and the memory, the one or more processors configured to:
display, on the display, an electronic document comprising a first object and a content boundary,
while displaying the electronic document, detect an input corresponding to a request to translate the electronic document in a first direction;
in response to detecting the input corresponding to a request to translate the electronic document, translate a respective portion of the electronic document in the first direction in accordance with the detected input without translating the first object, so that the first object is outside of the content boundary of the electronic document;
after translating the respective portion of the electronic document without translating the first object, detect an end of the input;
in response to detecting the end of the input, translate the respective portion of the electronic document in a second direction different from the first direction without translating the first object, so that the first object is within the content boundary of the electronic document. 24. The device of claim 23, wherein translating the respective portion of the electronic document in the first direction in accordance with the detected input comprises:
translating the respective portion of the electronic document in the first direction in a linear relationship with the detected input until the content boundary of the electronic document reaches an edge of a window displaying the electronic document; and translating the respective portion of the electronic document in the first direction in a non-linear relationship with the detected input as the content boundary of the electronic document is pulled inside the edge of the window. 25. The device of claim 24, wherein:
the display is a touch-sensitive display; the detected input comprises movement of a finger on the touch-sensitive display; translating the respective portion of the electronic document in the first direction in a linear relationship with the detected input comprises translating the electronic document in the first direction by an amount that is proportional to the distance moved by the finger on the touch-sensitive display; and translating the respective portion of the electronic document in the first direction in a non-linear relationship with the detected input comprises translating the electronic document in the first direction by an amount that has a non-linear relationship with the distance moved by the finger on the touch-sensitive display. 26. The device of claim 24, wherein:
the electronic document further comprises a second object; and translating the respective portion of the electronic document in the first direction in accordance with the detected input comprises:
maintaining the second object stationary until the content boundary of the electronic document reaches the edge of the window displaying the electronic document; and
translating the second object with the respective portion of the electronic document in the first direction in the non-linear relationship with the detected input as the content boundary of the electronic document is pulled inside the edge of the window. 27. The device of claim 24, wherein:
the electronic document further comprises a third object; and translating the respective portion of the electronic document in the first direction in accordance with the detected input comprises:
translating the third object with the respective portion of the electronic document in the first direction in the linear relationship with the detected input until the content boundary of the electronic document reaches the edge of the window; and
translating the third object with the respective portion of the electronic document in the first direction in the non-linear relationship with the detected input as the content boundary of the electronic document is pulled inside the edge of the window. 28. The device of claim 24, wherein:
the electronic document further comprises a fourth object; and translating the respective portion of the electronic document in the first direction in accordance with the detected input comprises:
translating the fourth object with the respective portion of the electronic document in the first direction in the linear relationship with the detected input until the content boundary of the electronic document reaches the edge of the window; and
maintaining the fourth object stationary as the content boundary of the electronic document is pulled inside the edge of the window. 29. The device of claim 23, wherein the first object is fixed relative to the edge of the window displaying the electronic document. 30. The device of claim 23, wherein:
translating the respective portion of the electronic document in the first direction in accordance with the detected input without moving the first object comprises passing a portion of the electronic document under the first object. 31. The device of claim 23, wherein the second direction is opposite the first direction. 32. The device of claim 23, wherein
in response to detecting the end of the input, the respective portion of the electronic document is translated in the second direction at a speed faster than a speed of the translation of the respective portion of the electronic document in the first direction in accordance with the detected input. 33. The device of claim 23, wherein
in response to detecting the end of the input, the respective portion of the electronic document is translated in the second direction until the content boundary of the electronic document reaches the edge of the window. | Techniques for coordinating movements of various objects in an electronic document are disclosed. A first-type object remains stationary so that it becomes outside a content boundary of the electronic document, as the content boundary is pulled inside an edge of a window displaying the electronic document. A second-type object remains stationary until the content boundary reaches the edge of the window and then moves along with the scrolled electronic document as the content boundary is pulled inside the edge of the window. A third-type object and a fourth-type object may show different movement behaviors.1. A non-transitory 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, cause the device to:
display, on the display, an electronic document comprising a first object and a content boundary, while displaying the electronic document, detect an input corresponding to a request to translate the electronic document in a first direction; in response to detecting the input corresponding to a request to translate the electronic document, translate a respective portion of the electronic document in the first direction in accordance with the detected input without translating the first object, so that the first object is outside of the content boundary of the electronic document; after translating the respective portion of the electronic document without translating the first object, detect an end of the input; in response to detecting the end of the input, translate the respective portion of the electronic document in a second direction different from the first direction without translating the first object, so that the first object is within the content boundary of the electronic document. 2. The non-transitory computer-readable storage medium of claim 1, wherein translating the respective portion of the electronic document in the first direction in accordance with the detected input comprises:
translating the respective portion of the electronic document in the first direction in a linear relationship with the detected input until the content boundary of the electronic document reaches an edge of a window displaying the electronic document; and translating the respective portion of the electronic document in the first direction in a non-linear relationship with the detected input as the content boundary of the electronic document is pulled inside the edge of the window. 3. The non-transitory computer-readable storage medium of claim 2, wherein:
the display is a touch-sensitive display; the detected input comprises movement of a finger on the touch-sensitive display; translating the respective portion of the electronic document in the first direction in a linear relationship with the detected input comprises translating the electronic document in the first direction by an amount that is proportional to the distance moved by the finger on the touch-sensitive display; and translating the respective portion of the electronic document in the first direction in a non-linear relationship with the detected input comprises translating the electronic document in the first direction by an amount that has a non-linear relationship with the distance moved by the finger on the touch-sensitive display. 4. The non-transitory computer-readable storage medium of claim 2, wherein:
the electronic document further comprises a second object; and translating the respective portion of the electronic document in the first direction in accordance with the detected input comprises:
maintaining the second object stationary until the content boundary of the electronic document reaches the edge of the window displaying the electronic document; and
translating the second object with the respective portion of the electronic document in the first direction in the non-linear relationship with the detected input as the content boundary of the electronic document is pulled inside the edge of the window. 5. The non-transitory computer-readable storage medium of claim 2, wherein:
the electronic document further comprises a third object; and translating the respective portion of the electronic document in the first direction in accordance with the detected input comprises:
translating the third object with the respective portion of the electronic document in the first direction in the linear relationship with the detected input until the content boundary of the electronic document reaches the edge of the window; and
translating the third object with the respective portion of the electronic document in the first direction in the non-linear relationship with the detected input as the content boundary of the electronic document is pulled inside the edge of the window. 6. The non-transitory computer-readable storage medium of claim 2, wherein:
the electronic document further comprises a fourth object; and translating the respective portion of the electronic document in the first direction in accordance with the detected input comprises:
translating the fourth object with the respective portion of the electronic document in the first direction in the linear relationship with the detected input until the content boundary of the electronic document reaches the edge of the window; and
maintaining the fourth object stationary as the content boundary of the electronic document is pulled inside the edge of the window. 7. The non-transitory computer-readable storage medium of claim 1, wherein the first object is fixed relative to the edge of the window displaying the electronic document. 8. The non-transitory computer-readable storage medium of claim 1, wherein:
translating the respective portion of the electronic document in the first direction in accordance with the detected input without translating the first object comprises passing a portion of the electronic document under the first object. 9. The non-transitory computer-readable storage medium of claim 1, wherein the second direction is opposite the first direction. 10. The non-transitory computer-readable storage medium of claim 1, wherein in response to detecting the end of the input, the respective portion of the electronic document is translated in the second direction at a speed faster than a speed of the translation of the respective portion of the electronic document in the first direction in accordance with the detected input. 11. The non-transitory computer-readable storage medium of claim 1, wherein in response to detecting the end of the input, the respective portion of the electronic document is translated in the second direction until the content boundary of the electronic document reaches the edge of the window. 12. A method, comprising:
at an electronic device with a display:
displaying, on the display, an electronic document comprising a first object and a content boundary,
while displaying the electronic document, detecting an input corresponding to a request to translate the electronic document in a first direction;
in response to detecting the input corresponding to a request to translate the electronic document, translating a respective portion of the electronic document in the first direction in accordance with the detected input without translating the first object, so that the first object is outside of the content boundary of the electronic document;
after translating the respective portion of the electronic document without translating the first object, detecting an end of the input;
in response to detecting the end of the input, translating the respective portion of the electronic document in a second direction different from the first direction without translating the first object, so that the first object is within the content boundary of the electronic document. 13. The method of claim 12, wherein translating the respective portion of the electronic document in the first direction in accordance with the detected input comprises:
translating the respective portion of the electronic document in the first direction in a linear relationship with the detected input until the content boundary of the electronic document reaches an edge of a window displaying the electronic document; and translating the respective portion of the electronic document in the first direction in a non-linear relationship with the detected input as the content boundary of the electronic document is pulled inside the edge of the window. 14. The method of claim 13, wherein:
the display is a touch-sensitive display; the detected input comprises movement of a finger on the touch-sensitive display; translating the respective portion of the electronic document in the first direction in a linear relationship with the detected input comprises translating the electronic document in the first direction by an amount that is proportional to the distance moved by the finger on the touch-sensitive display; and translating the respective portion of the electronic document in the first direction in a non-linear relationship with the detected input comprises translating the electronic document in the first direction by an amount that has a non-linear relationship with the distance moved by the finger on the touch-sensitive display. 15. The method of claim 13, wherein:
the electronic document further comprises a second object; and translating the respective portion of the electronic document in the first direction in accordance with the detected input comprises:
maintaining the second object stationary until the content boundary of the electronic document reaches the edge of the window displaying the electronic document; and
translating the second object with the respective portion of the electronic document in the first direction in the non-linear relationship with the detected input as the content boundary of the electronic document is pulled inside the edge of the window. 16. The method of claim 13, wherein:
the electronic document further comprises a third object; and translating the respective portion of the electronic document in the first direction in accordance with the detected input comprises:
translating the third object with the respective portion of the electronic document in the first direction in the linear relationship with the detected input until the content boundary of the electronic document reaches the edge of the window; and
translating the third object with the respective portion of the electronic document in the first direction in the non-linear relationship with the detected input as the content boundary of the electronic document is pulled inside the edge of the window. 17. The method of claim 13, wherein:
the electronic document further comprises a fourth object; and translating the respective portion of the electronic document in the first direction in accordance with the detected input comprises:
translating the fourth object with the respective portion of the electronic document in the first direction in the linear relationship with the detected input until the content boundary of the electronic document reaches the edge of the window; and
maintaining the fourth object stationary as the content boundary of the electronic document is pulled inside the edge of the window. 18. The method of claim 12, wherein the first object is fixed relative to the edge of the window displaying the electronic document. 19. The method of claim 12, wherein
translating the respective portion of the electronic document in the first direction in accordance with the detected input without moving the first object comprises passing a portion of the electronic document under the first object. 20. The method of claim 12, wherein the second direction is opposite the first direction. 21. The method of claim 12, wherein
in response to detecting the end of the input, the respective portion of the electronic document is translated in the second direction at a speed faster than a speed of the translation of the respective portion of the electronic document in the first direction in accordance with the detected input. 22. The method of claim 12, wherein in response to detecting the end of the input, the respective portion of the electronic document is translated in the second direction until the content boundary of the electronic document reaches the edge of the window. 23. An electronic device, comprising:
a display; a memory; and one or more processors coupled to the display and the memory, the one or more processors configured to:
display, on the display, an electronic document comprising a first object and a content boundary,
while displaying the electronic document, detect an input corresponding to a request to translate the electronic document in a first direction;
in response to detecting the input corresponding to a request to translate the electronic document, translate a respective portion of the electronic document in the first direction in accordance with the detected input without translating the first object, so that the first object is outside of the content boundary of the electronic document;
after translating the respective portion of the electronic document without translating the first object, detect an end of the input;
in response to detecting the end of the input, translate the respective portion of the electronic document in a second direction different from the first direction without translating the first object, so that the first object is within the content boundary of the electronic document. 24. The device of claim 23, wherein translating the respective portion of the electronic document in the first direction in accordance with the detected input comprises:
translating the respective portion of the electronic document in the first direction in a linear relationship with the detected input until the content boundary of the electronic document reaches an edge of a window displaying the electronic document; and translating the respective portion of the electronic document in the first direction in a non-linear relationship with the detected input as the content boundary of the electronic document is pulled inside the edge of the window. 25. The device of claim 24, wherein:
the display is a touch-sensitive display; the detected input comprises movement of a finger on the touch-sensitive display; translating the respective portion of the electronic document in the first direction in a linear relationship with the detected input comprises translating the electronic document in the first direction by an amount that is proportional to the distance moved by the finger on the touch-sensitive display; and translating the respective portion of the electronic document in the first direction in a non-linear relationship with the detected input comprises translating the electronic document in the first direction by an amount that has a non-linear relationship with the distance moved by the finger on the touch-sensitive display. 26. The device of claim 24, wherein:
the electronic document further comprises a second object; and translating the respective portion of the electronic document in the first direction in accordance with the detected input comprises:
maintaining the second object stationary until the content boundary of the electronic document reaches the edge of the window displaying the electronic document; and
translating the second object with the respective portion of the electronic document in the first direction in the non-linear relationship with the detected input as the content boundary of the electronic document is pulled inside the edge of the window. 27. The device of claim 24, wherein:
the electronic document further comprises a third object; and translating the respective portion of the electronic document in the first direction in accordance with the detected input comprises:
translating the third object with the respective portion of the electronic document in the first direction in the linear relationship with the detected input until the content boundary of the electronic document reaches the edge of the window; and
translating the third object with the respective portion of the electronic document in the first direction in the non-linear relationship with the detected input as the content boundary of the electronic document is pulled inside the edge of the window. 28. The device of claim 24, wherein:
the electronic document further comprises a fourth object; and translating the respective portion of the electronic document in the first direction in accordance with the detected input comprises:
translating the fourth object with the respective portion of the electronic document in the first direction in the linear relationship with the detected input until the content boundary of the electronic document reaches the edge of the window; and
maintaining the fourth object stationary as the content boundary of the electronic document is pulled inside the edge of the window. 29. The device of claim 23, wherein the first object is fixed relative to the edge of the window displaying the electronic document. 30. The device of claim 23, wherein:
translating the respective portion of the electronic document in the first direction in accordance with the detected input without moving the first object comprises passing a portion of the electronic document under the first object. 31. The device of claim 23, wherein the second direction is opposite the first direction. 32. The device of claim 23, wherein
in response to detecting the end of the input, the respective portion of the electronic document is translated in the second direction at a speed faster than a speed of the translation of the respective portion of the electronic document in the first direction in accordance with the detected input. 33. The device of claim 23, wherein
in response to detecting the end of the input, the respective portion of the electronic document is translated in the second direction until the content boundary of the electronic document reaches the edge of the window. | 2,100 |
5,347 | 5,347 | 14,364,138 | 2,182 | A method for operating a processor in which a first program comprising a first sequence of commands is provided, at least one second program is provided comprising a second sequence of commands, where the first program comprises a time-critical section with time-critical commands, commands from the first and second programs are processed in a processor pipeline, a start time is identified for the time-critical section in the first program, and a predefined interrupt program is incorporated into the at least one second program once the start time of the time critical section in the first program has been identified. | 1.-10. (canceled) 11. A method for operating a processor comprising:
providing a first program having a first sequence of commands to the processor; providing at least one second program having a second sequence of commands to the processor, the first program comprising a time-critical section having time-critical commands; and handling commands from the first and second programs in a processor pipeline; identifying a starting instant for the time-critical section in the first program; and inserting a previously stipulated interrupt program into the at least one second program as soon as the starting instant of the time-critical section in the first program is identified. 12. The method as claimed in claim 11, wherein starting of the time-critical section in the first program prompts an interrupt signal to be sent to the second program for insertion of the interrupt program. 13. The method as claimed in claim 11, wherein the time-critical section is handled together with the interrupt program in a predictable order in the processor pipeline. 14. The method as claimed in claim 12, wherein the time-critical section is handled together with the interrupt program in a predictable order in the processor pipeline. 15. The method as claimed in claim 11, wherein the interrupt program is also terminated with the time-critical section. 16. The method as claimed in claim 11, wherein the interrupt program comprises:
program instructions for reading of a value from a memory, program instructions for comparing the read value with a previously stipulated value; and program instructions for restarting the interrupt program if the read value and the stipulated value differ. 17. The method as claimed in claim 15, wherein the interrupt program is terminated by virtue of a value that corresponds to the previously stipulated value being written to the memory. 18. The method as claimed in claim 16, wherein the interrupt program is terminated by virtue of a value that corresponds to the previously stipulated value being written to the memory. 19. A processor comprising:
a first processor unit for providing a first program having a first sequence of commands; at least one second processor unit for providing at least one second program having a second sequence of commands, the first program comprising a time-critical section having time-critical commands; a processor pipeline for handling commands from the first and second programs; and a memory device having an operating system, the processor being configured to execute the operating system; wherein one of the processor and the operating system is configured to identify a starting time for the time-critical section in the first program and to insert a previously stipulated interrupt program into the at least one second program as soon as the starting time of the time-critical section in the first program has been identified. 20. The processor as claimed in claim 19, further comprising:
a data interchange unit configured to read a value from a memory during the interrupt program; and a comparison unit configured to compare the read value with a previously stipulated value during the interrupt program. 21. The processor as claimed in claim 19, wherein the processor comprises at least two processor cores. 22. The processor as claimed in claim 20, wherein the processor comprises at least two processor cores. 23. An automation appliance having the processor as claimed in claim 19. | A method for operating a processor in which a first program comprising a first sequence of commands is provided, at least one second program is provided comprising a second sequence of commands, where the first program comprises a time-critical section with time-critical commands, commands from the first and second programs are processed in a processor pipeline, a start time is identified for the time-critical section in the first program, and a predefined interrupt program is incorporated into the at least one second program once the start time of the time critical section in the first program has been identified.1.-10. (canceled) 11. A method for operating a processor comprising:
providing a first program having a first sequence of commands to the processor; providing at least one second program having a second sequence of commands to the processor, the first program comprising a time-critical section having time-critical commands; and handling commands from the first and second programs in a processor pipeline; identifying a starting instant for the time-critical section in the first program; and inserting a previously stipulated interrupt program into the at least one second program as soon as the starting instant of the time-critical section in the first program is identified. 12. The method as claimed in claim 11, wherein starting of the time-critical section in the first program prompts an interrupt signal to be sent to the second program for insertion of the interrupt program. 13. The method as claimed in claim 11, wherein the time-critical section is handled together with the interrupt program in a predictable order in the processor pipeline. 14. The method as claimed in claim 12, wherein the time-critical section is handled together with the interrupt program in a predictable order in the processor pipeline. 15. The method as claimed in claim 11, wherein the interrupt program is also terminated with the time-critical section. 16. The method as claimed in claim 11, wherein the interrupt program comprises:
program instructions for reading of a value from a memory, program instructions for comparing the read value with a previously stipulated value; and program instructions for restarting the interrupt program if the read value and the stipulated value differ. 17. The method as claimed in claim 15, wherein the interrupt program is terminated by virtue of a value that corresponds to the previously stipulated value being written to the memory. 18. The method as claimed in claim 16, wherein the interrupt program is terminated by virtue of a value that corresponds to the previously stipulated value being written to the memory. 19. A processor comprising:
a first processor unit for providing a first program having a first sequence of commands; at least one second processor unit for providing at least one second program having a second sequence of commands, the first program comprising a time-critical section having time-critical commands; a processor pipeline for handling commands from the first and second programs; and a memory device having an operating system, the processor being configured to execute the operating system; wherein one of the processor and the operating system is configured to identify a starting time for the time-critical section in the first program and to insert a previously stipulated interrupt program into the at least one second program as soon as the starting time of the time-critical section in the first program has been identified. 20. The processor as claimed in claim 19, further comprising:
a data interchange unit configured to read a value from a memory during the interrupt program; and a comparison unit configured to compare the read value with a previously stipulated value during the interrupt program. 21. The processor as claimed in claim 19, wherein the processor comprises at least two processor cores. 22. The processor as claimed in claim 20, wherein the processor comprises at least two processor cores. 23. An automation appliance having the processor as claimed in claim 19. | 2,100 |
5,348 | 5,348 | 14,635,475 | 2,167 | Disclosed are systems, methods and computer program products for automated report generation. Provided is a set of technological tools having customization options including customization settings that are user friendly to end users. The method involves creation of a data structuring schema for report generation with customizable query text, data sets, data links, available report fields, and data retrieval parameters, specifying default data structuring settings, generating a report template according to the created data structuring schema and specified data structuring settings, and generating a report based on the template. | 1. A computer-implemented method for automatically generating a report comprising:
receiving a data structuring schema via a data structuring module stored on the processor, and storing the created data structuring schema in the repository; receiving default data structuring settings via a processor and storing the default data structuring settings in a repository accessible by the processor; receiving user settings via a user interface associated with the processor; generating a report template via a report template module stored on the processor, wherein the report template is generated based on the created data structuring schema and one or more of the default data structuring settings and the user settings; and generating a customizable report based on the generated report template, wherein a report modification module stored on the processor is configured to modify the customizable report based on input data comprising one or more of query text, data sets, data links, available report fields and data retrieval parameters, the report modification module being configured to receive the input data via the user interface. 2. The method of claim 1 further comprising receiving the input data from script objects. 3. The method of claim 1, wherein the step of generating the customizable report comprises modifying the generated report template based on a data structuring schema of a data set query and based on fields and filters comprised by the user settings. 4. The method of claim 1, wherein the data structuring schema comprises modifiable query fragments. 5. The method of claim 1, wherein the data structuring schema comprises data from multiple data sets. 6. The method of claim 5, wherein each of the multiple data sets comprise linked data, the method further comprising providing data links to retrieve the linked data, wherein the data links comprise hierarchical links between the multiple data sets. 7. The method of claim 1, wherein creating a data structuring schema further comprises creating a plurality of data structuring schemas, wherein the plurality of data structuring schemas are nested. 8. The method of claim 1 further comprising:
receiving modified data structuring settings via the processor and storing the modified data structuring settings in the repository;
generating a specific report template based on the modified data structuring settings; and
generating a specific report based on the generated specific report template. 9. The method of claim 1, wherein the data structuring schema comprises report field display settings. 10. The method of claim 1, wherein the generated customizable report comprises a subset of report settings configured to be modified based on an input received via the user interface. 11. The method of claim 1, wherein generating a report template further comprises:
generating a plurality of report templates based on a plurality of data structuring settings; and storing each of the plurality of data structuring settings associated with each of the plurality of report templates in the repository. 12. The method of claim 1, wherein the generated customizable report comprises reference fields having subordinate fields. 13. The method of claim 1 further comprising modifying one or more of the default data structuring settings and input settings based on information within the generated customizable report. 14. The method of claim 1, wherein the query text comprises data set query templates having specific fragments marking modifiable query parts. 15. A system for automatically generating a report comprising:
a processor; a user interface functioning via the processor; and a repository accessible by the processor; wherein the processor is configured to:
receive a data structuring schema via a data structuring module stored on the processor, and store the created data structuring schema in the repository;
receive default data structuring settings and store the default data structuring settings in the repository;
receive user settings via the user interface;
generate a report template via a report template module stored on the processor, wherein the report template is generated based on the created data structuring schema and one or more of the default data structuring settings and the user settings; and
generate a customizable report based on the generated report template, wherein a report modification module stored on the processor is configured to modify the customizable report based on input data comprising one or more of query text, data sets, data links, available report fields and data retrieval parameters, the report modification module being configured to receive the input data via the user interface. 16. The system of claim 15, wherein the processor is configured to receive the input data from script objects. 17. The system of claim 15, wherein the processor is further configured to modify the generated report template based on a data structuring schema of a data set query and based on fields and filters comprised by the user settings. 18. The system of claim 15, wherein the data structuring schema comprises data from multiple data sets that comprise linked data, and the processor being further configured to provide data links to retrieve the linked data, wherein the data links comprise hierarchical links between the multiple data sets. 19. The system of claim 15, wherein the processor is configured to create a plurality of data structuring schemas, wherein the plurality of data structuring schemas are nested. 20. A computer program product, stored on a non-transitory computer readable medium, for automatically generating a report, wherein the computer program product includes computer executable instructions for:
receive a data structuring schema via a data structuring module stored on the processor, and storing the created data structuring schema in the repository; receiving default data structuring settings via a processor and storing the default data structuring settings in a repository accessible by the processor; receiving user settings via a user interface associated with the processor; generating a report template via a report template module stored on the processor, wherein the report template is generated based on the created data structuring schema and one or more of the default data structuring settings and the user settings; and generating a customizable report based on the generated report template, wherein a report modification module stored on the processor is configured to modify the customizable report based on input data comprising one or more of query text, data sets, data links, available report fields and data retrieval parameters, the report modification module being configured to receive the input data via the user interface. | Disclosed are systems, methods and computer program products for automated report generation. Provided is a set of technological tools having customization options including customization settings that are user friendly to end users. The method involves creation of a data structuring schema for report generation with customizable query text, data sets, data links, available report fields, and data retrieval parameters, specifying default data structuring settings, generating a report template according to the created data structuring schema and specified data structuring settings, and generating a report based on the template.1. A computer-implemented method for automatically generating a report comprising:
receiving a data structuring schema via a data structuring module stored on the processor, and storing the created data structuring schema in the repository; receiving default data structuring settings via a processor and storing the default data structuring settings in a repository accessible by the processor; receiving user settings via a user interface associated with the processor; generating a report template via a report template module stored on the processor, wherein the report template is generated based on the created data structuring schema and one or more of the default data structuring settings and the user settings; and generating a customizable report based on the generated report template, wherein a report modification module stored on the processor is configured to modify the customizable report based on input data comprising one or more of query text, data sets, data links, available report fields and data retrieval parameters, the report modification module being configured to receive the input data via the user interface. 2. The method of claim 1 further comprising receiving the input data from script objects. 3. The method of claim 1, wherein the step of generating the customizable report comprises modifying the generated report template based on a data structuring schema of a data set query and based on fields and filters comprised by the user settings. 4. The method of claim 1, wherein the data structuring schema comprises modifiable query fragments. 5. The method of claim 1, wherein the data structuring schema comprises data from multiple data sets. 6. The method of claim 5, wherein each of the multiple data sets comprise linked data, the method further comprising providing data links to retrieve the linked data, wherein the data links comprise hierarchical links between the multiple data sets. 7. The method of claim 1, wherein creating a data structuring schema further comprises creating a plurality of data structuring schemas, wherein the plurality of data structuring schemas are nested. 8. The method of claim 1 further comprising:
receiving modified data structuring settings via the processor and storing the modified data structuring settings in the repository;
generating a specific report template based on the modified data structuring settings; and
generating a specific report based on the generated specific report template. 9. The method of claim 1, wherein the data structuring schema comprises report field display settings. 10. The method of claim 1, wherein the generated customizable report comprises a subset of report settings configured to be modified based on an input received via the user interface. 11. The method of claim 1, wherein generating a report template further comprises:
generating a plurality of report templates based on a plurality of data structuring settings; and storing each of the plurality of data structuring settings associated with each of the plurality of report templates in the repository. 12. The method of claim 1, wherein the generated customizable report comprises reference fields having subordinate fields. 13. The method of claim 1 further comprising modifying one or more of the default data structuring settings and input settings based on information within the generated customizable report. 14. The method of claim 1, wherein the query text comprises data set query templates having specific fragments marking modifiable query parts. 15. A system for automatically generating a report comprising:
a processor; a user interface functioning via the processor; and a repository accessible by the processor; wherein the processor is configured to:
receive a data structuring schema via a data structuring module stored on the processor, and store the created data structuring schema in the repository;
receive default data structuring settings and store the default data structuring settings in the repository;
receive user settings via the user interface;
generate a report template via a report template module stored on the processor, wherein the report template is generated based on the created data structuring schema and one or more of the default data structuring settings and the user settings; and
generate a customizable report based on the generated report template, wherein a report modification module stored on the processor is configured to modify the customizable report based on input data comprising one or more of query text, data sets, data links, available report fields and data retrieval parameters, the report modification module being configured to receive the input data via the user interface. 16. The system of claim 15, wherein the processor is configured to receive the input data from script objects. 17. The system of claim 15, wherein the processor is further configured to modify the generated report template based on a data structuring schema of a data set query and based on fields and filters comprised by the user settings. 18. The system of claim 15, wherein the data structuring schema comprises data from multiple data sets that comprise linked data, and the processor being further configured to provide data links to retrieve the linked data, wherein the data links comprise hierarchical links between the multiple data sets. 19. The system of claim 15, wherein the processor is configured to create a plurality of data structuring schemas, wherein the plurality of data structuring schemas are nested. 20. A computer program product, stored on a non-transitory computer readable medium, for automatically generating a report, wherein the computer program product includes computer executable instructions for:
receive a data structuring schema via a data structuring module stored on the processor, and storing the created data structuring schema in the repository; receiving default data structuring settings via a processor and storing the default data structuring settings in a repository accessible by the processor; receiving user settings via a user interface associated with the processor; generating a report template via a report template module stored on the processor, wherein the report template is generated based on the created data structuring schema and one or more of the default data structuring settings and the user settings; and generating a customizable report based on the generated report template, wherein a report modification module stored on the processor is configured to modify the customizable report based on input data comprising one or more of query text, data sets, data links, available report fields and data retrieval parameters, the report modification module being configured to receive the input data via the user interface. | 2,100 |
5,349 | 5,349 | 13,673,872 | 2,182 | An aspect includes an apparatus for evaluating a mathematical function at an input value. The apparatus includes a selector for selecting a mathematical function, an input for a value at which to evaluate the function, an identifier for identifying an interval containing the input value. The interval is described by at least one polynomial function. At least one control point representing the polynomial function is retrieved from at least one look up table, and the polynomial function can be derived from the control points. The function is evaluated at the input value and an output of the evaluation is used as a value of the function at that input value. | 1. A method for producing a representation of a mathematical function, for evaluating the output of the mathematical function for an input, comprising:
receiving, in a processor, a mathematical function, for which a representation is to be created; and producing, in the processor, a representation of the mathematical function, the representation comprising a single respective spline control point for each interval of a plurality of intervals over which the mathematical function may be evaluated, wherein the spline control point for each interval, in cooperation with spline control points of neighboring intervals, defines a polynomial of a pre-determined order, which is used to evaluate the mathematical function for a specific value within that interval. 2. The method for producing a representation of a mathematical function of claim 1, further comprising storing spline control points for adjacent intervals in separate lookup tables. 3. The method for producing a representation of a mathematical function of claim 1, wherein the polynomial is a polynomial of cubic order. 4. The method for producing a representation of a mathematical function of claim 1, wherein the polynomial is a polynomial of quadratic order. 5. The method for producing a representation of a mathematical function of claim 1, wherein control points are determined using singular value decomposition. 6. The method for producing a representation of a mathematical function of claim 1, wherein control points are determined using wavelet techniques. 7. A computation device, comprising:
a plurality of lookup tables stored in one or more non-transitory memories, each of the lookup tables storing a respective control point determined for a respective interval over which a mathematical function may be evaluated; and a circuit coupling with the plurality of lookup tables, the circuit configured for identifying an interval containing a point at which the mathematical function is to be evaluated, obtaining the control point for the interval containing the point at which the mathematical function is to be evaluated and control points for at least one interval adjacent to each end of that interval, deriving a polynomial from the obtained control points, and computing an output value of the polynomial at the point at which the mathematical function is to be evaluated, and using that output value as the evaluation of the mathematical function. 8. The device of claim 7, wherein the polynomial is a polynomial of cubic order. 9. The device of claim 7, wherein the polynomial is a polynomial of quadratic order. 10. A method for evaluating a mathematical function at a specified value by a machine, comprising:
receiving a value for a variable of a mathematical function to be evaluated; accessing, from a non-transitory medium, a plurality of control points, each determined from the mathematical function to be evaluated, wherein the control points are not themselves required to be an output value of the mathematical function for an input value to the mathematical function; producing coefficients of a polynomial of a pre-determined order, from the plurality of control points, wherein the polynomial approximates the mathematical function on an interval; evaluating the polynomial for the value of the variable; and using an output of evaluating of the polynomial to represent an output value of the mathematical function when the variable has the received value. 11. The method of claim 10, wherein the pre-determined order of the polynomial is cubic order. 12. The method of claim 10, wherein the pre-determined order of the polynomial is quadratic order. | An aspect includes an apparatus for evaluating a mathematical function at an input value. The apparatus includes a selector for selecting a mathematical function, an input for a value at which to evaluate the function, an identifier for identifying an interval containing the input value. The interval is described by at least one polynomial function. At least one control point representing the polynomial function is retrieved from at least one look up table, and the polynomial function can be derived from the control points. The function is evaluated at the input value and an output of the evaluation is used as a value of the function at that input value.1. A method for producing a representation of a mathematical function, for evaluating the output of the mathematical function for an input, comprising:
receiving, in a processor, a mathematical function, for which a representation is to be created; and producing, in the processor, a representation of the mathematical function, the representation comprising a single respective spline control point for each interval of a plurality of intervals over which the mathematical function may be evaluated, wherein the spline control point for each interval, in cooperation with spline control points of neighboring intervals, defines a polynomial of a pre-determined order, which is used to evaluate the mathematical function for a specific value within that interval. 2. The method for producing a representation of a mathematical function of claim 1, further comprising storing spline control points for adjacent intervals in separate lookup tables. 3. The method for producing a representation of a mathematical function of claim 1, wherein the polynomial is a polynomial of cubic order. 4. The method for producing a representation of a mathematical function of claim 1, wherein the polynomial is a polynomial of quadratic order. 5. The method for producing a representation of a mathematical function of claim 1, wherein control points are determined using singular value decomposition. 6. The method for producing a representation of a mathematical function of claim 1, wherein control points are determined using wavelet techniques. 7. A computation device, comprising:
a plurality of lookup tables stored in one or more non-transitory memories, each of the lookup tables storing a respective control point determined for a respective interval over which a mathematical function may be evaluated; and a circuit coupling with the plurality of lookup tables, the circuit configured for identifying an interval containing a point at which the mathematical function is to be evaluated, obtaining the control point for the interval containing the point at which the mathematical function is to be evaluated and control points for at least one interval adjacent to each end of that interval, deriving a polynomial from the obtained control points, and computing an output value of the polynomial at the point at which the mathematical function is to be evaluated, and using that output value as the evaluation of the mathematical function. 8. The device of claim 7, wherein the polynomial is a polynomial of cubic order. 9. The device of claim 7, wherein the polynomial is a polynomial of quadratic order. 10. A method for evaluating a mathematical function at a specified value by a machine, comprising:
receiving a value for a variable of a mathematical function to be evaluated; accessing, from a non-transitory medium, a plurality of control points, each determined from the mathematical function to be evaluated, wherein the control points are not themselves required to be an output value of the mathematical function for an input value to the mathematical function; producing coefficients of a polynomial of a pre-determined order, from the plurality of control points, wherein the polynomial approximates the mathematical function on an interval; evaluating the polynomial for the value of the variable; and using an output of evaluating of the polynomial to represent an output value of the mathematical function when the variable has the received value. 11. The method of claim 10, wherein the pre-determined order of the polynomial is cubic order. 12. The method of claim 10, wherein the pre-determined order of the polynomial is quadratic order. | 2,100 |
5,350 | 5,350 | 15,354,700 | 2,166 | Managing file distribution in an online file sharing system implemented by at least one server includes inviting a first entity to access a shared file hosted by the online file sharing system, and allowing the first entity to reshare the shared the through the online file sharing system with at least a second entity only to an extent permitted by a resharing policy stored by the online file sharing system. | 1. A method for managing file distribution in an online file sharing system implemented by a server, the method comprising:
inviting a first entity to access a shared file hosted by the online file sharing system; allowing the first entity to reshare the shared file through the online file sharing system with at least a second entity only to an extent permitted by a resharing policy indicated by a tag associated with the shared file, in which the resharing policy determines users that are allowed to receive reshared files; and notifying an author of the shared file of the reshare of the shared file. 2. The method of claim 1, further comprising determining whether the second entity is an unauthorized recipient of the reshared file. 3. The method of claim 1, wherein the resharing policy:
allows the first entity to reshare the shared file with an entity within a group; and prohibits the first entity from resharing the shared file with an entity outside the group. 4. The method of claim 3, further comprising allowing a user to see the resharing policy associated with the group. 5. The method of claim 1, further comprising allowing a user to see the resharing policy associated with the shared file. 6. The method of claim 1, wherein notifying an author of the shared file of the reshare of the shared file comprises sending an email to the author of the shared file indicating that a particular reshare has occurred. 7. The method of claim 1, further comprising allowing the first entity to indicate which other users are allowed to open an uploaded file. 8. A server comprising:
a processor; and a memory, having an online file sharing software stored thereon; in which the online file sharing software is configured to cause the processor to, upon execution of the online file sharing software:
invite a first entity to access a shared file hosted by an online file sharing system;
allow the first entity to reshare the shared file through the online file sharing system with at least a second entity only to an extent permitted by a resharing policy indicated by a tag associated with the shared file, in which the resharing policy determines users that are allowed to receive reshared files: and
notify an author of the shared file of the reshare of the shared file. 9. The server of claim 8, wherein users that are allowed to receive reshared files and shared files that can be reshared are determined from attributes of the first entity. 10. The server of claim 8, wherein users that are allowed to receive reshared files and shared files that can be reshared are determined from attributes of an author of the shared file. 11. The server of claim 8, wherein users that are allowed to receive reshared files are determined from attributes of the shared file. 12. The server of claim 8, wherein the tag indicates one of several levels of confidentiality for the shared file. 13. A computer program product for managing the resharing of artifacts, the computer program product comprising:
a computer readable memory having computer readable program code embodied therewith, the computer readable program code comprising:
computer readable program code to invite a first entity o access a shared file hosted by an online file sharing system;
computer readable program code to allow the first entity to reshare the shared tile through the online file sharing system with at least one second entity only to an extent permitted by at least one resharing policy indicated by a tag associated with the shared file, in which the at least one resharing policy determines users that are allowed to receive reshared files; and
computer readable program code to notify an author of the shared file of the reshare of the shared file. 14. The computer program product of claim 13, wherein the computer readable program code comprises computer readable program code to override the at least one resharing policy. 15. The computer program product of claim 13, wherein the at least one resharing policy comprises:
a first resharing policy applied to entities within a group; and a second resharing policy applied to entities within a subgroup of the group. | Managing file distribution in an online file sharing system implemented by at least one server includes inviting a first entity to access a shared file hosted by the online file sharing system, and allowing the first entity to reshare the shared the through the online file sharing system with at least a second entity only to an extent permitted by a resharing policy stored by the online file sharing system.1. A method for managing file distribution in an online file sharing system implemented by a server, the method comprising:
inviting a first entity to access a shared file hosted by the online file sharing system; allowing the first entity to reshare the shared file through the online file sharing system with at least a second entity only to an extent permitted by a resharing policy indicated by a tag associated with the shared file, in which the resharing policy determines users that are allowed to receive reshared files; and notifying an author of the shared file of the reshare of the shared file. 2. The method of claim 1, further comprising determining whether the second entity is an unauthorized recipient of the reshared file. 3. The method of claim 1, wherein the resharing policy:
allows the first entity to reshare the shared file with an entity within a group; and prohibits the first entity from resharing the shared file with an entity outside the group. 4. The method of claim 3, further comprising allowing a user to see the resharing policy associated with the group. 5. The method of claim 1, further comprising allowing a user to see the resharing policy associated with the shared file. 6. The method of claim 1, wherein notifying an author of the shared file of the reshare of the shared file comprises sending an email to the author of the shared file indicating that a particular reshare has occurred. 7. The method of claim 1, further comprising allowing the first entity to indicate which other users are allowed to open an uploaded file. 8. A server comprising:
a processor; and a memory, having an online file sharing software stored thereon; in which the online file sharing software is configured to cause the processor to, upon execution of the online file sharing software:
invite a first entity to access a shared file hosted by an online file sharing system;
allow the first entity to reshare the shared file through the online file sharing system with at least a second entity only to an extent permitted by a resharing policy indicated by a tag associated with the shared file, in which the resharing policy determines users that are allowed to receive reshared files: and
notify an author of the shared file of the reshare of the shared file. 9. The server of claim 8, wherein users that are allowed to receive reshared files and shared files that can be reshared are determined from attributes of the first entity. 10. The server of claim 8, wherein users that are allowed to receive reshared files and shared files that can be reshared are determined from attributes of an author of the shared file. 11. The server of claim 8, wherein users that are allowed to receive reshared files are determined from attributes of the shared file. 12. The server of claim 8, wherein the tag indicates one of several levels of confidentiality for the shared file. 13. A computer program product for managing the resharing of artifacts, the computer program product comprising:
a computer readable memory having computer readable program code embodied therewith, the computer readable program code comprising:
computer readable program code to invite a first entity o access a shared file hosted by an online file sharing system;
computer readable program code to allow the first entity to reshare the shared tile through the online file sharing system with at least one second entity only to an extent permitted by at least one resharing policy indicated by a tag associated with the shared file, in which the at least one resharing policy determines users that are allowed to receive reshared files; and
computer readable program code to notify an author of the shared file of the reshare of the shared file. 14. The computer program product of claim 13, wherein the computer readable program code comprises computer readable program code to override the at least one resharing policy. 15. The computer program product of claim 13, wherein the at least one resharing policy comprises:
a first resharing policy applied to entities within a group; and a second resharing policy applied to entities within a subgroup of the group. | 2,100 |
5,351 | 5,351 | 15,208,816 | 2,139 | A cache memory and method of operating a cache memory are provided. The cache memory comprises cache storage that stores cache lines for a plurality of requesters and cache control circuitry that controls insertion of a cache line into the cache storage when a memory access request from one of the plurality of requesters misses in the cache memory. The cache memory further has cache occupancy estimation circuitry that holds a count of insertions of cache lines into the cache storage for each of the plurality of requesters over a defined period. The count of cache line insertions for each requester thus provides an estimation of the cache occupancy associated with each requester. | 1. A cache memory comprising:
cache storage configured to store cache lines for a plurality of requesters; cache control circuitry that controls insertion of a cache line into the cache storage when a memory access request from one of the plurality of requesters misses in the cache memory; and cache occupancy estimation circuitry configured to hold a count of insertions of cache lines into the cache storage for each of the plurality of requesters over a defined period. 2. The cache memory as claimed in claim 1, wherein the cache control circuitry is responsive to the cache storage having a full occupancy of cache lines to select a victim cache line for eviction from the cache storage in dependence on a retention policy, and wherein the cache control circuitry has biasing circuitry to bias the retention policy in dependence on the count of insertions held by the cache occupancy estimation circuitry. 3. The cache memory as claimed in claim 1, further comprising priority value storage configured to store a priority value in association with each cache line, wherein the cache control circuitry sets the priority value stored in association with a newly filled cache line in dependence on the count of insertions held by the cache occupancy estimation circuitry for the requester which issued the memory access request which caused the newly filled cache line. 4. The cache memory as claimed in claim 1, further comprising recent usage storage configured to store a recent usage value in association with each cache line, wherein the cache control circuitry sets the recent usage value stored in association with a newly filled cache line in dependence on the count of insertions held by the cache occupancy estimation circuitry for the requester which issued the memory access request which caused the newly filled cache line,
and wherein the victim cache line is selected in dependence on the recent usage values stored in the recent usage storage. 5. The cache memory as claimed in claim 2, wherein,
when the count of insertions for a first requester of the plurality of requesters is higher than the count of insertions for a second requester of the plurality of requesters, the biasing of the retention policy comprises biasing selection of the victim cache line towards selection of a cache line associated with the first requester over selection of a cache line associated with the second requester. 6. The cache memory as claimed in claim 2, wherein the cache control circuitry comprises target cache usage storage configured to hold at least one target value for usage of the cache lines by at least one requester of the plurality of requesters, and wherein the biasing of the retention policy comprises biasing selection of the victim cache line to reduce a difference between the count of insertions of cache lines into the cache storage and the at least one target value for usage of the cache lines. 7. The cache memory as claimed in claim 2, wherein the cache control circuitry is responsive to at least one performance metric received from at least one of the plurality of requesters to bias the retention policy in dependence on the at least one performance metric. 8. The cache memory as claimed in claim 7, wherein the cache control circuitry is responsive to two performance metrics received from two of the plurality of requesters to bias the retention policy to seek to modify a ratio of the two performance metrics. 9. The cache memory as claimed in claim 2, wherein the biasing circuitry is responsive to an elapse of the defined period to update the retention policy in dependence on the count of insertions held by the cache occupancy estimation circuitry. 10. The cache memory as claimed in claim 9, wherein the biasing circuitry is responsive to the elapse of the defined period to update the retention policy in dependence on an average count of insertions determined with respect to a plurality of counts of insertions counted over a multiple of the defined period. 11. The cache memory as claimed in claim 2, wherein the biasing circuitry is responsive to a type of requester when biasing the retention policy to further bias the retention policy in dependence on a type of at least one of the plurality of requesters. 12. The cache memory as claimed in claim 1, the cache memory configured to form part of a cache memory hierarchy with at least one further cache memory interposed between the plurality of requesters and the cache memory. 13. A method of caching data comprising:
storing cache lines for a plurality of requesters; in response to a memory access request from one of the plurality of requesters missing in the cache memory, controlling insertion of a cache line into the cache storage; and holding a count of insertions of cache lines into the cache storage for each of the plurality of requesters over a defined period. 14. A cache memory comprising:
means for storing cache lines for a plurality of requesters; means for controlling insertion of a cache line into the cache storage in response to a memory access request from one of the plurality of requesters missing in the cache memory; and means for holding a count of insertions of cache lines into the cache storage for each of the plurality of requesters over a defined period. | A cache memory and method of operating a cache memory are provided. The cache memory comprises cache storage that stores cache lines for a plurality of requesters and cache control circuitry that controls insertion of a cache line into the cache storage when a memory access request from one of the plurality of requesters misses in the cache memory. The cache memory further has cache occupancy estimation circuitry that holds a count of insertions of cache lines into the cache storage for each of the plurality of requesters over a defined period. The count of cache line insertions for each requester thus provides an estimation of the cache occupancy associated with each requester.1. A cache memory comprising:
cache storage configured to store cache lines for a plurality of requesters; cache control circuitry that controls insertion of a cache line into the cache storage when a memory access request from one of the plurality of requesters misses in the cache memory; and cache occupancy estimation circuitry configured to hold a count of insertions of cache lines into the cache storage for each of the plurality of requesters over a defined period. 2. The cache memory as claimed in claim 1, wherein the cache control circuitry is responsive to the cache storage having a full occupancy of cache lines to select a victim cache line for eviction from the cache storage in dependence on a retention policy, and wherein the cache control circuitry has biasing circuitry to bias the retention policy in dependence on the count of insertions held by the cache occupancy estimation circuitry. 3. The cache memory as claimed in claim 1, further comprising priority value storage configured to store a priority value in association with each cache line, wherein the cache control circuitry sets the priority value stored in association with a newly filled cache line in dependence on the count of insertions held by the cache occupancy estimation circuitry for the requester which issued the memory access request which caused the newly filled cache line. 4. The cache memory as claimed in claim 1, further comprising recent usage storage configured to store a recent usage value in association with each cache line, wherein the cache control circuitry sets the recent usage value stored in association with a newly filled cache line in dependence on the count of insertions held by the cache occupancy estimation circuitry for the requester which issued the memory access request which caused the newly filled cache line,
and wherein the victim cache line is selected in dependence on the recent usage values stored in the recent usage storage. 5. The cache memory as claimed in claim 2, wherein,
when the count of insertions for a first requester of the plurality of requesters is higher than the count of insertions for a second requester of the plurality of requesters, the biasing of the retention policy comprises biasing selection of the victim cache line towards selection of a cache line associated with the first requester over selection of a cache line associated with the second requester. 6. The cache memory as claimed in claim 2, wherein the cache control circuitry comprises target cache usage storage configured to hold at least one target value for usage of the cache lines by at least one requester of the plurality of requesters, and wherein the biasing of the retention policy comprises biasing selection of the victim cache line to reduce a difference between the count of insertions of cache lines into the cache storage and the at least one target value for usage of the cache lines. 7. The cache memory as claimed in claim 2, wherein the cache control circuitry is responsive to at least one performance metric received from at least one of the plurality of requesters to bias the retention policy in dependence on the at least one performance metric. 8. The cache memory as claimed in claim 7, wherein the cache control circuitry is responsive to two performance metrics received from two of the plurality of requesters to bias the retention policy to seek to modify a ratio of the two performance metrics. 9. The cache memory as claimed in claim 2, wherein the biasing circuitry is responsive to an elapse of the defined period to update the retention policy in dependence on the count of insertions held by the cache occupancy estimation circuitry. 10. The cache memory as claimed in claim 9, wherein the biasing circuitry is responsive to the elapse of the defined period to update the retention policy in dependence on an average count of insertions determined with respect to a plurality of counts of insertions counted over a multiple of the defined period. 11. The cache memory as claimed in claim 2, wherein the biasing circuitry is responsive to a type of requester when biasing the retention policy to further bias the retention policy in dependence on a type of at least one of the plurality of requesters. 12. The cache memory as claimed in claim 1, the cache memory configured to form part of a cache memory hierarchy with at least one further cache memory interposed between the plurality of requesters and the cache memory. 13. A method of caching data comprising:
storing cache lines for a plurality of requesters; in response to a memory access request from one of the plurality of requesters missing in the cache memory, controlling insertion of a cache line into the cache storage; and holding a count of insertions of cache lines into the cache storage for each of the plurality of requesters over a defined period. 14. A cache memory comprising:
means for storing cache lines for a plurality of requesters; means for controlling insertion of a cache line into the cache storage in response to a memory access request from one of the plurality of requesters missing in the cache memory; and means for holding a count of insertions of cache lines into the cache storage for each of the plurality of requesters over a defined period. | 2,100 |
5,352 | 5,352 | 14,284,370 | 2,152 | An apparatus, computer-readable medium, and computer-implemented method for generating a headline includes identifying a content section of a document, selecting a sentence in the content section based at least in part on a determination that the sentence exhibits one or more characteristics correlated with headline performance, extracting a portion of the sentence based at least in part on a trigger attribute within the sentence, and generating the headline based at least in part on the portion of the sentence. | 1. A method executed by one or more computing devices for generating a headline, the method comprising:
identifying, by at least one of the one or more computing devices, a content section of a document; selecting, by at least one of the one or more computing devices, a sentence in the content section based at least in part on a determination that the sentence exhibits one or more characteristics correlated with headline performance; extracting, by at least one of the one or more computing devices, a portion of the sentence based at least in part on a trigger attribute within the sentence; and generating, by at least one of the one or more computing device, the headline based at least in part on the portion of the sentence. 2. The method of claim 1, wherein the one or more characteristics correlated with headline performance comprise at least one of semantic characteristics and grammatical characteristics. 3. The method of claim 1, wherein headline performance is measured by a performance indicator. 4. The method of claim 3, wherein the performance indicator comprises at least one of click-through rate, conversion to action, time spent on site, and download rate. 5. The method of claim 1, wherein selecting a sentence comprises:
scoring a plurality of sentences in the content section based at least in part on the one or more characteristics correlated with headline performance, wherein each sentence is scored based on the occurrence of the one or more characteristics within that sentence; and selecting the sentence in the plurality of sentences based at least in part on the score of the sentence. 6. The method of claim 1, wherein extracting a portion of the sentence comprises:
identifying the trigger attribute within the sentence; identifying at least one of a subject of the trigger attribute and an object of the trigger attribute; and extracting the portion of the sentence based at least in part on the location of the trigger attribute and the location of at least one of the subject of the trigger attribute and the object of the trigger attribute. 7. The method of claim 6, wherein at least one of the subject of the trigger attribute and the object of the trigger attribute are identified based on rules relating to at least one of syntax, parts-of-speech, grammar, and punctuation. 8. The method of claim 6, wherein the trigger attribute comprises at least one of a verb and an adjective. 9. The method of claim 1, wherein generating the headline comprises:
removing one or more words from the portion of the sentence. 10. The method of claim 9, wherein the one or more words comprise at least one of an adjective, an adverb, and a prepositional phrase. 11. The method of claim 1, wherein generating the headline comprises:
converting a verb in the portion of the sentence into either an active tense or a gerund. 12. An apparatus for generating a headline comprising:
one or more processors; and one or more memories operatively coupled to at least one of the one or more processors and having instructions stored thereon that, when executed by at least one of the one or more processors, cause at least one of the one or more processors to:
identify a content section of a document;
select a sentence in the content section based at least in part on a determination that the sentence exhibits one or more characteristics correlated with headline performance;
extract a portion of the sentence based at least in part on a trigger attribute within the sentence; and
generate the headline based at least in part on the portion of the sentence. 13. The apparatus of claim 12, wherein the one or more characteristics correlated with headline performance comprise at least one of semantic characteristics and grammatical characteristics. 14. The apparatus of claim 12, wherein headline performance is measured by a performance indicator. 15. The apparatus of claim 14, wherein the performance indicator comprises at least one of click-through rate, conversion to action, time spent on site, and download rate. 16. The apparatus of claim 12, wherein the instructions that, when executed by at least one of the one or more processors, cause at least one of the one or more processors to select a sentence further cause at least one of the one or more processors to:
score a plurality of sentences in the content section based at least in part on the one or more characteristics correlated with headline performance, wherein each sentence is scored based on the occurrence of the one or more characteristics within that sentence; and select the sentence in the plurality of sentences based at least in part on the score of the sentence. 17. The apparatus of claim 12, wherein the instructions that, when executed by at least one of the one or more processors, cause at least one of the one or more processors to extract a portion of the sentence further cause at least one of the one or more processors to:
identify the trigger attribute within the sentence; identify at least one of a subject of the trigger attribute and an object of the trigger attribute; and extract the portion of the sentence based at least in part on the location of the trigger attribute and the location of at least one of the subject of the trigger attribute and the object of the trigger attribute. 18. The apparatus of claim 17, wherein at least one of the subject of the trigger attribute and the object of the trigger attribute are identified based on rules relating to at least one of syntax, parts-of-speech, grammar, and punctuation. 19. The apparatus of claim 17, wherein the trigger attribute comprises at least one of a verb and an adjective. 20. The apparatus of claim 12, wherein the instructions that, when executed by at least one of the one or more processors, cause at least one of the one or more processors to generate the headline further cause at least one of the one or more processors to remove one or more words from the portion of the sentence. 21. The apparatus of claim 20, wherein the one or more words comprise at least one of an adjective, an adverb, and a prepositional phrase. 22. The apparatus of claim 12, wherein the instructions that, when executed by at least one of the one or more processors, cause at least one of the one or more processors to generate the headline further cause at least one of the one or more processors to convert a verb in the portion of the sentence into either an active tense or a gerund. 23. At least one non-transitory computer-readable medium storing computer-readable instructions that, when executed by one or more computing devices, cause at least one of the one or more computing devices to:
identify a content section of a document; select a sentence in the content section based at least in part on a determination that the sentence exhibits one or more characteristics correlated with headline performance; extract a portion of the sentence based at least in part on a trigger attribute within the sentence; and generate a headline based at least in part on the portion of the sentence. 24. The at least one non-transitory computer-readable medium of claim 23, wherein the one or more characteristics correlated with headline performance comprise at least one of semantic characteristics and grammatical characteristics. 25. The at least one non-transitory computer-readable medium of claim 23, wherein headline performance is measured by a performance indicator. 26. The at least one non-transitory computer-readable medium of claim 25, wherein the performance indicator comprises at least one of click-through rate, conversion to action, time spent on site, and download rate. 27. The at least one non-transitory computer-readable medium of claim 23, wherein the instructions that, when executed by at least one of the one or more computing devices, cause at least one of the one or more computing devices to select a sentence further cause at least one of the one or more computing devices to:
score a plurality of sentences in the content section based at least in part on the one or more characteristics correlated with headline performance, wherein each sentence is scored based on the occurrence of the one or more characteristics within that sentence; and select the sentence in the plurality of sentences based at least in part on the score of the sentence. 28. The at least one non-transitory computer-readable medium of claim 23, wherein the instructions that, when executed by at least one of the one or more computing devices, cause at least one of the one or more computing devices to extract a portion of the sentence further cause at least one of the one or more computing devices to:
identify the trigger attribute within the sentence; identify at least one of a subject of the trigger attribute and an object of the trigger attribute; and extract the portion of the sentence based at least in part on the location of the trigger attribute and the location of at least one of the subject of the trigger attribute and the object of the trigger attribute. 29. The at least one non-transitory computer-readable medium of claim 28, wherein at least one of the subject of the trigger attribute and the object of the trigger attribute are identified based on rules relating to at least one of syntax, parts-of-speech, grammar, and punctuation. 30. The at least one non-transitory computer-readable medium of claim 28, wherein the trigger attribute comprises at least one of a verb and an adjective. 31. The at least one non-transitory computer-readable medium of claim 23, wherein the instructions that, when executed by at least one of the one or more computing devices, cause at least one of the one or more computing devices to generate the headline further cause at least one of the one or more computing devices to remove one or more words from the portion of the sentence. 32. The at least one non-transitory computer-readable medium of claim 31, wherein the one or more words comprise at least one of an adjective, an adverb, and a prepositional phrase. 33. The at least one non-transitory computer-readable medium of claim 23, wherein the instructions that, when executed by at least one of the one or more computing devices, cause at least one of the one or more computing devices to generate the headline further cause at least one of the one or more computing devices to convert a verb in the portion of the sentence into either an active tense or a gerund. | An apparatus, computer-readable medium, and computer-implemented method for generating a headline includes identifying a content section of a document, selecting a sentence in the content section based at least in part on a determination that the sentence exhibits one or more characteristics correlated with headline performance, extracting a portion of the sentence based at least in part on a trigger attribute within the sentence, and generating the headline based at least in part on the portion of the sentence.1. A method executed by one or more computing devices for generating a headline, the method comprising:
identifying, by at least one of the one or more computing devices, a content section of a document; selecting, by at least one of the one or more computing devices, a sentence in the content section based at least in part on a determination that the sentence exhibits one or more characteristics correlated with headline performance; extracting, by at least one of the one or more computing devices, a portion of the sentence based at least in part on a trigger attribute within the sentence; and generating, by at least one of the one or more computing device, the headline based at least in part on the portion of the sentence. 2. The method of claim 1, wherein the one or more characteristics correlated with headline performance comprise at least one of semantic characteristics and grammatical characteristics. 3. The method of claim 1, wherein headline performance is measured by a performance indicator. 4. The method of claim 3, wherein the performance indicator comprises at least one of click-through rate, conversion to action, time spent on site, and download rate. 5. The method of claim 1, wherein selecting a sentence comprises:
scoring a plurality of sentences in the content section based at least in part on the one or more characteristics correlated with headline performance, wherein each sentence is scored based on the occurrence of the one or more characteristics within that sentence; and selecting the sentence in the plurality of sentences based at least in part on the score of the sentence. 6. The method of claim 1, wherein extracting a portion of the sentence comprises:
identifying the trigger attribute within the sentence; identifying at least one of a subject of the trigger attribute and an object of the trigger attribute; and extracting the portion of the sentence based at least in part on the location of the trigger attribute and the location of at least one of the subject of the trigger attribute and the object of the trigger attribute. 7. The method of claim 6, wherein at least one of the subject of the trigger attribute and the object of the trigger attribute are identified based on rules relating to at least one of syntax, parts-of-speech, grammar, and punctuation. 8. The method of claim 6, wherein the trigger attribute comprises at least one of a verb and an adjective. 9. The method of claim 1, wherein generating the headline comprises:
removing one or more words from the portion of the sentence. 10. The method of claim 9, wherein the one or more words comprise at least one of an adjective, an adverb, and a prepositional phrase. 11. The method of claim 1, wherein generating the headline comprises:
converting a verb in the portion of the sentence into either an active tense or a gerund. 12. An apparatus for generating a headline comprising:
one or more processors; and one or more memories operatively coupled to at least one of the one or more processors and having instructions stored thereon that, when executed by at least one of the one or more processors, cause at least one of the one or more processors to:
identify a content section of a document;
select a sentence in the content section based at least in part on a determination that the sentence exhibits one or more characteristics correlated with headline performance;
extract a portion of the sentence based at least in part on a trigger attribute within the sentence; and
generate the headline based at least in part on the portion of the sentence. 13. The apparatus of claim 12, wherein the one or more characteristics correlated with headline performance comprise at least one of semantic characteristics and grammatical characteristics. 14. The apparatus of claim 12, wherein headline performance is measured by a performance indicator. 15. The apparatus of claim 14, wherein the performance indicator comprises at least one of click-through rate, conversion to action, time spent on site, and download rate. 16. The apparatus of claim 12, wherein the instructions that, when executed by at least one of the one or more processors, cause at least one of the one or more processors to select a sentence further cause at least one of the one or more processors to:
score a plurality of sentences in the content section based at least in part on the one or more characteristics correlated with headline performance, wherein each sentence is scored based on the occurrence of the one or more characteristics within that sentence; and select the sentence in the plurality of sentences based at least in part on the score of the sentence. 17. The apparatus of claim 12, wherein the instructions that, when executed by at least one of the one or more processors, cause at least one of the one or more processors to extract a portion of the sentence further cause at least one of the one or more processors to:
identify the trigger attribute within the sentence; identify at least one of a subject of the trigger attribute and an object of the trigger attribute; and extract the portion of the sentence based at least in part on the location of the trigger attribute and the location of at least one of the subject of the trigger attribute and the object of the trigger attribute. 18. The apparatus of claim 17, wherein at least one of the subject of the trigger attribute and the object of the trigger attribute are identified based on rules relating to at least one of syntax, parts-of-speech, grammar, and punctuation. 19. The apparatus of claim 17, wherein the trigger attribute comprises at least one of a verb and an adjective. 20. The apparatus of claim 12, wherein the instructions that, when executed by at least one of the one or more processors, cause at least one of the one or more processors to generate the headline further cause at least one of the one or more processors to remove one or more words from the portion of the sentence. 21. The apparatus of claim 20, wherein the one or more words comprise at least one of an adjective, an adverb, and a prepositional phrase. 22. The apparatus of claim 12, wherein the instructions that, when executed by at least one of the one or more processors, cause at least one of the one or more processors to generate the headline further cause at least one of the one or more processors to convert a verb in the portion of the sentence into either an active tense or a gerund. 23. At least one non-transitory computer-readable medium storing computer-readable instructions that, when executed by one or more computing devices, cause at least one of the one or more computing devices to:
identify a content section of a document; select a sentence in the content section based at least in part on a determination that the sentence exhibits one or more characteristics correlated with headline performance; extract a portion of the sentence based at least in part on a trigger attribute within the sentence; and generate a headline based at least in part on the portion of the sentence. 24. The at least one non-transitory computer-readable medium of claim 23, wherein the one or more characteristics correlated with headline performance comprise at least one of semantic characteristics and grammatical characteristics. 25. The at least one non-transitory computer-readable medium of claim 23, wherein headline performance is measured by a performance indicator. 26. The at least one non-transitory computer-readable medium of claim 25, wherein the performance indicator comprises at least one of click-through rate, conversion to action, time spent on site, and download rate. 27. The at least one non-transitory computer-readable medium of claim 23, wherein the instructions that, when executed by at least one of the one or more computing devices, cause at least one of the one or more computing devices to select a sentence further cause at least one of the one or more computing devices to:
score a plurality of sentences in the content section based at least in part on the one or more characteristics correlated with headline performance, wherein each sentence is scored based on the occurrence of the one or more characteristics within that sentence; and select the sentence in the plurality of sentences based at least in part on the score of the sentence. 28. The at least one non-transitory computer-readable medium of claim 23, wherein the instructions that, when executed by at least one of the one or more computing devices, cause at least one of the one or more computing devices to extract a portion of the sentence further cause at least one of the one or more computing devices to:
identify the trigger attribute within the sentence; identify at least one of a subject of the trigger attribute and an object of the trigger attribute; and extract the portion of the sentence based at least in part on the location of the trigger attribute and the location of at least one of the subject of the trigger attribute and the object of the trigger attribute. 29. The at least one non-transitory computer-readable medium of claim 28, wherein at least one of the subject of the trigger attribute and the object of the trigger attribute are identified based on rules relating to at least one of syntax, parts-of-speech, grammar, and punctuation. 30. The at least one non-transitory computer-readable medium of claim 28, wherein the trigger attribute comprises at least one of a verb and an adjective. 31. The at least one non-transitory computer-readable medium of claim 23, wherein the instructions that, when executed by at least one of the one or more computing devices, cause at least one of the one or more computing devices to generate the headline further cause at least one of the one or more computing devices to remove one or more words from the portion of the sentence. 32. The at least one non-transitory computer-readable medium of claim 31, wherein the one or more words comprise at least one of an adjective, an adverb, and a prepositional phrase. 33. The at least one non-transitory computer-readable medium of claim 23, wherein the instructions that, when executed by at least one of the one or more computing devices, cause at least one of the one or more computing devices to generate the headline further cause at least one of the one or more computing devices to convert a verb in the portion of the sentence into either an active tense or a gerund. | 2,100 |
5,353 | 5,353 | 14,984,335 | 2,143 | A method and an apparatus for managing a notification bar message relate to the field of electronic device applications and resolve a problem of a tedious operation for clearing a resident notification message. The method includes: searching for a resident notification message; after the resident notification message is found, displaying, in a notification bar, prompt information prompting whether to delete the resident notification message; and if a user chooses to delete the resident notification message, deleting the resident notification message according to a system permission. The method and apparatus are mainly applied to a process of managing a mobile phone application. | 1. A method for managing a notification bar message, comprising:
searching for a resident notification message; after the resident notification message is found, displaying, in a notification bar, prompt information inform whether to delete the resident notification message; and if a user chooses to delete the resident notification message, deleting the resident notification message according to a system permission. 2. The method according to claim 1, wherein the searching for a resident notification message comprises:
receiving, in the notification bar, a notification message deletion instruction; and searching for a resident notification message in a notification message to be deleted. 3. The method according to claim 1, wherein the searching for a resident notification message comprises:
monitoring whether a new notification message is added to the notification bar; and if a new notification message is added to the notification bar, determining whether the newly added notification message is the resident notification message. 4. The method according to claim 1, wherein the deleting the resident notification message according to a system permission comprises:
sending a resident notification message deletion request to an operating system according to the system permission, wherein the resident notification message deletion request carries an attribute flag used to indicate that the notification message is the resident notification message, so that the operating system deletes the resident notification message according to the attribute flag. 5. The method according to claim 1, wherein after the searching for a resident notification message, the method further comprises:
displaying, in the notification bar, shielding prompt information, wherein the shielding prompt information is used to prompt whether to perform message pushing shielding for an application that pushes the resident notification message; and if the user chooses to perform message pushing shielding for the application, sending a push shielding request to the operating system according to the system permission, so that the operating system shields, according to the push shielding request, a notification message pushed by the application. 6. The method according to claim 1, wherein after the searching for a resident notification message, the method further comprises:
displaying, in the notification bar, attribute modification prompt information, wherein the attribute modification prompt information is used to prompt whether to perform notification message attribute modification for an application that pushes the resident notification message; and if the user chooses to perform attribute modification for the application, sending an attribute modification request to the operating system according to the system permission, wherein the attribute modification request carries an attribute flag used to indicate that the notification message is the resident notification message, so that the operating system modifies, into a non-resident notification message according to the attribute flag, a notification message attribute of the application that pushes the resident notification message. 7. The method according to claim 1, wherein after the resident notification message, the method further comprises:
performing a semantic analysis on the resident notification message; and if content of the resident notification message matches a preset content set, deleting the resident notification message. 8. An apparatus for managing a notification bar message, comprising:
a monitoring unit, configured to search for a resident notification message; a notifying unit, configured to: after the monitoring unit finds the resident notification message, display, in a notification bar, prompt information prompting whether to delete the resident notification message; and a processing unit, configured to: when a user chooses, according to a message from the notifying unit, to delete the resident notification message, delete, according to a system permission, the resident notification message that is found by the monitoring unit. 9. The apparatus according to claim 8, wherein the monitoring unit comprises:
a receiving subunit, configured to receive, in the notification bar, a notification message deletion instruction; and a searching subunit, configured to: after the receiving subunit receives the notification message deletion instruction, search for a resident notification message in a notification message to be deleted. 10. The apparatus according to claim 8, wherein the monitoring unit comprises:
a monitoring subunit, configured to monitor whether a new notification message is added to the notification bar; and a determining subunit, configured to: when the monitoring subunit finds, by means of monitoring, that a new notification message is added to the notification bar, determine whether the newly added notification message is a resident notification message. 11. The apparatus according to claim 8, wherein the processing unit is configured to send a resident notification message deletion request to an operating system according to the system permission, wherein the resident notification message deletion request carries an attribute flag used to indicate that the notification message is the resident notification message, so that the operating system deletes the resident notification message according to the attribute flag. 12. The apparatus according to claim 8, wherein the notifying unit is configured to: after the monitoring unit searches for the resident notification message, display, in the notification bar, shielding prompt information, wherein the shielding prompt information is used to prompt whether to perform message pushing shielding for an application that pushes the resident notification message; and
the processing unit is configured to: when the user chooses, according to a prompt from the notifying unit, to perform message pushing shielding for the application, send a push shielding request to the operating system according to the system permission, so that the operating system shields, according to the push shielding request, a notification message pushed by the application. 13. The apparatus according to claim 8, wherein the notifying unit is configured to: after the monitoring unit searches for the resident notification message, display, in the notification bar, attribute modification prompt information, wherein the attribute modification prompt information is used to prompt whether to perform notification message attribute modification for an application that pushes the resident notification message; and
the processing unit is configured to: when the user chooses, according to a prompt from the notifying unit, to perform attribute modification for the application, send an attribute modification request to the operating system according to the system permission, wherein the attribute modification request carries an attribute flag used to indicate that the notification message is the resident notification message, so that the operating system modifies, into a non-resident notification message according to the attribute flag, a notification message attribute of the application that pushes the resident notification message. 14. The apparatus according to claim 8, wherein the apparatus further comprises:
a screening unit, configured to perform a semantic analysis on the resident notification message after the monitoring unit searches for the resident notification message; wherein the processing unit is configured to delete the resident notification message when the screening unit finds, by means of an analysis, that content of the resident notification message matches a preset content set. 15. An apparatus for managing a notification bar message, comprising:
a monitoring circuit, configured to search for a resident notification message; an input and output circuit, configured to: after the monitoring circuit finds the resident notification message, display, in a notification bar, prompt information prompting whether to delete the resident notification message; and a processor, configured to: when a user chooses, according to a prompt from the input and output circuit, to delete the resident notification message, delete, according to a system permission, the resident notification message that is found by the monitoring circuit. 16. The apparatus according to claim 15, wherein the monitoring circuit is configured to receive, in the notification bar, a notification message deletion instruction, and after receiving the notification message deletion instruction, search for a resident notification message in a notification message to be deleted. 17. The apparatus according to claim 15, wherein the monitoring circuit is configured to monitor whether a new notification message is added to the notification bar, and when it is found, by means of monitoring, that a new notification message is added to the notification bar, determine whether the newly added notification message is the resident notification message. 18. The apparatus according to claim 15, wherein the processor is configured to send a resident notification message deletion request to an operating system according to the system permission, wherein the resident notification message deletion request carries an attribute flag used to indicate that the notification message is the resident notification message, so that the operating system deletes the resident notification message according to the attribute flag. 19. The apparatus according to claim 15, wherein the input and output circuit is configured to: after the monitoring circuit searches for the resident notification message, display, in the notification bar, shielding prompt information, wherein the shielding prompt information is used to prompt whether to perform message pushing shielding for an application that pushes the resident notification message; and
the processor is configured to: when the user chooses, according to a prompt from the input and output circuit, to perform message pushing shielding for the application, send a push shielding request to the operating system according to the system permission, so that the operating system shields, according to the push shielding request, a notification message pushed by the application. 20. The apparatus according to claim 15, wherein the input and output unit is configured to: after the monitoring circuit searches for the resident notification message, display, in the notification bar, attribute modification prompt information, wherein the attribute modification prompt information is used to prompt whether to perform notification message attribute modification for an application that pushes the resident notification message; and
the processor is configured to: when the user chooses, according to a prompt from the input and output circuit, to perform attribute modification for the application, send an attribute modification request to the operating system according to the system permission, wherein the attribute modification request carries an attribute flag used to indicate that the notification message is the resident notification message, so that the operating system modifies, into a non-resident notification message according to the attribute flag, a notification message attribute of the application that pushes the resident notification message. 21. The apparatus according to claim 15, wherein the processor is further configured to perform a semantic analysis on the resident notification message after the monitoring circuit searches for the resident notification message, and delete the resident notification message when it is found, by means of an analysis, that content of the resident notification message matches a preset content set. | A method and an apparatus for managing a notification bar message relate to the field of electronic device applications and resolve a problem of a tedious operation for clearing a resident notification message. The method includes: searching for a resident notification message; after the resident notification message is found, displaying, in a notification bar, prompt information prompting whether to delete the resident notification message; and if a user chooses to delete the resident notification message, deleting the resident notification message according to a system permission. The method and apparatus are mainly applied to a process of managing a mobile phone application.1. A method for managing a notification bar message, comprising:
searching for a resident notification message; after the resident notification message is found, displaying, in a notification bar, prompt information inform whether to delete the resident notification message; and if a user chooses to delete the resident notification message, deleting the resident notification message according to a system permission. 2. The method according to claim 1, wherein the searching for a resident notification message comprises:
receiving, in the notification bar, a notification message deletion instruction; and searching for a resident notification message in a notification message to be deleted. 3. The method according to claim 1, wherein the searching for a resident notification message comprises:
monitoring whether a new notification message is added to the notification bar; and if a new notification message is added to the notification bar, determining whether the newly added notification message is the resident notification message. 4. The method according to claim 1, wherein the deleting the resident notification message according to a system permission comprises:
sending a resident notification message deletion request to an operating system according to the system permission, wherein the resident notification message deletion request carries an attribute flag used to indicate that the notification message is the resident notification message, so that the operating system deletes the resident notification message according to the attribute flag. 5. The method according to claim 1, wherein after the searching for a resident notification message, the method further comprises:
displaying, in the notification bar, shielding prompt information, wherein the shielding prompt information is used to prompt whether to perform message pushing shielding for an application that pushes the resident notification message; and if the user chooses to perform message pushing shielding for the application, sending a push shielding request to the operating system according to the system permission, so that the operating system shields, according to the push shielding request, a notification message pushed by the application. 6. The method according to claim 1, wherein after the searching for a resident notification message, the method further comprises:
displaying, in the notification bar, attribute modification prompt information, wherein the attribute modification prompt information is used to prompt whether to perform notification message attribute modification for an application that pushes the resident notification message; and if the user chooses to perform attribute modification for the application, sending an attribute modification request to the operating system according to the system permission, wherein the attribute modification request carries an attribute flag used to indicate that the notification message is the resident notification message, so that the operating system modifies, into a non-resident notification message according to the attribute flag, a notification message attribute of the application that pushes the resident notification message. 7. The method according to claim 1, wherein after the resident notification message, the method further comprises:
performing a semantic analysis on the resident notification message; and if content of the resident notification message matches a preset content set, deleting the resident notification message. 8. An apparatus for managing a notification bar message, comprising:
a monitoring unit, configured to search for a resident notification message; a notifying unit, configured to: after the monitoring unit finds the resident notification message, display, in a notification bar, prompt information prompting whether to delete the resident notification message; and a processing unit, configured to: when a user chooses, according to a message from the notifying unit, to delete the resident notification message, delete, according to a system permission, the resident notification message that is found by the monitoring unit. 9. The apparatus according to claim 8, wherein the monitoring unit comprises:
a receiving subunit, configured to receive, in the notification bar, a notification message deletion instruction; and a searching subunit, configured to: after the receiving subunit receives the notification message deletion instruction, search for a resident notification message in a notification message to be deleted. 10. The apparatus according to claim 8, wherein the monitoring unit comprises:
a monitoring subunit, configured to monitor whether a new notification message is added to the notification bar; and a determining subunit, configured to: when the monitoring subunit finds, by means of monitoring, that a new notification message is added to the notification bar, determine whether the newly added notification message is a resident notification message. 11. The apparatus according to claim 8, wherein the processing unit is configured to send a resident notification message deletion request to an operating system according to the system permission, wherein the resident notification message deletion request carries an attribute flag used to indicate that the notification message is the resident notification message, so that the operating system deletes the resident notification message according to the attribute flag. 12. The apparatus according to claim 8, wherein the notifying unit is configured to: after the monitoring unit searches for the resident notification message, display, in the notification bar, shielding prompt information, wherein the shielding prompt information is used to prompt whether to perform message pushing shielding for an application that pushes the resident notification message; and
the processing unit is configured to: when the user chooses, according to a prompt from the notifying unit, to perform message pushing shielding for the application, send a push shielding request to the operating system according to the system permission, so that the operating system shields, according to the push shielding request, a notification message pushed by the application. 13. The apparatus according to claim 8, wherein the notifying unit is configured to: after the monitoring unit searches for the resident notification message, display, in the notification bar, attribute modification prompt information, wherein the attribute modification prompt information is used to prompt whether to perform notification message attribute modification for an application that pushes the resident notification message; and
the processing unit is configured to: when the user chooses, according to a prompt from the notifying unit, to perform attribute modification for the application, send an attribute modification request to the operating system according to the system permission, wherein the attribute modification request carries an attribute flag used to indicate that the notification message is the resident notification message, so that the operating system modifies, into a non-resident notification message according to the attribute flag, a notification message attribute of the application that pushes the resident notification message. 14. The apparatus according to claim 8, wherein the apparatus further comprises:
a screening unit, configured to perform a semantic analysis on the resident notification message after the monitoring unit searches for the resident notification message; wherein the processing unit is configured to delete the resident notification message when the screening unit finds, by means of an analysis, that content of the resident notification message matches a preset content set. 15. An apparatus for managing a notification bar message, comprising:
a monitoring circuit, configured to search for a resident notification message; an input and output circuit, configured to: after the monitoring circuit finds the resident notification message, display, in a notification bar, prompt information prompting whether to delete the resident notification message; and a processor, configured to: when a user chooses, according to a prompt from the input and output circuit, to delete the resident notification message, delete, according to a system permission, the resident notification message that is found by the monitoring circuit. 16. The apparatus according to claim 15, wherein the monitoring circuit is configured to receive, in the notification bar, a notification message deletion instruction, and after receiving the notification message deletion instruction, search for a resident notification message in a notification message to be deleted. 17. The apparatus according to claim 15, wherein the monitoring circuit is configured to monitor whether a new notification message is added to the notification bar, and when it is found, by means of monitoring, that a new notification message is added to the notification bar, determine whether the newly added notification message is the resident notification message. 18. The apparatus according to claim 15, wherein the processor is configured to send a resident notification message deletion request to an operating system according to the system permission, wherein the resident notification message deletion request carries an attribute flag used to indicate that the notification message is the resident notification message, so that the operating system deletes the resident notification message according to the attribute flag. 19. The apparatus according to claim 15, wherein the input and output circuit is configured to: after the monitoring circuit searches for the resident notification message, display, in the notification bar, shielding prompt information, wherein the shielding prompt information is used to prompt whether to perform message pushing shielding for an application that pushes the resident notification message; and
the processor is configured to: when the user chooses, according to a prompt from the input and output circuit, to perform message pushing shielding for the application, send a push shielding request to the operating system according to the system permission, so that the operating system shields, according to the push shielding request, a notification message pushed by the application. 20. The apparatus according to claim 15, wherein the input and output unit is configured to: after the monitoring circuit searches for the resident notification message, display, in the notification bar, attribute modification prompt information, wherein the attribute modification prompt information is used to prompt whether to perform notification message attribute modification for an application that pushes the resident notification message; and
the processor is configured to: when the user chooses, according to a prompt from the input and output circuit, to perform attribute modification for the application, send an attribute modification request to the operating system according to the system permission, wherein the attribute modification request carries an attribute flag used to indicate that the notification message is the resident notification message, so that the operating system modifies, into a non-resident notification message according to the attribute flag, a notification message attribute of the application that pushes the resident notification message. 21. The apparatus according to claim 15, wherein the processor is further configured to perform a semantic analysis on the resident notification message after the monitoring circuit searches for the resident notification message, and delete the resident notification message when it is found, by means of an analysis, that content of the resident notification message matches a preset content set. | 2,100 |
5,354 | 5,354 | 15,246,266 | 2,144 | Examples relate to manipulating web pages. In one example, a computing device may: receive a web page that includes application instructions for modifying objects included in the web page; execute the application instructions; record, in an ordered list of changes, change data for each application object that is modified, created, or destroyed during execution of the application instructions; record, in the ordered list of changes, change data for each web page object that is modified, created, or destroyed during execution of the application instructions; identify, in the ordered list of changes, a transition point between recorded changes; receive a request to change a state of the web page to the transition point; and apply, in reverse order, an inverse of each change specified in the ordered list of changes from a current point in time until the transition point. | 1. A non-transitory machine-readable storage medium encoded with instructions that upon execution by a computing device cause the computing device to:
receive a web page that includes application instructions for modifying objects included in the web page; execute the application instructions; record, in an ordered list of changes, change data for each application object that is modified, created, or destroyed during execution of the application instructions, the application object defined by the application instructions; record, in the ordered list of changes, change data for each web page object that is modified, created, or destroyed during execution of the application instructions, the web page object defined by a document object model (DOM) of the web page; identify, in the ordered list of changes, a transition point between recorded changes; receive a request to change a state of the web page to the transition point; and apply, in reverse order, an inverse of each change specified in the ordered list of changes from a current point in time until the transition point. 2. The storage medium of claim 1, wherein the application instructions comprise application script, and wherein each application object is an object defined by the application script. 3. (canceled) 4. The storage medium of claim 1, wherein:
the change data for each web page object includes i) a web page object identifier, ii) a new value for a web page object that was created or modified, and iii) an old value for a web page object that was modified or destroyed, and the change data for each application object includes i) an application object identifier, ii) a new value for an application object that was created or modified, and iii) an old value for an application object that was modified or destroyed. 5. The storage medium of claim 1, wherein each transition point is identified based on at least one of an application object change or web page object change. 6. The storage medium of claim 1, wherein the instructions further cause the computing device to:
receive a request to change the web page to a second transition point, the second transition point being listed after a current point in the ordered list of changes; and apply, in order, each change specified in the ordered list of changes from the current point in the ordered list of changes to the second transition point. 7. The storage medium of claim 1, wherein the instructions further cause the computing device to:
identify web page objects by tagging the web page objects; and identify application objects by tagging the application objects. 8. A method for application manipulation, implemented using a hardware processor, the method comprising:
receiving a web page that includes application instructions for modifying objects included in the web page; executing the application instructions; receiving, during execution of the application instructions and at a first state of the web page, input that causes a change to an application object defined by the application instructions; recording, in an ordered list of changes, change data for the change to the application object caused by the received input; receiving a request to change a current state of the web page to the first state of the web page; and applying an inverse of the change to the application object caused by the received input to place the web page at the first state. 9. The method of claim 8, wherein the application instructions comprise an application script, and wherein the application object is defined by the application script. 10. The method of claim 8, further comprising:
receiving, during the execution of the application instructions, a further input that causes a change to a web page object defined by a document object model (DOM) of the web page; recording, in the ordered list of changes, change data for the change to the web page object; and in response to the request, applying an inverse of the change to the web page object to place the web page at the first state. 11. The method of claim 10, wherein:
the change data for the web page object includes i) a web page object identifier, ii) a new value for a web page object that was created or modified, and iii) an old value for a web page object that was modified or destroyed, and the change data for the application object includes i) an application object identifier, ii) a new value for an application object that was created or modified, and iii) an old value for an application object that was modified or destroyed. 12. The method of claim 8, further comprising:
after applying the inverse of the change to the application object, receiving a request to change the first state of the web page to the current state; and re-applying the change caused by the input received during execution of the application instructions at the first state. 13. The method of claim 8, further comprising:
identifying, by a web page manipulator executed on the hardware processor, web page objects by tagging the web page objects specified by a document object model (DOM) of the web page; and identifying, by the web page manipulator, application objects by the tagging the application objects. 14. A computing device comprising:
a hardware processor; and a data storage device storing instructions executable on the hardware processor to:
receive a web page that includes application instructions for modifying objects included in the web page;
execute the application instructions;
record, in an ordered list of changes, change data for each of a plurality of modifications, creations, or destructions of application objects during execution of the application instructions, the application objects defined by the application instructions;
record, in the ordered list of changes, change data for each of a plurality of modifications, creations, or destructions of web page objects during execution of the application instructions, the web page objects defined by a document object model (DOM) of the web page;
identify, in the ordered list of changes, at least one transition point between recorded changes;
receive a request to change a state of the web page to a particular transition point of the at least one transition point; and
apply to the web page, in reverse order, an inverse of each change specified in the ordered list of changes from a current point in time until the particular transition point. 15. The computing device of claim 14, wherein the application instructions comprise an application script, and wherein each application object is an object defined by the application script. 16. (canceled) 17. The computing device of claim 14, wherein:
the change data for each web page object includes i) a web page object identifier, ii) a new value for a web page object that was created or modified, and iii) an old value for a web page object that was modified or destroyed, and the change data for each application object includes i) an application object identifier, ii) a new value for an application object that was created or modified, and iii) an old value for an application object that was modified or destroyed. 18. The computing device of claim 14, wherein each of the at least one transition point is identified based on at least one of an application object change or web page object change. 19. The computing device of claim 14, wherein the instructions are executable on the hardware processor to:
receive a request to change the web page to a second transition point of the at least one transition, the second transition point being listed after a current point in the ordered list of changes; and apply, in order, each change and each creation specified in the ordered list of changes from the current point in the ordered list of changes to the second transition point. 20. The computing device of claim 14, wherein the instructions are executable on the processor to:
identify web page objects by tagging the web page objects; and identify application objects by tagging the application objects. 21. The storage medium of claim 1, wherein the ordered list of changes is represented by a tree representation including nodes that represent states of the web page responsive to the changes to the application objects and the web page objects, and links between the nodes, the links representing transitions between the states of the web page. 22. The method of claim 8, wherein the ordered list of changes is represented by a tree representation including nodes that represent states of the web page responsive to the changes to application objects and web page objects, and links between the nodes, the links representing transitions between the states of the web page. | Examples relate to manipulating web pages. In one example, a computing device may: receive a web page that includes application instructions for modifying objects included in the web page; execute the application instructions; record, in an ordered list of changes, change data for each application object that is modified, created, or destroyed during execution of the application instructions; record, in the ordered list of changes, change data for each web page object that is modified, created, or destroyed during execution of the application instructions; identify, in the ordered list of changes, a transition point between recorded changes; receive a request to change a state of the web page to the transition point; and apply, in reverse order, an inverse of each change specified in the ordered list of changes from a current point in time until the transition point.1. A non-transitory machine-readable storage medium encoded with instructions that upon execution by a computing device cause the computing device to:
receive a web page that includes application instructions for modifying objects included in the web page; execute the application instructions; record, in an ordered list of changes, change data for each application object that is modified, created, or destroyed during execution of the application instructions, the application object defined by the application instructions; record, in the ordered list of changes, change data for each web page object that is modified, created, or destroyed during execution of the application instructions, the web page object defined by a document object model (DOM) of the web page; identify, in the ordered list of changes, a transition point between recorded changes; receive a request to change a state of the web page to the transition point; and apply, in reverse order, an inverse of each change specified in the ordered list of changes from a current point in time until the transition point. 2. The storage medium of claim 1, wherein the application instructions comprise application script, and wherein each application object is an object defined by the application script. 3. (canceled) 4. The storage medium of claim 1, wherein:
the change data for each web page object includes i) a web page object identifier, ii) a new value for a web page object that was created or modified, and iii) an old value for a web page object that was modified or destroyed, and the change data for each application object includes i) an application object identifier, ii) a new value for an application object that was created or modified, and iii) an old value for an application object that was modified or destroyed. 5. The storage medium of claim 1, wherein each transition point is identified based on at least one of an application object change or web page object change. 6. The storage medium of claim 1, wherein the instructions further cause the computing device to:
receive a request to change the web page to a second transition point, the second transition point being listed after a current point in the ordered list of changes; and apply, in order, each change specified in the ordered list of changes from the current point in the ordered list of changes to the second transition point. 7. The storage medium of claim 1, wherein the instructions further cause the computing device to:
identify web page objects by tagging the web page objects; and identify application objects by tagging the application objects. 8. A method for application manipulation, implemented using a hardware processor, the method comprising:
receiving a web page that includes application instructions for modifying objects included in the web page; executing the application instructions; receiving, during execution of the application instructions and at a first state of the web page, input that causes a change to an application object defined by the application instructions; recording, in an ordered list of changes, change data for the change to the application object caused by the received input; receiving a request to change a current state of the web page to the first state of the web page; and applying an inverse of the change to the application object caused by the received input to place the web page at the first state. 9. The method of claim 8, wherein the application instructions comprise an application script, and wherein the application object is defined by the application script. 10. The method of claim 8, further comprising:
receiving, during the execution of the application instructions, a further input that causes a change to a web page object defined by a document object model (DOM) of the web page; recording, in the ordered list of changes, change data for the change to the web page object; and in response to the request, applying an inverse of the change to the web page object to place the web page at the first state. 11. The method of claim 10, wherein:
the change data for the web page object includes i) a web page object identifier, ii) a new value for a web page object that was created or modified, and iii) an old value for a web page object that was modified or destroyed, and the change data for the application object includes i) an application object identifier, ii) a new value for an application object that was created or modified, and iii) an old value for an application object that was modified or destroyed. 12. The method of claim 8, further comprising:
after applying the inverse of the change to the application object, receiving a request to change the first state of the web page to the current state; and re-applying the change caused by the input received during execution of the application instructions at the first state. 13. The method of claim 8, further comprising:
identifying, by a web page manipulator executed on the hardware processor, web page objects by tagging the web page objects specified by a document object model (DOM) of the web page; and identifying, by the web page manipulator, application objects by the tagging the application objects. 14. A computing device comprising:
a hardware processor; and a data storage device storing instructions executable on the hardware processor to:
receive a web page that includes application instructions for modifying objects included in the web page;
execute the application instructions;
record, in an ordered list of changes, change data for each of a plurality of modifications, creations, or destructions of application objects during execution of the application instructions, the application objects defined by the application instructions;
record, in the ordered list of changes, change data for each of a plurality of modifications, creations, or destructions of web page objects during execution of the application instructions, the web page objects defined by a document object model (DOM) of the web page;
identify, in the ordered list of changes, at least one transition point between recorded changes;
receive a request to change a state of the web page to a particular transition point of the at least one transition point; and
apply to the web page, in reverse order, an inverse of each change specified in the ordered list of changes from a current point in time until the particular transition point. 15. The computing device of claim 14, wherein the application instructions comprise an application script, and wherein each application object is an object defined by the application script. 16. (canceled) 17. The computing device of claim 14, wherein:
the change data for each web page object includes i) a web page object identifier, ii) a new value for a web page object that was created or modified, and iii) an old value for a web page object that was modified or destroyed, and the change data for each application object includes i) an application object identifier, ii) a new value for an application object that was created or modified, and iii) an old value for an application object that was modified or destroyed. 18. The computing device of claim 14, wherein each of the at least one transition point is identified based on at least one of an application object change or web page object change. 19. The computing device of claim 14, wherein the instructions are executable on the hardware processor to:
receive a request to change the web page to a second transition point of the at least one transition, the second transition point being listed after a current point in the ordered list of changes; and apply, in order, each change and each creation specified in the ordered list of changes from the current point in the ordered list of changes to the second transition point. 20. The computing device of claim 14, wherein the instructions are executable on the processor to:
identify web page objects by tagging the web page objects; and identify application objects by tagging the application objects. 21. The storage medium of claim 1, wherein the ordered list of changes is represented by a tree representation including nodes that represent states of the web page responsive to the changes to the application objects and the web page objects, and links between the nodes, the links representing transitions between the states of the web page. 22. The method of claim 8, wherein the ordered list of changes is represented by a tree representation including nodes that represent states of the web page responsive to the changes to application objects and web page objects, and links between the nodes, the links representing transitions between the states of the web page. | 2,100 |
5,355 | 5,355 | 14,394,982 | 2,132 | A cache coherence management system includes: a set of directories distributed between nodes of a network for interconnecting processors including cache memories, each directory including a correspondence table between cache lines and information fields on the cache lines; and a mechanism updating the directories by adding, modifying, or deleting cache lines in the correspondence tables. In each correspondence table and for each cache line identified, at least one field is provided for indicating a possible blocking of a transaction relative to the cache line considered, when the blocking occurs in the node associated with the correspondence table considered. The system further includes a mechanism detecting fields indicating a transaction blocking and restarting each transaction detected as blocked from the node in which it is indicated as blocked. | 1-10. (canceled) 11. A system for managing cache coherence in a network of processors including cache memories, the network including a main memory shared between the processors and a plurality of nodes for access to the main memory interconnected with one another and the processors, the system comprising:
a set of directories distributed between the nodes of the network, each directory comprising a correspondence table between cache lines and information fields on the cache lines; means for updating the directories by adding cache lines, modifying information fields of cache lines, or deleting cache lines in the correspondence tables; wherein in each correspondence table and for each cache line identified, at least one field is provided for indicating whether a transaction relative to the cache line considered is blocked in the node associated with the correspondence table considered; and the system further comprising means for detecting fields indicating a transaction blocking and for restarting each transaction detected as being blocked from the node in which it is indicated as blocked. 12. The system for managing cache coherence according to claim 11, wherein each node of the network comprises a module for automatic search of fields indicating a transaction blocking in the correspondence table associated with it and for restarting each transaction detected as being blocked from the node. 13. The system for managing cache coherence according to claim 12, wherein each node of the network comprises:
a protocol engine interacting with the directory associated with the node for implementation of a cache coherence management protocol; at least one input buffer memory arranged upstream of the protocol engine in a direction of transmission of the transactions through the node; at least one output buffer memory arranged downstream of the protocol engine in the direction of transmission of the transactions through the node; and wherein the module for automatic search and restarting of each node is integrated in an architecture of the node to be configured to transmit requests to restart blocked transactions to attention of the protocol engine, receiving an acknowledgement from the protocol engine each time the protocol engine processes a restart request, and receiving notifications of blocking or unblocking of the node coming from the at least one output buffer memory. 14. The system for managing cache coherence according to claim 13, wherein each node of the network further comprises a multiplexer arbiter arranged upstream of the protocol engine and receiving, at an input, data from each input buffer memory and the requests to restart blocked transactions to the attention of the protocol engine transmitted by the automatic search and restart module, and wherein the automatic search and restart module is implemented in a form of a finite-state machine that includes:
a first idle state in which no transaction is detected as blocked; a second waiting state, when the node is in a deadlock situation, in which the retransmission of transactions stored in the at least one input buffer memory is abandoned, fields for indicating a possible blocking of these transactions are set to a value indicating an actual blocking for the cache lines corresponding to these transactions, and the at least one input buffer memory is cleared of these transactions; a third arbitration state, when the node is in an unblocked situation, in which a request to restart a transaction detected as blocked is waiting to be processed by the protocol engine; and a fourth restarting state, when the node is in an unblocked situation, in which a request to restart a transaction detected as blocked is being processed by the protocol engine. 15. The system for managing cache coherence according to claim 11, wherein lists of cache memories sharing cache lines are represented in the network of processors for implementing a cache coherence management protocol, representation of each list of cache memories sharing a same cache line being distributed between a plurality of directories of nodes of the processor network, including at least the directories of the nodes, as cache nodes, connected to processors, the cache memories of which temporarily store the cache line. 16. The system for managing cache coherence according to claim 15, wherein the directories between which the representation of a list of cache memories sharing the same cache line is distributed further comprises the directories of nodes for interconnection of the cache nodes to form a tree, distributed in the directories of the nodes of the network, for representation of the cache line, the correspondence table of each directory of a node of the tree comprising, for the cache line, status fields to indicate whether the node actually has a copy of the cache line, which directions among a set of predetermined directions lead to another node of the tree in the network, which direction leads to the node of the tree, as a root, historically having first stored the cache line, and whether the node is itself the root node of the tree. 17. An electronic chip comprising:
a network of processors including cache memories, the network including a main memory shared between the processors and a plurality of nodes for access to the main memory interconnected with one another and the processors; and a system for managing cache coherence according to claim 11. 18. A method for managing cache coherence in a network of processors including cache memories, the network including a main memory shared between the processors and a plurality of nodes for access to the main memory interconnected with one another and the processors, the method comprising:
generating directories distributed between the nodes of the network, each directory including a correspondence table between cache lines and information fields on these cache lines; updating the directories by adding cache lines, modifying information fields of cache lines or deleting cache lines, in the correspondence tables; when a blocking of a transaction relative to a cache line is detected in a node of the network, updating at least one field for indicating the blocking in the corresponding cache line of the correspondence table of the directory of the node, detecting fields indicating the blocking of a transaction in at least one directory of at least one node of the network; and restarting each transaction detected as being blocked from the node in which it is indicated as being blocked. 19. The method for managing cache coherence according to claim 18, wherein the detection comprises an automatic search of the fields indicating a transaction blocking in each directory of each node of the network, the automatic search for and restarting of transactions detected as being blocked in a node of the network being performed in a circular manner in the correspondence table of the directory of the node, by:
a first pointer, as the work pointer, scanning the lines of the correspondence table to cause a transaction to be restarted each time the field for indicating a blocking relative to a cache line indicates a transaction blocking, and a second pointer, as a read pointer, performing a control function by being positioned on the line preceding that indicated by the current value of the work pointer each time a blocking of the node is detected. 20. A non-transitory computer readable program executable by a processor, comprising instructions for executing the cache coherence management method according to claim 18, when the program is executed on a computer. | A cache coherence management system includes: a set of directories distributed between nodes of a network for interconnecting processors including cache memories, each directory including a correspondence table between cache lines and information fields on the cache lines; and a mechanism updating the directories by adding, modifying, or deleting cache lines in the correspondence tables. In each correspondence table and for each cache line identified, at least one field is provided for indicating a possible blocking of a transaction relative to the cache line considered, when the blocking occurs in the node associated with the correspondence table considered. The system further includes a mechanism detecting fields indicating a transaction blocking and restarting each transaction detected as blocked from the node in which it is indicated as blocked.1-10. (canceled) 11. A system for managing cache coherence in a network of processors including cache memories, the network including a main memory shared between the processors and a plurality of nodes for access to the main memory interconnected with one another and the processors, the system comprising:
a set of directories distributed between the nodes of the network, each directory comprising a correspondence table between cache lines and information fields on the cache lines; means for updating the directories by adding cache lines, modifying information fields of cache lines, or deleting cache lines in the correspondence tables; wherein in each correspondence table and for each cache line identified, at least one field is provided for indicating whether a transaction relative to the cache line considered is blocked in the node associated with the correspondence table considered; and the system further comprising means for detecting fields indicating a transaction blocking and for restarting each transaction detected as being blocked from the node in which it is indicated as blocked. 12. The system for managing cache coherence according to claim 11, wherein each node of the network comprises a module for automatic search of fields indicating a transaction blocking in the correspondence table associated with it and for restarting each transaction detected as being blocked from the node. 13. The system for managing cache coherence according to claim 12, wherein each node of the network comprises:
a protocol engine interacting with the directory associated with the node for implementation of a cache coherence management protocol; at least one input buffer memory arranged upstream of the protocol engine in a direction of transmission of the transactions through the node; at least one output buffer memory arranged downstream of the protocol engine in the direction of transmission of the transactions through the node; and wherein the module for automatic search and restarting of each node is integrated in an architecture of the node to be configured to transmit requests to restart blocked transactions to attention of the protocol engine, receiving an acknowledgement from the protocol engine each time the protocol engine processes a restart request, and receiving notifications of blocking or unblocking of the node coming from the at least one output buffer memory. 14. The system for managing cache coherence according to claim 13, wherein each node of the network further comprises a multiplexer arbiter arranged upstream of the protocol engine and receiving, at an input, data from each input buffer memory and the requests to restart blocked transactions to the attention of the protocol engine transmitted by the automatic search and restart module, and wherein the automatic search and restart module is implemented in a form of a finite-state machine that includes:
a first idle state in which no transaction is detected as blocked; a second waiting state, when the node is in a deadlock situation, in which the retransmission of transactions stored in the at least one input buffer memory is abandoned, fields for indicating a possible blocking of these transactions are set to a value indicating an actual blocking for the cache lines corresponding to these transactions, and the at least one input buffer memory is cleared of these transactions; a third arbitration state, when the node is in an unblocked situation, in which a request to restart a transaction detected as blocked is waiting to be processed by the protocol engine; and a fourth restarting state, when the node is in an unblocked situation, in which a request to restart a transaction detected as blocked is being processed by the protocol engine. 15. The system for managing cache coherence according to claim 11, wherein lists of cache memories sharing cache lines are represented in the network of processors for implementing a cache coherence management protocol, representation of each list of cache memories sharing a same cache line being distributed between a plurality of directories of nodes of the processor network, including at least the directories of the nodes, as cache nodes, connected to processors, the cache memories of which temporarily store the cache line. 16. The system for managing cache coherence according to claim 15, wherein the directories between which the representation of a list of cache memories sharing the same cache line is distributed further comprises the directories of nodes for interconnection of the cache nodes to form a tree, distributed in the directories of the nodes of the network, for representation of the cache line, the correspondence table of each directory of a node of the tree comprising, for the cache line, status fields to indicate whether the node actually has a copy of the cache line, which directions among a set of predetermined directions lead to another node of the tree in the network, which direction leads to the node of the tree, as a root, historically having first stored the cache line, and whether the node is itself the root node of the tree. 17. An electronic chip comprising:
a network of processors including cache memories, the network including a main memory shared between the processors and a plurality of nodes for access to the main memory interconnected with one another and the processors; and a system for managing cache coherence according to claim 11. 18. A method for managing cache coherence in a network of processors including cache memories, the network including a main memory shared between the processors and a plurality of nodes for access to the main memory interconnected with one another and the processors, the method comprising:
generating directories distributed between the nodes of the network, each directory including a correspondence table between cache lines and information fields on these cache lines; updating the directories by adding cache lines, modifying information fields of cache lines or deleting cache lines, in the correspondence tables; when a blocking of a transaction relative to a cache line is detected in a node of the network, updating at least one field for indicating the blocking in the corresponding cache line of the correspondence table of the directory of the node, detecting fields indicating the blocking of a transaction in at least one directory of at least one node of the network; and restarting each transaction detected as being blocked from the node in which it is indicated as being blocked. 19. The method for managing cache coherence according to claim 18, wherein the detection comprises an automatic search of the fields indicating a transaction blocking in each directory of each node of the network, the automatic search for and restarting of transactions detected as being blocked in a node of the network being performed in a circular manner in the correspondence table of the directory of the node, by:
a first pointer, as the work pointer, scanning the lines of the correspondence table to cause a transaction to be restarted each time the field for indicating a blocking relative to a cache line indicates a transaction blocking, and a second pointer, as a read pointer, performing a control function by being positioned on the line preceding that indicated by the current value of the work pointer each time a blocking of the node is detected. 20. A non-transitory computer readable program executable by a processor, comprising instructions for executing the cache coherence management method according to claim 18, when the program is executed on a computer. | 2,100 |
5,356 | 5,356 | 14,691,598 | 2,175 | Disclosed are various embodiments relating to a floating media player. A playback of a media item is performed using an output device of a client device. A first user interface corresponding to the playback of the media item is rendered upon a display of the client device. The first user interface is rendered in a first region of the display such that a second user interface is visible in a second region of the display. A movement of the first user interface is facilitated in response to a first user gesture. A resizing of the first user interface is facilitated in response to a second user gesture. | 1. A non-transitory computer-readable medium embodying a service executable in a mobile device, comprising:
code that identifies a media item; code that obtains data corresponding to the media item; code that performs a playback of the media item using at least one output device of the mobile device; code that renders a first user interface corresponding to the playback of the media item upon a display of the mobile device, the first user interface being rendered in a first region of the display such that a second user interface corresponding to another application is visible in a second region of the display, the first user interface being of a system alert type; code that facilitates a movement of the first user interface on the display in response to a first user gesture; and code that facilitates a resizing of the first user interface on the display in response to a second user gesture. 2. The non-transitory computer-readable medium of claim 1, wherein the first user interface is on top of the second user interface such that the first user interface obscures a portion of the second user interface. 3. The non-transitory computer-readable medium of claim 2, wherein the first user interface is configured to remain on top of the second user interface during a user interaction involving the second user interface. 4. The non-transitory computer-readable medium of claim 1, wherein the mobile device executes a non-windowed operating system. 5. The non-transitory computer-readable medium of claim 1, wherein the playback of the media item is not stopped by the movement or the resizing. 6. The non-transitory computer-readable medium of claim 1, wherein the media item comprises a video. 7. A client device configured to at least:
render a first user interface of a media player in a first region upon a display of the client device, the client device having a non-windowed operating system, the first user interface being of a system alert type; render a second user interface of another application in a second region upon the display, the first user interface partially overlapping the second user interface such that a first portion of the second user interface is obscured by the first user interface and a second portion of the second user interface is visible; receive a user gesture; and apply a transformation to the first user interface in response to the user gesture. 8. The client device of claim 7, wherein the first user interface is rendered by a service executed in the client device. 9. The client device of claim 8, wherein the non-windowed operating system is an Android operating system, and the service implements a Frame Layout class. 10. The client device of claim 7, wherein the transformation comprises at least one of: a movement of the first user interface or a resizing of the first user interface. 11. The client device of claim 7, wherein the user gesture is a drag gesture, and the client device is configured to at least move the first user interface in response to the drag gesture. 12. The client device of claim 7, wherein the user gesture is a pinch or zoom gesture, and the client device is configured to at least resize the first user interface in response to the pinch or zoom gesture. 13. The client device of claim 7, wherein the client device is configured to at least render a video playback of a media item in the first user interface. 14. The client device of claim 7, wherein the client device is configured to at least render the first user interface on top of the second user interface upon the display during a user interaction involving the second user interface. 15. The client device of claim 7, wherein the client device is configured to at least render a seek control for a media item in the first user interface. 16. The client device of claim 7, wherein the client device is configured to at least pause a playback of a media item by the media player in response to receiving a single tap gesture above the first user interface. 17. A method, comprising:
rendering, by a client device having a non-windowed operating system, a first user interface upon a display, the first user interface corresponding to a media player; commencing, by the client device, a playback of a media item in the first user interface; receiving, by the client device, a first user gesture; resizing, by the client device, the first user interface to expose a portion of a second user interface upon the display below the first user interface in response to the first user gesture, the second user interface corresponding to another application; receiving, by the client device, a second user gesture; and moving, by the client device, the first user interface so that a different portion of the second user interface is rendered upon the display in response to the second user gesture. 18. The method of claim 17, wherein the first user interface is rendered in a full-screen mode before the first user gesture is received, and the second user interface is rendered in the full-screen mode under the first user interface. 19. The method of claim 17, further comprising continuing, by the client device, the playback of the media item while the portion or the different portion of the second user interface is rendered upon the display. 20. The method of claim 17, further comprising:
receiving, by the client device, a third user gesture over the second user interface during the playback of the media item; and providing, by the client device, user input corresponding to the third user gesture to the other application. | Disclosed are various embodiments relating to a floating media player. A playback of a media item is performed using an output device of a client device. A first user interface corresponding to the playback of the media item is rendered upon a display of the client device. The first user interface is rendered in a first region of the display such that a second user interface is visible in a second region of the display. A movement of the first user interface is facilitated in response to a first user gesture. A resizing of the first user interface is facilitated in response to a second user gesture.1. A non-transitory computer-readable medium embodying a service executable in a mobile device, comprising:
code that identifies a media item; code that obtains data corresponding to the media item; code that performs a playback of the media item using at least one output device of the mobile device; code that renders a first user interface corresponding to the playback of the media item upon a display of the mobile device, the first user interface being rendered in a first region of the display such that a second user interface corresponding to another application is visible in a second region of the display, the first user interface being of a system alert type; code that facilitates a movement of the first user interface on the display in response to a first user gesture; and code that facilitates a resizing of the first user interface on the display in response to a second user gesture. 2. The non-transitory computer-readable medium of claim 1, wherein the first user interface is on top of the second user interface such that the first user interface obscures a portion of the second user interface. 3. The non-transitory computer-readable medium of claim 2, wherein the first user interface is configured to remain on top of the second user interface during a user interaction involving the second user interface. 4. The non-transitory computer-readable medium of claim 1, wherein the mobile device executes a non-windowed operating system. 5. The non-transitory computer-readable medium of claim 1, wherein the playback of the media item is not stopped by the movement or the resizing. 6. The non-transitory computer-readable medium of claim 1, wherein the media item comprises a video. 7. A client device configured to at least:
render a first user interface of a media player in a first region upon a display of the client device, the client device having a non-windowed operating system, the first user interface being of a system alert type; render a second user interface of another application in a second region upon the display, the first user interface partially overlapping the second user interface such that a first portion of the second user interface is obscured by the first user interface and a second portion of the second user interface is visible; receive a user gesture; and apply a transformation to the first user interface in response to the user gesture. 8. The client device of claim 7, wherein the first user interface is rendered by a service executed in the client device. 9. The client device of claim 8, wherein the non-windowed operating system is an Android operating system, and the service implements a Frame Layout class. 10. The client device of claim 7, wherein the transformation comprises at least one of: a movement of the first user interface or a resizing of the first user interface. 11. The client device of claim 7, wherein the user gesture is a drag gesture, and the client device is configured to at least move the first user interface in response to the drag gesture. 12. The client device of claim 7, wherein the user gesture is a pinch or zoom gesture, and the client device is configured to at least resize the first user interface in response to the pinch or zoom gesture. 13. The client device of claim 7, wherein the client device is configured to at least render a video playback of a media item in the first user interface. 14. The client device of claim 7, wherein the client device is configured to at least render the first user interface on top of the second user interface upon the display during a user interaction involving the second user interface. 15. The client device of claim 7, wherein the client device is configured to at least render a seek control for a media item in the first user interface. 16. The client device of claim 7, wherein the client device is configured to at least pause a playback of a media item by the media player in response to receiving a single tap gesture above the first user interface. 17. A method, comprising:
rendering, by a client device having a non-windowed operating system, a first user interface upon a display, the first user interface corresponding to a media player; commencing, by the client device, a playback of a media item in the first user interface; receiving, by the client device, a first user gesture; resizing, by the client device, the first user interface to expose a portion of a second user interface upon the display below the first user interface in response to the first user gesture, the second user interface corresponding to another application; receiving, by the client device, a second user gesture; and moving, by the client device, the first user interface so that a different portion of the second user interface is rendered upon the display in response to the second user gesture. 18. The method of claim 17, wherein the first user interface is rendered in a full-screen mode before the first user gesture is received, and the second user interface is rendered in the full-screen mode under the first user interface. 19. The method of claim 17, further comprising continuing, by the client device, the playback of the media item while the portion or the different portion of the second user interface is rendered upon the display. 20. The method of claim 17, further comprising:
receiving, by the client device, a third user gesture over the second user interface during the playback of the media item; and providing, by the client device, user input corresponding to the third user gesture to the other application. | 2,100 |
5,357 | 5,357 | 11,850,020 | 2,175 | Methods, systems, and apparatus, including computer program products, for configuring a device. A device is coupled to a data source. One or more parameters associated with the data source are determined. The one or more parameters are applied to the device. Properties of the data source are inherited by the device without requiring a user to specifically input or identify the parameters for the device. | 1. A method comprising:
coupling a device to an agent; receiving at the device one or more parameters, wherein the one or more parameters are determined by the agent from one or more signals; and configuring a user interface of the device based on the received parameters. 2. The method of claim 1, wherein configuring a user interface of the device comprises setting a user interface language of the device. 3. The method of claim 1, wherein configuring a user interface of the device comprises setting a country of the device. 4. The method of claim 1, wherein configuring a user interface of the device comprises setting a respective display format for one or more of time, date, numbers, and currency. 5. The method of claim 1, wherein the one or more parameters comprise a set of one or more parameters associated with a locale. 6. The method of claim 1, wherein:
the agent is running on a computer; and the signals comprise one or more settings on the computer. 7. The method of claim 1, wherein:
the agent is associated with a service accessible through a network; and the signals comprise one or more settings related to the service. 8. The method of claim 1, wherein the one or more parameters comprise a set of parameters associated with a locale. 9. The method of claim 1, wherein the locale is determined by the agent based on the signals. 10. A method, comprising:
coupling an agent to a device; determining at the agent one or more device parameters from one or more signals; and transmitting the device parameters to the device. 11. The method of claim 10, wherein determining one or more device parameters from one or more agent system settings comprises:
determining a locale based on the signals; and selecting one of a plurality of sets of device parameters, each of the plurality of sets of device parameters corresponding to a respective locale, the selected set of device parameters corresponding to the determined locale. 12. The method of claim 10, wherein:
the agent is running on a computer; and the signals comprise one or more settings on the computer. 13. The method of claim 10, wherein:
the agent is associated with a service accessible through a network; and the signals comprise one or more settings related to the service. 14. A device comprising:
a touch-sensitive display; one or more processors; and a computer-readable medium storing instructions for execution by the one or more processors, the instructions comprising instructions to:
couple a device to an agent;
receive at the device one or more parameters, wherein the one or more parameters are determined by the agent from one or more signals; and
configure a user interface of the device based on the received parameters. 15. A system, comprising:
one or more processors; and a computer-readable medium storing instructions for execution by the one or more processors, the instructions comprising instructions to:
couple an agent in the system to a device;
determine at the agent one or more device parameters from one or more signals; and
transmit the device parameters to the device. 16. A method comprising:
coupling a device to a data source; determining one or more parameters associated with the data source; and applying the one or more parameters to the device including inheriting properties of the data source without requiring a user to specifically input or identify the parameters for the device. | Methods, systems, and apparatus, including computer program products, for configuring a device. A device is coupled to a data source. One or more parameters associated with the data source are determined. The one or more parameters are applied to the device. Properties of the data source are inherited by the device without requiring a user to specifically input or identify the parameters for the device.1. A method comprising:
coupling a device to an agent; receiving at the device one or more parameters, wherein the one or more parameters are determined by the agent from one or more signals; and configuring a user interface of the device based on the received parameters. 2. The method of claim 1, wherein configuring a user interface of the device comprises setting a user interface language of the device. 3. The method of claim 1, wherein configuring a user interface of the device comprises setting a country of the device. 4. The method of claim 1, wherein configuring a user interface of the device comprises setting a respective display format for one or more of time, date, numbers, and currency. 5. The method of claim 1, wherein the one or more parameters comprise a set of one or more parameters associated with a locale. 6. The method of claim 1, wherein:
the agent is running on a computer; and the signals comprise one or more settings on the computer. 7. The method of claim 1, wherein:
the agent is associated with a service accessible through a network; and the signals comprise one or more settings related to the service. 8. The method of claim 1, wherein the one or more parameters comprise a set of parameters associated with a locale. 9. The method of claim 1, wherein the locale is determined by the agent based on the signals. 10. A method, comprising:
coupling an agent to a device; determining at the agent one or more device parameters from one or more signals; and transmitting the device parameters to the device. 11. The method of claim 10, wherein determining one or more device parameters from one or more agent system settings comprises:
determining a locale based on the signals; and selecting one of a plurality of sets of device parameters, each of the plurality of sets of device parameters corresponding to a respective locale, the selected set of device parameters corresponding to the determined locale. 12. The method of claim 10, wherein:
the agent is running on a computer; and the signals comprise one or more settings on the computer. 13. The method of claim 10, wherein:
the agent is associated with a service accessible through a network; and the signals comprise one or more settings related to the service. 14. A device comprising:
a touch-sensitive display; one or more processors; and a computer-readable medium storing instructions for execution by the one or more processors, the instructions comprising instructions to:
couple a device to an agent;
receive at the device one or more parameters, wherein the one or more parameters are determined by the agent from one or more signals; and
configure a user interface of the device based on the received parameters. 15. A system, comprising:
one or more processors; and a computer-readable medium storing instructions for execution by the one or more processors, the instructions comprising instructions to:
couple an agent in the system to a device;
determine at the agent one or more device parameters from one or more signals; and
transmit the device parameters to the device. 16. A method comprising:
coupling a device to a data source; determining one or more parameters associated with the data source; and applying the one or more parameters to the device including inheriting properties of the data source without requiring a user to specifically input or identify the parameters for the device. | 2,100 |
5,358 | 5,358 | 11,647,973 | 2,159 | An object-oriented, semantic information model and method are provided. | 1. A method for representing content in a system with a universal item taxonomy, the method comprising:
providing an abstract base type object for each content definition, the abstract base type object having one or more general characteristic elements of an object and one or more semantic property elements; and providing a plurality of base components, each base component being a child of the abstract base type object and inheriting the one or more general characteristics, each base component being a container item kind that describes a type of object and encapsulates the particular type of object wherein each type of object associated with a system is represented by the abstract base type object and one of the base components. 2. The method of claim 1, wherein each base component has one or more semantic properties that are defined in the one or more semantic property elements. 3. The method of claim 2, wherein the one or more semantic property elements further comprise a tag associated with an object. 4. The method of claim 3, wherein a tag further comprises a tag generated by a user or an automatically generated tag. 5. The method of claim 4, wherein each automatically generated tag further comprises a tag type name, a role and a value of the role wherein the role is an element within the base component to which the tag is associated. 6. The method of claim 5, wherein the tag type name further comprises a time tag type, a person tag type, a location tag type, a category tag type or a rating tag type. 7. The method of claim 2, wherein the one or more semantic property elements further comprise a note associated with an object. 8. The method of claim 2, wherein the one or more semantic property elements further comprise a connection that connects a particular object with another object. 9. The method of claim 8, wherein the connection further comprises a connection generated by a user or an automatically generated connection. 10. The method of claim 9, wherein each automatically generated connection further comprises a unique connection identifier and an identifier of a source of the automatically generated connection. 11. The method of claim 1, wherein the one or more general characteristic elements of an object further comprises a LogicalServerID element, a ContentSize element, a CreatedBy element, a CreationTime element, an ItemID element, a KindID element, a LastModified element, a Title element, or an UpdatedBy element. 12. The method of claim 1 further comprising providing a plurality of aggregated components wherein each aggregated component further comprises one or more base components so that the aggregated component stores information about a content having one or more types of objects. 13. The method of claim 1, wherein the providing the abstract base type object further comprises providing an ItemKind data structure. 14. The method of claim 3, wherein providing the plurality of base components further comprises providing one or more of a BlogKind, a ContactKind, a LinkKind, a MediaKind, a DocumentKind, a MessageKind, a CalendarKind, an EventKind, a To-DoKind, a TaskKind, and a PhotoKind. 15. The method of claim 2, wherein the abstract base type object, the plurality of base components and the plurality of aggregated components each further comprise XML data. 16. The method of claim 5, wherein providing the MediaKind further comprises providing an AudioKind, a VideoKind and a PhotoKind, providing the MessageKind further comprises providing an Email-MessageKind and a Text-MessageKind and wherein providing the Text-MessageKind further comprises providing an IM MessageKind. 17. The method of claim 2, wherein providing the plurality of aggregated components further comprises providing one or more of an ApparelKind, an AutoKind, a BookKind, a MovieKind, a MusicKind, a Real EstateKind, a VideoGameKind and a WineKind. 18. The method of claim 1 further comprising creating a new base component for a new type of object, the new base component describing the new type of object and encapsulating the underlying content of the new type of object within a generic content element wherein the new type of object is represented by the new base component. 19. The method of claim 1, wherein the plurality of base components further comprises a vertical application domain item based on a base component that has a vertical application domain semantic property element. 20. The method of claim 1, wherein the abstract base type object further comprises a views element, an actions element and a constraints element wherein the views element describes zero or more display types associated with the abstract base type object, the actions element describes zero or more actions associated with the abstract base type object and the constraints element describes zero or more constraints associated with the abstract base type object. 21. The method of claim 20, wherein the views element, actions element and constraints element associated with the abstract base type object are inherited by the base component types that extend the abstract base type object. 22. The method of claim 1, wherein each base component further comprises a views element, an actions element and a constraints element wherein the views element describes zero or more display types associated with the base component, the actions element describes zero or more actions associated with the base component and the constraints element describes zero or more constraints associated with the base component. 23. The method of claim 22, wherein the views element, actions element and constraints element associated with a particular base component type are inherited by the objects that are derived from that particular base component type. 24. A computer-implemented universal item taxonomy, comprising:
an abstract base type object for each object definition, the abstract base type object having one or more general characteristics containers of an object and one or more semantic property containers; and a plurality of base components, each base component being a child of the abstract base type object and inheriting the general characteristics, each base component describes a type of object and encapsulates the particular type of object wherein each type of object associated with the system is represented by the abstract base type object and one of the base components. 25. The taxonomy of claim 24, wherein each base component has one or more semantic properties that are defined in the one or more semantic property elements. 26. The taxonomy of claim 2, wherein the one or more semantic property elements further comprise tags associated with an object. 27. The taxonomy of claim 3, wherein the tag further comprises a tag generated by a user or an automatically generated tag. 28. The taxonomy of claim 27, wherein each automatically generated tag further comprises a tag name, a role and a value of the role wherein the role is an element within the base component to which the tag is associated. 29. The taxonomy of claim 28, wherein the tag type name further comprises a time tag type, a person tag type, a location tag type, a category tag type or a rating tag type. 30. The taxonomy of claim 2, wherein the one or more semantic property elements further comprise a note associated with an object. 31. The taxonomy of claim 2, wherein the one or more semantic property elements further comprise a connection that connects a particular object with another object. 32. The taxonomy of claim 8, wherein the connection further comprises a connection generated by a user or an automatically generated connection. 33. The taxonomy of claim 32, wherein each automatically generated connection further comprises a unique connection identifier and an identifier of a source of the automatically generated connection. 34. The taxonomy of claim 24, wherein the one or more general characteristic elements of an object further comprises a LogicalServerID element, a ContentSize element, a CreatedBy element, a CreationTime element, an ItemID element, a KindID element, a LastModified element, a Title element, or an UpdatedBy element. 35. The taxonomy of claim 24 further comprising a plurality of aggregated components wherein each aggregated component further comprises one or more base components so that the aggregated component stores information about a topic having one or more types of objects. 36. The taxonomy of claim 24, wherein the abstract base type object further comprises an ItemKind data structure. 37. The taxonomy of claim 26, wherein the plurality of base components further comprises one or more of a BlogKind, a ContactKind, a LinkKind, a MediaKind, a DocumentKind, a MessageKind, a CalendarKind, an EventKind, a To-DoKind, a TaskKind, and a PhotoKind. 38. The taxonomy of claim 25, wherein the abstract base type object, the plurality of base components and the plurality of aggregated components each further comprise XML data. 39. The taxonomy of claim 27, wherein the MediaKind further comprises an AudioKind, a VideoKind and a PhotoKind, the MessageKind further comprises an Email-MessageKind and a Text-MessageKind and wherein the Text-MessageKind further comprises an IM MessageKind. 40. The taxonomy of claim 25, wherein the plurality of aggregated components further comprises one or more of an ApparelKind, an AutoKind, a BookKind, a MovieKind, a MusicKind, a Real EstateKind, a VideoGameKind and a WineKind. 41. The taxonomy of claim 24 further comprising creating a new base component for a new type of object, the new base component describing the new type of object and encapsulating the underlying content of the new type of object within a generic content element wherein the new type of object is represented by the new base component. 42. The taxonomy of claim 24, wherein the plurality of base components further comprises a vertical application domain item based on a base component that has a vertical application domain semantic property element. 43. The taxonomy of claim 24, wherein the abstract base type object further comprises a views element, an actions element and a constraints element wherein the views element describes zero or more display types associated with the abstract base type object, the actions element describes zero or more actions associated with the abstract base type object and the constraints element describes zero or more constraints associated with the abstract base type object. 44. The taxonomy of claim 43, wherein the views element, actions element and constraints element associated with the abstract base type object are inherited by the base component types that extend the abstract base type object. 45. The taxonomy of claim 24, wherein each base component further comprises a views element, an actions element and a constraints element wherein the views element describes zero or more display types associated with the base component, the actions element describes zero or more actions associated with the base component and the constraints element describes zero or more constraints associated with the base component. 46. The taxonomy of claim 45, wherein the views element, actions element and constraints element associated with a particular base component type are inherited by the objects that are derived from that particular base component type. | An object-oriented, semantic information model and method are provided.1. A method for representing content in a system with a universal item taxonomy, the method comprising:
providing an abstract base type object for each content definition, the abstract base type object having one or more general characteristic elements of an object and one or more semantic property elements; and providing a plurality of base components, each base component being a child of the abstract base type object and inheriting the one or more general characteristics, each base component being a container item kind that describes a type of object and encapsulates the particular type of object wherein each type of object associated with a system is represented by the abstract base type object and one of the base components. 2. The method of claim 1, wherein each base component has one or more semantic properties that are defined in the one or more semantic property elements. 3. The method of claim 2, wherein the one or more semantic property elements further comprise a tag associated with an object. 4. The method of claim 3, wherein a tag further comprises a tag generated by a user or an automatically generated tag. 5. The method of claim 4, wherein each automatically generated tag further comprises a tag type name, a role and a value of the role wherein the role is an element within the base component to which the tag is associated. 6. The method of claim 5, wherein the tag type name further comprises a time tag type, a person tag type, a location tag type, a category tag type or a rating tag type. 7. The method of claim 2, wherein the one or more semantic property elements further comprise a note associated with an object. 8. The method of claim 2, wherein the one or more semantic property elements further comprise a connection that connects a particular object with another object. 9. The method of claim 8, wherein the connection further comprises a connection generated by a user or an automatically generated connection. 10. The method of claim 9, wherein each automatically generated connection further comprises a unique connection identifier and an identifier of a source of the automatically generated connection. 11. The method of claim 1, wherein the one or more general characteristic elements of an object further comprises a LogicalServerID element, a ContentSize element, a CreatedBy element, a CreationTime element, an ItemID element, a KindID element, a LastModified element, a Title element, or an UpdatedBy element. 12. The method of claim 1 further comprising providing a plurality of aggregated components wherein each aggregated component further comprises one or more base components so that the aggregated component stores information about a content having one or more types of objects. 13. The method of claim 1, wherein the providing the abstract base type object further comprises providing an ItemKind data structure. 14. The method of claim 3, wherein providing the plurality of base components further comprises providing one or more of a BlogKind, a ContactKind, a LinkKind, a MediaKind, a DocumentKind, a MessageKind, a CalendarKind, an EventKind, a To-DoKind, a TaskKind, and a PhotoKind. 15. The method of claim 2, wherein the abstract base type object, the plurality of base components and the plurality of aggregated components each further comprise XML data. 16. The method of claim 5, wherein providing the MediaKind further comprises providing an AudioKind, a VideoKind and a PhotoKind, providing the MessageKind further comprises providing an Email-MessageKind and a Text-MessageKind and wherein providing the Text-MessageKind further comprises providing an IM MessageKind. 17. The method of claim 2, wherein providing the plurality of aggregated components further comprises providing one or more of an ApparelKind, an AutoKind, a BookKind, a MovieKind, a MusicKind, a Real EstateKind, a VideoGameKind and a WineKind. 18. The method of claim 1 further comprising creating a new base component for a new type of object, the new base component describing the new type of object and encapsulating the underlying content of the new type of object within a generic content element wherein the new type of object is represented by the new base component. 19. The method of claim 1, wherein the plurality of base components further comprises a vertical application domain item based on a base component that has a vertical application domain semantic property element. 20. The method of claim 1, wherein the abstract base type object further comprises a views element, an actions element and a constraints element wherein the views element describes zero or more display types associated with the abstract base type object, the actions element describes zero or more actions associated with the abstract base type object and the constraints element describes zero or more constraints associated with the abstract base type object. 21. The method of claim 20, wherein the views element, actions element and constraints element associated with the abstract base type object are inherited by the base component types that extend the abstract base type object. 22. The method of claim 1, wherein each base component further comprises a views element, an actions element and a constraints element wherein the views element describes zero or more display types associated with the base component, the actions element describes zero or more actions associated with the base component and the constraints element describes zero or more constraints associated with the base component. 23. The method of claim 22, wherein the views element, actions element and constraints element associated with a particular base component type are inherited by the objects that are derived from that particular base component type. 24. A computer-implemented universal item taxonomy, comprising:
an abstract base type object for each object definition, the abstract base type object having one or more general characteristics containers of an object and one or more semantic property containers; and a plurality of base components, each base component being a child of the abstract base type object and inheriting the general characteristics, each base component describes a type of object and encapsulates the particular type of object wherein each type of object associated with the system is represented by the abstract base type object and one of the base components. 25. The taxonomy of claim 24, wherein each base component has one or more semantic properties that are defined in the one or more semantic property elements. 26. The taxonomy of claim 2, wherein the one or more semantic property elements further comprise tags associated with an object. 27. The taxonomy of claim 3, wherein the tag further comprises a tag generated by a user or an automatically generated tag. 28. The taxonomy of claim 27, wherein each automatically generated tag further comprises a tag name, a role and a value of the role wherein the role is an element within the base component to which the tag is associated. 29. The taxonomy of claim 28, wherein the tag type name further comprises a time tag type, a person tag type, a location tag type, a category tag type or a rating tag type. 30. The taxonomy of claim 2, wherein the one or more semantic property elements further comprise a note associated with an object. 31. The taxonomy of claim 2, wherein the one or more semantic property elements further comprise a connection that connects a particular object with another object. 32. The taxonomy of claim 8, wherein the connection further comprises a connection generated by a user or an automatically generated connection. 33. The taxonomy of claim 32, wherein each automatically generated connection further comprises a unique connection identifier and an identifier of a source of the automatically generated connection. 34. The taxonomy of claim 24, wherein the one or more general characteristic elements of an object further comprises a LogicalServerID element, a ContentSize element, a CreatedBy element, a CreationTime element, an ItemID element, a KindID element, a LastModified element, a Title element, or an UpdatedBy element. 35. The taxonomy of claim 24 further comprising a plurality of aggregated components wherein each aggregated component further comprises one or more base components so that the aggregated component stores information about a topic having one or more types of objects. 36. The taxonomy of claim 24, wherein the abstract base type object further comprises an ItemKind data structure. 37. The taxonomy of claim 26, wherein the plurality of base components further comprises one or more of a BlogKind, a ContactKind, a LinkKind, a MediaKind, a DocumentKind, a MessageKind, a CalendarKind, an EventKind, a To-DoKind, a TaskKind, and a PhotoKind. 38. The taxonomy of claim 25, wherein the abstract base type object, the plurality of base components and the plurality of aggregated components each further comprise XML data. 39. The taxonomy of claim 27, wherein the MediaKind further comprises an AudioKind, a VideoKind and a PhotoKind, the MessageKind further comprises an Email-MessageKind and a Text-MessageKind and wherein the Text-MessageKind further comprises an IM MessageKind. 40. The taxonomy of claim 25, wherein the plurality of aggregated components further comprises one or more of an ApparelKind, an AutoKind, a BookKind, a MovieKind, a MusicKind, a Real EstateKind, a VideoGameKind and a WineKind. 41. The taxonomy of claim 24 further comprising creating a new base component for a new type of object, the new base component describing the new type of object and encapsulating the underlying content of the new type of object within a generic content element wherein the new type of object is represented by the new base component. 42. The taxonomy of claim 24, wherein the plurality of base components further comprises a vertical application domain item based on a base component that has a vertical application domain semantic property element. 43. The taxonomy of claim 24, wherein the abstract base type object further comprises a views element, an actions element and a constraints element wherein the views element describes zero or more display types associated with the abstract base type object, the actions element describes zero or more actions associated with the abstract base type object and the constraints element describes zero or more constraints associated with the abstract base type object. 44. The taxonomy of claim 43, wherein the views element, actions element and constraints element associated with the abstract base type object are inherited by the base component types that extend the abstract base type object. 45. The taxonomy of claim 24, wherein each base component further comprises a views element, an actions element and a constraints element wherein the views element describes zero or more display types associated with the base component, the actions element describes zero or more actions associated with the base component and the constraints element describes zero or more constraints associated with the base component. 46. The taxonomy of claim 45, wherein the views element, actions element and constraints element associated with a particular base component type are inherited by the objects that are derived from that particular base component type. | 2,100 |
5,359 | 5,359 | 13,608,543 | 2,125 | A computer-implemented method using a computer-based FSTP expert system. The method manages an analysis of a claim in an endeavor p and a technical teaching TT.p underlying the endeavor over at least one document i in a reference set (RS) of documents and the technical teaching TT.i underlying the at least one document. The method comprises receiving at least one Pair of TT.p and the Reference Set (PTR). The user generates at least one anticipation combination (AC) based on the PTR An anticipation deficiency is evaluated for the at least one AC. At least one AC is identified wherein after a minimal number of conceptual modifications the TT.p is anticipated. A numerical semantic height of the TT.p over the RS of documents i is computed based on the number of conceptual modifications identified. A numerical pragmatic height of the TT.p over the RS is computed. | 1. A computer-implemented method using a computer-based FSTP expert system, the method managing an analysis of a claim in an endeavor p and a technical teaching TT.p underlying the endeavor, the technical teaching TT.p being related to the claim, over at least one document i in a reference set (RS) of documents and the technical teaching TT.i underlying the at least one document, TT.i being related to the claim, a user interacting with the computer and a processor in the computer reading and writing to a database or a memory within the computer, the method comprising:
a) receiving at least one Pair of TT.p and the Reference Set (PTR) and entering the PTR to the database; b) the user generating at least one anticipation combination (AC) based on the PTR and entering the AC to the database; c) generating an Anticipates-Notanticaptes-Contradicts (ANC) matrix; d) evaluating the at least one AC for anticipation deficiency; e) generating explanation for the anticipation deficiency and entering the explanation into the database; f) identifying at least one AC wherein after a minimal number of conceptual modifications over all ACs anticipates TT.p; g) computing a numerical semantic height of the TT.p over the RS of documents i based on the number of conceptual modifications identified in step f; h) computing a numerical pragmatic height of the TT.p over the RS; and i) displaying the semantic height and the pragmatic height to assist in a decision about non-obviousness. 2. The method of claim 1, wherein generating of the at least one AC comprises creating combination of at least one peer fundamental fact of the TT.i potentially anticipating a fundamental fact of the TT.p. 3. The method of claim 1, wherein at least one AC is contradiction-free, element integrity preserving or as given by a national law system (NLS). 4. The method of claim 1, wherein at least one of the steps in the method is executed interactively by the user of the expert system or automatically by the expert system. 5. The method of claim 2, wherein the fundamental fact has a disclosure level (D-level) presentation. 6. The method of claim 5, wherein the fundamental fact is converted from the D-level to a binary-presentation level (B-level). 7. The method of claim 6, wherein the B-level presentation of at least one fundamental fact is based on an independent binary concept. 8. The method of claim 1, wherein the endeavor is a patent or a patent application. 9. The method of claim 1 wherein all possible ACs are maintained in the database for enabling an exhaustive search of the database to respond to a query. 10. A expert system for analyzing a claim in an endeavor p and a technical teaching TT.p underlying the endeavor, the technical teaching TT.p being related to the claim, over at least one document i in a reference set (RS) of documents and the technical teaching TT.i underlying the at least one document, the technical teaching TT.i being related to the claim, tests system being implemented on a computer with at least a processor and memory, the processor reading and writing to a database in the memory, the expert system being connected to one or more external databases, the expert system comprising:
a presentations system,
the memory,
an IO and
a display
the expert system being operable to interact with the user to generate at least one anticipation combination (AC) and further operable to enter the AC into the database;
the expert system being further operable to interact with the user to evaluate the at least one AC for anticipation deficiency, and generate explanation for the anticipation deficiency,
the expert system being further operable to identify at least one AC wherein after a minimal number of conceptual modifications over all the ACs, anticipates the TT.p;
the expert system being further operable to compute a numerical semantic height of the TT.p over the RS based on the number of conceptual modifications identified by the expert system;
the expert system being further operable to compute a numerical pragmatic height of the TT.p over the RS and display the semantic height and the pragmatic height to assist in a decision about non-obviousness. 11. The expert system of claim 10 wherein the external databases include databases related to various patent jurisdictions in the world. 12. The system of claim 10, wherein the system generates AC by creating a combination of at least one peer fundamental fact of the TT.i potentially anticipating a fundamental fact of TT.p. 13. The system of claim 10, wherein at least one AC is contradiction-free, element integrity preserving or as given by a national law system (NLS). 14. The system of claim 10, wherein the fundamental facts has a disclosure level (D-level) presentation. 15. The system of claim 14, wherein the fundamental fact is converted from the D-level to a binary presentation-level (B-level). 16. The system of claim 15, wherein the B-level presentation of at least one fundamental fact is based on an independent binary concept. 17. The system of claim 10, wherein the endeavor is a patent or a patent application. 18. The system of claim 10 wherein all possible ACs are maintained in the database for enabling an exhaustive search of the database to respond to a query. 19. A computer program product including a tangible computer readable medium, the computer-readable medium comprising instructions that enable a computer to implement a method using a computer-based FSTP expert system, the method managing an analysis of a claim in an endeavor p and a technical teaching TT.p underlying the endeavor, the technical teaching TT.p being related to the claim, over at least one document i in a reference set (RS) of documents and the technical teaching TT.i underlying the document, TT.i being related to the claim, a user interacting with the computer and a processor in the computer reading and writing to a database or a memory within the computer, the method comprising:
a) receiving at least one Pair of TT.p and the Reference Set (PTR) and entering the PTR to the database; b) the user generating at least one anticipation combination (AC) based on the PTR and entering the AC to the database; c) generating an ANC matrix; d) evaluating the at least one AC for anticipation deficiency; e) generating explanation for the anticipation deficiency and entering the explanation into the database; f) identifying at least one AC wherein after a minimal number of conceptual modifications over all ACs anticipates TT.p; g) computing a numerical semantic height of the TT.p over the RS of documents i based on the number of conceptual modifications identified in step f; h) computing a numerical pragmatic height of the TT.p over the RS; and i) displaying the semantic height and the pragmatic height to assist in a decision about non-obviousness. 20. The computer program product of claim 19, wherein generating of the at least one AC comprises creating combination of at least one peer fundamental fact of the TT.i potentially anticipating a fundamental fact of the TT.p. 21. The computer program product of claim 19, wherein at least one AC is contradiction-free, element integrity preserving or as given by a national law system (NLS). 22. The computer program product of claim 19, wherein at least one of the steps in the method is executed interactively by the user of the expert system or automatically by the expert system. 23. The computer program product of claim 20, wherein the fundamental fact has a disclosure level (D-level) presentation. 24. The computer program product of claim 23, wherein the fundamental fact is converted from the D-level to a binary-presentation level (B-level). 25. The computer program product of claim 24, wherein the B-level presentation of at least one fundamental fact is based on an independent binary concept. 26. The computer program product of claim 19, wherein the endeavor is a patent or a patent application. 27. The computer program product of claim 19 wherein all possible ACs are maintained in the database for enabling an exhaustive search of the database to respond to a query. | A computer-implemented method using a computer-based FSTP expert system. The method manages an analysis of a claim in an endeavor p and a technical teaching TT.p underlying the endeavor over at least one document i in a reference set (RS) of documents and the technical teaching TT.i underlying the at least one document. The method comprises receiving at least one Pair of TT.p and the Reference Set (PTR). The user generates at least one anticipation combination (AC) based on the PTR An anticipation deficiency is evaluated for the at least one AC. At least one AC is identified wherein after a minimal number of conceptual modifications the TT.p is anticipated. A numerical semantic height of the TT.p over the RS of documents i is computed based on the number of conceptual modifications identified. A numerical pragmatic height of the TT.p over the RS is computed.1. A computer-implemented method using a computer-based FSTP expert system, the method managing an analysis of a claim in an endeavor p and a technical teaching TT.p underlying the endeavor, the technical teaching TT.p being related to the claim, over at least one document i in a reference set (RS) of documents and the technical teaching TT.i underlying the at least one document, TT.i being related to the claim, a user interacting with the computer and a processor in the computer reading and writing to a database or a memory within the computer, the method comprising:
a) receiving at least one Pair of TT.p and the Reference Set (PTR) and entering the PTR to the database; b) the user generating at least one anticipation combination (AC) based on the PTR and entering the AC to the database; c) generating an Anticipates-Notanticaptes-Contradicts (ANC) matrix; d) evaluating the at least one AC for anticipation deficiency; e) generating explanation for the anticipation deficiency and entering the explanation into the database; f) identifying at least one AC wherein after a minimal number of conceptual modifications over all ACs anticipates TT.p; g) computing a numerical semantic height of the TT.p over the RS of documents i based on the number of conceptual modifications identified in step f; h) computing a numerical pragmatic height of the TT.p over the RS; and i) displaying the semantic height and the pragmatic height to assist in a decision about non-obviousness. 2. The method of claim 1, wherein generating of the at least one AC comprises creating combination of at least one peer fundamental fact of the TT.i potentially anticipating a fundamental fact of the TT.p. 3. The method of claim 1, wherein at least one AC is contradiction-free, element integrity preserving or as given by a national law system (NLS). 4. The method of claim 1, wherein at least one of the steps in the method is executed interactively by the user of the expert system or automatically by the expert system. 5. The method of claim 2, wherein the fundamental fact has a disclosure level (D-level) presentation. 6. The method of claim 5, wherein the fundamental fact is converted from the D-level to a binary-presentation level (B-level). 7. The method of claim 6, wherein the B-level presentation of at least one fundamental fact is based on an independent binary concept. 8. The method of claim 1, wherein the endeavor is a patent or a patent application. 9. The method of claim 1 wherein all possible ACs are maintained in the database for enabling an exhaustive search of the database to respond to a query. 10. A expert system for analyzing a claim in an endeavor p and a technical teaching TT.p underlying the endeavor, the technical teaching TT.p being related to the claim, over at least one document i in a reference set (RS) of documents and the technical teaching TT.i underlying the at least one document, the technical teaching TT.i being related to the claim, tests system being implemented on a computer with at least a processor and memory, the processor reading and writing to a database in the memory, the expert system being connected to one or more external databases, the expert system comprising:
a presentations system,
the memory,
an IO and
a display
the expert system being operable to interact with the user to generate at least one anticipation combination (AC) and further operable to enter the AC into the database;
the expert system being further operable to interact with the user to evaluate the at least one AC for anticipation deficiency, and generate explanation for the anticipation deficiency,
the expert system being further operable to identify at least one AC wherein after a minimal number of conceptual modifications over all the ACs, anticipates the TT.p;
the expert system being further operable to compute a numerical semantic height of the TT.p over the RS based on the number of conceptual modifications identified by the expert system;
the expert system being further operable to compute a numerical pragmatic height of the TT.p over the RS and display the semantic height and the pragmatic height to assist in a decision about non-obviousness. 11. The expert system of claim 10 wherein the external databases include databases related to various patent jurisdictions in the world. 12. The system of claim 10, wherein the system generates AC by creating a combination of at least one peer fundamental fact of the TT.i potentially anticipating a fundamental fact of TT.p. 13. The system of claim 10, wherein at least one AC is contradiction-free, element integrity preserving or as given by a national law system (NLS). 14. The system of claim 10, wherein the fundamental facts has a disclosure level (D-level) presentation. 15. The system of claim 14, wherein the fundamental fact is converted from the D-level to a binary presentation-level (B-level). 16. The system of claim 15, wherein the B-level presentation of at least one fundamental fact is based on an independent binary concept. 17. The system of claim 10, wherein the endeavor is a patent or a patent application. 18. The system of claim 10 wherein all possible ACs are maintained in the database for enabling an exhaustive search of the database to respond to a query. 19. A computer program product including a tangible computer readable medium, the computer-readable medium comprising instructions that enable a computer to implement a method using a computer-based FSTP expert system, the method managing an analysis of a claim in an endeavor p and a technical teaching TT.p underlying the endeavor, the technical teaching TT.p being related to the claim, over at least one document i in a reference set (RS) of documents and the technical teaching TT.i underlying the document, TT.i being related to the claim, a user interacting with the computer and a processor in the computer reading and writing to a database or a memory within the computer, the method comprising:
a) receiving at least one Pair of TT.p and the Reference Set (PTR) and entering the PTR to the database; b) the user generating at least one anticipation combination (AC) based on the PTR and entering the AC to the database; c) generating an ANC matrix; d) evaluating the at least one AC for anticipation deficiency; e) generating explanation for the anticipation deficiency and entering the explanation into the database; f) identifying at least one AC wherein after a minimal number of conceptual modifications over all ACs anticipates TT.p; g) computing a numerical semantic height of the TT.p over the RS of documents i based on the number of conceptual modifications identified in step f; h) computing a numerical pragmatic height of the TT.p over the RS; and i) displaying the semantic height and the pragmatic height to assist in a decision about non-obviousness. 20. The computer program product of claim 19, wherein generating of the at least one AC comprises creating combination of at least one peer fundamental fact of the TT.i potentially anticipating a fundamental fact of the TT.p. 21. The computer program product of claim 19, wherein at least one AC is contradiction-free, element integrity preserving or as given by a national law system (NLS). 22. The computer program product of claim 19, wherein at least one of the steps in the method is executed interactively by the user of the expert system or automatically by the expert system. 23. The computer program product of claim 20, wherein the fundamental fact has a disclosure level (D-level) presentation. 24. The computer program product of claim 23, wherein the fundamental fact is converted from the D-level to a binary-presentation level (B-level). 25. The computer program product of claim 24, wherein the B-level presentation of at least one fundamental fact is based on an independent binary concept. 26. The computer program product of claim 19, wherein the endeavor is a patent or a patent application. 27. The computer program product of claim 19 wherein all possible ACs are maintained in the database for enabling an exhaustive search of the database to respond to a query. | 2,100 |
5,360 | 5,360 | 14,502,273 | 2,145 | One embodiment provides a method, comprising: associating, using a processor, an information handling device with a participant; identifying, using a processor, a participant as a current presenter, wherein the current presenter's information handling device is used as a presentation device; identifying, using a processor, a second participant as a new presenter; and automatically transferring, using a processor, the presentation device from the current presenter's information handling device to the new presenter's information handling device. Other aspects are described and claimed. | 1. A method, comprising:
associating, using a processor, an information handling device with a participant; identifying, using a processor, a participant as a current presenter, wherein the current presenter's information handling device is used as a presentation device; identifying, using a processor, a second participant as a new presenter; and automatically transferring, using a processor, the presentation device from the current presenter's information handling device to the new presenter's information handling device. 2. The method of claim 1, wherein the associating comprises receiving data from the information handling device, wherein the data designates the information handling device as being associated with a participant. 3. The method of claim 2, wherein the data comprises user credentials received when the participant accesses the information handling device. 4. The method of claim 2, wherein the data comprises user credentials received when the participant accesses conferencing software. 5. The method of claim 1, wherein the identifying comprises using a recognition device to capture an indication by a participant indicating the participant is to be a presenter, wherein the recognition device is selected from the group consisting of: an image capture device, an audio capture device, and a biometric capture device. 6. The method of claim 1, wherein the identifying comprises capturing data from a schedule, wherein the schedule identifies a participant as a presenter. 7. The method of claim 1, wherein the identifying comprises receiving user input, wherein the user input designates a participant as a presenter. 8. The method of claim 1, wherein the automatic transferring comprises disabling the current presenter's information handling device as the presentation device and enabling the new presenter's information handling device as the presentation device. 9. The method of claim 1, wherein the automatic transferring comprises assigning control from the current presenter's information handling device to the new presenter's information handling device. 10. The method of claim 1, further comprising displaying a prompt, wherein the prompt requests the current presenter to release control to the new presenter. 11. An information handling device, comprising:
a processor; a memory device that stores instructions executable by the processor to: associate an information handling device with a participant; identify a participant as a current presenter, wherein the current presenter's information handling device is used as a presentation device; identify a second participant as a new presenter; and automatically transfer the presentation device from the current presenter's information handling device to the new presenter's information handling device. 12. The information handling device of claim 11, wherein to associate comprises receiving data from the information handling device, wherein the data designates the information handling device as being associated with a participant. 13. The information handling device of claim 12, wherein the data comprises user credentials received when the participant accesses the information handling device. 14. The information handling device of claim 11, wherein to identify comprises using a recognition device to capture an indication by a participant indicating the participant is to be a presenter, wherein the recognition device is selected from the group consisting of: an image capture device, an audio capture device, and a biometric capture device. 15. The information handling device of claim 11, wherein to identify comprises capturing data from a schedule, wherein the schedule identifies a participant as a presenter. 16. The information handling device of claim 11, wherein to identify comprises receiving user input, wherein the user input designates a participant as a presenter. 17. The information handling device of claim 11, wherein to automatically transfer comprises disabling the current presenter's information handling device as the presentation device and enabling the new presenter's information handling device as the presentation device. 18. The information handling device of claim 11, wherein to automatically transfer comprises assigning control from the current presenter's information handling device to the new presenter's information handling device. 19. The information handling device of claim 11, wherein the instructions are further executable to display a prompt, wherein the prompt requests the current presenter to release control to the new presenter. 20. A product, comprising:
a storage device having code stored therewith, the code being executable by a processor and comprising: code that associates an information handling device with a participant; code that identifies a participant as a current presenter, wherein the current presenter's information handling device is used as a presentation device; code that identifies a second participant as a new presenter; and code that automatically transfers the presentation device from the current presenter's information handling device to the new presenter's information handling device. | One embodiment provides a method, comprising: associating, using a processor, an information handling device with a participant; identifying, using a processor, a participant as a current presenter, wherein the current presenter's information handling device is used as a presentation device; identifying, using a processor, a second participant as a new presenter; and automatically transferring, using a processor, the presentation device from the current presenter's information handling device to the new presenter's information handling device. Other aspects are described and claimed.1. A method, comprising:
associating, using a processor, an information handling device with a participant; identifying, using a processor, a participant as a current presenter, wherein the current presenter's information handling device is used as a presentation device; identifying, using a processor, a second participant as a new presenter; and automatically transferring, using a processor, the presentation device from the current presenter's information handling device to the new presenter's information handling device. 2. The method of claim 1, wherein the associating comprises receiving data from the information handling device, wherein the data designates the information handling device as being associated with a participant. 3. The method of claim 2, wherein the data comprises user credentials received when the participant accesses the information handling device. 4. The method of claim 2, wherein the data comprises user credentials received when the participant accesses conferencing software. 5. The method of claim 1, wherein the identifying comprises using a recognition device to capture an indication by a participant indicating the participant is to be a presenter, wherein the recognition device is selected from the group consisting of: an image capture device, an audio capture device, and a biometric capture device. 6. The method of claim 1, wherein the identifying comprises capturing data from a schedule, wherein the schedule identifies a participant as a presenter. 7. The method of claim 1, wherein the identifying comprises receiving user input, wherein the user input designates a participant as a presenter. 8. The method of claim 1, wherein the automatic transferring comprises disabling the current presenter's information handling device as the presentation device and enabling the new presenter's information handling device as the presentation device. 9. The method of claim 1, wherein the automatic transferring comprises assigning control from the current presenter's information handling device to the new presenter's information handling device. 10. The method of claim 1, further comprising displaying a prompt, wherein the prompt requests the current presenter to release control to the new presenter. 11. An information handling device, comprising:
a processor; a memory device that stores instructions executable by the processor to: associate an information handling device with a participant; identify a participant as a current presenter, wherein the current presenter's information handling device is used as a presentation device; identify a second participant as a new presenter; and automatically transfer the presentation device from the current presenter's information handling device to the new presenter's information handling device. 12. The information handling device of claim 11, wherein to associate comprises receiving data from the information handling device, wherein the data designates the information handling device as being associated with a participant. 13. The information handling device of claim 12, wherein the data comprises user credentials received when the participant accesses the information handling device. 14. The information handling device of claim 11, wherein to identify comprises using a recognition device to capture an indication by a participant indicating the participant is to be a presenter, wherein the recognition device is selected from the group consisting of: an image capture device, an audio capture device, and a biometric capture device. 15. The information handling device of claim 11, wherein to identify comprises capturing data from a schedule, wherein the schedule identifies a participant as a presenter. 16. The information handling device of claim 11, wherein to identify comprises receiving user input, wherein the user input designates a participant as a presenter. 17. The information handling device of claim 11, wherein to automatically transfer comprises disabling the current presenter's information handling device as the presentation device and enabling the new presenter's information handling device as the presentation device. 18. The information handling device of claim 11, wherein to automatically transfer comprises assigning control from the current presenter's information handling device to the new presenter's information handling device. 19. The information handling device of claim 11, wherein the instructions are further executable to display a prompt, wherein the prompt requests the current presenter to release control to the new presenter. 20. A product, comprising:
a storage device having code stored therewith, the code being executable by a processor and comprising: code that associates an information handling device with a participant; code that identifies a participant as a current presenter, wherein the current presenter's information handling device is used as a presentation device; code that identifies a second participant as a new presenter; and code that automatically transfers the presentation device from the current presenter's information handling device to the new presenter's information handling device. | 2,100 |
5,361 | 5,361 | 14,448,173 | 2,159 | In some implementations, a subscriber to an online content management system can share content items that are external to the subscriber's content library. A computing device can include managed content items associated with the subscriber's content library. The computing device can include unmanaged content items that are stored externally to the subscriber's content library. The subscriber can provide input associated with an unmanaged content item to generate a link (e.g., URL, file path, location reference, etc.) for the unmanaged content item. When generating the link, the unmanaged content item can be uploaded to the online content management system and stored separately from the subscriber's content library. The generated link can be shared with recipient user (e.g., subscriber or non-subscriber). The generated link can be used by the recipient to access the unmanaged content item uploaded to and stored by the online content management system. | 1. A method comprising:
receiving, by a client device of an online content management system, a user input to generate a link for a content item that is not managed by the online content management system; in response to the user input, generating, by the client device, a copy of the unmanaged content item; storing, by the client device, the copy of the unmanaged content item in cache on the client device; transmitting, by the client device, the cached unmanaged content item to the online content management system; and receiving, from the online content management system, a link for accessing the unmanaged content item stored at the online content management system. 2. The method of claim 1, further comprising:
transmitting a description of the unmanaged content item, including a directory path identifying where the unmanaged content item is stored on the client device. 3. The method of claim 1, further comprising:
generating one or more first hash values based on content of the unmanaged content item; transmitting the one or more first hash values to the online content management system; receiving one or more second hash values from the online content management system that correspond to a portion of the one or more first hash values; and transmitting, to the online content management system, content of the unmanaged content item corresponding to the one or more second hash values. 4. The method of claim 1, wherein the link is a URL that references metadata associated with the unmanaged content item stored at the online content management system. 5. The method of claim 1, wherein generating a copy of the unmanaged content item includes determining that there is enough memory available on the client device to store a copy of the unmanaged content item. 6. A method comprising:
receiving, at a server device of a content management system, a description for an unmanaged content item; generating a metadata entry in an external content database of the content management system based on the unmanaged content item description; generating a link for accessing the metadata entry; and transmitting the link to a client device of the content management system. 7. The method of claim 6, further comprising:
receiving one or more first hash values corresponding to content data of the unmanaged content item; comparing the first hash values to hash value indexes of a content data store of the content management system; based on the comparison, determining which of the one or more hash values do not exist in the content data store; and transmitting to the client device one or more second hash values corresponding to the one or more first hash values that do not exist in the content data store. 8. The method of claim 7, further comprising:
receiving content data corresponding to the one or more second hash values; and storing the content data in the content data store. 9. The method of claim 6, where the metadata entry includes a directory path that represents a location of the unmanaged content item on the client device, where the location is external to a content library managed by the content management system. 10. The method of claim 6, where the metadata entry is associated with a hidden namespace. 11. A system comprising:
one or more processors; and a computer-readable medium including one or more sequences of instructions which, when executed by the one or more processors, cause:
receiving, by a client device of an online content management system, a user input to generate a link for a content item that is not managed by the online content management system;
in response to the user input, generating, by the client device, a copy of the unmanaged content item;
storing, by the client device, the copy of the unmanaged content item in cache on the client device;
transmitting, by the client device, the cached unmanaged content item to the online content management system; and
receiving, from the online content management system, a link for accessing the unmanaged content item stored at the online content management system. 12. The system of claim 11, wherein the instructions cause:
transmitting a description of the unmanaged content item, including a directory path identifying where the unmanaged content item is stored on the client device. 13. The system of claim 11, wherein the instructions cause:
generating one or more first hash values based on content of the unmanaged content item; transmitting the one or more first hash values to the online content management system; receiving one or more second hash values from the online content management system that correspond to a portion of the one or more first hash values; and transmitting, to the online content management system, content of the unmanaged content item corresponding to the one or more second hash values. 14. The system of claim 11, wherein the link is a URL that references metadata associated with the unmanaged content item stored at the online content management system. 15. The system of claim 11, wherein the instructions that cause generating a copy of the unmanaged content item include instructions that cause determining that there is enough memory available on the client device to store a copy of the unmanaged content item. 16. A system comprising:
one or more processors; and a computer-readable medium including one or more sequences of instructions which, when executed by the one or more processors, cause:
receiving, at a server device of a content management system, a description for an unmanaged content item;
generating a metadata entry in an external content database of the content management system based on the unmanaged content item description;
generating a link for accessing the metadata entry; and
transmitting the link to a client device of the content management system. 17. The system of claim 16, wherein the instructions cause:
receiving one or more first hash values corresponding to content data of the unmanaged content item; comparing the first hash values to hash value indexes of a content data store of the content management system; based on the comparison, determining which of the one or more hash values do not exist in the content data store; and transmitting to the client device one or more second hash values corresponding to the one or more first hash values that do not exist in the content data store. 18. The system of claim 17, wherein the instructions cause:
receiving content data corresponding to the one or more second hash values; and storing the content data in the content data store. 19. The system of claim 16, where the metadata entry includes a directory path that represents a location of the unmanaged content item on the client device, where the location is external to a content library managed by the content management system. 20. The system of claim 16, where the metadata entry is associated with a hidden namespace. | In some implementations, a subscriber to an online content management system can share content items that are external to the subscriber's content library. A computing device can include managed content items associated with the subscriber's content library. The computing device can include unmanaged content items that are stored externally to the subscriber's content library. The subscriber can provide input associated with an unmanaged content item to generate a link (e.g., URL, file path, location reference, etc.) for the unmanaged content item. When generating the link, the unmanaged content item can be uploaded to the online content management system and stored separately from the subscriber's content library. The generated link can be shared with recipient user (e.g., subscriber or non-subscriber). The generated link can be used by the recipient to access the unmanaged content item uploaded to and stored by the online content management system.1. A method comprising:
receiving, by a client device of an online content management system, a user input to generate a link for a content item that is not managed by the online content management system; in response to the user input, generating, by the client device, a copy of the unmanaged content item; storing, by the client device, the copy of the unmanaged content item in cache on the client device; transmitting, by the client device, the cached unmanaged content item to the online content management system; and receiving, from the online content management system, a link for accessing the unmanaged content item stored at the online content management system. 2. The method of claim 1, further comprising:
transmitting a description of the unmanaged content item, including a directory path identifying where the unmanaged content item is stored on the client device. 3. The method of claim 1, further comprising:
generating one or more first hash values based on content of the unmanaged content item; transmitting the one or more first hash values to the online content management system; receiving one or more second hash values from the online content management system that correspond to a portion of the one or more first hash values; and transmitting, to the online content management system, content of the unmanaged content item corresponding to the one or more second hash values. 4. The method of claim 1, wherein the link is a URL that references metadata associated with the unmanaged content item stored at the online content management system. 5. The method of claim 1, wherein generating a copy of the unmanaged content item includes determining that there is enough memory available on the client device to store a copy of the unmanaged content item. 6. A method comprising:
receiving, at a server device of a content management system, a description for an unmanaged content item; generating a metadata entry in an external content database of the content management system based on the unmanaged content item description; generating a link for accessing the metadata entry; and transmitting the link to a client device of the content management system. 7. The method of claim 6, further comprising:
receiving one or more first hash values corresponding to content data of the unmanaged content item; comparing the first hash values to hash value indexes of a content data store of the content management system; based on the comparison, determining which of the one or more hash values do not exist in the content data store; and transmitting to the client device one or more second hash values corresponding to the one or more first hash values that do not exist in the content data store. 8. The method of claim 7, further comprising:
receiving content data corresponding to the one or more second hash values; and storing the content data in the content data store. 9. The method of claim 6, where the metadata entry includes a directory path that represents a location of the unmanaged content item on the client device, where the location is external to a content library managed by the content management system. 10. The method of claim 6, where the metadata entry is associated with a hidden namespace. 11. A system comprising:
one or more processors; and a computer-readable medium including one or more sequences of instructions which, when executed by the one or more processors, cause:
receiving, by a client device of an online content management system, a user input to generate a link for a content item that is not managed by the online content management system;
in response to the user input, generating, by the client device, a copy of the unmanaged content item;
storing, by the client device, the copy of the unmanaged content item in cache on the client device;
transmitting, by the client device, the cached unmanaged content item to the online content management system; and
receiving, from the online content management system, a link for accessing the unmanaged content item stored at the online content management system. 12. The system of claim 11, wherein the instructions cause:
transmitting a description of the unmanaged content item, including a directory path identifying where the unmanaged content item is stored on the client device. 13. The system of claim 11, wherein the instructions cause:
generating one or more first hash values based on content of the unmanaged content item; transmitting the one or more first hash values to the online content management system; receiving one or more second hash values from the online content management system that correspond to a portion of the one or more first hash values; and transmitting, to the online content management system, content of the unmanaged content item corresponding to the one or more second hash values. 14. The system of claim 11, wherein the link is a URL that references metadata associated with the unmanaged content item stored at the online content management system. 15. The system of claim 11, wherein the instructions that cause generating a copy of the unmanaged content item include instructions that cause determining that there is enough memory available on the client device to store a copy of the unmanaged content item. 16. A system comprising:
one or more processors; and a computer-readable medium including one or more sequences of instructions which, when executed by the one or more processors, cause:
receiving, at a server device of a content management system, a description for an unmanaged content item;
generating a metadata entry in an external content database of the content management system based on the unmanaged content item description;
generating a link for accessing the metadata entry; and
transmitting the link to a client device of the content management system. 17. The system of claim 16, wherein the instructions cause:
receiving one or more first hash values corresponding to content data of the unmanaged content item; comparing the first hash values to hash value indexes of a content data store of the content management system; based on the comparison, determining which of the one or more hash values do not exist in the content data store; and transmitting to the client device one or more second hash values corresponding to the one or more first hash values that do not exist in the content data store. 18. The system of claim 17, wherein the instructions cause:
receiving content data corresponding to the one or more second hash values; and storing the content data in the content data store. 19. The system of claim 16, where the metadata entry includes a directory path that represents a location of the unmanaged content item on the client device, where the location is external to a content library managed by the content management system. 20. The system of claim 16, where the metadata entry is associated with a hidden namespace. | 2,100 |
5,362 | 5,362 | 14,388,546 | 2,128 | The present invention relates to simulating modifications to the mineralogical compositions of soil. This simulation includes: simulating a stochastic movement of a particle in a geological model and modifying the mineralogical composition attached to the model. This modification is based on at least the coordinates for the particle in the model, the aggressiveness of the particle, and the local mineralogical composition. As a result, the aggressiveness of the particle is also modified. | 1-12. (canceled) 13. A method, realized by computer, for simulating modifications to mineralogical compositions of soil, comprising:
/a/ receiving a geological model for said soil, wherein the model comprises at least one local mineralogical composition parameter based on local coordinates in this model; /b/ simulating a stochastic movement of a particle in the geological model, said particle having coordinates in said model and having an aggressiveness parameter; /c/ modifying the local mineralogical composition parameter while taking into account at least:
the coordinates of the particle in said model,
the aggressiveness of the particle, and
the local mineralogical composition parameter;
/d/ modifying the aggressiveness of the particle while taking into account at least the modification of the local mineralogical composition of step /c/; and /e/ when an end condition is satisfied, supplying the local mineralogical composition parameter, otherwise repeating steps /b/, /c, /d/ and /e/. 14. The method according to claim 13, wherein the local mineralogical composition parameter comprises a plurality of components, each component being associated with a ratio for a type of mineral in a mineralogical composition,
and wherein the modification of the local mineralogical composition parameter comprises modifications to said components, each component being modified to a different extent. 15. The simulation method according to claim 14, wherein the modification of the mineralogical composition is selected from among: dissolution, precipitation, or change of lithology with change of porosity. 16. The simulation method according to claim 14, wherein the modification of the mineralogical composition is configured by a parameter selected from among: one or more minerals as subjects of the modification, a maximum/minimum porosity value of the model, a maximum/minimum conduit diameter value, a reactivity index for each mineral, a facies transformation, a modification inhibitor, the kinetics of the modification, a mineral to be transformed, a mineral to be created, and the minimum and maximum rates of change of a mineral. 17. The method according to claim 13, wherein for at least one component of the local mineralogical composition parameter, the modification of the component comprises increasing the ratio associated with said component. 18. The method according to claim 13, wherein for at least one component of the local mineralogical composition parameter, the modification of the component comprises decreasing the ratio associated with said component. 19. The method according to claim 13, wherein steps /b/, /c/, /d/ and /e/ are carried out for a plurality of particles. 20. The method according to claim 13, wherein the particle comprises a mineralogical composition parameter, and the aggressiveness of the particle is a function of:
the mineralogical composition parameter for the particle, the local mineralogical composition parameter for the model, and the coordinates of the particle in said model. 21. The method according to claim 13, wherein the aggressiveness parameter comprises a plurality of components, each aggressiveness component being associated with a capacity of the particle to dissolve or precipitate a certain type of mineral in the presence of a mineralogical composition. 22. A non-transitory computer readable storage medium, having stored thereon a computer program comprising program instructions, the computer program being loadable into a data-processing unit and adapted to cause the data-processing unit to carry out, when the computer program is run by the data-processing device:
/a/ receiving a geological model for said soil, wherein the model comprises at least one local mineralogical composition parameter based on local coordinates in this model; /b/ simulating a stochastic movement of a particle in the geological model, said particle having coordinates in said model and having an aggressiveness parameter; /c/ modifying the local mineralogical composition parameter while taking into account at least:
the coordinates of the particle in said model,
the aggressiveness of the particle, and
the local mineralogical composition parameter;
/d/ modifying the aggressiveness of the particle while taking into account at least the modification of the local mineralogical composition of step /c/; /e/ when an end condition is satisfied, supplying the local mineralogical composition parameter, otherwise repeating steps /b/, /c/, /d/ and /e/. 23. A device for simulating modifications to the mineralogical compositions of soil, wherein said device comprises a processor for:
/a/ receiving a geological model for said soil, wherein the model comprises at least one local mineralogical composition parameter based on local coordinates in this model; /b/ simulating a stochastic movement of a particle in the geological model, said particle having coordinates in said model and having an aggressiveness parameter; /c/ modifying the local mineralogical composition parameter while taking into account at least:
the coordinates of the particle in said model,
the aggressiveness of the particle, and
the local mineralogical composition parameter;
/d/ modifying the aggressiveness of the particle while taking into account at least the modification of the local mineralogical composition of step /c/; /e/ when an end condition is satisfied, supplying the local mineralogical composition parameter, otherwise repeating steps /b/, /c/, /d/ and /e/. 24. A production method for a hydrocarbon extraction facility, comprising the implementation of:
/a/ receiving a geological model for said soil, wherein the model comprises at least one local mineralogical composition parameter based on local coordinates in this model; /b/ simulating a stochastic movement of a particle in the geological model, said particle having coordinates in said model and having an aggressiveness parameter; /c/ modifying the local mineralogical composition parameter while taking into account at least:
the coordinates of the particle in said model,
the aggressiveness of the particle, and
the local mineralogical composition parameter:
/d/ modifying the aggressiveness of the particle while taking into account at least the modification of the local mineralogical composition of step /c/; /e/ when an end condition is satisfied, supplying the local mineralogical composition parameter, otherwise repeating steps /b/, /c/, /d/ and /e/. | The present invention relates to simulating modifications to the mineralogical compositions of soil. This simulation includes: simulating a stochastic movement of a particle in a geological model and modifying the mineralogical composition attached to the model. This modification is based on at least the coordinates for the particle in the model, the aggressiveness of the particle, and the local mineralogical composition. As a result, the aggressiveness of the particle is also modified.1-12. (canceled) 13. A method, realized by computer, for simulating modifications to mineralogical compositions of soil, comprising:
/a/ receiving a geological model for said soil, wherein the model comprises at least one local mineralogical composition parameter based on local coordinates in this model; /b/ simulating a stochastic movement of a particle in the geological model, said particle having coordinates in said model and having an aggressiveness parameter; /c/ modifying the local mineralogical composition parameter while taking into account at least:
the coordinates of the particle in said model,
the aggressiveness of the particle, and
the local mineralogical composition parameter;
/d/ modifying the aggressiveness of the particle while taking into account at least the modification of the local mineralogical composition of step /c/; and /e/ when an end condition is satisfied, supplying the local mineralogical composition parameter, otherwise repeating steps /b/, /c, /d/ and /e/. 14. The method according to claim 13, wherein the local mineralogical composition parameter comprises a plurality of components, each component being associated with a ratio for a type of mineral in a mineralogical composition,
and wherein the modification of the local mineralogical composition parameter comprises modifications to said components, each component being modified to a different extent. 15. The simulation method according to claim 14, wherein the modification of the mineralogical composition is selected from among: dissolution, precipitation, or change of lithology with change of porosity. 16. The simulation method according to claim 14, wherein the modification of the mineralogical composition is configured by a parameter selected from among: one or more minerals as subjects of the modification, a maximum/minimum porosity value of the model, a maximum/minimum conduit diameter value, a reactivity index for each mineral, a facies transformation, a modification inhibitor, the kinetics of the modification, a mineral to be transformed, a mineral to be created, and the minimum and maximum rates of change of a mineral. 17. The method according to claim 13, wherein for at least one component of the local mineralogical composition parameter, the modification of the component comprises increasing the ratio associated with said component. 18. The method according to claim 13, wherein for at least one component of the local mineralogical composition parameter, the modification of the component comprises decreasing the ratio associated with said component. 19. The method according to claim 13, wherein steps /b/, /c/, /d/ and /e/ are carried out for a plurality of particles. 20. The method according to claim 13, wherein the particle comprises a mineralogical composition parameter, and the aggressiveness of the particle is a function of:
the mineralogical composition parameter for the particle, the local mineralogical composition parameter for the model, and the coordinates of the particle in said model. 21. The method according to claim 13, wherein the aggressiveness parameter comprises a plurality of components, each aggressiveness component being associated with a capacity of the particle to dissolve or precipitate a certain type of mineral in the presence of a mineralogical composition. 22. A non-transitory computer readable storage medium, having stored thereon a computer program comprising program instructions, the computer program being loadable into a data-processing unit and adapted to cause the data-processing unit to carry out, when the computer program is run by the data-processing device:
/a/ receiving a geological model for said soil, wherein the model comprises at least one local mineralogical composition parameter based on local coordinates in this model; /b/ simulating a stochastic movement of a particle in the geological model, said particle having coordinates in said model and having an aggressiveness parameter; /c/ modifying the local mineralogical composition parameter while taking into account at least:
the coordinates of the particle in said model,
the aggressiveness of the particle, and
the local mineralogical composition parameter;
/d/ modifying the aggressiveness of the particle while taking into account at least the modification of the local mineralogical composition of step /c/; /e/ when an end condition is satisfied, supplying the local mineralogical composition parameter, otherwise repeating steps /b/, /c/, /d/ and /e/. 23. A device for simulating modifications to the mineralogical compositions of soil, wherein said device comprises a processor for:
/a/ receiving a geological model for said soil, wherein the model comprises at least one local mineralogical composition parameter based on local coordinates in this model; /b/ simulating a stochastic movement of a particle in the geological model, said particle having coordinates in said model and having an aggressiveness parameter; /c/ modifying the local mineralogical composition parameter while taking into account at least:
the coordinates of the particle in said model,
the aggressiveness of the particle, and
the local mineralogical composition parameter;
/d/ modifying the aggressiveness of the particle while taking into account at least the modification of the local mineralogical composition of step /c/; /e/ when an end condition is satisfied, supplying the local mineralogical composition parameter, otherwise repeating steps /b/, /c/, /d/ and /e/. 24. A production method for a hydrocarbon extraction facility, comprising the implementation of:
/a/ receiving a geological model for said soil, wherein the model comprises at least one local mineralogical composition parameter based on local coordinates in this model; /b/ simulating a stochastic movement of a particle in the geological model, said particle having coordinates in said model and having an aggressiveness parameter; /c/ modifying the local mineralogical composition parameter while taking into account at least:
the coordinates of the particle in said model,
the aggressiveness of the particle, and
the local mineralogical composition parameter:
/d/ modifying the aggressiveness of the particle while taking into account at least the modification of the local mineralogical composition of step /c/; /e/ when an end condition is satisfied, supplying the local mineralogical composition parameter, otherwise repeating steps /b/, /c/, /d/ and /e/. | 2,100 |
5,363 | 5,363 | 14,306,940 | 2,176 | A visual editor creates the meta rules for transforming mapping data between the source meta data and target meta data representation via a wide variety of Graphical User Interface (GUI). A set of transformation rules or scripts is generated by the editor using a transformation rule engine, e.g. XSL and sent to a standard transformation engine, e.g. XSLT which accepts an input data file and using the transformation rules generates a transformed output data file The meta rules are represented in a template and stored in a configuration file. The configuration file can be updated with other rules by the visual editor specifying in the rule file the transformation/mapping language as an element of the rule file. The editor specifies any attributes or parameters on the rule transformation/mapping element. The transformation rule engine reads in a new meta rule generated by the editor. Parameter values are added to complete the rule based on the description from a meta rule configuration file. A locking mechanism in the template is selected to lock the context to the template or portion of the rule definition selected at the time the lock is clicked. The new transformation/rule is saved into the transformation rule file. An editor-mapping engine generates a notification of the creation of a new transformation-mapping rule; updates the meta data rules file; and provide the updated rule file to the transformation engine. Input data to the transformation engine is processed using the updated rule file and the transformed data is provided as an output. | 1-32. (canceled) 33. A computer program product comprising a computer-usable storage medium having stored therein computer usable program code for creating a transformation rule usable to transform a source document into a target document, the computer usable program code, which when executed by a computer hardware system, causes the computer hardware system to perform
receiving, prior to the transformation rule being generated, a source data description of a single data field in the source document; receiving, prior to the transformation rule being generated, a target data description of a single data field in the target document; receiving a meta rule configured to create a transformation rule; and creating the transformation rule using the meta rule with the source data description and the target data description, wherein each data field is to be populated by data having parameters, each respective data description characterizes the parameters of the data, and the computer-usable storage medium is not a transitory, propagating signal per se. 34. The computer program product of claim 33, wherein the computer usable program code further causes the computer hardware system to perform
selecting the meta rule from a plurality of meta rules using a mapping relation between the source data description and the target data description. 35. The computer program product of claim 34, wherein the computer usable program code further causes the computer hardware system to perform
testing the meta rule using the source data description and the target data description to identify missing parameter information. 36. The computer program product of claim 35, wherein the computer usable program code further causes the computer hardware system to perform
upon the missing parameter information being identified, prompting a user to supply the missing parameter information. 37. The computer program product of claim 36, wherein
the transformation rule is created using the tested meta rule and the missing parameter information supplied by the user. 38. The computer program product of claim 33, wherein the computer usable program code further causes the computer hardware system to perform
receiving a second source target data description of a second single data field in the source document, wherein the transformation rule is created using both the source target data description and the second source data description. 39. The computer program product of claim 33, wherein the computer usable program code further causes the computer hardware system to perform
simultaneously visually displaying the source data description and the target data description. 40. The computer program product of claim 33, wherein the computer usable program code further causes the computer hardware system to perform
displaying a source schema in tree form; and displaying a target schema in tree form. 41. The computer program product of claim 33, wherein
the transformation rule is written in XSL (Extended Style Language). 42. The computer program product of claim 33, wherein the computer usable program code further causes the computer hardware system to perform
transforming data in the source document into data formatted for the target document using the transformation rule. 43. A computer hardware system configured to create a transformation rule usable to transform a source document into a target document, comprising:
at least one process, wherein the at least one processor is configured to initiate and/or perform:
receiving, prior to the transformation rule being generated, a source data description of a single data field in the source document;
receiving, prior to the transformation rule being generated, a target data description of a single data field in the target document;
receiving a meta rule configured to create a transformation rule; and
creating the transformation rule using the meta rule with the source data description and the target data description, wherein
each data field is to be populated by data having parameters, and each respective data description characterizes the parameters of the data. 44. The system of claim 43, wherein the at least one processor is further configured to initiate and/or perform
selecting the meta rule from a plurality of meta rules using a mapping relation between the source data description and the target data description. 45. The system of claim 44, wherein the at least one processor is further configured to initiate and/or perform
testing the meta rule using the source data description and the target data description to identify missing parameter information. 46. The system of claim 45, wherein the at least one processor is further configured to initiate and/or perform
upon the missing parameter information being identified, prompting a user to supply the missing parameter information. 47. The system of claim 46, wherein
the transformation rule is created using the tested meta rule and the missing parameter information supplied by the user. 48. The system of claim 43, wherein the at least one processor is further configured to initiate and/or perform
receiving a second source target data description of a second single data field in the source document, wherein the transformation rule is created using both the source target data description and the second source data description. 49. The system of claim 43, wherein the at least one processor is further configured to initiate and/or perform
simultaneously visually displaying the source data description and the target data description. 50. The system of claim 43, wherein the at least one processor is further configured to initiate and/or perform
displaying a source schema in tree form; and displaying a target schema in tree form. 51. The system of claim 43, wherein
the transformation rule is written in XSL (Extended Style Language). 52. The system of claim 43, wherein the at least one processor is further configured to initiate and/or perform
transforming data in the source document into data formatted for the target document using the transformation rule. | A visual editor creates the meta rules for transforming mapping data between the source meta data and target meta data representation via a wide variety of Graphical User Interface (GUI). A set of transformation rules or scripts is generated by the editor using a transformation rule engine, e.g. XSL and sent to a standard transformation engine, e.g. XSLT which accepts an input data file and using the transformation rules generates a transformed output data file The meta rules are represented in a template and stored in a configuration file. The configuration file can be updated with other rules by the visual editor specifying in the rule file the transformation/mapping language as an element of the rule file. The editor specifies any attributes or parameters on the rule transformation/mapping element. The transformation rule engine reads in a new meta rule generated by the editor. Parameter values are added to complete the rule based on the description from a meta rule configuration file. A locking mechanism in the template is selected to lock the context to the template or portion of the rule definition selected at the time the lock is clicked. The new transformation/rule is saved into the transformation rule file. An editor-mapping engine generates a notification of the creation of a new transformation-mapping rule; updates the meta data rules file; and provide the updated rule file to the transformation engine. Input data to the transformation engine is processed using the updated rule file and the transformed data is provided as an output.1-32. (canceled) 33. A computer program product comprising a computer-usable storage medium having stored therein computer usable program code for creating a transformation rule usable to transform a source document into a target document, the computer usable program code, which when executed by a computer hardware system, causes the computer hardware system to perform
receiving, prior to the transformation rule being generated, a source data description of a single data field in the source document; receiving, prior to the transformation rule being generated, a target data description of a single data field in the target document; receiving a meta rule configured to create a transformation rule; and creating the transformation rule using the meta rule with the source data description and the target data description, wherein each data field is to be populated by data having parameters, each respective data description characterizes the parameters of the data, and the computer-usable storage medium is not a transitory, propagating signal per se. 34. The computer program product of claim 33, wherein the computer usable program code further causes the computer hardware system to perform
selecting the meta rule from a plurality of meta rules using a mapping relation between the source data description and the target data description. 35. The computer program product of claim 34, wherein the computer usable program code further causes the computer hardware system to perform
testing the meta rule using the source data description and the target data description to identify missing parameter information. 36. The computer program product of claim 35, wherein the computer usable program code further causes the computer hardware system to perform
upon the missing parameter information being identified, prompting a user to supply the missing parameter information. 37. The computer program product of claim 36, wherein
the transformation rule is created using the tested meta rule and the missing parameter information supplied by the user. 38. The computer program product of claim 33, wherein the computer usable program code further causes the computer hardware system to perform
receiving a second source target data description of a second single data field in the source document, wherein the transformation rule is created using both the source target data description and the second source data description. 39. The computer program product of claim 33, wherein the computer usable program code further causes the computer hardware system to perform
simultaneously visually displaying the source data description and the target data description. 40. The computer program product of claim 33, wherein the computer usable program code further causes the computer hardware system to perform
displaying a source schema in tree form; and displaying a target schema in tree form. 41. The computer program product of claim 33, wherein
the transformation rule is written in XSL (Extended Style Language). 42. The computer program product of claim 33, wherein the computer usable program code further causes the computer hardware system to perform
transforming data in the source document into data formatted for the target document using the transformation rule. 43. A computer hardware system configured to create a transformation rule usable to transform a source document into a target document, comprising:
at least one process, wherein the at least one processor is configured to initiate and/or perform:
receiving, prior to the transformation rule being generated, a source data description of a single data field in the source document;
receiving, prior to the transformation rule being generated, a target data description of a single data field in the target document;
receiving a meta rule configured to create a transformation rule; and
creating the transformation rule using the meta rule with the source data description and the target data description, wherein
each data field is to be populated by data having parameters, and each respective data description characterizes the parameters of the data. 44. The system of claim 43, wherein the at least one processor is further configured to initiate and/or perform
selecting the meta rule from a plurality of meta rules using a mapping relation between the source data description and the target data description. 45. The system of claim 44, wherein the at least one processor is further configured to initiate and/or perform
testing the meta rule using the source data description and the target data description to identify missing parameter information. 46. The system of claim 45, wherein the at least one processor is further configured to initiate and/or perform
upon the missing parameter information being identified, prompting a user to supply the missing parameter information. 47. The system of claim 46, wherein
the transformation rule is created using the tested meta rule and the missing parameter information supplied by the user. 48. The system of claim 43, wherein the at least one processor is further configured to initiate and/or perform
receiving a second source target data description of a second single data field in the source document, wherein the transformation rule is created using both the source target data description and the second source data description. 49. The system of claim 43, wherein the at least one processor is further configured to initiate and/or perform
simultaneously visually displaying the source data description and the target data description. 50. The system of claim 43, wherein the at least one processor is further configured to initiate and/or perform
displaying a source schema in tree form; and displaying a target schema in tree form. 51. The system of claim 43, wherein
the transformation rule is written in XSL (Extended Style Language). 52. The system of claim 43, wherein the at least one processor is further configured to initiate and/or perform
transforming data in the source document into data formatted for the target document using the transformation rule. | 2,100 |
5,364 | 5,364 | 14,643,476 | 2,145 | User interfaces for browsing and/or searching are described. In at least certain embodiments, icon data from a plug-in includes badge data and an image (such as a thumbnail). The badge data includes additional information on the file, the creator application of the file, and/or a third party vendor of the creator application. For example, the badge data may include the version of the creator application. Using the badge data, a badge may be generated and displayed on the icon. Other embodiments are also described, and computer readable media and apparatuses are also described. | 1-19. (canceled) 20. A method of generating icons include a preview, the method comprising:
displaying, within a graphical user interface (GUI) on a computing device, an icon representing a file, the icon including a preview of content of the file displayed within the icon, the preview initially displaying a first content portion representative of a first portion the content of the file; detecting, on the computing device within the GUI, a first user input corresponding to the icon; in response to detecting the first user input, displaying a first user interface control corresponding to the icon; detecting, on the computing device within the GUI, a second user input corresponding to the first user interface control; and in response to detecting the second user input, displaying a second content portion representative of a second portion of the content of the file. 21. The method of claim 20, wherein displaying the first user interface control includes displaying the first user interface control within the icon. 22. The method of claim 20, wherein displaying the first user interface control includes displaying the first user interface control outside of the icon. 23. The method of claim 20, wherein displaying the icon includes displaying two user interface controls, wherein:
activation of the first user interface control advances the preview in a first direction; and activation of a second user interface control advances the preview in a second direction. 24. The method of claim 20, further comprising in response to displaying the second content portion within the icon displaying a second user interface control enabling a second manipulation of the preview. 25. The method of claim 24, wherein the first user interface control is a right arrow to advance the preview in a first direction and the second user interface control is a left arrow to advance the preview in a second direction. 26. The method of claim 24, wherein the first user interface control is a play button to initiate playing of the preview and the second user interface control is a stop button to stop playing of the preview, and wherein the second user interface control replaces the first user interface control in response to activation of the first user interface control. 27. The method of claim 23, wherein a format of the icon is maintained in response to the second user input activating the first user interface control. 28. The method of claim 20, wherein the first user interface control is a control selected from the following group of controls:
arrow buttons; play button; zoom button; and scroll bar. 29. The method of claim 20, further comprising displaying a status indicator within the icon, the status indicator indicating a position within the preview. 30. The method of claim 20, wherein the preview is displayed within the icon without launching an application associated with the file or displaying a new window to present the preview. 31. A non-transitory computer readable medium storing instructions that, when executed on a computing device, cause the computing device to perform operations comprising:
displaying, within a graphical user interface (GUI) on the computing device, an icon representing a file, the icon depicting a preview of content of the file, the preview displaying a first content portion representative of a first portion the content of the file; detecting a first user input corresponding to the icon; in response to detecting the first user input, displaying a first user interface control corresponding to the icon; detecting a second user input corresponding to the first user interface control; and in response to detecting the second user input, displaying a second content portion representative of a second portion of the content of the file. 32. The non-transitory computer readable medium of claim 31, wherein the preview is displayed within the icon without launching an application associated with the file or displaying a new window to present the preview. 33. The non-transitory computer readable medium of claim 31, wherein the operations further comprise an operation for displaying two user interface controls, wherein:
activation of the first user interface control advances the preview in a first direction; and activation of a second user interface control advances the preview in a second direction. 34. The non-transitory computer readable medium of claim 31, wherein the operations further comprise in response to displaying the second content portion of the content of the file within the icon displaying a second user interface control enabling a second manipulation of the preview. 35. The non-transitory computer readable medium of claim 34, wherein the first user interface control is a right arrow to advance the preview in a first direction and the second user interface control is a left arrow to advance the preview in a second direction. 36. The non-transitory computer readable medium of claim 34, wherein the first user interface control is a play button to initiate playing of the preview and the second user interface control is a stop button to stop playing of the preview, and wherein the second user interface control replaces the first user interface control in response to activation of the first user interface control. 37. The non-transitory computer readable medium of claim 31, wherein the operation for displaying the icon include maintaining a format of the icon in response to the second user input activating the first user interface control. 39. The non-transitory computer readable medium of claim 31, further comprising operations for displaying a status indicator within the dynamic icon, the status indicator indicating a position within the interactive preview. 40. The non-transitory computer readable medium of claim 31, wherein the preview is displayed within the icon without launching an application associated with the file or displaying a new user interface element external of the icon to present the preview. 41. An apparatus comprising:
a display device; and a processor to display an icon to represent a file in a graphical user interface (GUI) on the display device, the icon including a preview of content of the file, and the processor to further execute a preview generator to control a content portion displayed by the preview without modifying a size format of the icon in response to receiving a user command to manipulate the preview via a user interface control, and to display the user interface control on the icon, the user interface control configured to receive the user command to manipulate the preview of content of the file within the icon. 42. The apparatus of claim 40, wherein:
the processor further detects a first user command to manipulate the preview of the content of the file within the icon; and in response to detecting the first user command, the preview generator updates the content portion of the preview displayed within the icon. 43. The apparatus of claim 40, wherein the processor further displays a status indicator within the icon, the status indicator indicating a position within the interactive preview. | User interfaces for browsing and/or searching are described. In at least certain embodiments, icon data from a plug-in includes badge data and an image (such as a thumbnail). The badge data includes additional information on the file, the creator application of the file, and/or a third party vendor of the creator application. For example, the badge data may include the version of the creator application. Using the badge data, a badge may be generated and displayed on the icon. Other embodiments are also described, and computer readable media and apparatuses are also described.1-19. (canceled) 20. A method of generating icons include a preview, the method comprising:
displaying, within a graphical user interface (GUI) on a computing device, an icon representing a file, the icon including a preview of content of the file displayed within the icon, the preview initially displaying a first content portion representative of a first portion the content of the file; detecting, on the computing device within the GUI, a first user input corresponding to the icon; in response to detecting the first user input, displaying a first user interface control corresponding to the icon; detecting, on the computing device within the GUI, a second user input corresponding to the first user interface control; and in response to detecting the second user input, displaying a second content portion representative of a second portion of the content of the file. 21. The method of claim 20, wherein displaying the first user interface control includes displaying the first user interface control within the icon. 22. The method of claim 20, wherein displaying the first user interface control includes displaying the first user interface control outside of the icon. 23. The method of claim 20, wherein displaying the icon includes displaying two user interface controls, wherein:
activation of the first user interface control advances the preview in a first direction; and activation of a second user interface control advances the preview in a second direction. 24. The method of claim 20, further comprising in response to displaying the second content portion within the icon displaying a second user interface control enabling a second manipulation of the preview. 25. The method of claim 24, wherein the first user interface control is a right arrow to advance the preview in a first direction and the second user interface control is a left arrow to advance the preview in a second direction. 26. The method of claim 24, wherein the first user interface control is a play button to initiate playing of the preview and the second user interface control is a stop button to stop playing of the preview, and wherein the second user interface control replaces the first user interface control in response to activation of the first user interface control. 27. The method of claim 23, wherein a format of the icon is maintained in response to the second user input activating the first user interface control. 28. The method of claim 20, wherein the first user interface control is a control selected from the following group of controls:
arrow buttons; play button; zoom button; and scroll bar. 29. The method of claim 20, further comprising displaying a status indicator within the icon, the status indicator indicating a position within the preview. 30. The method of claim 20, wherein the preview is displayed within the icon without launching an application associated with the file or displaying a new window to present the preview. 31. A non-transitory computer readable medium storing instructions that, when executed on a computing device, cause the computing device to perform operations comprising:
displaying, within a graphical user interface (GUI) on the computing device, an icon representing a file, the icon depicting a preview of content of the file, the preview displaying a first content portion representative of a first portion the content of the file; detecting a first user input corresponding to the icon; in response to detecting the first user input, displaying a first user interface control corresponding to the icon; detecting a second user input corresponding to the first user interface control; and in response to detecting the second user input, displaying a second content portion representative of a second portion of the content of the file. 32. The non-transitory computer readable medium of claim 31, wherein the preview is displayed within the icon without launching an application associated with the file or displaying a new window to present the preview. 33. The non-transitory computer readable medium of claim 31, wherein the operations further comprise an operation for displaying two user interface controls, wherein:
activation of the first user interface control advances the preview in a first direction; and activation of a second user interface control advances the preview in a second direction. 34. The non-transitory computer readable medium of claim 31, wherein the operations further comprise in response to displaying the second content portion of the content of the file within the icon displaying a second user interface control enabling a second manipulation of the preview. 35. The non-transitory computer readable medium of claim 34, wherein the first user interface control is a right arrow to advance the preview in a first direction and the second user interface control is a left arrow to advance the preview in a second direction. 36. The non-transitory computer readable medium of claim 34, wherein the first user interface control is a play button to initiate playing of the preview and the second user interface control is a stop button to stop playing of the preview, and wherein the second user interface control replaces the first user interface control in response to activation of the first user interface control. 37. The non-transitory computer readable medium of claim 31, wherein the operation for displaying the icon include maintaining a format of the icon in response to the second user input activating the first user interface control. 39. The non-transitory computer readable medium of claim 31, further comprising operations for displaying a status indicator within the dynamic icon, the status indicator indicating a position within the interactive preview. 40. The non-transitory computer readable medium of claim 31, wherein the preview is displayed within the icon without launching an application associated with the file or displaying a new user interface element external of the icon to present the preview. 41. An apparatus comprising:
a display device; and a processor to display an icon to represent a file in a graphical user interface (GUI) on the display device, the icon including a preview of content of the file, and the processor to further execute a preview generator to control a content portion displayed by the preview without modifying a size format of the icon in response to receiving a user command to manipulate the preview via a user interface control, and to display the user interface control on the icon, the user interface control configured to receive the user command to manipulate the preview of content of the file within the icon. 42. The apparatus of claim 40, wherein:
the processor further detects a first user command to manipulate the preview of the content of the file within the icon; and in response to detecting the first user command, the preview generator updates the content portion of the preview displayed within the icon. 43. The apparatus of claim 40, wherein the processor further displays a status indicator within the icon, the status indicator indicating a position within the interactive preview. | 2,100 |
5,365 | 5,365 | 15,107,093 | 2,145 | A display device displays device information in a navigation tree, whose nodes are each assigned to apparatus parts, apparatuses and/or apparatus groups, such that the apparatus information with a node that is superordinate both to the node which is assigned to a source of the apparatus information, and to a currently selected node. | 1-12. (canceled) 13. A method for displaying apparatus information in a navigation tree, the navigation tree having nodes that are interlinked by directional links, the directional links defining an order structure that includes superordinate nodes and subordinate nodes for each node, the order structure defining for each node an assigned navigation path that includes all superordinate nodes for the node and respective connecting links, each node being assigned an apparatus part, an apparatus, or an apparatus group of a plant that in each case transmits apparatus information, comprising:
displaying a node as a selected node with an associated navigation path and nodes directly subordinate to the node, on a display unit, wherein one node is displayed as the selected node with an associated first navigation path and nodes directly subordinate to the node on the display unit; automatically identifying an associated node for apparatus information sent by an apparatus part, an apparatus, or an apparatus group; automatically ascertaining an associated second navigation path for the identified node, one node in the second navigation path that is presently displayed on the display unit being ascertained automatically; and displaying the apparatus information on the display unit in a manner assigned automatically to the ascertained node. 14. The method according to claim 13, wherein the node of the second navigation path is determined as an ascertained node for which no subordinate node in the second navigation path is currently displayed, and/or each node has exactly or no more than one directly superordinate node in the navigation tree. 15. The method according to claim 13, wherein the navigation path is ascertained in a manner that a directly superordinate node in each case is automatically searched for recursively and noted as an element of the navigation path, and/or upon a change of the selected node on the display unit, one node in the second navigation path that is currently displayed on the display unit is again ascertained automatically, and the apparatus information is displayed on the display unit in a manner assigned automatically to the newly ascertained node. 16. The method according to claim 13, wherein the apparatus information is displayed on a link to a node that is directly superordinate to the ascertained node, and/or on the ascertained node, and/or the navigation tree has a start node for which no superordinate node exists and to which the remaining nodes of the navigation tree are subordinate. 17. The method according to claim 13, wherein with the selected node, a graphic read-out device adapted to read out apparatus parameters of the assigned apparatus part, apparatus, or apparatus group and/or a graphic control device adapted to control the assigned apparatus part, apparatus, or apparatus group are displayed, and/or for each unselected node displayed, no more than two directly subordinate or superordinate nodes are displayed. 18. A display device for apparatus information, comprising:
a storage device adapted to store a navigation tree, the navigation tree including nodes that are interlinked by directional links, the directional links defining an order structure that includes superordinate nodes and subordinate nodes for each node, the order structure defining for each node an assigned navigation path that includes all superordinate nodes for the node and respective connecting links, each node being assigned an apparatus part, an apparatus, or an apparatus group of a plant which in each case transmits apparatus information; a selection device adapted to select a node displayed on the display device, the display device adapted to display a selected node of the navigation tree with an associated navigation path and the nodes directly subordinate to the node; an information input adapted to receive apparatus information transmitted from the apparatus part, the apparatus, or the apparatus group; an identification device adapted to identify a node assigned to apparatus information received; a navigation-path calculation device adapted to ascertain the navigation path to an identified node; a node-selection device adapted to ascertain a node in the navigation path to the identified node, which at the same time is also currently displayed on the display unit; and an information-output device adapted to display the apparatus information with the ascertained node on the display unit. 19. The display device according to claim 18, wherein the node-selection device is adapted to ascertain the node in the navigation path to the identified node, for which no subordinate node in the navigation path is currently displayed. 20. The display device according to claim 18, wherein each node has exactly or no more than one directly superordinate node in the navigation tree and/or the navigation-path calculation device is adapted to recursively, automatically ascertain one node directly superordinate in each case to a node, and to note the superordinate node as an element of the navigation path. 21. The display device according to claim 18, wherein in response to a change of the selected node on the display unit, the display device is adapted to again automatically ascertain a node currently displayed on the display unit, in the navigation path of the identified node, and to display the apparatus information in a manner assigned to a newly ascertained node, and/or the display device is adapted to display the apparatus information on a link to a node that is directly superordinate to the ascertained node, and/or on the ascertained node. 22. The display device according to claim 18, wherein the navigation tree includes a start node having no superordinate node and to which remaining nodes in the navigation tree are subordinate, and/or the display device is adapted to display a graphic read-out device adapted to read out apparatus parameters of the assigned apparatus part, apparatus, or apparatus group with the selected node and/or to display a graphic control device adapted to control the assigned apparatus part, apparatus, or apparatus group. 23. The display device according to claim 18, wherein the display device is adapted to display no more than two directly subordinate or superordinate nodes for each unselected node displayed. 24. The display device according to claim 18, wherein the display device is adapted to perform the method recited in claim 13. 25. The method according to claim 13, wherein the method is performed by the display device recited in claim 18. | A display device displays device information in a navigation tree, whose nodes are each assigned to apparatus parts, apparatuses and/or apparatus groups, such that the apparatus information with a node that is superordinate both to the node which is assigned to a source of the apparatus information, and to a currently selected node.1-12. (canceled) 13. A method for displaying apparatus information in a navigation tree, the navigation tree having nodes that are interlinked by directional links, the directional links defining an order structure that includes superordinate nodes and subordinate nodes for each node, the order structure defining for each node an assigned navigation path that includes all superordinate nodes for the node and respective connecting links, each node being assigned an apparatus part, an apparatus, or an apparatus group of a plant that in each case transmits apparatus information, comprising:
displaying a node as a selected node with an associated navigation path and nodes directly subordinate to the node, on a display unit, wherein one node is displayed as the selected node with an associated first navigation path and nodes directly subordinate to the node on the display unit; automatically identifying an associated node for apparatus information sent by an apparatus part, an apparatus, or an apparatus group; automatically ascertaining an associated second navigation path for the identified node, one node in the second navigation path that is presently displayed on the display unit being ascertained automatically; and displaying the apparatus information on the display unit in a manner assigned automatically to the ascertained node. 14. The method according to claim 13, wherein the node of the second navigation path is determined as an ascertained node for which no subordinate node in the second navigation path is currently displayed, and/or each node has exactly or no more than one directly superordinate node in the navigation tree. 15. The method according to claim 13, wherein the navigation path is ascertained in a manner that a directly superordinate node in each case is automatically searched for recursively and noted as an element of the navigation path, and/or upon a change of the selected node on the display unit, one node in the second navigation path that is currently displayed on the display unit is again ascertained automatically, and the apparatus information is displayed on the display unit in a manner assigned automatically to the newly ascertained node. 16. The method according to claim 13, wherein the apparatus information is displayed on a link to a node that is directly superordinate to the ascertained node, and/or on the ascertained node, and/or the navigation tree has a start node for which no superordinate node exists and to which the remaining nodes of the navigation tree are subordinate. 17. The method according to claim 13, wherein with the selected node, a graphic read-out device adapted to read out apparatus parameters of the assigned apparatus part, apparatus, or apparatus group and/or a graphic control device adapted to control the assigned apparatus part, apparatus, or apparatus group are displayed, and/or for each unselected node displayed, no more than two directly subordinate or superordinate nodes are displayed. 18. A display device for apparatus information, comprising:
a storage device adapted to store a navigation tree, the navigation tree including nodes that are interlinked by directional links, the directional links defining an order structure that includes superordinate nodes and subordinate nodes for each node, the order structure defining for each node an assigned navigation path that includes all superordinate nodes for the node and respective connecting links, each node being assigned an apparatus part, an apparatus, or an apparatus group of a plant which in each case transmits apparatus information; a selection device adapted to select a node displayed on the display device, the display device adapted to display a selected node of the navigation tree with an associated navigation path and the nodes directly subordinate to the node; an information input adapted to receive apparatus information transmitted from the apparatus part, the apparatus, or the apparatus group; an identification device adapted to identify a node assigned to apparatus information received; a navigation-path calculation device adapted to ascertain the navigation path to an identified node; a node-selection device adapted to ascertain a node in the navigation path to the identified node, which at the same time is also currently displayed on the display unit; and an information-output device adapted to display the apparatus information with the ascertained node on the display unit. 19. The display device according to claim 18, wherein the node-selection device is adapted to ascertain the node in the navigation path to the identified node, for which no subordinate node in the navigation path is currently displayed. 20. The display device according to claim 18, wherein each node has exactly or no more than one directly superordinate node in the navigation tree and/or the navigation-path calculation device is adapted to recursively, automatically ascertain one node directly superordinate in each case to a node, and to note the superordinate node as an element of the navigation path. 21. The display device according to claim 18, wherein in response to a change of the selected node on the display unit, the display device is adapted to again automatically ascertain a node currently displayed on the display unit, in the navigation path of the identified node, and to display the apparatus information in a manner assigned to a newly ascertained node, and/or the display device is adapted to display the apparatus information on a link to a node that is directly superordinate to the ascertained node, and/or on the ascertained node. 22. The display device according to claim 18, wherein the navigation tree includes a start node having no superordinate node and to which remaining nodes in the navigation tree are subordinate, and/or the display device is adapted to display a graphic read-out device adapted to read out apparatus parameters of the assigned apparatus part, apparatus, or apparatus group with the selected node and/or to display a graphic control device adapted to control the assigned apparatus part, apparatus, or apparatus group. 23. The display device according to claim 18, wherein the display device is adapted to display no more than two directly subordinate or superordinate nodes for each unselected node displayed. 24. The display device according to claim 18, wherein the display device is adapted to perform the method recited in claim 13. 25. The method according to claim 13, wherein the method is performed by the display device recited in claim 18. | 2,100 |
5,366 | 5,366 | 13,501,362 | 2,158 | A system and method for efficiently and accurately identifying relevant document classifications is contemplated. The document analysis system receives classified reference documents along with a relevancy indicator for each document and generates sensory indicators that assist a researcher in identifying relevant classifications that have not been previously researched. In one aspect, the document analysis system generates a table of classifications, the classifications being determined by scoring of each classification cited within each relevant document. The system then determines a sensory indicator (e.g. a color) for each classification that indicates the extent to which the classification has been previously searched. The classification analysis window thus allows the researcher to quickly determine (e.g. by visual inspection) which classification codes have been cited most frequently as well as which classification codes require further search. In this manner the researcher may quickly determine where to direct a next iteration of a search. | 1. A search system for searching through a plurality of documents that are organized using a classification system to define each of the plurality of documents as a classified document, wherein a search is conducted based on a predetermined subject matter, the system comprising:
a program module stored on at least one of a computer readable medium and a memory of a computer, the program module comprising instructions executable by a processor of the computer to determine document classifications that are relevant to the subject matter of the search, the program module comprising a classification analysis module; wherein the classification analysis module:
receives a set of documents, the set of documents including at least one document, each document in the set of documents having a relevancy indicator and at least one classification value, each classification value being defined as a unique classification value;
determines a score of each of the unique classification values appearing in the at least one document in the set of documents, the score being defined as a frequency of occurrence of each of the unique classification values appearing in the at least one document;
determines a search indicator for each of the unique classification values, the search indicator providing an indication of a level to which each of the unique classification values has been previously searched; and
generates and displays a table of each of the unique classification values along with at least one of the score of each of the unique classification values and the search indicator for each of the unique classification values. 2. A system according to claim 1 wherein the table is sorted based on the score of each of the unique classification values. 3. A system according to claim 1 wherein each of the unique classification values is assigned a predetermined value that corresponds to a weight of each of the unique classification values to define a weighted classification value, and wherein the weighted classification value is used to modify the score. 4. A system according to claim 1 wherein each of the unique classification values relating to a document located in the search that is determined to be a relevant document is assigned a predetermined value that corresponds to a weight of each of the unique classification values to define a weighted classification value, wherein the predetermined value is derived from the overall relevance of the document located in the search, and wherein the weighted classification value is used to modify the score. 5. A system according to claim 1 wherein each of the unique classification values relating to a document located in the search is assigned a predetermined value that corresponds to a weight of each of the unique classification values to define a weighted classification value based on the number of documents located in the classification, and wherein the weighted classification value is used to modify the score. 6. A system according to claim 1 wherein the classification analysis module separates the unique classification values to display only the unique classification values of those documents located in the search that were determined to be relevant. 7. A system according to claim 1 wherein each of the unique classification values are organized in a hierarchy providing each of the unique classification values with at least one ancestor node; and wherein each of the unique classification values is replaced with the at least one ancestor node. 8. A system according to claim 1 wherein each of the unique classification values includes a class value and a subclass value; and wherein each of the unique classification values is replaced with the class value. 9. A system according to claim 1 wherein the classification analysis module determines the search indicator for each unique classification value by receiving both an alphanumeric indicator relating to a search status of the unique classification value and an alphanumeric indicator relating to a search extent of the unique classification value. 10. A system according to claim 1 wherein the classification analysis module assigns a color to be displayed on a user interface relating to the search indicator. 11. A system according to claim 1 wherein the computer is a server and the system further comprises a client computer, the server communicatively coupled to the client computer; and wherein the program module is located on the client computer and the classification analysis module is located on the server. 12. A system according to claim 7 wherein each of the unique classification values are grouped by adding the scores of each of the unique classification values after being replaced; wherein the grouped unique classification values are sorted according to the scores; and wherein the sorted grouped unique classification values are displayed on the table. 13. A method of searching through a plurality of documents that are organized using a classification system to define each of the plurality of documents as a classified document, the plurality of classified documents being searched based on a predetermined subject matter, the method comprising:
determining record classifications that are relevant to the subject matter of the search using a program module stored on at least one of a computer readable medium and a memory of a computer, the program module comprising instructions executable by a processor of the computer to determine document classifications; receiving a set of documents, the set of documents including at least one document, each document in the set of documents having a relevancy indicator and at least one classification value, each classification value being defined as a unique classification value; determining a score of each of the unique classification values appearing in the at least one document in the set of documents, the score being defined as a frequency of occurrence of each of the unique classification values appearing in the at least one document; determining a search indicator for each of the unique classification values, the search indicator providing an indication of a level to which each of the unique classification values has been previously searched; and generating and displaying a table of each of the unique classification values along with at least one of the score of each of the unique classification values and the search indicator for each of the unique classification values. 14. A method according to claim 13 further comprising sorting the table based on the score of each of the unique classification values. 15. A method according to claim 13 further comprising assigning a predetermined value to each of the unique classification values that corresponds to a weight of each of the unique classification values to define a weighted classification value; and wherein the weighted classification value is used to modify the score. 16. A method according to claim 13 further comprising assigning a predetermined value to each of the unique classification values relating to a document located in the search that is determined to be a relevant document that corresponds to a weight of each of the unique classification values to define a weighted classification value, and wherein the weighted classification value is used to modify the score. 17. A method according to claim 13 further comprising assigning a predetermined value to each of the unique classification values relating to a document located in the search that corresponds to a weight of each of the unique classification values to define a weighted classification value based on the number of documents located in the classification, and wherein the weighted classification value is used to modify the score. 18. A method according to claim 13 further comprising separating the unique classification values to display only the unique classification values of those documents located in the search that were determined to be relevant. 19. A method according to claim 13 further comprising organizing each of the unique classification values in a hierarchy providing each of the unique classification values with at least one ancestor node; and further comprising replacing each of the unique classification values with the at least one ancestor node. 20. A method according to claim 13 wherein each of the unique classification values includes a class value and a subclass value; and further comprising replacing each of the unique classification values with the class value. 21. A method according to claim 13 further comprising determining the search indicator for each unique classification value by receiving both an alphanumeric indicator relating to a search status of the unique classification value and an alphanumeric indicator relating to a search extend of the unique classification value. 22. A method according to claim 13 further comprising assigning a color to be displayed on a user interface relating to the search indicator. 23. A method according to claim 19 further comprising grouping each of the unique classification values by adding the scores of each of the unique classification values after being replaced; sorting the grouped unique classification values according to the scores; and displaying the sorted grouped unique classification values on the table. 24. A method of searching through a plurality of documents that are organized using a classification system to define each of the plurality of documents as a classified document, the plurality of classified documents being searched based on a predetermined subject matter, the method comprising:
determining record classifications that are relevant to the subject matter of the search using a program module stored on at least one of a computer readable medium and a memory of a computer, the program module comprising instructions executable by a processor of the computer to determine document classifications; receiving a set of documents, the set of documents including at least one document, each document in the set of documents having a relevancy indicator and at least one classification value, each classification value being defined as a unique classification value; determining a score of each of the unique classification values appearing in the at least one document in the set of documents, the score being defined as a frequency of occurrence of each of the unique classification values appearing in the at least one document; determining a search indicator for each of the unique classification values, the search indicator providing an indication of a level to which each of the unique classification values has been previously searched, wherein the search indicator is determined by receiving both an alphanumeric indicator relating to a search status of the unique classification value and an alphanumeric indicator relating to a search extend of the unique classification value; generating and displaying a table of each of the unique classification values along with at least one of the score of each of the unique classification values and the search indicator for each of the unique classification values; and assigning a color to be displayed on a user interface relating to the search indicator. 25. A method according to claim 24 further comprising sorting the table based on the score of each of the unique classification values. 26. A method according to claim 24 further comprising assigning a predetermined value to each of the unique classification values that corresponds to a weight of each of the unique classification values to define a weighted classification value; and wherein the weighted classification value is used to modify the score. 27. A method according to claim 24 further comprising assigning a predetermined value to each of the unique classification values relating to a document located in the search that is determined to be a relevant document that corresponds to a weight of each of the unique classification values to define a weighted classification value, and wherein the weighted classification value is used to modify the score. 28. A method according to claim 24 further comprising assigning a predetermined value to each of the unique classification values relating to a document located in the search that corresponds to a weight of each of the unique classification values to define a weighted classification value based on the number of documents located in the classification, and wherein the weighted classification value is used to modify the score. 29. A method according to claim 24 further comprising separating the unique classification values to display only the unique classification values of those documents located in the search that were determined to be relevant. 30. A method according to claim 24 further comprising organizing each of the unique classification values in a hierarchy providing each of the unique classification values with at least one ancestor node; and further comprising replacing each of the unique classification values with the at least one ancestor node. 31. A method according to claim 24 wherein each of the unique classification values includes a class value and a subclass value; and further comprising replacing each of the unique classification values with the class value. 32. A method according to claim 30 further comprising grouping each of the unique classification values by adding the scores of each of the unique classification values after being replaced; sorting the grouped unique classification values according to the scores; and displaying the sorted grouped unique classification values on the table. 33. A system according to claim 8 wherein each of the unique classification values are grouped by adding the scores of each of the unique classification values after being replaced; wherein the grouped unique classification values are sorted according to the scores; and wherein the sorted grouped unique classification values are displayed on the table. 34. A method according to claim 20 further comprising grouping each of the unique classification values by adding the scores of each of the unique classification values after being replaced; sorting the grouped unique classification values according to the scores; and displaying the sorted grouped unique classification values on the table. 35. A method according to claim 31 further comprising grouping each of the unique classification values by adding the scores of each of the unique classification values after being replaced; sorting the grouped unique classification values according to the scores; and displaying the sorted grouped unique classification values on the table. | A system and method for efficiently and accurately identifying relevant document classifications is contemplated. The document analysis system receives classified reference documents along with a relevancy indicator for each document and generates sensory indicators that assist a researcher in identifying relevant classifications that have not been previously researched. In one aspect, the document analysis system generates a table of classifications, the classifications being determined by scoring of each classification cited within each relevant document. The system then determines a sensory indicator (e.g. a color) for each classification that indicates the extent to which the classification has been previously searched. The classification analysis window thus allows the researcher to quickly determine (e.g. by visual inspection) which classification codes have been cited most frequently as well as which classification codes require further search. In this manner the researcher may quickly determine where to direct a next iteration of a search.1. A search system for searching through a plurality of documents that are organized using a classification system to define each of the plurality of documents as a classified document, wherein a search is conducted based on a predetermined subject matter, the system comprising:
a program module stored on at least one of a computer readable medium and a memory of a computer, the program module comprising instructions executable by a processor of the computer to determine document classifications that are relevant to the subject matter of the search, the program module comprising a classification analysis module; wherein the classification analysis module:
receives a set of documents, the set of documents including at least one document, each document in the set of documents having a relevancy indicator and at least one classification value, each classification value being defined as a unique classification value;
determines a score of each of the unique classification values appearing in the at least one document in the set of documents, the score being defined as a frequency of occurrence of each of the unique classification values appearing in the at least one document;
determines a search indicator for each of the unique classification values, the search indicator providing an indication of a level to which each of the unique classification values has been previously searched; and
generates and displays a table of each of the unique classification values along with at least one of the score of each of the unique classification values and the search indicator for each of the unique classification values. 2. A system according to claim 1 wherein the table is sorted based on the score of each of the unique classification values. 3. A system according to claim 1 wherein each of the unique classification values is assigned a predetermined value that corresponds to a weight of each of the unique classification values to define a weighted classification value, and wherein the weighted classification value is used to modify the score. 4. A system according to claim 1 wherein each of the unique classification values relating to a document located in the search that is determined to be a relevant document is assigned a predetermined value that corresponds to a weight of each of the unique classification values to define a weighted classification value, wherein the predetermined value is derived from the overall relevance of the document located in the search, and wherein the weighted classification value is used to modify the score. 5. A system according to claim 1 wherein each of the unique classification values relating to a document located in the search is assigned a predetermined value that corresponds to a weight of each of the unique classification values to define a weighted classification value based on the number of documents located in the classification, and wherein the weighted classification value is used to modify the score. 6. A system according to claim 1 wherein the classification analysis module separates the unique classification values to display only the unique classification values of those documents located in the search that were determined to be relevant. 7. A system according to claim 1 wherein each of the unique classification values are organized in a hierarchy providing each of the unique classification values with at least one ancestor node; and wherein each of the unique classification values is replaced with the at least one ancestor node. 8. A system according to claim 1 wherein each of the unique classification values includes a class value and a subclass value; and wherein each of the unique classification values is replaced with the class value. 9. A system according to claim 1 wherein the classification analysis module determines the search indicator for each unique classification value by receiving both an alphanumeric indicator relating to a search status of the unique classification value and an alphanumeric indicator relating to a search extent of the unique classification value. 10. A system according to claim 1 wherein the classification analysis module assigns a color to be displayed on a user interface relating to the search indicator. 11. A system according to claim 1 wherein the computer is a server and the system further comprises a client computer, the server communicatively coupled to the client computer; and wherein the program module is located on the client computer and the classification analysis module is located on the server. 12. A system according to claim 7 wherein each of the unique classification values are grouped by adding the scores of each of the unique classification values after being replaced; wherein the grouped unique classification values are sorted according to the scores; and wherein the sorted grouped unique classification values are displayed on the table. 13. A method of searching through a plurality of documents that are organized using a classification system to define each of the plurality of documents as a classified document, the plurality of classified documents being searched based on a predetermined subject matter, the method comprising:
determining record classifications that are relevant to the subject matter of the search using a program module stored on at least one of a computer readable medium and a memory of a computer, the program module comprising instructions executable by a processor of the computer to determine document classifications; receiving a set of documents, the set of documents including at least one document, each document in the set of documents having a relevancy indicator and at least one classification value, each classification value being defined as a unique classification value; determining a score of each of the unique classification values appearing in the at least one document in the set of documents, the score being defined as a frequency of occurrence of each of the unique classification values appearing in the at least one document; determining a search indicator for each of the unique classification values, the search indicator providing an indication of a level to which each of the unique classification values has been previously searched; and generating and displaying a table of each of the unique classification values along with at least one of the score of each of the unique classification values and the search indicator for each of the unique classification values. 14. A method according to claim 13 further comprising sorting the table based on the score of each of the unique classification values. 15. A method according to claim 13 further comprising assigning a predetermined value to each of the unique classification values that corresponds to a weight of each of the unique classification values to define a weighted classification value; and wherein the weighted classification value is used to modify the score. 16. A method according to claim 13 further comprising assigning a predetermined value to each of the unique classification values relating to a document located in the search that is determined to be a relevant document that corresponds to a weight of each of the unique classification values to define a weighted classification value, and wherein the weighted classification value is used to modify the score. 17. A method according to claim 13 further comprising assigning a predetermined value to each of the unique classification values relating to a document located in the search that corresponds to a weight of each of the unique classification values to define a weighted classification value based on the number of documents located in the classification, and wherein the weighted classification value is used to modify the score. 18. A method according to claim 13 further comprising separating the unique classification values to display only the unique classification values of those documents located in the search that were determined to be relevant. 19. A method according to claim 13 further comprising organizing each of the unique classification values in a hierarchy providing each of the unique classification values with at least one ancestor node; and further comprising replacing each of the unique classification values with the at least one ancestor node. 20. A method according to claim 13 wherein each of the unique classification values includes a class value and a subclass value; and further comprising replacing each of the unique classification values with the class value. 21. A method according to claim 13 further comprising determining the search indicator for each unique classification value by receiving both an alphanumeric indicator relating to a search status of the unique classification value and an alphanumeric indicator relating to a search extend of the unique classification value. 22. A method according to claim 13 further comprising assigning a color to be displayed on a user interface relating to the search indicator. 23. A method according to claim 19 further comprising grouping each of the unique classification values by adding the scores of each of the unique classification values after being replaced; sorting the grouped unique classification values according to the scores; and displaying the sorted grouped unique classification values on the table. 24. A method of searching through a plurality of documents that are organized using a classification system to define each of the plurality of documents as a classified document, the plurality of classified documents being searched based on a predetermined subject matter, the method comprising:
determining record classifications that are relevant to the subject matter of the search using a program module stored on at least one of a computer readable medium and a memory of a computer, the program module comprising instructions executable by a processor of the computer to determine document classifications; receiving a set of documents, the set of documents including at least one document, each document in the set of documents having a relevancy indicator and at least one classification value, each classification value being defined as a unique classification value; determining a score of each of the unique classification values appearing in the at least one document in the set of documents, the score being defined as a frequency of occurrence of each of the unique classification values appearing in the at least one document; determining a search indicator for each of the unique classification values, the search indicator providing an indication of a level to which each of the unique classification values has been previously searched, wherein the search indicator is determined by receiving both an alphanumeric indicator relating to a search status of the unique classification value and an alphanumeric indicator relating to a search extend of the unique classification value; generating and displaying a table of each of the unique classification values along with at least one of the score of each of the unique classification values and the search indicator for each of the unique classification values; and assigning a color to be displayed on a user interface relating to the search indicator. 25. A method according to claim 24 further comprising sorting the table based on the score of each of the unique classification values. 26. A method according to claim 24 further comprising assigning a predetermined value to each of the unique classification values that corresponds to a weight of each of the unique classification values to define a weighted classification value; and wherein the weighted classification value is used to modify the score. 27. A method according to claim 24 further comprising assigning a predetermined value to each of the unique classification values relating to a document located in the search that is determined to be a relevant document that corresponds to a weight of each of the unique classification values to define a weighted classification value, and wherein the weighted classification value is used to modify the score. 28. A method according to claim 24 further comprising assigning a predetermined value to each of the unique classification values relating to a document located in the search that corresponds to a weight of each of the unique classification values to define a weighted classification value based on the number of documents located in the classification, and wherein the weighted classification value is used to modify the score. 29. A method according to claim 24 further comprising separating the unique classification values to display only the unique classification values of those documents located in the search that were determined to be relevant. 30. A method according to claim 24 further comprising organizing each of the unique classification values in a hierarchy providing each of the unique classification values with at least one ancestor node; and further comprising replacing each of the unique classification values with the at least one ancestor node. 31. A method according to claim 24 wherein each of the unique classification values includes a class value and a subclass value; and further comprising replacing each of the unique classification values with the class value. 32. A method according to claim 30 further comprising grouping each of the unique classification values by adding the scores of each of the unique classification values after being replaced; sorting the grouped unique classification values according to the scores; and displaying the sorted grouped unique classification values on the table. 33. A system according to claim 8 wherein each of the unique classification values are grouped by adding the scores of each of the unique classification values after being replaced; wherein the grouped unique classification values are sorted according to the scores; and wherein the sorted grouped unique classification values are displayed on the table. 34. A method according to claim 20 further comprising grouping each of the unique classification values by adding the scores of each of the unique classification values after being replaced; sorting the grouped unique classification values according to the scores; and displaying the sorted grouped unique classification values on the table. 35. A method according to claim 31 further comprising grouping each of the unique classification values by adding the scores of each of the unique classification values after being replaced; sorting the grouped unique classification values according to the scores; and displaying the sorted grouped unique classification values on the table. | 2,100 |
5,367 | 5,367 | 13,733,207 | 2,169 | Tagging a resource in a network with a tag belonging to a tag type includes creating, using a processor, a tag and relating the tag to the resource, categorizing the tag into a tag type, registering the tag type in a registry, associating tag type attributes to the tag type, associating a subset of the tag type attributes of the tag type to the tag, and associating a tag type attribute value to each member of the subset of the tag type attributes of the tag. The tag, the tag type, the subset of tag type attributes of the tag, and associated tag type attribute values are stored. Using the processor, a dynamically linkable executable program logic is triggered based on the subset of tag type attributes and the tag type attribute values. | 1. A method of tagging a resource in a network with a tag belonging to a tag type, the method comprising:
creating, using a processor, a tag and relating the tag to the resource; categorizing the tag into a tag type; registering the tag type in a registry; associating tag type attributes to the tag type; associating a subset of the tag type attributes of the tag type to the tag; associating a tag type attribute value to each member of the subset of the tag type attributes of the tag; storing the tag, the tag type, the subset of tag type attributes of the tag, and associated tag type attribute values; and triggering, using the processor, a dynamically linkable executable program logic based on the subset of tag type attributes and the tag type attribute values. 2. The method according to claim 1, wherein an execution of the linkable executable program logic is controlled by the tag type attribute values. 3. The method according to claim 1, wherein at least one of the tag types is a premium tag type which usage as a tag triggers a function in a billing system. 4. The method according to claim 1, further comprising:
displaying an aggregated view of tags, such that display attribute values of the subset of tag type attributes influence at least one of the aggregated view of a subset of the tags or an individual view of the tag. 5. The method according to claim 1, further comprising:
creating the tag type before or during the creation of the tag. 6. The method according to claim 1, further comprising:
receiving tag types via the network. 7. The method according to claim 1, further comprising:
receiving the dynamically linkable executable program logic via the network. 8. The method according to claim 5, wherein the creation of the tag type comprises comparing a newly created tag type with a predefined list of tag types. 9. The method according to claim 5, wherein the creation of the tag type comprises blocking the creating of a new tag type based on the comparison. 10. The method according to claim 5, further comprising:
triggering an action when activating a tag based on the tag type attribute values and the dynamically linkable executable program logic. 11. A system for tagging a resource in a network with a tag belonging to a tag type, the system comprising:
a processor programmed to initiate executable operations comprising: creating a tag and relating the tag to the resource; categorizing the tag into a tag type; registering the tag type in a registry; associating tag type attributes to the tag type; associating a subset of the tag type attributes of the tag type to the tag; associating a tag type attribute value to each member of the subset of the tag type attributes of the tag; storing the tag, the tag type, the subset of tag type attributes of the tag, and associated tag type attribute values; and triggering a dynamically linkable executable program logic based on the subset of tag type attributes and the tag type attribute values. 12. The system according to claim 11, wherein an execution of the linkable executable program logic is controlled by the tag type attribute values. 13. The system according to claim 11, wherein at least one of the tag types is a premium tag type which usage as a tag triggers a function in a billing system. 14. The system according to claim 11, wherein the processor is further programmed to initiate an executable operation comprising:
displaying an aggregated view of tags, such that display attribute values of the subset of tag type attributes influence at least one of the aggregated view of a subset of the tags or an individual view of the tag. 15. The system according to claim 11, wherein the processor is further programmed to initiate an executable operation comprising:
creating the tag type before or during the creation of the tag. 16. The system according to claim 11, wherein the processor is further programmed to initiate an executable operation comprising:
receiving tag types via the network. 17. The system according to claim 11, wherein the processor is further programmed to initiate an executable operation comprising:
receiving the dynamically linkable executable program logic via the network. 18. The system according to claim 15, wherein the creation of the tag type comprises comparing a newly created tag type with a predefined list of tag types. 19. The system according to claim 15, wherein the creation of the tag type comprises blocking the creating of a new tag type based on the comparison. 20. The system according to claim 15, wherein the processor is further programmed to initiate an executable operation comprising:
triggering an action when activating a tag based on the tag type attribute values and the dynamically linkable executable program logic. 21. A computer program product for tagging a resource in a network with a tag belonging to a tag type, the computer program product comprising a computer readable storage medium having program code stored thereon, the program code executable by a processor to perform a method comprising:
creating, using the processor, a tag and relating the tag to the resource; categorizing, using the processor, the tag into a tag type; registering, using the processor, the tag type in a registry; associating, using the processor, tag type attributes to the tag type; associating, using the processor, a subset of the tag type attributes of the tag type to the tag; associating, using the processor, a tag type attribute value to each member of the subset of the tag type attributes of the tag; storing, using the processor, the tag, the tag type, the subset of tag type attributes of the tag, and associated tag type attribute values; and triggering, using the processor, a dynamically linkable executable program logic based on the subset of tag type attributes and the tag type attribute values. 22. The computer program product according to claim 21, wherein an execution of the linkable executable program logic is controlled by the tag type attribute values. 23. The computer program product according to claim 21, wherein at least one of the tag types is a premium tag type which usage as a tag triggers a function in a billing system. 24. The computer program product according to claim 21, wherein the method further comprises:
displaying an aggregated view of tags, such that display attribute values of the subset of tag type attributes influence at least one of the aggregated view of a subset of the tags or an individual view of the tag. 25. The computer program product according to claim 21, wherein the method further comprises:
creating the tag type before or during the creation of the tag. | Tagging a resource in a network with a tag belonging to a tag type includes creating, using a processor, a tag and relating the tag to the resource, categorizing the tag into a tag type, registering the tag type in a registry, associating tag type attributes to the tag type, associating a subset of the tag type attributes of the tag type to the tag, and associating a tag type attribute value to each member of the subset of the tag type attributes of the tag. The tag, the tag type, the subset of tag type attributes of the tag, and associated tag type attribute values are stored. Using the processor, a dynamically linkable executable program logic is triggered based on the subset of tag type attributes and the tag type attribute values.1. A method of tagging a resource in a network with a tag belonging to a tag type, the method comprising:
creating, using a processor, a tag and relating the tag to the resource; categorizing the tag into a tag type; registering the tag type in a registry; associating tag type attributes to the tag type; associating a subset of the tag type attributes of the tag type to the tag; associating a tag type attribute value to each member of the subset of the tag type attributes of the tag; storing the tag, the tag type, the subset of tag type attributes of the tag, and associated tag type attribute values; and triggering, using the processor, a dynamically linkable executable program logic based on the subset of tag type attributes and the tag type attribute values. 2. The method according to claim 1, wherein an execution of the linkable executable program logic is controlled by the tag type attribute values. 3. The method according to claim 1, wherein at least one of the tag types is a premium tag type which usage as a tag triggers a function in a billing system. 4. The method according to claim 1, further comprising:
displaying an aggregated view of tags, such that display attribute values of the subset of tag type attributes influence at least one of the aggregated view of a subset of the tags or an individual view of the tag. 5. The method according to claim 1, further comprising:
creating the tag type before or during the creation of the tag. 6. The method according to claim 1, further comprising:
receiving tag types via the network. 7. The method according to claim 1, further comprising:
receiving the dynamically linkable executable program logic via the network. 8. The method according to claim 5, wherein the creation of the tag type comprises comparing a newly created tag type with a predefined list of tag types. 9. The method according to claim 5, wherein the creation of the tag type comprises blocking the creating of a new tag type based on the comparison. 10. The method according to claim 5, further comprising:
triggering an action when activating a tag based on the tag type attribute values and the dynamically linkable executable program logic. 11. A system for tagging a resource in a network with a tag belonging to a tag type, the system comprising:
a processor programmed to initiate executable operations comprising: creating a tag and relating the tag to the resource; categorizing the tag into a tag type; registering the tag type in a registry; associating tag type attributes to the tag type; associating a subset of the tag type attributes of the tag type to the tag; associating a tag type attribute value to each member of the subset of the tag type attributes of the tag; storing the tag, the tag type, the subset of tag type attributes of the tag, and associated tag type attribute values; and triggering a dynamically linkable executable program logic based on the subset of tag type attributes and the tag type attribute values. 12. The system according to claim 11, wherein an execution of the linkable executable program logic is controlled by the tag type attribute values. 13. The system according to claim 11, wherein at least one of the tag types is a premium tag type which usage as a tag triggers a function in a billing system. 14. The system according to claim 11, wherein the processor is further programmed to initiate an executable operation comprising:
displaying an aggregated view of tags, such that display attribute values of the subset of tag type attributes influence at least one of the aggregated view of a subset of the tags or an individual view of the tag. 15. The system according to claim 11, wherein the processor is further programmed to initiate an executable operation comprising:
creating the tag type before or during the creation of the tag. 16. The system according to claim 11, wherein the processor is further programmed to initiate an executable operation comprising:
receiving tag types via the network. 17. The system according to claim 11, wherein the processor is further programmed to initiate an executable operation comprising:
receiving the dynamically linkable executable program logic via the network. 18. The system according to claim 15, wherein the creation of the tag type comprises comparing a newly created tag type with a predefined list of tag types. 19. The system according to claim 15, wherein the creation of the tag type comprises blocking the creating of a new tag type based on the comparison. 20. The system according to claim 15, wherein the processor is further programmed to initiate an executable operation comprising:
triggering an action when activating a tag based on the tag type attribute values and the dynamically linkable executable program logic. 21. A computer program product for tagging a resource in a network with a tag belonging to a tag type, the computer program product comprising a computer readable storage medium having program code stored thereon, the program code executable by a processor to perform a method comprising:
creating, using the processor, a tag and relating the tag to the resource; categorizing, using the processor, the tag into a tag type; registering, using the processor, the tag type in a registry; associating, using the processor, tag type attributes to the tag type; associating, using the processor, a subset of the tag type attributes of the tag type to the tag; associating, using the processor, a tag type attribute value to each member of the subset of the tag type attributes of the tag; storing, using the processor, the tag, the tag type, the subset of tag type attributes of the tag, and associated tag type attribute values; and triggering, using the processor, a dynamically linkable executable program logic based on the subset of tag type attributes and the tag type attribute values. 22. The computer program product according to claim 21, wherein an execution of the linkable executable program logic is controlled by the tag type attribute values. 23. The computer program product according to claim 21, wherein at least one of the tag types is a premium tag type which usage as a tag triggers a function in a billing system. 24. The computer program product according to claim 21, wherein the method further comprises:
displaying an aggregated view of tags, such that display attribute values of the subset of tag type attributes influence at least one of the aggregated view of a subset of the tags or an individual view of the tag. 25. The computer program product according to claim 21, wherein the method further comprises:
creating the tag type before or during the creation of the tag. | 2,100 |
5,368 | 5,368 | 13,928,372 | 2,171 | A computing device implemented method includes recording, in response to an initial user activation event, a first path of a first portion of a direction-specific symbolic swipe gesture. In response to a pause in the direction-specific symbolic swipe gesture, a selected number of possible symbolic gestures are displayed based on the recorded first path that reveal system commands that map to the symbolic gestures. A second path of a second portion of the direction-specific symbolic swipe gesture is recorded. In response to the recorded first and second paths of the direction-specific symbolic swipe gesture and a trigger, a first system command is accessed that maps to the first direction-specific gesture. | 1. A computer readable storage medium storing computer-executable instructions for controlling a computing device to perform a method comprising:
recording, in response to an initial user activation event, a first path of a first portion of a direction-specific symbolic swipe gesture; displaying, in response to a pause in the direction-specific symbolic swipe gesture, a selected number of possible symbolic gestures based on the recorded first path that reveal system commands that map to the symbolic gestures; recording a second path of a second portion of the direction-specific symbolic swipe gesture; and accessing, in response to the recorded first and second paths of the direction-specific symbolic swipe gesture and a trigger, a first system command that maps to the first direction-specific gesture. 2. The computer readable storage medium of claim 1, the method comprising:
executing the accessed first system command. 3. The computer readable storage medium of claim 1, wherein the direction-specific symbolic swipe gesture includes a curve. 4. The computer readable storage medium of claim 1, the method comprising:
calculating the selected number of possible symbolic gestures based on the recorded first path and gestures that align with the record first path. 5. The computer readable storage medium of claim 1, the method comprising:
calculating the selected number of possible symbolic gestures based on the recorded first path and gestures that are most used by a user. 6. The computer readable storage medium of claim 1, the method comprising:
receiving the initial user activation event, the initial user activation event produced from one of: a digit of a hand of a user, a keyboard chord, a keyboard hot key, a stylus, and an action of a pointing device. 7. The computer readable storage medium of claim 1, the method comprising:
recording a third path of a third portion of the direction-specific symbolic swipe gesture; and accessing, in response to the recorded first, second, and third paths of the direction-specific symbolic swipe gesture and the trigger, the first system command that maps to the first direction-specific gesture. 8. A computing device implemented method comprising:
recording, in response to an initial user activation event, a first path of a first portion of a direction-specific symbolic swipe gesture; displaying, in response to a pause in the direction-specific symbolic swipe gesture, a selected number of possible symbolic gestures based on the recorded first path that reveal system commands that map to the symbolic gestures; recording a second path of a second portion of the direction-specific symbolic swipe gesture; and accessing, in response to the recorded first and second paths of the direction-specific symbolic swipe gesture and a trigger, a first system command that maps to the first direction-specific gesture. 9. The method of claim 8 comprising:
executing the accessed first system command. 10. The method of claim 8, wherein the direction-specific symbolic swipe gesture includes a curve. 11. The method of claim 8 comprising:
receiving the first and second portions of the direction-specific symbolic swipe gesture produced from one of: a digit of a hand of a user, a stylus, and an action of a pointing device. 12. The method of claim 11 comprising:
producing the trigger in response to one of the digit being lifted from a touchscreen, the stylus being lifted from a touchscreen, and a second action of the pointing device. 13. The method of claim 8 comprising:
receiving the initial user activation event. 14. The method of claim 13, wherein the initial user activation event is produced from a digit of a hand of a user. 15. The method of claim 13, wherein the initial user activation event is produced from one of: a keyboard chord, a keyboard hot key, a stylus, and an action of a pointing device. 16. The method of claim 8 comprising:
receiving the first and second portions of the direction-specific symbolic swipe gesture produced from a digit of a hand of a user; and
producing the trigger in response to the digit being lifted from a touchscreen. 17. A computing device implemented method comprising:
receiving an initial user activation event; receiving a first portion of a direction-specific symbolic swipe gesture, the direction-specific symbolic swipe gesture including a curve; recording, in response to the initial user activation event, a first path of the first portion of the direction-specific symbolic swipe gesture; displaying, in response to a pause in the direction-specific symbolic swipe gesture, a selected number of possible symbolic gestures based on the recorded first path that reveal system commands that map to the symbolic gestures; receiving a second portion of the direction-specific symbolic swipe gesture; recording a second path of the second portion of the direction-specific symbolic swipe gesture; and accessing, in response to the recorded first and second paths of the direction-specific symbolic swipe gesture and a trigger, a first system command that maps to the first direction-specific gesture. 18. The method of claim 17 comprising:
executing the accessed first system command. 19. The method of claim 17, wherein the first and second portions of the direction-specific symbolic swipe gesture are produced from a digit of a first hand of the user, and the initial user activation event is produced from a digit of a second hand of the user. 20. The method of claim 17, wherein the initial user activation event is produced from one of: a digit of a second hand of the user, a keyboard chord, a keyboard hot key, a stylus, and an action of a pointing device. | A computing device implemented method includes recording, in response to an initial user activation event, a first path of a first portion of a direction-specific symbolic swipe gesture. In response to a pause in the direction-specific symbolic swipe gesture, a selected number of possible symbolic gestures are displayed based on the recorded first path that reveal system commands that map to the symbolic gestures. A second path of a second portion of the direction-specific symbolic swipe gesture is recorded. In response to the recorded first and second paths of the direction-specific symbolic swipe gesture and a trigger, a first system command is accessed that maps to the first direction-specific gesture.1. A computer readable storage medium storing computer-executable instructions for controlling a computing device to perform a method comprising:
recording, in response to an initial user activation event, a first path of a first portion of a direction-specific symbolic swipe gesture; displaying, in response to a pause in the direction-specific symbolic swipe gesture, a selected number of possible symbolic gestures based on the recorded first path that reveal system commands that map to the symbolic gestures; recording a second path of a second portion of the direction-specific symbolic swipe gesture; and accessing, in response to the recorded first and second paths of the direction-specific symbolic swipe gesture and a trigger, a first system command that maps to the first direction-specific gesture. 2. The computer readable storage medium of claim 1, the method comprising:
executing the accessed first system command. 3. The computer readable storage medium of claim 1, wherein the direction-specific symbolic swipe gesture includes a curve. 4. The computer readable storage medium of claim 1, the method comprising:
calculating the selected number of possible symbolic gestures based on the recorded first path and gestures that align with the record first path. 5. The computer readable storage medium of claim 1, the method comprising:
calculating the selected number of possible symbolic gestures based on the recorded first path and gestures that are most used by a user. 6. The computer readable storage medium of claim 1, the method comprising:
receiving the initial user activation event, the initial user activation event produced from one of: a digit of a hand of a user, a keyboard chord, a keyboard hot key, a stylus, and an action of a pointing device. 7. The computer readable storage medium of claim 1, the method comprising:
recording a third path of a third portion of the direction-specific symbolic swipe gesture; and accessing, in response to the recorded first, second, and third paths of the direction-specific symbolic swipe gesture and the trigger, the first system command that maps to the first direction-specific gesture. 8. A computing device implemented method comprising:
recording, in response to an initial user activation event, a first path of a first portion of a direction-specific symbolic swipe gesture; displaying, in response to a pause in the direction-specific symbolic swipe gesture, a selected number of possible symbolic gestures based on the recorded first path that reveal system commands that map to the symbolic gestures; recording a second path of a second portion of the direction-specific symbolic swipe gesture; and accessing, in response to the recorded first and second paths of the direction-specific symbolic swipe gesture and a trigger, a first system command that maps to the first direction-specific gesture. 9. The method of claim 8 comprising:
executing the accessed first system command. 10. The method of claim 8, wherein the direction-specific symbolic swipe gesture includes a curve. 11. The method of claim 8 comprising:
receiving the first and second portions of the direction-specific symbolic swipe gesture produced from one of: a digit of a hand of a user, a stylus, and an action of a pointing device. 12. The method of claim 11 comprising:
producing the trigger in response to one of the digit being lifted from a touchscreen, the stylus being lifted from a touchscreen, and a second action of the pointing device. 13. The method of claim 8 comprising:
receiving the initial user activation event. 14. The method of claim 13, wherein the initial user activation event is produced from a digit of a hand of a user. 15. The method of claim 13, wherein the initial user activation event is produced from one of: a keyboard chord, a keyboard hot key, a stylus, and an action of a pointing device. 16. The method of claim 8 comprising:
receiving the first and second portions of the direction-specific symbolic swipe gesture produced from a digit of a hand of a user; and
producing the trigger in response to the digit being lifted from a touchscreen. 17. A computing device implemented method comprising:
receiving an initial user activation event; receiving a first portion of a direction-specific symbolic swipe gesture, the direction-specific symbolic swipe gesture including a curve; recording, in response to the initial user activation event, a first path of the first portion of the direction-specific symbolic swipe gesture; displaying, in response to a pause in the direction-specific symbolic swipe gesture, a selected number of possible symbolic gestures based on the recorded first path that reveal system commands that map to the symbolic gestures; receiving a second portion of the direction-specific symbolic swipe gesture; recording a second path of the second portion of the direction-specific symbolic swipe gesture; and accessing, in response to the recorded first and second paths of the direction-specific symbolic swipe gesture and a trigger, a first system command that maps to the first direction-specific gesture. 18. The method of claim 17 comprising:
executing the accessed first system command. 19. The method of claim 17, wherein the first and second portions of the direction-specific symbolic swipe gesture are produced from a digit of a first hand of the user, and the initial user activation event is produced from a digit of a second hand of the user. 20. The method of claim 17, wherein the initial user activation event is produced from one of: a digit of a second hand of the user, a keyboard chord, a keyboard hot key, a stylus, and an action of a pointing device. | 2,100 |
5,369 | 5,369 | 15,184,181 | 2,185 | Coherency driven enhancements to a PCIe transaction layer are disclosed. In an exemplary aspect, a coherency agent is added to a PCIe system to support a relaxed consistency model for use of memory therein. In particular, endpoints can request ownership of portions of the memory to read from and write to the memory. The coherency agent assigns an address range including the requested portions. The requesting endpoint copies the contents of the memory corresponding to the assigned address range into local endpoint memory to perform read and write operations locally. The owning endpoint may provide an updated snapshot of the copied memory contents upon request. At completion of use of the copied memory contents, or upon request from the coherency agent, ownership of the address range reverts back to the root complex, and the endpoint sends the updated contents back to the address range in the system memory element. | 1. A method for controlling a host memory in a Peripheral Component Interconnect (PCI) express (PCIe) system, comprising:
receiving, at a root complex of a host associated with a host memory in the host, a request from a first endpoint for access to a first portion of data stored in the host memory; requesting, to a coherency agent of the host, an ownership of an address range associated with the first portion of the data from the host; assigning, by the coherency agent, the ownership of the address range from the host to the first endpoint; providing data associated with the address range to the first endpoint; and receiving, from the first endpoint, modified data associated with the address range when the ownership of the address range returns to the host. 2. The method of claim 1, further comprising storing, in the host memory, the modified data associated with the address range. 3. The method of claim 1, further comprising requesting, to the first endpoint, returning the ownership of the address range to the host, prior to receiving, from the first endpoint, the modified data associated with the address range. 4. The method of claim 1, further comprising receiving, at the root complex, the ownership of the address range from the first endpoint and returning the ownership of the address range to the host after receiving, from the first endpoint, the modified data associated with the address range. 5. The method of claim 1, further comprising:
receiving, at the root complex, a request from a second endpoint to read a second portion of the data stored in the host memory, the second portion of the data associated with the address range; requesting, to the first endpoint, a snapshot of the data associated with the address range; and providing, to the second endpoint, the snapshot of the data associated with the address range. 6. The method of claim 1, further comprising:
receiving, at the root complex, a request from a second endpoint for access to a second portion of the data stored in the host memory, the second portion of the data associated with the address range; requesting, to the coherency agent, the ownership of the address range from the first endpoint; requesting, to the first endpoint, returning the ownership of the address range to the host; assigning, by the coherency agent, the ownership of the address range from the first endpoint to the second endpoint, after receiving, from the first endpoint, the modified data associated with the address range; and providing, to the second endpoint, the data associated with the address range. 7. A host system of a Peripheral Component Interconnect (PCI) express (PCIe) system, comprising:
a PCIe bus interface configured to be coupled to at least a first endpoint and a second endpoint through a PCIe bus; host memory comprising data stored therein, at least a first portion of the data and a second portion of the data associated with an address range; a root complex associated with the host memory, configured to receive a request for ownership of the first portion of the data associated with the address range from the first endpoint from the PCIe bus; and a coherency agent configured to control ownership of the address range. 8. The host system of claim 7, wherein the root complex is further configured to:
request, to the coherency agent, the ownership of the address range associated with the first portion of the data from the host system; provide the data associated with the address range to the first endpoint; the coherency agent further configured to assign the ownership of the address range from the host system to the first endpoint; and store, in the host memory, modified data associated with the address range. 9. The host system of claim 8, wherein the root complex is further configured to:
provide the data associated with the address range to the first endpoint; and receive, from the first endpoint, the modified data associated with the address range when the ownership of the address range returns to the host system. 10. The host system of claim 9, wherein the root complex is further configured to store, in the host memory, the modified data associated with the address range. 11. The host system of claim 9, wherein the root complex is further configured to request, to the first endpoint, returning the ownership of the address range to the host system, prior to receiving, from the first endpoint, the modified data associated with the address range. 12. The host system of claim 9, wherein the root complex is further configured to receive, from the first endpoint, the ownership of the address range and return the ownership of the address range to the host system after receiving, from the first endpoint, the modified data associated with the address range. 13. The host system of claim 9, wherein the root complex is further configured to:
receive, from the second endpoint, a request to read the second portion of the data stored in the host memory; request, to the first endpoint, a snapshot of the data associated with the address range; and provide, to the second endpoint, the snapshot of the data associated with the address range. 14. The host system of claim 9, wherein the root complex is further configured to:
receive, from the second endpoint, a request for access to the second portion of the data stored in the host memory; request, to the coherency agent, the ownership of the address range from the first endpoint; request, to the first endpoint, returning the ownership of the address range to the host system; and provide, to the second endpoint, the data associated with the address range; the coherency agent further configured to assign the ownership of the address range from the first endpoint to the second endpoint, after receiving, from the first endpoint, the modified data associated with the address range. 15. The host system of claim 7 integrated into an integrated circuit (IC). 16. The host system of claim 7 integrated into a device selected from the group consisting of: a set top box; an entertainment unit; a navigation device; a communications device; a fixed location data unit; a mobile location data unit; a mobile phone; a cellular phone; a smart phone; a tablet; a phablet; a server; a computer; a portable computer; a desktop computer; a personal digital assistant (PDA); a monitor; a computer monitor; a television; a tuner; a radio; a satellite radio; a music player; a digital music player; a portable music player; a digital video player; a video player; a digital video disc (DVD) player; a portable digital video player; and an automobile. 17. A method for managing data in an endpoint of a Peripheral Component Interconnect (PCI) express (PCIe) system, comprising:
requesting, by a first endpoint to a root complex associated with a host memory, access to a portion of data stored in the host memory; receiving, from the root complex, data associated with an address range and ownership of the address range; storing, at a local memory of the first endpoint, the data associated with the address range; and providing, to the root complex, modified data associated with the address range in response to the ownership of the address range returning to a host system. 18. The method of claim 17, further comprising providing the modified data associated with the address range in response to receiving, from the root complex, a request to return the ownership of the address range to the host system. 19. The method of claim 17, further comprising returning, by the first endpoint, the ownership of the address range to the host system after providing, to the root complex, the modified data associated with the address range. 20. The method of claim 17, further comprising:
receiving, at the first endpoint, a request from the root complex from a second endpoint for a snapshot of the data associated with the address range; and providing, to the second endpoint, the snapshot of the data associated with the address range. 21. The method of claim 17, further comprising:
receiving, at the first endpoint, a request to return the ownership of the address range to the host system; providing, to the root complex, the data associated with the address range; and returning, by the first endpoint, the ownership of the address range to the host system. 22. An endpoint of a Peripheral Component Interconnect (PCI) express (PCIe) system, comprising:
a local memory; and processing circuitry, coupled to the local memory, and configured to:
request, to a root complex associated with a host memory of a PCIe system, access to a portion of data stored in the host memory;
receive, from the root complex, data associated with an address range and ownership of the address range;
store, at the local memory of the endpoint, the data associated with the address range; and
provide, to the root complex, modified data associated with the address range in response to the ownership of the address range returning to the PCIe system. 23. The endpoint of claim 22, wherein the processing circuitry is further configured to provide the modified data associated with the address range in response to receiving, from the root complex, a request to return the ownership of the address range to the PCIe system. 24. The endpoint of claim 22, wherein the processing circuitry is further configured to return the ownership of the address range to the PCIe system after providing, to the root complex, the modified data associated with the address range. 25. The endpoint of claim 22, wherein the processing circuitry is further configured to:
provide, to a second endpoint, a snapshot of the data associated with the address range in response to receiving from the root complex a request from the second endpoint for the snapshot of the data associated with the address range. 26. The endpoint of claim 22, wherein the processing circuitry is further configured to:
provide, to the root complex, the data associated with the address range and return, to the PCIe system, the ownership of the address range in response to receiving a request to return the ownership of the address range to the PCIe system. 27. A host system of a Peripheral Component Interconnect (PCI) express (PCIe) system, comprising:
a means for interfacing with at least a first endpoint and a second endpoint through a PCIe bus; a means for storing data, at least a first portion of the data and a second portion of the data associated with an address range; a means for processing data ownership requests for the data stored in the means for storing data, configured to receive a request for ownership of the first portion of the data associated with the address range from the first endpoint from the PCIe bus; and a means for controlling memory, configured to control ownership of the address range. 28. The host system of claim 27, wherein the means for processing data ownership requests is further configured to:
request, to the means for controlling memory, the ownership of the address range associated with the first portion of the data from the host system; provide the data associated with the address range to the first endpoint; the means for controlling memory, further configured to assign the ownership of the address range from the host system to the first endpoint; and store, in the means for storing data, modified data associated with the address range. 29. A Peripheral Component Interconnect (PCI) express (PCIe) system, comprising:
a host system comprising:
a PCIe bus interface configured to be coupled to at least an endpoint of a PCIe system through a PCIe bus;
host memory comprising data stored therein, at least a portion of the data associated with an address range;
a root complex associated with the host memory, configured to receive a request for ownership of the portion of the data associated with the address range from the endpoint from the PCIe bus; and
a coherency agent configured to control ownership of the address range; and
the endpoint comprising a local memory and processing circuitry configured to:
request, to the root complex, access to the portion of the data stored in the host memory;
receive, from the root complex, the data associated with the address range and the ownership of the address range;
store, at the local memory, the data associated with the address range; and
provide, to the root complex, modified data associated with the address range in response to the ownership of the address range returning to the host system. | Coherency driven enhancements to a PCIe transaction layer are disclosed. In an exemplary aspect, a coherency agent is added to a PCIe system to support a relaxed consistency model for use of memory therein. In particular, endpoints can request ownership of portions of the memory to read from and write to the memory. The coherency agent assigns an address range including the requested portions. The requesting endpoint copies the contents of the memory corresponding to the assigned address range into local endpoint memory to perform read and write operations locally. The owning endpoint may provide an updated snapshot of the copied memory contents upon request. At completion of use of the copied memory contents, or upon request from the coherency agent, ownership of the address range reverts back to the root complex, and the endpoint sends the updated contents back to the address range in the system memory element.1. A method for controlling a host memory in a Peripheral Component Interconnect (PCI) express (PCIe) system, comprising:
receiving, at a root complex of a host associated with a host memory in the host, a request from a first endpoint for access to a first portion of data stored in the host memory; requesting, to a coherency agent of the host, an ownership of an address range associated with the first portion of the data from the host; assigning, by the coherency agent, the ownership of the address range from the host to the first endpoint; providing data associated with the address range to the first endpoint; and receiving, from the first endpoint, modified data associated with the address range when the ownership of the address range returns to the host. 2. The method of claim 1, further comprising storing, in the host memory, the modified data associated with the address range. 3. The method of claim 1, further comprising requesting, to the first endpoint, returning the ownership of the address range to the host, prior to receiving, from the first endpoint, the modified data associated with the address range. 4. The method of claim 1, further comprising receiving, at the root complex, the ownership of the address range from the first endpoint and returning the ownership of the address range to the host after receiving, from the first endpoint, the modified data associated with the address range. 5. The method of claim 1, further comprising:
receiving, at the root complex, a request from a second endpoint to read a second portion of the data stored in the host memory, the second portion of the data associated with the address range; requesting, to the first endpoint, a snapshot of the data associated with the address range; and providing, to the second endpoint, the snapshot of the data associated with the address range. 6. The method of claim 1, further comprising:
receiving, at the root complex, a request from a second endpoint for access to a second portion of the data stored in the host memory, the second portion of the data associated with the address range; requesting, to the coherency agent, the ownership of the address range from the first endpoint; requesting, to the first endpoint, returning the ownership of the address range to the host; assigning, by the coherency agent, the ownership of the address range from the first endpoint to the second endpoint, after receiving, from the first endpoint, the modified data associated with the address range; and providing, to the second endpoint, the data associated with the address range. 7. A host system of a Peripheral Component Interconnect (PCI) express (PCIe) system, comprising:
a PCIe bus interface configured to be coupled to at least a first endpoint and a second endpoint through a PCIe bus; host memory comprising data stored therein, at least a first portion of the data and a second portion of the data associated with an address range; a root complex associated with the host memory, configured to receive a request for ownership of the first portion of the data associated with the address range from the first endpoint from the PCIe bus; and a coherency agent configured to control ownership of the address range. 8. The host system of claim 7, wherein the root complex is further configured to:
request, to the coherency agent, the ownership of the address range associated with the first portion of the data from the host system; provide the data associated with the address range to the first endpoint; the coherency agent further configured to assign the ownership of the address range from the host system to the first endpoint; and store, in the host memory, modified data associated with the address range. 9. The host system of claim 8, wherein the root complex is further configured to:
provide the data associated with the address range to the first endpoint; and receive, from the first endpoint, the modified data associated with the address range when the ownership of the address range returns to the host system. 10. The host system of claim 9, wherein the root complex is further configured to store, in the host memory, the modified data associated with the address range. 11. The host system of claim 9, wherein the root complex is further configured to request, to the first endpoint, returning the ownership of the address range to the host system, prior to receiving, from the first endpoint, the modified data associated with the address range. 12. The host system of claim 9, wherein the root complex is further configured to receive, from the first endpoint, the ownership of the address range and return the ownership of the address range to the host system after receiving, from the first endpoint, the modified data associated with the address range. 13. The host system of claim 9, wherein the root complex is further configured to:
receive, from the second endpoint, a request to read the second portion of the data stored in the host memory; request, to the first endpoint, a snapshot of the data associated with the address range; and provide, to the second endpoint, the snapshot of the data associated with the address range. 14. The host system of claim 9, wherein the root complex is further configured to:
receive, from the second endpoint, a request for access to the second portion of the data stored in the host memory; request, to the coherency agent, the ownership of the address range from the first endpoint; request, to the first endpoint, returning the ownership of the address range to the host system; and provide, to the second endpoint, the data associated with the address range; the coherency agent further configured to assign the ownership of the address range from the first endpoint to the second endpoint, after receiving, from the first endpoint, the modified data associated with the address range. 15. The host system of claim 7 integrated into an integrated circuit (IC). 16. The host system of claim 7 integrated into a device selected from the group consisting of: a set top box; an entertainment unit; a navigation device; a communications device; a fixed location data unit; a mobile location data unit; a mobile phone; a cellular phone; a smart phone; a tablet; a phablet; a server; a computer; a portable computer; a desktop computer; a personal digital assistant (PDA); a monitor; a computer monitor; a television; a tuner; a radio; a satellite radio; a music player; a digital music player; a portable music player; a digital video player; a video player; a digital video disc (DVD) player; a portable digital video player; and an automobile. 17. A method for managing data in an endpoint of a Peripheral Component Interconnect (PCI) express (PCIe) system, comprising:
requesting, by a first endpoint to a root complex associated with a host memory, access to a portion of data stored in the host memory; receiving, from the root complex, data associated with an address range and ownership of the address range; storing, at a local memory of the first endpoint, the data associated with the address range; and providing, to the root complex, modified data associated with the address range in response to the ownership of the address range returning to a host system. 18. The method of claim 17, further comprising providing the modified data associated with the address range in response to receiving, from the root complex, a request to return the ownership of the address range to the host system. 19. The method of claim 17, further comprising returning, by the first endpoint, the ownership of the address range to the host system after providing, to the root complex, the modified data associated with the address range. 20. The method of claim 17, further comprising:
receiving, at the first endpoint, a request from the root complex from a second endpoint for a snapshot of the data associated with the address range; and providing, to the second endpoint, the snapshot of the data associated with the address range. 21. The method of claim 17, further comprising:
receiving, at the first endpoint, a request to return the ownership of the address range to the host system; providing, to the root complex, the data associated with the address range; and returning, by the first endpoint, the ownership of the address range to the host system. 22. An endpoint of a Peripheral Component Interconnect (PCI) express (PCIe) system, comprising:
a local memory; and processing circuitry, coupled to the local memory, and configured to:
request, to a root complex associated with a host memory of a PCIe system, access to a portion of data stored in the host memory;
receive, from the root complex, data associated with an address range and ownership of the address range;
store, at the local memory of the endpoint, the data associated with the address range; and
provide, to the root complex, modified data associated with the address range in response to the ownership of the address range returning to the PCIe system. 23. The endpoint of claim 22, wherein the processing circuitry is further configured to provide the modified data associated with the address range in response to receiving, from the root complex, a request to return the ownership of the address range to the PCIe system. 24. The endpoint of claim 22, wherein the processing circuitry is further configured to return the ownership of the address range to the PCIe system after providing, to the root complex, the modified data associated with the address range. 25. The endpoint of claim 22, wherein the processing circuitry is further configured to:
provide, to a second endpoint, a snapshot of the data associated with the address range in response to receiving from the root complex a request from the second endpoint for the snapshot of the data associated with the address range. 26. The endpoint of claim 22, wherein the processing circuitry is further configured to:
provide, to the root complex, the data associated with the address range and return, to the PCIe system, the ownership of the address range in response to receiving a request to return the ownership of the address range to the PCIe system. 27. A host system of a Peripheral Component Interconnect (PCI) express (PCIe) system, comprising:
a means for interfacing with at least a first endpoint and a second endpoint through a PCIe bus; a means for storing data, at least a first portion of the data and a second portion of the data associated with an address range; a means for processing data ownership requests for the data stored in the means for storing data, configured to receive a request for ownership of the first portion of the data associated with the address range from the first endpoint from the PCIe bus; and a means for controlling memory, configured to control ownership of the address range. 28. The host system of claim 27, wherein the means for processing data ownership requests is further configured to:
request, to the means for controlling memory, the ownership of the address range associated with the first portion of the data from the host system; provide the data associated with the address range to the first endpoint; the means for controlling memory, further configured to assign the ownership of the address range from the host system to the first endpoint; and store, in the means for storing data, modified data associated with the address range. 29. A Peripheral Component Interconnect (PCI) express (PCIe) system, comprising:
a host system comprising:
a PCIe bus interface configured to be coupled to at least an endpoint of a PCIe system through a PCIe bus;
host memory comprising data stored therein, at least a portion of the data associated with an address range;
a root complex associated with the host memory, configured to receive a request for ownership of the portion of the data associated with the address range from the endpoint from the PCIe bus; and
a coherency agent configured to control ownership of the address range; and
the endpoint comprising a local memory and processing circuitry configured to:
request, to the root complex, access to the portion of the data stored in the host memory;
receive, from the root complex, the data associated with the address range and the ownership of the address range;
store, at the local memory, the data associated with the address range; and
provide, to the root complex, modified data associated with the address range in response to the ownership of the address range returning to the host system. | 2,100 |
5,370 | 5,370 | 14,754,512 | 2,156 | Generally described, the present invention is directed to a network operating system that provides more effective ways of leveraging the connectivity of computer networks. In one embodiment, an XML virtual machine is implemented that accepts high-level application code written in an XML programming language as input. Functionality is provided to interpret or translate the application code written in an XML programming language into code that is suitable for execution across computer platforms. Moreover, the XML virtual machine supports the Model View Controller (MVC) design paradigm that facilitates true data abstraction from applications to a common data model. Multi-instance applications, with each instance potentially supporting multiple views, may be created and executed. | 1. A nontransitory computer-readable medium having computer-executable instructions stored thereon that, in response to execution by one or more processors of a client computing device, cause the computing device to open an application package containing an application's process and view logic, by:
obtaining resources of an application being opened as specified in a corresponding application package on the client computing device, the application defined in the application package having separately defined process and view logic; instantiating an instance object that associates process and view objects to a particular application instance and tracks a runtime state of the application during execution, and wherein potentially multiple instances of the application execute concurrently on the client computing device; re-creating a previous runtime state of the application within the instance object using data provided with the application package indicating the previous runtime state; and executing the application's process and view logic relative to the appropriate application instance including using the instance object to provide context of the runtime state in executing application logic. 2. The computer-readable medium as recited in claim 1, wherein obtaining resources of an application being opened includes:
evaluating an XML-based expression having a URL that references at least one resource of the application; and checking resources currently maintained in a client-side cache to determine whether at least one application resource is available locally. 3. The computer-readable medium as recited in claim 1, wherein a number of application instances that can be instantiated is limited to a number specified in the application package. 4. The computer-readable medium as recited in claim 1, wherein obtaining resources of an application being opened as specified in a corresponding application package includes instantiating an application object configured to hold multiple instance objects. 5. The computer-readable medium as recited in claim 1, wherein obtaining resources of an application being opened includes:
determining whether a primary network location that stores the resources is accessible; and if the resources are not available from the primary network location, utilizing semantic logic in the application package to identify a secondary network location. 6. The computer-readable medium as recited in claim 1, wherein resources obtained as specified in the application package include at least one resource selected from an image, XML document, and binary file. 7. The computer-readable medium as recited in claim 1, wherein the instance object is configured to track at least one object in the view layer and at least one object in the controller layer associated with an application that adheres to the MVC design paradigm. 8. The computer-readable medium as recited in claim 1, wherein the instance object holds a local expression engine and causes expressions referencing named objects that are global to the application to be evaluated relative to the appropriate application instance. 9. The computer-readable medium as recited in claim 1, wherein the data provided with the application package describing the previous runtime state includes data serialized in XML. 10. The computer-readable medium as recited in claim 1, wherein to initiate execution of an application's process and view logic includes utilizing a data type recognizer to identify a document type from semantic data in the application package and cause actions to be performed that are based on the identified document type. 11. The computer-readable medium as recited in claim 1, wherein the data provided with the application package indicating the previous runtime state includes a reference to an XML document that describes the previous runtime state. 12. The computer-readable medium as recited in claim 1, wherein the data provided with the application package indicating the previous runtime state includes XML data that describes the previous runtime state within the application package. 13. A client computing device configured to open an application package containing an application's process and view logic by:
obtaining resources of an application being opened as specified in a corresponding application package on the client computing device, the application defined in the application package having separately defined process and view logic; instantiating an instance object that associates process and view objects to a particular application instance and tracks a runtime state of the application during execution, and wherein potentially multiple instances of the application execute concurrently on the client computing device; re-creating a previous runtime state of the application within the instance object using data provided with the application package indicating the previous runtime state; and executing the application's process and view logic relative to the appropriate application instance including using the instance object to provide context of the runtime state in executing application logic. 14. The computer-readable medium as recited in claim 13, wherein obtaining resources of an application being opened includes:
evaluating an XML-based expression having a URL that references at least one resource of the application; and checking resources currently maintained in a client-side cache to determine whether at least one application resource is available locally. 15. The computer-readable medium as recited in claim 13, wherein obtaining resources of an application being opened as specified in a corresponding application package includes instantiating an application object configured to hold multiple instance objects. 16. The computer-readable medium as recited in claim 13, wherein resources obtained as specified in the application package include at least one resource selected from an image, XML document, and binary file. 17. The computer-readable medium as recited in claim 13, wherein the instance object is configured to track at least one object in the view layer and at least one object in the controller layer associated with an application that adheres to the MVC design paradigm. 18. The computer-readable medium as recited in claim 13, wherein the instance object holds a local expression engine and causes expressions referencing named objects that are global to the application to be evaluated relative to the appropriate application instance. 19. The computer-readable medium as recited in claim 13, wherein the data provided with the application package indicating the previous runtime state includes a reference to an XML document that describes the previous runtime state. 20. The computer-readable medium as recited in claim 13, wherein the data provided with the application package indicating the previous runtime state includes XML data that describes the previous runtime state within the application package. | Generally described, the present invention is directed to a network operating system that provides more effective ways of leveraging the connectivity of computer networks. In one embodiment, an XML virtual machine is implemented that accepts high-level application code written in an XML programming language as input. Functionality is provided to interpret or translate the application code written in an XML programming language into code that is suitable for execution across computer platforms. Moreover, the XML virtual machine supports the Model View Controller (MVC) design paradigm that facilitates true data abstraction from applications to a common data model. Multi-instance applications, with each instance potentially supporting multiple views, may be created and executed.1. A nontransitory computer-readable medium having computer-executable instructions stored thereon that, in response to execution by one or more processors of a client computing device, cause the computing device to open an application package containing an application's process and view logic, by:
obtaining resources of an application being opened as specified in a corresponding application package on the client computing device, the application defined in the application package having separately defined process and view logic; instantiating an instance object that associates process and view objects to a particular application instance and tracks a runtime state of the application during execution, and wherein potentially multiple instances of the application execute concurrently on the client computing device; re-creating a previous runtime state of the application within the instance object using data provided with the application package indicating the previous runtime state; and executing the application's process and view logic relative to the appropriate application instance including using the instance object to provide context of the runtime state in executing application logic. 2. The computer-readable medium as recited in claim 1, wherein obtaining resources of an application being opened includes:
evaluating an XML-based expression having a URL that references at least one resource of the application; and checking resources currently maintained in a client-side cache to determine whether at least one application resource is available locally. 3. The computer-readable medium as recited in claim 1, wherein a number of application instances that can be instantiated is limited to a number specified in the application package. 4. The computer-readable medium as recited in claim 1, wherein obtaining resources of an application being opened as specified in a corresponding application package includes instantiating an application object configured to hold multiple instance objects. 5. The computer-readable medium as recited in claim 1, wherein obtaining resources of an application being opened includes:
determining whether a primary network location that stores the resources is accessible; and if the resources are not available from the primary network location, utilizing semantic logic in the application package to identify a secondary network location. 6. The computer-readable medium as recited in claim 1, wherein resources obtained as specified in the application package include at least one resource selected from an image, XML document, and binary file. 7. The computer-readable medium as recited in claim 1, wherein the instance object is configured to track at least one object in the view layer and at least one object in the controller layer associated with an application that adheres to the MVC design paradigm. 8. The computer-readable medium as recited in claim 1, wherein the instance object holds a local expression engine and causes expressions referencing named objects that are global to the application to be evaluated relative to the appropriate application instance. 9. The computer-readable medium as recited in claim 1, wherein the data provided with the application package describing the previous runtime state includes data serialized in XML. 10. The computer-readable medium as recited in claim 1, wherein to initiate execution of an application's process and view logic includes utilizing a data type recognizer to identify a document type from semantic data in the application package and cause actions to be performed that are based on the identified document type. 11. The computer-readable medium as recited in claim 1, wherein the data provided with the application package indicating the previous runtime state includes a reference to an XML document that describes the previous runtime state. 12. The computer-readable medium as recited in claim 1, wherein the data provided with the application package indicating the previous runtime state includes XML data that describes the previous runtime state within the application package. 13. A client computing device configured to open an application package containing an application's process and view logic by:
obtaining resources of an application being opened as specified in a corresponding application package on the client computing device, the application defined in the application package having separately defined process and view logic; instantiating an instance object that associates process and view objects to a particular application instance and tracks a runtime state of the application during execution, and wherein potentially multiple instances of the application execute concurrently on the client computing device; re-creating a previous runtime state of the application within the instance object using data provided with the application package indicating the previous runtime state; and executing the application's process and view logic relative to the appropriate application instance including using the instance object to provide context of the runtime state in executing application logic. 14. The computer-readable medium as recited in claim 13, wherein obtaining resources of an application being opened includes:
evaluating an XML-based expression having a URL that references at least one resource of the application; and checking resources currently maintained in a client-side cache to determine whether at least one application resource is available locally. 15. The computer-readable medium as recited in claim 13, wherein obtaining resources of an application being opened as specified in a corresponding application package includes instantiating an application object configured to hold multiple instance objects. 16. The computer-readable medium as recited in claim 13, wherein resources obtained as specified in the application package include at least one resource selected from an image, XML document, and binary file. 17. The computer-readable medium as recited in claim 13, wherein the instance object is configured to track at least one object in the view layer and at least one object in the controller layer associated with an application that adheres to the MVC design paradigm. 18. The computer-readable medium as recited in claim 13, wherein the instance object holds a local expression engine and causes expressions referencing named objects that are global to the application to be evaluated relative to the appropriate application instance. 19. The computer-readable medium as recited in claim 13, wherein the data provided with the application package indicating the previous runtime state includes a reference to an XML document that describes the previous runtime state. 20. The computer-readable medium as recited in claim 13, wherein the data provided with the application package indicating the previous runtime state includes XML data that describes the previous runtime state within the application package. | 2,100 |
5,371 | 5,371 | 14,815,890 | 2,145 | Context-specific user interfaces for use with a portable multifunction device are disclosed. The methods described herein for context-specific user interfaces provide indications of time and, optionally, a variety of additional information. Further disclosed are non-transitory computer-readable storage media, systems, and devices configured to perform the methods described herein. | 1. A non-transitory computer readable storage medium storing one or more programs, the one or more programs comprising instructions, which when executed by one or more processors of an electronic device with a touch-sensitive display, cause the device to:
display a user interface screen on the display, the user interface screen including:
a clock face; and
an affordance, wherein the affordance represents an application, wherein the affordance comprises a set of information obtained from the application, wherein the set of information is updated in accordance with data from the application, and wherein the affordance is displayed as a complication associated with the clock face;
detect a contact on the displayed affordance, and in response to detecting the contact:
launch the application represented by the affordance. 2. The non-transitory computer readable storage medium of claim 1, wherein the non-transitory computer readable storage medium further comprises instructions, which when executed by the one or more processors of the electronic device, cause the device to:
display a second affordance on the user interface screen, wherein the second affordance represents a second application, wherein the second application is different from the first application, wherein the second affordance comprises a second set of information obtained from the second application, wherein the second set of information is updated in accordance with data from the second application, and wherein the second affordance is displayed as a complication associated with the clock face. 3. The non-transitory computer readable storage medium of claim 1, wherein the non-transitory computer readable storage medium further comprises instructions, which when executed by the one or more processors of the electronic device, cause the device to:
display a third affordance on the user interface screen, wherein the third affordance represents the first application, wherein the third affordance comprises a third set of information obtained from the first application, wherein the third set of information is different from the first set of information, wherein the third set of information is updated in accordance with data from the first application, and wherein the third affordance is displayed as a complication associated with the clock face. 4. The non-transitory computer readable storage medium of claim 1, wherein the non-transitory computer readable storage medium further comprises instructions, which when executed by the one or more processors of the electronic device, cause the device to:
receive a notification; determine whether the notification has been missed; and in accordance with a determination that notification has been missed:
display a missed notification affordance on the display, the missed notification affordance indicating a missed notification. 5. The non-transitory computer readable storage medium of claim 4, wherein an aspect of the displayed missed notification affordance represents a number of missed notifications received by the electronic device. 6. The non-transitory computer readable storage medium of claim 4, wherein the non-transitory computer readable storage medium further comprises instructions, which when executed by the one or more processors of the electronic device, cause the device to:
receive data representing user viewing of the missed notification, and in response to receiving the data:
remove the display of the missed notification affordance. 7. The non-transitory computer readable storage medium of claim 1, wherein the first affordance is a stopwatch progress affordance indicating a currently running stopwatch application, wherein the stopwatch progress affordance comprises a representation of a digital stopwatch, wherein the representation of the digital stopwatch is continuously updated to indicate a stopwatch time generated by the currently running stopwatch application, and wherein launching the first application comprises launching the stopwatch application. 8. The non-transitory computer readable storage medium of claim 1, wherein the electronic device comprises a location sensor, and wherein the non-transitory computer readable storage medium further comprises instructions, which when executed by the one or more processors of the electronic device, cause the device to:
while the clock face is displayed on the touch-sensitive display, detect a contact on the touch-sensitive display, and in response to detecting the contact:
access data representing a designated home location, the designated home location having an associated home time zone;
obtain a current time zone of the electronic device from the location sensor;
determine whether the current time zone is different from the home time zone; and
in response to a determination that the current time zone is different from the home time zone:
update the displayed clock face to indicate a current time at the home time zone. 9. The non-transitory computer readable storage medium of claim 8, wherein the designated home location is user-designated. 10. The non-transitory computer readable storage medium of claim 8, wherein the designated home location is a location designated based on data representing one or more of:
amount of time spent at the location; which times of day are spent at the location; and number of contact entries associated with the location stored on the electronic device. 11. The non-transitory computer readable storage medium of claim 1, wherein the non-transitory computer readable storage medium further comprises instructions, which when executed by the one or more processors of the electronic device, cause the device to:
detect a movement of the electronic device; and in response to detecting the movement:
move the displayed clock face on the display, wherein the displayed clock face comprises a plurality of pixels, and wherein the moving comprises modifying in appearance a subset of pixels in the plurality. 12. The non-transitory computer readable storage medium of claim 1, wherein the non-transitory computer readable storage medium further comprises instructions, which when executed by the one or more processors of the electronic device, cause the device to:
display a tachymeter user interface object comprising a start/stop affordance; detect a user input at a first time; in response to detecting the user input:
start a virtual tachymeter;
detect a second user input at a second time, the second time separated from the first time by a tachymeter interval;
in response to detecting the second user input:
stop the virtual tachymeter; and
display a time value based on a number of units of time in a predetermined interval divided by the tachymeter interval. 13. The non-transitory computer readable storage medium of claim 1, wherein the non-transitory computer readable storage medium further comprises instructions, which when executed by the one or more processors of the electronic device, cause the device to:
display a telemeter user interface object comprising a start/stop affordance; detect a user input at a first time; in response to detecting the user input:
start a virtual telemeter;
detect a second user input at a second time, the second time separated from the first time by a telemeter interval;
in response to detecting the second contact:
stop the virtual telemeter; and
display a distance based on the telemeter interval. 14. The non-transitory computer readable storage medium of claim 1, wherein the non-transitory computer readable storage medium further comprises instructions, which when executed by the one or more processors of the electronic device, cause the device to:
display a repeated interval timer user interface; receive data representing a user-designated time interval; and in response to receiving the data representing the user-designated time interval:
provide a user alert, wherein the user alert is repeated at times based on the user-designated time interval. 15. The non-transitory computer readable storage medium of claim 14, wherein the user alert comprises one or more of a visual alert, an audio alert, and a haptic alert. 16. A method, comprising:
at an electronic device with a touch-sensitive display: displaying a user interface screen on the display, the user interface screen including:
a clock face; and
an affordance, wherein the affordance represents an application, wherein the affordance comprises a set of information obtained from the application, wherein the set of information is updated in accordance with data from the application, and wherein the affordance is displayed as a complication associated with the clock face;
detecting a contact on the displayed affordance, and in response to detecting the contact:
launching the application represented by the affordance. 17. An electronic device, comprising:
a touch-sensitive display; one or more processors; a 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:
displaying a user interface screen on the display, the user interface screen including:
a clock face; and
an affordance, wherein the affordance represents an application, wherein the affordance comprises a set of information obtained from the application, wherein the set of information is updated in accordance with data from the application, and wherein the affordance is displayed as a complication associated with the clock face;
detecting a contact on the displayed affordance, and in response to detecting the contact:
launching the application represented by the affordance. | Context-specific user interfaces for use with a portable multifunction device are disclosed. The methods described herein for context-specific user interfaces provide indications of time and, optionally, a variety of additional information. Further disclosed are non-transitory computer-readable storage media, systems, and devices configured to perform the methods described herein.1. A non-transitory computer readable storage medium storing one or more programs, the one or more programs comprising instructions, which when executed by one or more processors of an electronic device with a touch-sensitive display, cause the device to:
display a user interface screen on the display, the user interface screen including:
a clock face; and
an affordance, wherein the affordance represents an application, wherein the affordance comprises a set of information obtained from the application, wherein the set of information is updated in accordance with data from the application, and wherein the affordance is displayed as a complication associated with the clock face;
detect a contact on the displayed affordance, and in response to detecting the contact:
launch the application represented by the affordance. 2. The non-transitory computer readable storage medium of claim 1, wherein the non-transitory computer readable storage medium further comprises instructions, which when executed by the one or more processors of the electronic device, cause the device to:
display a second affordance on the user interface screen, wherein the second affordance represents a second application, wherein the second application is different from the first application, wherein the second affordance comprises a second set of information obtained from the second application, wherein the second set of information is updated in accordance with data from the second application, and wherein the second affordance is displayed as a complication associated with the clock face. 3. The non-transitory computer readable storage medium of claim 1, wherein the non-transitory computer readable storage medium further comprises instructions, which when executed by the one or more processors of the electronic device, cause the device to:
display a third affordance on the user interface screen, wherein the third affordance represents the first application, wherein the third affordance comprises a third set of information obtained from the first application, wherein the third set of information is different from the first set of information, wherein the third set of information is updated in accordance with data from the first application, and wherein the third affordance is displayed as a complication associated with the clock face. 4. The non-transitory computer readable storage medium of claim 1, wherein the non-transitory computer readable storage medium further comprises instructions, which when executed by the one or more processors of the electronic device, cause the device to:
receive a notification; determine whether the notification has been missed; and in accordance with a determination that notification has been missed:
display a missed notification affordance on the display, the missed notification affordance indicating a missed notification. 5. The non-transitory computer readable storage medium of claim 4, wherein an aspect of the displayed missed notification affordance represents a number of missed notifications received by the electronic device. 6. The non-transitory computer readable storage medium of claim 4, wherein the non-transitory computer readable storage medium further comprises instructions, which when executed by the one or more processors of the electronic device, cause the device to:
receive data representing user viewing of the missed notification, and in response to receiving the data:
remove the display of the missed notification affordance. 7. The non-transitory computer readable storage medium of claim 1, wherein the first affordance is a stopwatch progress affordance indicating a currently running stopwatch application, wherein the stopwatch progress affordance comprises a representation of a digital stopwatch, wherein the representation of the digital stopwatch is continuously updated to indicate a stopwatch time generated by the currently running stopwatch application, and wherein launching the first application comprises launching the stopwatch application. 8. The non-transitory computer readable storage medium of claim 1, wherein the electronic device comprises a location sensor, and wherein the non-transitory computer readable storage medium further comprises instructions, which when executed by the one or more processors of the electronic device, cause the device to:
while the clock face is displayed on the touch-sensitive display, detect a contact on the touch-sensitive display, and in response to detecting the contact:
access data representing a designated home location, the designated home location having an associated home time zone;
obtain a current time zone of the electronic device from the location sensor;
determine whether the current time zone is different from the home time zone; and
in response to a determination that the current time zone is different from the home time zone:
update the displayed clock face to indicate a current time at the home time zone. 9. The non-transitory computer readable storage medium of claim 8, wherein the designated home location is user-designated. 10. The non-transitory computer readable storage medium of claim 8, wherein the designated home location is a location designated based on data representing one or more of:
amount of time spent at the location; which times of day are spent at the location; and number of contact entries associated with the location stored on the electronic device. 11. The non-transitory computer readable storage medium of claim 1, wherein the non-transitory computer readable storage medium further comprises instructions, which when executed by the one or more processors of the electronic device, cause the device to:
detect a movement of the electronic device; and in response to detecting the movement:
move the displayed clock face on the display, wherein the displayed clock face comprises a plurality of pixels, and wherein the moving comprises modifying in appearance a subset of pixels in the plurality. 12. The non-transitory computer readable storage medium of claim 1, wherein the non-transitory computer readable storage medium further comprises instructions, which when executed by the one or more processors of the electronic device, cause the device to:
display a tachymeter user interface object comprising a start/stop affordance; detect a user input at a first time; in response to detecting the user input:
start a virtual tachymeter;
detect a second user input at a second time, the second time separated from the first time by a tachymeter interval;
in response to detecting the second user input:
stop the virtual tachymeter; and
display a time value based on a number of units of time in a predetermined interval divided by the tachymeter interval. 13. The non-transitory computer readable storage medium of claim 1, wherein the non-transitory computer readable storage medium further comprises instructions, which when executed by the one or more processors of the electronic device, cause the device to:
display a telemeter user interface object comprising a start/stop affordance; detect a user input at a first time; in response to detecting the user input:
start a virtual telemeter;
detect a second user input at a second time, the second time separated from the first time by a telemeter interval;
in response to detecting the second contact:
stop the virtual telemeter; and
display a distance based on the telemeter interval. 14. The non-transitory computer readable storage medium of claim 1, wherein the non-transitory computer readable storage medium further comprises instructions, which when executed by the one or more processors of the electronic device, cause the device to:
display a repeated interval timer user interface; receive data representing a user-designated time interval; and in response to receiving the data representing the user-designated time interval:
provide a user alert, wherein the user alert is repeated at times based on the user-designated time interval. 15. The non-transitory computer readable storage medium of claim 14, wherein the user alert comprises one or more of a visual alert, an audio alert, and a haptic alert. 16. A method, comprising:
at an electronic device with a touch-sensitive display: displaying a user interface screen on the display, the user interface screen including:
a clock face; and
an affordance, wherein the affordance represents an application, wherein the affordance comprises a set of information obtained from the application, wherein the set of information is updated in accordance with data from the application, and wherein the affordance is displayed as a complication associated with the clock face;
detecting a contact on the displayed affordance, and in response to detecting the contact:
launching the application represented by the affordance. 17. An electronic device, comprising:
a touch-sensitive display; one or more processors; a 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:
displaying a user interface screen on the display, the user interface screen including:
a clock face; and
an affordance, wherein the affordance represents an application, wherein the affordance comprises a set of information obtained from the application, wherein the set of information is updated in accordance with data from the application, and wherein the affordance is displayed as a complication associated with the clock face;
detecting a contact on the displayed affordance, and in response to detecting the contact:
launching the application represented by the affordance. | 2,100 |
5,372 | 5,372 | 14,192,291 | 2,128 | Systems, methods, apparatus and mechanisms that iteratively generate one or more equations (conforming to one or more functions or functions types) of increasing complexity (e.g., degree or order) to provide one or more corresponding approximations of a System Under Study (SUS), where each approximation or “fit” provides additional information about the SUS and where the various equations may be summed to provide a final “fit” having an adequate level of accuracy. | 1. An apparatus for modeling a System Under Study (SUS), the SUS exhibiting at least one output adapted in response to a plurality of input parameters, the apparatus comprising a processor configured to:
generate an improved approximation model for said SUS comprising a summation of an initial approximation model, a constant term, and a plurality of polynomials, each polynomial being associated with a respective N-tuplet of input parameters for greater than zero integer values of N, wherein polynomials included within said improved approximation model are generated by iteratively performing the following steps until a sufficiently accurate fit is achieved:
rank ordering the N-tuplets of input parameters;
selecting a highest ranking N-tuplet of input parameters from among the remaining N-tuplets of input parameters to be processed;
fitting a polynomial involving input parameters in the selected N-tuplet of input parameters;
updating the current approximation model by adding the fitted polynomial;
adjusting the constant term as needed to match the evaluations of the SUS and the current approximation model at a point; and
evaluating fit of the said current approximation model to SUS;
wherein data representative of the improved approximation model of said SUS is stored in memory. 2. The apparatus in claim 1, wherein fitting a polynomial involving input parameters in a selected N-tuplet of input parameters comprises:
iteratively performing the following steps until a sufficiently accurate fit is achieved:
selecting a plurality of model generation points in the N-dimensional space defined by axis parallel lines of the selected N-tuplet of input parameters, where model generation points are incremented by one or more for subsequent iterations in the said N-dimensional space;
evaluating the SUS at the model generation points;
fitting a polynomial involving input parameters from the said N-tuplet of input parameters to the SUS evaluation; and
evaluating fit of said polynomial to SUS;
and removing polynomial terms that do not involve all input parameters from the said N-tuplet of input parameters. 3. The apparatus of claim 1, wherein rank ordering is determined according to a difference between evaluations of SUS and the current approximation model at ranking stress points generated using at least one of orthogonal array design, fractional factorial design, full factorial design, design of experiments and space filling designs. 4. The apparatus in claim 1, wherein rank ordering is determined according to at least one of importance, presumed importance, random order, past data, alphabetical order and order of entry. 5. The apparatus of claim 4, wherein importance of input parameters is determined by main effects analysis of the difference between SUS evaluations and current approximation model evaluations at ranking stress points. 6. The apparatus of claim 4, wherein importance of N-tuplets of input parameters is determined by N-parameter interaction effects analysis of the difference between evaluations of SUS and the current approximation model at ranking stress points. 7. The apparatus of claim 1, wherein fitting a polynomial involving input parameters in the selected N-tuplet of input parameters is performed using at least one of orthogonal polynomials, matrix inversion, Lagrange polynomials and solving simultaneous equations. 8. The apparatus of claim 1, wherein sufficiency of accuracy is determined by goodness of fit criteria comprising at least one of a maximum absolute difference, a sum of absolute differences, a mean square of selected top absolute differences, and a mean square error. 9. The apparatus of claim 1, wherein said sufficiently accurate fit is achieved in response to reaching at least one of a dimensional limit, a cost constraint, a time constraint and a resource constraint. 10. The apparatus of claim 1, wherein the initial approximation model is equal to one of the following: zero, a user specified model, a system specified model and a previously improved approximation model. 11. The apparatus of claim 1, wherein the fit is determined by generating one or more stress points and evaluating a difference between evaluations of the current approximation model and the SUS at the said stress points according to at least one goodness of fit criteria comprising an absolute difference, a sum of absolute differences, a mean square of selected top absolute differences, and a mean square error. 12. The apparatus of claim 11, wherein stress points are generated using at least one of orthogonal arrays, fractional factorial designs, full factorial designs, design of experiments and space filling designs. 13. The apparatus of claim 11, wherein one or more stress points generated in one iteration are used in at least one subsequent iteration. 14. The apparatus of claim 11, wherein one or more stress points are generated for each iteration. 15. The apparatus of claim 1, further comprising:
generating summary statistics associated with the improved approximation model of said SUS; and storing data representative of generated summary statistics in memory. 16. The apparatus of claim 15, wherein said summary statistics comprise at least one of mean, standard deviation, maxima, minima, inflection points, confidence intervals, probability percentiles, zeros of an equation, integrals associated with one or more input parameters and derivatives associated with one or more input parameters. 17. The apparatus of claim 1, further comprising:
post-processing said improved approximation model of said SUS according to at least one of an equation, a distribution and a region of interest of input parameters to generate thereby decision rules; and storing data representative of the decision rules in memory. 18. The apparatus of claim 1, wherein rank ordering of input parameters performed only in a first iteration. 19. The apparatus of claim 1, wherein a sufficiency of accuracy parameter is adapted so that an iteration is performed until polynomials for all of a specified set of N-tuplets of input parameters have been included in the current approximation model. 20. The apparatus of claim 19, wherein evaluation of fit of the current approximation model to the SUS occurs only after polynomials for all of a specified set of N-tuplets of input parameters have been included in the current approximation model. 21. The apparatus of claim 1, wherein fitting a polynomial involving input parameters in the selected N-tuplet of input parameters comprises constructing a polynomial with an origin proximate the center point. 22. The apparatus of claim 1, wherein fitting a polynomial involving input parameters in the selected N-tuplet of input parameters is accomplished by performing the steps of:
selecting a plurality of model generation points in the N-dimensional space defined by axis parallel lines of the selected N-tuplet of input parameters; evaluating the SUS at the model generation points; fitting a polynomial involving input parameters from the said N-tuplet of input parameters to the SUS evaluation; and removing polynomial terms that do not involve all input parameters from the said N-tuplet of input parameters. 23. The apparatus of claim 2, wherein the fit is determined by:
generating one or more stress points in the N-dimensional space defined by the axis parallel lines of the input parameters in the N-tuplet of input parameters that are distinct from the model generation points; and evaluating a difference between evaluations of the said polynomial and the SUS at the said stress points according to at least one goodness of fit criteria comprising absolute difference, sum of absolute differences, mean square of selected top absolute differences and mean square error. 24. The apparatus of claim 23, wherein stress points are generated using at least one of orthogonal arrays, fractional factorial designs, full factorial designs, design of experiments and space filling designs. 25. The apparatus in claim 1, wherein fitting a polynomial involving input parameters in the selected N-tuplet of input parameters comprises:
iteratively by performing the following steps until a sufficiently accurate fit is achieved:
selecting a plurality of model generation points in or close to the N-dimensional space defined by axis parallel lines of the selected N-tuplet of input parameters, where model generation points are incremented by at least one subsequent iteration within approximately the said N-dimensional space;
evaluating the SUS at the model generation points;
fitting a polynomial involving input parameters from the said N-tuplet of input parameters to the SUS evaluation; and
evaluating fit of said polynomial to SUS;
and removing polynomial terms that do not involve all parameters from the said N-tuplet of input parameters. 26. The apparatus in claim 1, wherein fitting a polynomial involving input parameters in the selected N-tuplet of input parameters comprises iteratively performing the following steps until a sufficiently accurate fit is achieved:
selecting a plurality of model generation points in the N-dimensional space defined by axis parallel lines of the selected N-tuplet of input parameters, where model generation points are incremented by at least one for subsequent iterations in the said N-dimensional space; evaluating the SUS at the model generation points; fitting a polynomial involving input parameters from the said N-tuplet of input parameters to the SUS evaluation; and evaluating fit of said polynomial to SUS. 27. The apparatus of claim 2, wherein fitting a polynomial involving input parameters from the said N-tuplet of input parameters to the SUS evaluation is performed using at least one of orthogonal polynomials, matrix inversion, Lagrange polynomials and solving simultaneous equations. 28. The apparatus of claim 2, wherein sufficiency of accuracy is determined by goodness of fit criteria comprising at least one goodness of fit criterion comprising an absolute difference, a sum of absolute differences, a mean square of selected top absolute differences and a mean square error. 29. An apparatus for modeling a System Under Study (SUS), the SUS exhibiting at least one output adapted in response to a plurality of input parameters, the apparatus comprising a processor configured to:
generate an improved approximation model for said SUS comprising a summation of an initial approximation model, a constant term, and a plurality of complex function elements, each complex function element being associated with a respective N-tuplet of input parameters for greater than zero integer values of N, wherein complex function elements included within said improved approximation model are generated by iteratively performing the following steps until a sufficiently accurate fit is achieved:
rank ordering the N-tuplets of input parameters;
selecting a highest ranking N-tuplet of input parameters from among the remaining N-tuplets of input parameters to be processed;
fitting a complex function element involving input parameters in the selected N-tuplet of input parameters;
updating the current approximation model by adding the fitted complex function element;
adjusting the constant term as needed to match the evaluations of the SUS and the current approximation model at a point; and
evaluating fit of the said current approximation model to SUS;
wherein data representative of the improved approximation model of said SUS is stored in memory. 30. The apparatus of claim 29, wherein the complex function elements are associated with one of a polynomial function, a wavelet function, a Fourier series and a Walsh function. 31. A tangible and non-transient computer readable storage medium storing instructions which, when executed by a computer, adapt the operation of the computer to provide a method of modeling a System Under Study (SUS), the SUS exhibiting at least one output adapted in response to a plurality of input parameters, the method comprising:
generating an improved approximation model for said SUS comprising a summation of an initial approximation model, a constant term, and a plurality of polynomials, each polynomial being associated with a respective N-tuplet of input parameters for greater than zero integer values of N, wherein polynomials included within said improved approximation model are generated by iteratively performing the following steps until a sufficiently accurate fit is achieved:
rank ordering the N-tuplets of input parameters;
selecting a highest ranking N-tuplet of input parameters from among the remaining N-tuplets of input parameters to be processed;
fitting a polynomial involving input parameters in the selected N-tuplet of input parameters;
updating the current approximation model by adding the fitted polynomial;
adjusting the constant term as needed to match the evaluations of the SUS and the current approximation model at a point; and
evaluating fit of the said current approximation model to SUS;
wherein data representative of the improved approximation model of said SUS is stored in memory. 32. A computer program product wherein computer instructions, when executed by a processor in a computing device, adapt the operation of the computing device to provide a method of modeling a System Under Study (SUS), the SUS exhibiting at least one output adapted in response to a plurality of input parameters, the method comprising:
generating an improved approximation model for said SUS comprising a summation of an initial approximation model, a constant term, and a plurality of polynomials, each polynomial being associated with a respective N-tuplet of input parameters for greater than zero integer values of N, wherein polynomials included within said improved approximation model are generated by iteratively performing the following steps until a sufficiently accurate fit is achieved:
rank ordering the N-tuplets of input parameters;
selecting a highest ranking N-tuplet of input parameters from among the remaining N-tuplets of input parameters to be processed;
fitting a polynomial involving input parameters in the selected N-tuplet of input parameters;
updating the current approximation model by adding the fitted polynomial;
adjusting the constant term as needed to match the evaluations of the SUS and the current approximation model at a point; and
evaluating fit of the said current approximation model to SUS;
wherein data representative of the improved approximation model of said SUS is stored in memory. | Systems, methods, apparatus and mechanisms that iteratively generate one or more equations (conforming to one or more functions or functions types) of increasing complexity (e.g., degree or order) to provide one or more corresponding approximations of a System Under Study (SUS), where each approximation or “fit” provides additional information about the SUS and where the various equations may be summed to provide a final “fit” having an adequate level of accuracy.1. An apparatus for modeling a System Under Study (SUS), the SUS exhibiting at least one output adapted in response to a plurality of input parameters, the apparatus comprising a processor configured to:
generate an improved approximation model for said SUS comprising a summation of an initial approximation model, a constant term, and a plurality of polynomials, each polynomial being associated with a respective N-tuplet of input parameters for greater than zero integer values of N, wherein polynomials included within said improved approximation model are generated by iteratively performing the following steps until a sufficiently accurate fit is achieved:
rank ordering the N-tuplets of input parameters;
selecting a highest ranking N-tuplet of input parameters from among the remaining N-tuplets of input parameters to be processed;
fitting a polynomial involving input parameters in the selected N-tuplet of input parameters;
updating the current approximation model by adding the fitted polynomial;
adjusting the constant term as needed to match the evaluations of the SUS and the current approximation model at a point; and
evaluating fit of the said current approximation model to SUS;
wherein data representative of the improved approximation model of said SUS is stored in memory. 2. The apparatus in claim 1, wherein fitting a polynomial involving input parameters in a selected N-tuplet of input parameters comprises:
iteratively performing the following steps until a sufficiently accurate fit is achieved:
selecting a plurality of model generation points in the N-dimensional space defined by axis parallel lines of the selected N-tuplet of input parameters, where model generation points are incremented by one or more for subsequent iterations in the said N-dimensional space;
evaluating the SUS at the model generation points;
fitting a polynomial involving input parameters from the said N-tuplet of input parameters to the SUS evaluation; and
evaluating fit of said polynomial to SUS;
and removing polynomial terms that do not involve all input parameters from the said N-tuplet of input parameters. 3. The apparatus of claim 1, wherein rank ordering is determined according to a difference between evaluations of SUS and the current approximation model at ranking stress points generated using at least one of orthogonal array design, fractional factorial design, full factorial design, design of experiments and space filling designs. 4. The apparatus in claim 1, wherein rank ordering is determined according to at least one of importance, presumed importance, random order, past data, alphabetical order and order of entry. 5. The apparatus of claim 4, wherein importance of input parameters is determined by main effects analysis of the difference between SUS evaluations and current approximation model evaluations at ranking stress points. 6. The apparatus of claim 4, wherein importance of N-tuplets of input parameters is determined by N-parameter interaction effects analysis of the difference between evaluations of SUS and the current approximation model at ranking stress points. 7. The apparatus of claim 1, wherein fitting a polynomial involving input parameters in the selected N-tuplet of input parameters is performed using at least one of orthogonal polynomials, matrix inversion, Lagrange polynomials and solving simultaneous equations. 8. The apparatus of claim 1, wherein sufficiency of accuracy is determined by goodness of fit criteria comprising at least one of a maximum absolute difference, a sum of absolute differences, a mean square of selected top absolute differences, and a mean square error. 9. The apparatus of claim 1, wherein said sufficiently accurate fit is achieved in response to reaching at least one of a dimensional limit, a cost constraint, a time constraint and a resource constraint. 10. The apparatus of claim 1, wherein the initial approximation model is equal to one of the following: zero, a user specified model, a system specified model and a previously improved approximation model. 11. The apparatus of claim 1, wherein the fit is determined by generating one or more stress points and evaluating a difference between evaluations of the current approximation model and the SUS at the said stress points according to at least one goodness of fit criteria comprising an absolute difference, a sum of absolute differences, a mean square of selected top absolute differences, and a mean square error. 12. The apparatus of claim 11, wherein stress points are generated using at least one of orthogonal arrays, fractional factorial designs, full factorial designs, design of experiments and space filling designs. 13. The apparatus of claim 11, wherein one or more stress points generated in one iteration are used in at least one subsequent iteration. 14. The apparatus of claim 11, wherein one or more stress points are generated for each iteration. 15. The apparatus of claim 1, further comprising:
generating summary statistics associated with the improved approximation model of said SUS; and storing data representative of generated summary statistics in memory. 16. The apparatus of claim 15, wherein said summary statistics comprise at least one of mean, standard deviation, maxima, minima, inflection points, confidence intervals, probability percentiles, zeros of an equation, integrals associated with one or more input parameters and derivatives associated with one or more input parameters. 17. The apparatus of claim 1, further comprising:
post-processing said improved approximation model of said SUS according to at least one of an equation, a distribution and a region of interest of input parameters to generate thereby decision rules; and storing data representative of the decision rules in memory. 18. The apparatus of claim 1, wherein rank ordering of input parameters performed only in a first iteration. 19. The apparatus of claim 1, wherein a sufficiency of accuracy parameter is adapted so that an iteration is performed until polynomials for all of a specified set of N-tuplets of input parameters have been included in the current approximation model. 20. The apparatus of claim 19, wherein evaluation of fit of the current approximation model to the SUS occurs only after polynomials for all of a specified set of N-tuplets of input parameters have been included in the current approximation model. 21. The apparatus of claim 1, wherein fitting a polynomial involving input parameters in the selected N-tuplet of input parameters comprises constructing a polynomial with an origin proximate the center point. 22. The apparatus of claim 1, wherein fitting a polynomial involving input parameters in the selected N-tuplet of input parameters is accomplished by performing the steps of:
selecting a plurality of model generation points in the N-dimensional space defined by axis parallel lines of the selected N-tuplet of input parameters; evaluating the SUS at the model generation points; fitting a polynomial involving input parameters from the said N-tuplet of input parameters to the SUS evaluation; and removing polynomial terms that do not involve all input parameters from the said N-tuplet of input parameters. 23. The apparatus of claim 2, wherein the fit is determined by:
generating one or more stress points in the N-dimensional space defined by the axis parallel lines of the input parameters in the N-tuplet of input parameters that are distinct from the model generation points; and evaluating a difference between evaluations of the said polynomial and the SUS at the said stress points according to at least one goodness of fit criteria comprising absolute difference, sum of absolute differences, mean square of selected top absolute differences and mean square error. 24. The apparatus of claim 23, wherein stress points are generated using at least one of orthogonal arrays, fractional factorial designs, full factorial designs, design of experiments and space filling designs. 25. The apparatus in claim 1, wherein fitting a polynomial involving input parameters in the selected N-tuplet of input parameters comprises:
iteratively by performing the following steps until a sufficiently accurate fit is achieved:
selecting a plurality of model generation points in or close to the N-dimensional space defined by axis parallel lines of the selected N-tuplet of input parameters, where model generation points are incremented by at least one subsequent iteration within approximately the said N-dimensional space;
evaluating the SUS at the model generation points;
fitting a polynomial involving input parameters from the said N-tuplet of input parameters to the SUS evaluation; and
evaluating fit of said polynomial to SUS;
and removing polynomial terms that do not involve all parameters from the said N-tuplet of input parameters. 26. The apparatus in claim 1, wherein fitting a polynomial involving input parameters in the selected N-tuplet of input parameters comprises iteratively performing the following steps until a sufficiently accurate fit is achieved:
selecting a plurality of model generation points in the N-dimensional space defined by axis parallel lines of the selected N-tuplet of input parameters, where model generation points are incremented by at least one for subsequent iterations in the said N-dimensional space; evaluating the SUS at the model generation points; fitting a polynomial involving input parameters from the said N-tuplet of input parameters to the SUS evaluation; and evaluating fit of said polynomial to SUS. 27. The apparatus of claim 2, wherein fitting a polynomial involving input parameters from the said N-tuplet of input parameters to the SUS evaluation is performed using at least one of orthogonal polynomials, matrix inversion, Lagrange polynomials and solving simultaneous equations. 28. The apparatus of claim 2, wherein sufficiency of accuracy is determined by goodness of fit criteria comprising at least one goodness of fit criterion comprising an absolute difference, a sum of absolute differences, a mean square of selected top absolute differences and a mean square error. 29. An apparatus for modeling a System Under Study (SUS), the SUS exhibiting at least one output adapted in response to a plurality of input parameters, the apparatus comprising a processor configured to:
generate an improved approximation model for said SUS comprising a summation of an initial approximation model, a constant term, and a plurality of complex function elements, each complex function element being associated with a respective N-tuplet of input parameters for greater than zero integer values of N, wherein complex function elements included within said improved approximation model are generated by iteratively performing the following steps until a sufficiently accurate fit is achieved:
rank ordering the N-tuplets of input parameters;
selecting a highest ranking N-tuplet of input parameters from among the remaining N-tuplets of input parameters to be processed;
fitting a complex function element involving input parameters in the selected N-tuplet of input parameters;
updating the current approximation model by adding the fitted complex function element;
adjusting the constant term as needed to match the evaluations of the SUS and the current approximation model at a point; and
evaluating fit of the said current approximation model to SUS;
wherein data representative of the improved approximation model of said SUS is stored in memory. 30. The apparatus of claim 29, wherein the complex function elements are associated with one of a polynomial function, a wavelet function, a Fourier series and a Walsh function. 31. A tangible and non-transient computer readable storage medium storing instructions which, when executed by a computer, adapt the operation of the computer to provide a method of modeling a System Under Study (SUS), the SUS exhibiting at least one output adapted in response to a plurality of input parameters, the method comprising:
generating an improved approximation model for said SUS comprising a summation of an initial approximation model, a constant term, and a plurality of polynomials, each polynomial being associated with a respective N-tuplet of input parameters for greater than zero integer values of N, wherein polynomials included within said improved approximation model are generated by iteratively performing the following steps until a sufficiently accurate fit is achieved:
rank ordering the N-tuplets of input parameters;
selecting a highest ranking N-tuplet of input parameters from among the remaining N-tuplets of input parameters to be processed;
fitting a polynomial involving input parameters in the selected N-tuplet of input parameters;
updating the current approximation model by adding the fitted polynomial;
adjusting the constant term as needed to match the evaluations of the SUS and the current approximation model at a point; and
evaluating fit of the said current approximation model to SUS;
wherein data representative of the improved approximation model of said SUS is stored in memory. 32. A computer program product wherein computer instructions, when executed by a processor in a computing device, adapt the operation of the computing device to provide a method of modeling a System Under Study (SUS), the SUS exhibiting at least one output adapted in response to a plurality of input parameters, the method comprising:
generating an improved approximation model for said SUS comprising a summation of an initial approximation model, a constant term, and a plurality of polynomials, each polynomial being associated with a respective N-tuplet of input parameters for greater than zero integer values of N, wherein polynomials included within said improved approximation model are generated by iteratively performing the following steps until a sufficiently accurate fit is achieved:
rank ordering the N-tuplets of input parameters;
selecting a highest ranking N-tuplet of input parameters from among the remaining N-tuplets of input parameters to be processed;
fitting a polynomial involving input parameters in the selected N-tuplet of input parameters;
updating the current approximation model by adding the fitted polynomial;
adjusting the constant term as needed to match the evaluations of the SUS and the current approximation model at a point; and
evaluating fit of the said current approximation model to SUS;
wherein data representative of the improved approximation model of said SUS is stored in memory. | 2,100 |
5,373 | 5,373 | 14,561,766 | 2,177 | A user interacts with a messaging application on a client device to capture and send images to contacts or connections of the user, with a single user interaction. The messaging application installed on the client device, presents to the user a user interface. The user interface includes a camera view, and a face tray. The messaging application automatically populates the face tray with contact icons associated with one or more contacts. The messaging application identifies contacts associated with the user and attributes associated with the contacts. Based on one or more attributes, the messaging application may rank the contacts. Based on the rank associated with the contacts, the messaging application selects one or more contacts to include in the face tray to present to the user or to provide to the user from which the user can select contacts to include in the face tray. | 1. A computer program product comprising a computer-readable medium having instructions encoded thereon that, when executed by a processor, cause the processor to:
present a user interface of a messaging application to a user of a client device, the user interface including a face tray, the face tray comprising a plurality of contact icons, each contact icon representing one or more contacts of the user; and retrieve a set of contacts of the user of the client device; identify a set of attributes associated with the retrieved contacts; rank the retrieved contacts based on the attributes associated with each contact, the ranking based on a prediction of contacts with whom the user is most likely to interact using the messaging application; select, based on the ranking of the retrieved contacts, a set of the retrieved contacts for display in the face tray; and populate the face tray with the selected contact icons. 2. The computer program product of claim 1, wherein an attribute associated with a retrieved contact is a name identifying the contact, and wherein the retrieved contacts are ranked based on an inferred familial relationship between the user and the contact determined from the name identifying the contact. 3. The computer program product of claim 1, wherein an attribute associated with a retrieved contact is address information associated with the retrieved contact that indicates a physical address at which the retrieved contact resides or an email address associated with the retrieved contact. 4. The computer program product of claim 1, wherein an attribute associated with a retrieved contact is an identifier indicating the user's intent to interact with the retrieved contact frequently, using one or more applications installed on the client device. 5. The computer program product of claim 1, wherein an attribute associated with a retrieved contact is the number of times a user interacts with the retrieved contact using one or more applications installed on the client device. 6. The computer program product of claim 1, wherein an attribute associated with a retrieved contact is the number of common connections or contacts between the user and the retrieved contact. 7. The computer program product of claim 1, wherein the retrieved contacts may be ranked based on the number of connections between a contact and the user in a social graph comprising a plurality of contacts of both the user and the retrieved contact. 8. The computer program product of claim 1, wherein the instructions further cause the processor to:
present the set of retrieved contacts to the user via a second user interface; receive a selection of contacts of the set of contacts from the user, via the selection user interface; and display the selected contacts from the set of contacts in the face tray. 9. The computer program product of claim 8, wherein the selection user interface is presented to the user when the user first signs on to the messaging application. 10. The computer program product of claim 1, wherein the selection user interface is presented to the user when a contact associated with the user begins using the messaging application. 11. The computer program product of claim 1, wherein the messaging application is configured to send images or videos to one or more contacts on receiving a single user interaction with a contact icon in the face tray. 12. A computer program product comprising a computer-readable medium having instructions encoded thereon that, when executed by a processor, cause the processor to:
present a user interface of a messaging application to a user of a client device, the user interface including a face tray, the face tray comprising a plurality of contact icons representing one or more contacts associated with the user; receive a user request to edit the face tray; and responsive to receiving the user request to edit the face tray:
retrieve a set of contacts of the user of the client device,
identify a set of attributes associated with the retrieved contacts, and
rank the retrieved contacts based on the attributes associated with each contact, the ranking based on a prediction of contacts with whom the user is most likely to interact using the messaging application,
determine a listing of the retrieved contacts based on the ranking, and
present a selection user interface comprising the determined listing of the retrieved contacts. 13. The computer program product of claim 12, wherein the instructions further cause the processor to:
receive a selection of contacts icons of the contact icons presented to the user via the selection user interface, from the user; and present the selected contact icons in the face tray of the user interface. 14. The computer program product of claim 12, wherein the instructions further cause the processor to:
receive a user interaction with contacts icons presented to the user via the selection user interface, the user interaction comprising the user dragging a contact icon from the selection user interface to the face tray; and present the dragged contact icon in the face tray of the user interface. 15. The computer program product of claim 12, wherein an attribute associated with a retrieved contact is a name identifying the contact, and wherein the retrieved contacts are ranked based on an inferred familial relationship between the user and the contact determined from the name identifying the contact. 16. The computer program product of claim 12, wherein an attribute associated with a retrieved contact is address information associated with the contact that indicates a physical address at which the retrieved contact resides or an email address associated with the retrieved contact. 17. The computer program product of claim 12, wherein an attribute associated with a retrieved contact is an identifier indicating the user's intent to interact with the contact frequently using one or more applications installed on the client device. 18. The computer program product of claim 12, wherein an attribute associated with a retrieved contact is the number of times a user interacts with the retrieved contact using one or more applications installed on the client device. 19. The computer program product of claim 12, wherein an attribute associated with a retrieved contact is the number of common connections or retrieved contacts between the user and the retrieved contact. 20. The computer program product of claim 12, wherein the user interaction is received with respect to a gear icon presented with the user interface. 21. The computer program product of claim 12, wherein the retrieved contacts are ranked based on the number of connections between a retrieved contact and the user in a social graph comprising a plurality of contacts of both the user and the retrieved contact. 22. The computer program product of claim 12, wherein the messaging application is configured to send images or videos to one or more contacts on receiving a single user interaction with a contact icon in the face tray. 23. The computer program product of claim 12, wherein the listing of the retrieved contacts is ordered based on the rank associated with the retrieved contacts. 24. The computer program product of claim 12, wherein the listing of the retrieved contacts is filtered based on the rank associated with the retrieved contacts. | A user interacts with a messaging application on a client device to capture and send images to contacts or connections of the user, with a single user interaction. The messaging application installed on the client device, presents to the user a user interface. The user interface includes a camera view, and a face tray. The messaging application automatically populates the face tray with contact icons associated with one or more contacts. The messaging application identifies contacts associated with the user and attributes associated with the contacts. Based on one or more attributes, the messaging application may rank the contacts. Based on the rank associated with the contacts, the messaging application selects one or more contacts to include in the face tray to present to the user or to provide to the user from which the user can select contacts to include in the face tray.1. A computer program product comprising a computer-readable medium having instructions encoded thereon that, when executed by a processor, cause the processor to:
present a user interface of a messaging application to a user of a client device, the user interface including a face tray, the face tray comprising a plurality of contact icons, each contact icon representing one or more contacts of the user; and retrieve a set of contacts of the user of the client device; identify a set of attributes associated with the retrieved contacts; rank the retrieved contacts based on the attributes associated with each contact, the ranking based on a prediction of contacts with whom the user is most likely to interact using the messaging application; select, based on the ranking of the retrieved contacts, a set of the retrieved contacts for display in the face tray; and populate the face tray with the selected contact icons. 2. The computer program product of claim 1, wherein an attribute associated with a retrieved contact is a name identifying the contact, and wherein the retrieved contacts are ranked based on an inferred familial relationship between the user and the contact determined from the name identifying the contact. 3. The computer program product of claim 1, wherein an attribute associated with a retrieved contact is address information associated with the retrieved contact that indicates a physical address at which the retrieved contact resides or an email address associated with the retrieved contact. 4. The computer program product of claim 1, wherein an attribute associated with a retrieved contact is an identifier indicating the user's intent to interact with the retrieved contact frequently, using one or more applications installed on the client device. 5. The computer program product of claim 1, wherein an attribute associated with a retrieved contact is the number of times a user interacts with the retrieved contact using one or more applications installed on the client device. 6. The computer program product of claim 1, wherein an attribute associated with a retrieved contact is the number of common connections or contacts between the user and the retrieved contact. 7. The computer program product of claim 1, wherein the retrieved contacts may be ranked based on the number of connections between a contact and the user in a social graph comprising a plurality of contacts of both the user and the retrieved contact. 8. The computer program product of claim 1, wherein the instructions further cause the processor to:
present the set of retrieved contacts to the user via a second user interface; receive a selection of contacts of the set of contacts from the user, via the selection user interface; and display the selected contacts from the set of contacts in the face tray. 9. The computer program product of claim 8, wherein the selection user interface is presented to the user when the user first signs on to the messaging application. 10. The computer program product of claim 1, wherein the selection user interface is presented to the user when a contact associated with the user begins using the messaging application. 11. The computer program product of claim 1, wherein the messaging application is configured to send images or videos to one or more contacts on receiving a single user interaction with a contact icon in the face tray. 12. A computer program product comprising a computer-readable medium having instructions encoded thereon that, when executed by a processor, cause the processor to:
present a user interface of a messaging application to a user of a client device, the user interface including a face tray, the face tray comprising a plurality of contact icons representing one or more contacts associated with the user; receive a user request to edit the face tray; and responsive to receiving the user request to edit the face tray:
retrieve a set of contacts of the user of the client device,
identify a set of attributes associated with the retrieved contacts, and
rank the retrieved contacts based on the attributes associated with each contact, the ranking based on a prediction of contacts with whom the user is most likely to interact using the messaging application,
determine a listing of the retrieved contacts based on the ranking, and
present a selection user interface comprising the determined listing of the retrieved contacts. 13. The computer program product of claim 12, wherein the instructions further cause the processor to:
receive a selection of contacts icons of the contact icons presented to the user via the selection user interface, from the user; and present the selected contact icons in the face tray of the user interface. 14. The computer program product of claim 12, wherein the instructions further cause the processor to:
receive a user interaction with contacts icons presented to the user via the selection user interface, the user interaction comprising the user dragging a contact icon from the selection user interface to the face tray; and present the dragged contact icon in the face tray of the user interface. 15. The computer program product of claim 12, wherein an attribute associated with a retrieved contact is a name identifying the contact, and wherein the retrieved contacts are ranked based on an inferred familial relationship between the user and the contact determined from the name identifying the contact. 16. The computer program product of claim 12, wherein an attribute associated with a retrieved contact is address information associated with the contact that indicates a physical address at which the retrieved contact resides or an email address associated with the retrieved contact. 17. The computer program product of claim 12, wherein an attribute associated with a retrieved contact is an identifier indicating the user's intent to interact with the contact frequently using one or more applications installed on the client device. 18. The computer program product of claim 12, wherein an attribute associated with a retrieved contact is the number of times a user interacts with the retrieved contact using one or more applications installed on the client device. 19. The computer program product of claim 12, wherein an attribute associated with a retrieved contact is the number of common connections or retrieved contacts between the user and the retrieved contact. 20. The computer program product of claim 12, wherein the user interaction is received with respect to a gear icon presented with the user interface. 21. The computer program product of claim 12, wherein the retrieved contacts are ranked based on the number of connections between a retrieved contact and the user in a social graph comprising a plurality of contacts of both the user and the retrieved contact. 22. The computer program product of claim 12, wherein the messaging application is configured to send images or videos to one or more contacts on receiving a single user interaction with a contact icon in the face tray. 23. The computer program product of claim 12, wherein the listing of the retrieved contacts is ordered based on the rank associated with the retrieved contacts. 24. The computer program product of claim 12, wherein the listing of the retrieved contacts is filtered based on the rank associated with the retrieved contacts. | 2,100 |
5,374 | 5,374 | 14,993,589 | 2,145 | A display device is provided. The display apparatus includes: a display configured to display a user interface screen; an input unit configured to receive a user operation to select and execute at least one menu included in the user interface screen; and a processor configured to separately recognize a short click and a long press based on an input time of the user operation, constantly maintain an execution speed of a function corresponding to a selected menu within a preset critical time in the time for which the input of the long press is continued and accelerate the execution speed of the corresponding function after the preset critical time passes. By this configuration, it is possible to intuitively and easily operate the display apparatus to increase operation convenience of a user. | 1. A display apparatus, comprising:
a display configured to display a user interface screen; an input unit configured to receive a user operation to select and execute at least one menu included in the user interface screen; and a processor configured to separately recognize a short click and a long press based on an input time of the user operation, constantly maintain an execution speed of a function corresponding to a selected menu within a preset critical time in time for which an input of the long press is continued and accelerate the execution speed of the corresponding function after the preset critical time passes. 2. The display apparatus as claimed in claim 1, wherein the processor is further configured to constantly maintain a sampling section in which the input of the long press is recognized at a preset size within the preset critical time and to change the sampling section in which the input of the long press is recognized to a size which is smaller than the preset size after the preset critical time passes. 3. The display apparatus as claimed in claim 1, wherein the processor is further configured to create an on screen display (OSD) which guides functions corresponding to each of the short click and the long press and to display the created OSD on the display. 4. The display apparatus as claimed in claim 1, wherein the processor is further configured to move a selected GUI for selecting one of the at least one menu included in the user interface screen when the user operation is recognized as the short click and to select and execute a menu at which the selected GUI is positioned when the user operation is recognized as the long press. 5. The display apparatus as claimed in claim 4, wherein the processor is further configured to constantly maintain a channel change speed within the preset critical time and to accelerate the channel change speed after the preset critical time when the menu at which the selected GUI is positioned is a channel change menu. 6. The display apparatus as claimed in claim 5, wherein the processor is further configured to constantly maintain a volume change speed within the preset critical time and to accelerate the volume change speed after the preset critical time when the menu at which the selection GUI is positioned is a volume change menu. 7. The display apparatus as claimed in claim 1, wherein the input unit includes at least one of a single physical function key and a touch panel. 8. The display apparatus as claimed in claim 7, wherein at least one of the single physical function key and the touch panel is provided on a bezel portion of the display apparatus. 9. A controlling method of a display apparatus including an input unit which receives a user operation to select and execute at least one menu included in a user interface screen, the controlling method comprising:
displaying the user interface screen; separately recognizing a short click and a long press based on an input time of the user operation; and constantly maintaining an execution speed of a function corresponding to a selected menu within a preset critical time, in time for which an input of the long press is continued, and accelerating the execution speed of the corresponding function after the preset critical time passes. 10. The controlling method as claimed in claim 9, wherein the accelerating further comprises:
a sampling section, in which the input of the long press is recognized, is constantly maintained at a preset size within the preset critical time, and the sampling section, in which the input of the long press is recognized, is changed to a size which is smaller than the preset size after the preset critical time passes. 11. The controlling method as claimed in claim 9, further comprising:
creating an on screen display (OSD) which guides functions corresponding to each of the short click and the long press, and displaying the created OSD. 12. The controlling method as claimed in claim 9, further comprising:
moving a selected GUI for selecting one of at least one menu included in the user interface screen, when the user operation is recognized as the short click and selecting and executing a menu at which the selected GUI is positioned, when the user operation is recognized as the long press. 13. The controlling method as claimed in claim 12, wherein the accelerating further comprises:
constantly maintaining channel change speed within the preset critical time, and accelerating the channel change speed after the preset critical time passes, when the menu at which the selected GUI is positioned is a channel change menu. 14. The controlling method as claimed in claim 13, wherein the accelerating further comprises:
constantly maintaining a volume change speed is constantly maintained within the preset critical time, and accelerating the volume change speed after the preset critical time passes, when the menu at which the selected GUI is positioned is a volume change menu. 15. The controlling method as claimed in claim 9, wherein the input unit includes at least one of a single physical function key and a touch panel. 16. The controlling method as claimed in claim 15, wherein at least one of the single physical function key and the touch panel is provided on a bezel portion of the display apparatus. 17. A display apparatus, comprising:
an input unit configured to receive a user operation; and a processor configured to classify the input user operation based on an amount of time of the input user operation, and amplify the functionality of the input user operation after a predetermined amount of time passes. 18. A controlling method of a display apparatus, comprising:
receiving a user operation input; classifying the input user operation based on an amount of time of the input user operation; and amplifying the functionality of the input user operation after a predetermined amount of time passes. | A display device is provided. The display apparatus includes: a display configured to display a user interface screen; an input unit configured to receive a user operation to select and execute at least one menu included in the user interface screen; and a processor configured to separately recognize a short click and a long press based on an input time of the user operation, constantly maintain an execution speed of a function corresponding to a selected menu within a preset critical time in the time for which the input of the long press is continued and accelerate the execution speed of the corresponding function after the preset critical time passes. By this configuration, it is possible to intuitively and easily operate the display apparatus to increase operation convenience of a user.1. A display apparatus, comprising:
a display configured to display a user interface screen; an input unit configured to receive a user operation to select and execute at least one menu included in the user interface screen; and a processor configured to separately recognize a short click and a long press based on an input time of the user operation, constantly maintain an execution speed of a function corresponding to a selected menu within a preset critical time in time for which an input of the long press is continued and accelerate the execution speed of the corresponding function after the preset critical time passes. 2. The display apparatus as claimed in claim 1, wherein the processor is further configured to constantly maintain a sampling section in which the input of the long press is recognized at a preset size within the preset critical time and to change the sampling section in which the input of the long press is recognized to a size which is smaller than the preset size after the preset critical time passes. 3. The display apparatus as claimed in claim 1, wherein the processor is further configured to create an on screen display (OSD) which guides functions corresponding to each of the short click and the long press and to display the created OSD on the display. 4. The display apparatus as claimed in claim 1, wherein the processor is further configured to move a selected GUI for selecting one of the at least one menu included in the user interface screen when the user operation is recognized as the short click and to select and execute a menu at which the selected GUI is positioned when the user operation is recognized as the long press. 5. The display apparatus as claimed in claim 4, wherein the processor is further configured to constantly maintain a channel change speed within the preset critical time and to accelerate the channel change speed after the preset critical time when the menu at which the selected GUI is positioned is a channel change menu. 6. The display apparatus as claimed in claim 5, wherein the processor is further configured to constantly maintain a volume change speed within the preset critical time and to accelerate the volume change speed after the preset critical time when the menu at which the selection GUI is positioned is a volume change menu. 7. The display apparatus as claimed in claim 1, wherein the input unit includes at least one of a single physical function key and a touch panel. 8. The display apparatus as claimed in claim 7, wherein at least one of the single physical function key and the touch panel is provided on a bezel portion of the display apparatus. 9. A controlling method of a display apparatus including an input unit which receives a user operation to select and execute at least one menu included in a user interface screen, the controlling method comprising:
displaying the user interface screen; separately recognizing a short click and a long press based on an input time of the user operation; and constantly maintaining an execution speed of a function corresponding to a selected menu within a preset critical time, in time for which an input of the long press is continued, and accelerating the execution speed of the corresponding function after the preset critical time passes. 10. The controlling method as claimed in claim 9, wherein the accelerating further comprises:
a sampling section, in which the input of the long press is recognized, is constantly maintained at a preset size within the preset critical time, and the sampling section, in which the input of the long press is recognized, is changed to a size which is smaller than the preset size after the preset critical time passes. 11. The controlling method as claimed in claim 9, further comprising:
creating an on screen display (OSD) which guides functions corresponding to each of the short click and the long press, and displaying the created OSD. 12. The controlling method as claimed in claim 9, further comprising:
moving a selected GUI for selecting one of at least one menu included in the user interface screen, when the user operation is recognized as the short click and selecting and executing a menu at which the selected GUI is positioned, when the user operation is recognized as the long press. 13. The controlling method as claimed in claim 12, wherein the accelerating further comprises:
constantly maintaining channel change speed within the preset critical time, and accelerating the channel change speed after the preset critical time passes, when the menu at which the selected GUI is positioned is a channel change menu. 14. The controlling method as claimed in claim 13, wherein the accelerating further comprises:
constantly maintaining a volume change speed is constantly maintained within the preset critical time, and accelerating the volume change speed after the preset critical time passes, when the menu at which the selected GUI is positioned is a volume change menu. 15. The controlling method as claimed in claim 9, wherein the input unit includes at least one of a single physical function key and a touch panel. 16. The controlling method as claimed in claim 15, wherein at least one of the single physical function key and the touch panel is provided on a bezel portion of the display apparatus. 17. A display apparatus, comprising:
an input unit configured to receive a user operation; and a processor configured to classify the input user operation based on an amount of time of the input user operation, and amplify the functionality of the input user operation after a predetermined amount of time passes. 18. A controlling method of a display apparatus, comprising:
receiving a user operation input; classifying the input user operation based on an amount of time of the input user operation; and amplifying the functionality of the input user operation after a predetermined amount of time passes. | 2,100 |
5,375 | 5,375 | 15,235,469 | 2,178 | Various embodiments are described that relate to creating a user interface when a data structure is unknown. An application can be used to discover the content of that unknown data structure at runtime. Part of this discovery can include conversion of that data structure from a virtual machine class to a markup language. The discovered content can be used to build a user interface presented on a display. The user interface can be interactive such that information is entered into the user interface. That entered information can be retained in a database as can the discovered content. The entered information along with the content can be converted from the markup language to the virtual machine class back to an originator of the unknown data structure. This way, the originator receives a response in a format usable by the originator. | 1. A system, comprising:
a collection component configured to collect an information set formatted in a data structure, the data structure being unknown to the collection component upon collection and a content of the information set being unknown to the collection component upon collection; an evaluation component configured to perform an evaluation of the information set after collection, the evaluation determines the content of the information set; a creation component configured to create a user interface that discloses at least part of the content of the information set; and an output component configured to cause disclosure of the user interface upon a display. 2. The system of claim 1, comprising:
an entry component configured to access an entry into the user interface; an analysis component configured to analyze the entry into the user interface to determine a content of the user interface; and a retention component configured to cause retention of at least part of the entry into a database, where the entry is in a markup language. 3. The system of claim 2, comprising:
a conversion component configured to convert the entry into an instance; and a combination component configured to combine the instance with a definition into a single construct, where the user interface is created from the definition, where the creation component is, in creation of the user interface, configured to convert the data structure into the definition and where the data structure is a virtual machine class. 4. The system of claim 3, comprising:
a transfer component configured to cause a transfer of the single construct to an entity that provides the information set formatted in the data structure, where the single construct is in the virtual machine class. 5. The system of claim 2,
where the retention component is configured to cause retention of part of the content in a database in a content-specific location and where the retention component is configured to cause retention of part of the content in a database in a general location. 6. The system of claim 1,
where the data structure is a virtual machine class, where the evaluation component is configured to convert the data structure from a virtual machine class to a definition, and where the creation component is configured to use the definition to create the user interface. 7. The system of claim 6,
where the creation component is configured to employ a renderer to convert the definition to a markup language and where the markup language is used to create the user interface. 8. The system of claim 1, comprising:
a visualization component configured to produce a visualization that represents at least part of the information set, where the output component is configured to cause disclosure of the visualization upon the display. 9. A method, comprising:
obtaining an information set in an unknown format; identifying an information classification expected in the information set; searching the information set for a piece of information that meets the information classification; identifying the piece of information that meets the information classification as a result of the search; and recording the piece of information that meets the information classification in a database location associated with the information classification. 10. The method of claim 9, comprising:
identifying a piece of information of the information set that does not meet the classification; and recording the piece of information of the information set that does not meet the classification in a general storage location of the database, where the piece of information that meets the information classification is recorded in a specific storage location of the database different from the general storage location. 11. (canceled) 12. The method of claim 9, comprising:
identifying the piece of information in the information set that does not meet an existing information classification; creating a new information classification for the piece of information in the information set that does not meet the existing information classification; and recording the piece of information in the information set that does not meet the existing information classification in a database location associated with the new information classification. 13. The method of claim 9, comprising:
sending a request for the information set in a virtual machine class to a personal electronic device; where a structure of the virtual machine class is unknown to the personal electronic device upon collection of the request, where the personal electronic device converts the virtual machine class into a markup language, where the information set is an entry into a user interface that is based, at least in part, on the markup language, where the entry and the markup language are combined together and converted into the virtual machine class, and where searching the information set for the piece of information that meets the information classification occurs upon the converted virtual machine class. 14. A method, comprising:
obtaining an information set of an unknown data structure; discovering, at runtime, the data structure of the information set after the information set is obtained such that the unknown data structure is known; identifying, at runtime, the content of the information set after the data structure is discovered; creating an item for presentation upon a display based, at least in part, on the content; and causing presentation of the item upon the display. 15. The method of claim 14, where the information set is a first information set and where the item is a first item, comprising:
obtaining a second information set of an unknown data structure; discovering the data structure of the second information set after the second information set is obtained such that the unknown data structure of the second information set is known; identifying the content of the second information set after the data structure of the second information set is discovered; creating a second item for presentation upon the display based, at least in part, on the content of the second information set; and causing presentation of the second item upon the display, where the data structure of the first information set and the data structure of the second information set are different data structures. 16. The method of claim 15,
where a format of the first item and a format of the second item are identical and where the first item and the second item are presented at different times. 17. The method of claim 15,
where a format of the first item and a format of the second item are different and where the first item and second time are caused to be presented concurrently. 18. The method of claim 17,
where the first item and the second item are presented concurrently on a single map. 19. The method of claim 14, comprising:
identifying a part of an entry into the user interface as a recognized classification; identifying a part of an entry into the user interface set as an unrecognized classification; causing retention of the part of the entry into the user interface that is of the recognized classification in a storage location associated with the recognized classification; and causing retention of the part of the entry into the user interface that is of the unrecognized classification in a general storage location. 20. The method of claim 14, comprising:
accessing an information set entered into the user interface; converting the information set into the data structure; and causing the converted data structure to be outputted. 21. The method of claim 9,
where identifying the information classification expected in the information set occurs without, at the time of or before identifying the information classification expected in the information set, determining an actual information classification in the information set. | Various embodiments are described that relate to creating a user interface when a data structure is unknown. An application can be used to discover the content of that unknown data structure at runtime. Part of this discovery can include conversion of that data structure from a virtual machine class to a markup language. The discovered content can be used to build a user interface presented on a display. The user interface can be interactive such that information is entered into the user interface. That entered information can be retained in a database as can the discovered content. The entered information along with the content can be converted from the markup language to the virtual machine class back to an originator of the unknown data structure. This way, the originator receives a response in a format usable by the originator.1. A system, comprising:
a collection component configured to collect an information set formatted in a data structure, the data structure being unknown to the collection component upon collection and a content of the information set being unknown to the collection component upon collection; an evaluation component configured to perform an evaluation of the information set after collection, the evaluation determines the content of the information set; a creation component configured to create a user interface that discloses at least part of the content of the information set; and an output component configured to cause disclosure of the user interface upon a display. 2. The system of claim 1, comprising:
an entry component configured to access an entry into the user interface; an analysis component configured to analyze the entry into the user interface to determine a content of the user interface; and a retention component configured to cause retention of at least part of the entry into a database, where the entry is in a markup language. 3. The system of claim 2, comprising:
a conversion component configured to convert the entry into an instance; and a combination component configured to combine the instance with a definition into a single construct, where the user interface is created from the definition, where the creation component is, in creation of the user interface, configured to convert the data structure into the definition and where the data structure is a virtual machine class. 4. The system of claim 3, comprising:
a transfer component configured to cause a transfer of the single construct to an entity that provides the information set formatted in the data structure, where the single construct is in the virtual machine class. 5. The system of claim 2,
where the retention component is configured to cause retention of part of the content in a database in a content-specific location and where the retention component is configured to cause retention of part of the content in a database in a general location. 6. The system of claim 1,
where the data structure is a virtual machine class, where the evaluation component is configured to convert the data structure from a virtual machine class to a definition, and where the creation component is configured to use the definition to create the user interface. 7. The system of claim 6,
where the creation component is configured to employ a renderer to convert the definition to a markup language and where the markup language is used to create the user interface. 8. The system of claim 1, comprising:
a visualization component configured to produce a visualization that represents at least part of the information set, where the output component is configured to cause disclosure of the visualization upon the display. 9. A method, comprising:
obtaining an information set in an unknown format; identifying an information classification expected in the information set; searching the information set for a piece of information that meets the information classification; identifying the piece of information that meets the information classification as a result of the search; and recording the piece of information that meets the information classification in a database location associated with the information classification. 10. The method of claim 9, comprising:
identifying a piece of information of the information set that does not meet the classification; and recording the piece of information of the information set that does not meet the classification in a general storage location of the database, where the piece of information that meets the information classification is recorded in a specific storage location of the database different from the general storage location. 11. (canceled) 12. The method of claim 9, comprising:
identifying the piece of information in the information set that does not meet an existing information classification; creating a new information classification for the piece of information in the information set that does not meet the existing information classification; and recording the piece of information in the information set that does not meet the existing information classification in a database location associated with the new information classification. 13. The method of claim 9, comprising:
sending a request for the information set in a virtual machine class to a personal electronic device; where a structure of the virtual machine class is unknown to the personal electronic device upon collection of the request, where the personal electronic device converts the virtual machine class into a markup language, where the information set is an entry into a user interface that is based, at least in part, on the markup language, where the entry and the markup language are combined together and converted into the virtual machine class, and where searching the information set for the piece of information that meets the information classification occurs upon the converted virtual machine class. 14. A method, comprising:
obtaining an information set of an unknown data structure; discovering, at runtime, the data structure of the information set after the information set is obtained such that the unknown data structure is known; identifying, at runtime, the content of the information set after the data structure is discovered; creating an item for presentation upon a display based, at least in part, on the content; and causing presentation of the item upon the display. 15. The method of claim 14, where the information set is a first information set and where the item is a first item, comprising:
obtaining a second information set of an unknown data structure; discovering the data structure of the second information set after the second information set is obtained such that the unknown data structure of the second information set is known; identifying the content of the second information set after the data structure of the second information set is discovered; creating a second item for presentation upon the display based, at least in part, on the content of the second information set; and causing presentation of the second item upon the display, where the data structure of the first information set and the data structure of the second information set are different data structures. 16. The method of claim 15,
where a format of the first item and a format of the second item are identical and where the first item and the second item are presented at different times. 17. The method of claim 15,
where a format of the first item and a format of the second item are different and where the first item and second time are caused to be presented concurrently. 18. The method of claim 17,
where the first item and the second item are presented concurrently on a single map. 19. The method of claim 14, comprising:
identifying a part of an entry into the user interface as a recognized classification; identifying a part of an entry into the user interface set as an unrecognized classification; causing retention of the part of the entry into the user interface that is of the recognized classification in a storage location associated with the recognized classification; and causing retention of the part of the entry into the user interface that is of the unrecognized classification in a general storage location. 20. The method of claim 14, comprising:
accessing an information set entered into the user interface; converting the information set into the data structure; and causing the converted data structure to be outputted. 21. The method of claim 9,
where identifying the information classification expected in the information set occurs without, at the time of or before identifying the information classification expected in the information set, determining an actual information classification in the information set. | 2,100 |
5,376 | 5,376 | 14,205,619 | 2,173 | Information storages store a plurality of different types of information. An update information storage stores a part of information updated in the information storages as update information associated with the respective types. An update information manager monitors an information update in the information storages and stores, when an information update is made in the information storages, the part of the updated information in the update information storage as update information associated with the respective types. Further, an information selector extracts the update information stored in the update information storage in time series and outputs them to display them on a screen. | 1. A computer-implemented method of displaying update information on a mobile device, comprising:
obtaining said update information, by an application executed by said mobile device from an update information controller of said mobile device, said update information including common subject data or different subject data, and including an earliest-in-time-series update information and a latest-in-time-series update information; extracting said update information; sending, to a display controller, said update information arranged in reverse chronological order; displaying, on a touch screen display by said display controller, said update information in reverse, continuous, sequential chronological order from an upper portion to a lower portion of said touch screen display; detecting an input instruction provided by touching, dragging, and releasing said touch screen display; determining, in response to the detecting said input instruction, a direction of said input instruction as being an upward direction or a downward direction; and scrolling, in response to the detecting, said update information on said touch screen display based on said direction of said input instruction, wherein when said direction of said input instruction is detected as being the upward direction, removing newer update information from said upper portion of said touch screen display and adding older update information from said lower portion of said touch screen display, and when said direction of said input instruction is detected as being the downward direction, adding newer update information from said upper portion of said touch screen display and removing older update information from said lower portion bottom of said touch screen display. 2. The method as recited in claim 1, further comprising:
specifying a top update information or a most recent update information using one or more touch button icons on said touch screen display. 3. The method as recited in claim 1, wherein said update information is formatted for displaying by said display controller based on an update information formatting instruction. 4. The method as recited in claim 1, further comprising:
determining, in response to the detecting said input instruction, the direction of said input instruction as being a sideward direction; adding an extended update information from a side portion of said touch screen display; removing said update information from an opposite side of said side portion of said touch screen display; requesting, by said application from said update information controller, said extended update information that is arranged chronologically; extracting said extended update information from said update information controller, wherein said update information controller accesses said extended update information from an information storage, and sends said extended update information to said display controller by said update information controller. 5. The method as recited in claim 1, wherein said information storage is an information accumulation device that is disposed in the mobile device or is accessible through a network. 6. The method as recited in claim 1, wherein said input instruction is provided by scrolling an icon on said touch screen display. 7. A non-transitory computer-readable medium storing computer-readable instructions thereon which when executed by a computer cause the computer to perform a method of displaying update information on a mobile device, the method comprising:
obtaining said update information, by an application executed by said mobile device from an update information controller of said mobile device, said update information including common subject data or different subject data, and including an earliest-in-time-series update information and a latest-in-time-series update information; extracting said update information; sending, to a display controller, said update information arranged in reverse chronological order; displaying, on a touch screen display by said display controller, said update information in reverse, continuous, sequential chronological order from an upper portion to a lower portion of said touch screen display; detecting an input instruction provided by touching, dragging, and releasing said touch screen display; determining, in response to the detecting said input instruction, a direction of said input instruction as being an upward direction or a downward direction; and scrolling, in response to the detecting, said update information on said touch screen display based on said direction of said input instruction, wherein when said direction of said input instruction is detected as being the upward direction, removing newer update information from said upper portion of said touch screen display and adding older update information from said lower portion of said touch screen display, and when said direction of said input instruction is detected as being the downward direction, adding newer update information from said upper portion of said touch screen display and removing older update information from said lower portion bottom of said touch screen display. 8. The non-transitory computer-readable medium as recited in claim 7, further comprising:
specifying a top update information or a most recent update information using one or more touch button icons on said touch screen display. 9. The non-transitory computer-readable medium as recited in claim 7, wherein said update information is formatted for displaying by said display controller based on an update information formatting instruction. 10. The non-transitory computer-readable medium as recited in claim 7, further comprising:
determining, in response to the detecting said input instruction, the direction of said input instruction as being a sideward direction; adding an extended update information from a side portion of said touch screen display; removing said update information from an opposite side of said side portion of said touch screen display; requesting, by said application from said update information controller, said extended update information that is arranged chronologically; extracting said extended update information from said update information controller, wherein said update information controller accesses said extended update information from an information storage, and sends said extended update information to said display controller by said update information controller. 11. The non-transitory computer-readable medium as recited in claim 7, wherein said information storage is an information accumulation device that is disposed in the mobile device or is accessible through a network. 12. The non-transitory computer-readable medium as recited in claim 7, wherein said input instruction is provided by scrolling an icon on said touch screen display. 13. A mobile device for displaying update information, comprising:
circuitry configured to
obtain said update information, by an application executed by said mobile device from an update information controller of said mobile device, said update information including common subject data or different subject data, and including an earliest-in-time-series update information and a latest-in-time-series update information,
extract said update information,
send, to a display controller, said update information arranged in reverse chronological order,
display, on a touch screen display by said display controller, said update information in reverse, continuous, sequential chronological order from an upper portion to a lower portion of said touch screen display,
detect an input instruction provided by touching, dragging, and release said touch screen display,
determine, in response to the detecting said input instruction, a direction of said input instruction as being an upward direction or a downward direction, and
scroll, in response to the detecting, said update information on said touch screen display based on said direction of said input instruction, wherein
when said direction of said input instruction is detected as being the upward direction, the circuitry removes newer update information from said upper portion of said touch screen display and adding older update information from said lower portion of said touch screen display, and
when said direction of said input instruction is detected as being the downward direction, the circuitry adds newer update information from said upper portion of said touch screen display and removing older update information from said lower portion bottom of said touch screen display. 14. The mobile device as recited in claim 13, wherein the circuitry is further configured to specify a top update information or a most recent update information using one or more touch button icons on said touch screen display. 15. The mobile device as recited in claim 13, wherein said update information is formatted for displaying by said display controller based on an update information formatting instruction. 16. The mobile device as recited in claim 13, wherein the circuitry is further configured to
determine, in response to the detecting said input instruction, the direction of said input instruction as being a sideward direction, add an extended update information from a side portion of said touch screen display, remove said update information from an opposite side of said side portion of said touch screen display, request, by said application from said update information controller, said extended update information that is arranged chronologically, extract said extended update information from said update information controller, wherein said update information controller accesses said extended update information from an information storage, and sends said extended update information to said display controller by said update information controller. 17. The mobile device as recited in claim 13, wherein said information storage is an information accumulation device that is disposed in the mobile device or is accessible through a network. 18. The mobile device as recited in claim 13, wherein said input instruction is provided by scrolling an icon on said touch screen display. | Information storages store a plurality of different types of information. An update information storage stores a part of information updated in the information storages as update information associated with the respective types. An update information manager monitors an information update in the information storages and stores, when an information update is made in the information storages, the part of the updated information in the update information storage as update information associated with the respective types. Further, an information selector extracts the update information stored in the update information storage in time series and outputs them to display them on a screen.1. A computer-implemented method of displaying update information on a mobile device, comprising:
obtaining said update information, by an application executed by said mobile device from an update information controller of said mobile device, said update information including common subject data or different subject data, and including an earliest-in-time-series update information and a latest-in-time-series update information; extracting said update information; sending, to a display controller, said update information arranged in reverse chronological order; displaying, on a touch screen display by said display controller, said update information in reverse, continuous, sequential chronological order from an upper portion to a lower portion of said touch screen display; detecting an input instruction provided by touching, dragging, and releasing said touch screen display; determining, in response to the detecting said input instruction, a direction of said input instruction as being an upward direction or a downward direction; and scrolling, in response to the detecting, said update information on said touch screen display based on said direction of said input instruction, wherein when said direction of said input instruction is detected as being the upward direction, removing newer update information from said upper portion of said touch screen display and adding older update information from said lower portion of said touch screen display, and when said direction of said input instruction is detected as being the downward direction, adding newer update information from said upper portion of said touch screen display and removing older update information from said lower portion bottom of said touch screen display. 2. The method as recited in claim 1, further comprising:
specifying a top update information or a most recent update information using one or more touch button icons on said touch screen display. 3. The method as recited in claim 1, wherein said update information is formatted for displaying by said display controller based on an update information formatting instruction. 4. The method as recited in claim 1, further comprising:
determining, in response to the detecting said input instruction, the direction of said input instruction as being a sideward direction; adding an extended update information from a side portion of said touch screen display; removing said update information from an opposite side of said side portion of said touch screen display; requesting, by said application from said update information controller, said extended update information that is arranged chronologically; extracting said extended update information from said update information controller, wherein said update information controller accesses said extended update information from an information storage, and sends said extended update information to said display controller by said update information controller. 5. The method as recited in claim 1, wherein said information storage is an information accumulation device that is disposed in the mobile device or is accessible through a network. 6. The method as recited in claim 1, wherein said input instruction is provided by scrolling an icon on said touch screen display. 7. A non-transitory computer-readable medium storing computer-readable instructions thereon which when executed by a computer cause the computer to perform a method of displaying update information on a mobile device, the method comprising:
obtaining said update information, by an application executed by said mobile device from an update information controller of said mobile device, said update information including common subject data or different subject data, and including an earliest-in-time-series update information and a latest-in-time-series update information; extracting said update information; sending, to a display controller, said update information arranged in reverse chronological order; displaying, on a touch screen display by said display controller, said update information in reverse, continuous, sequential chronological order from an upper portion to a lower portion of said touch screen display; detecting an input instruction provided by touching, dragging, and releasing said touch screen display; determining, in response to the detecting said input instruction, a direction of said input instruction as being an upward direction or a downward direction; and scrolling, in response to the detecting, said update information on said touch screen display based on said direction of said input instruction, wherein when said direction of said input instruction is detected as being the upward direction, removing newer update information from said upper portion of said touch screen display and adding older update information from said lower portion of said touch screen display, and when said direction of said input instruction is detected as being the downward direction, adding newer update information from said upper portion of said touch screen display and removing older update information from said lower portion bottom of said touch screen display. 8. The non-transitory computer-readable medium as recited in claim 7, further comprising:
specifying a top update information or a most recent update information using one or more touch button icons on said touch screen display. 9. The non-transitory computer-readable medium as recited in claim 7, wherein said update information is formatted for displaying by said display controller based on an update information formatting instruction. 10. The non-transitory computer-readable medium as recited in claim 7, further comprising:
determining, in response to the detecting said input instruction, the direction of said input instruction as being a sideward direction; adding an extended update information from a side portion of said touch screen display; removing said update information from an opposite side of said side portion of said touch screen display; requesting, by said application from said update information controller, said extended update information that is arranged chronologically; extracting said extended update information from said update information controller, wherein said update information controller accesses said extended update information from an information storage, and sends said extended update information to said display controller by said update information controller. 11. The non-transitory computer-readable medium as recited in claim 7, wherein said information storage is an information accumulation device that is disposed in the mobile device or is accessible through a network. 12. The non-transitory computer-readable medium as recited in claim 7, wherein said input instruction is provided by scrolling an icon on said touch screen display. 13. A mobile device for displaying update information, comprising:
circuitry configured to
obtain said update information, by an application executed by said mobile device from an update information controller of said mobile device, said update information including common subject data or different subject data, and including an earliest-in-time-series update information and a latest-in-time-series update information,
extract said update information,
send, to a display controller, said update information arranged in reverse chronological order,
display, on a touch screen display by said display controller, said update information in reverse, continuous, sequential chronological order from an upper portion to a lower portion of said touch screen display,
detect an input instruction provided by touching, dragging, and release said touch screen display,
determine, in response to the detecting said input instruction, a direction of said input instruction as being an upward direction or a downward direction, and
scroll, in response to the detecting, said update information on said touch screen display based on said direction of said input instruction, wherein
when said direction of said input instruction is detected as being the upward direction, the circuitry removes newer update information from said upper portion of said touch screen display and adding older update information from said lower portion of said touch screen display, and
when said direction of said input instruction is detected as being the downward direction, the circuitry adds newer update information from said upper portion of said touch screen display and removing older update information from said lower portion bottom of said touch screen display. 14. The mobile device as recited in claim 13, wherein the circuitry is further configured to specify a top update information or a most recent update information using one or more touch button icons on said touch screen display. 15. The mobile device as recited in claim 13, wherein said update information is formatted for displaying by said display controller based on an update information formatting instruction. 16. The mobile device as recited in claim 13, wherein the circuitry is further configured to
determine, in response to the detecting said input instruction, the direction of said input instruction as being a sideward direction, add an extended update information from a side portion of said touch screen display, remove said update information from an opposite side of said side portion of said touch screen display, request, by said application from said update information controller, said extended update information that is arranged chronologically, extract said extended update information from said update information controller, wherein said update information controller accesses said extended update information from an information storage, and sends said extended update information to said display controller by said update information controller. 17. The mobile device as recited in claim 13, wherein said information storage is an information accumulation device that is disposed in the mobile device or is accessible through a network. 18. The mobile device as recited in claim 13, wherein said input instruction is provided by scrolling an icon on said touch screen display. | 2,100 |
5,377 | 5,377 | 14,645,109 | 2,152 | In an example embodiment, primary data is received from a first tenant in a computer network. Then auxiliary data relating to the primary data is received from the first tenant. A first index is created for the primary data and the auxiliary data from the first tenant. Then the first index is stored as a first shardlet. The first shardlet is bundled with one or more other shardlets for the tenant in a shard group. The shard group is packed with one or more other shard groups in a first shard. Then the first shard is stored in a first instance of a distributed database, the distributed database comprising a plurality of instances, each instance operating on a different logical or physical device. | 1. A method comprising:
receiving primary data from a first tenant in a computer network; receiving auxiliary data relating to the primary data from the first tenant; creating a first index for the primary data and the auxiliary data from the first tenant; storing the first index as a first shardlet; bundling the first shardlet with one or more other shardlets for the tenant in a shard group; packing the shard group with one or more other shard groups in a first shard; and storing the first shard in a first instance of a distributed database, the distributed database comprising a plurality of instances, each instance operating on a different logical or physical device. 2. The method of claim 1, wherein the packing is performed dynamically in response to one or more updates to the primary or auxiliary data. 3. The method of claim 1, wherein the packing is performed dynamically based on weighting scores assigned to each of one or more shards, the weighting scores dynamically assigned to each of the one or more shards based on one or more factors of the first tenant. 4. The method of claim 3, wherein the one or more factors include size of data of the first tenant. 5. The method of claim 3, wherein the one or more factors include a weight applied to a size of the first tenant. 6. The method of claim 3, wherein the one or more factors include number of replicas for the first tenant. 7. The method of claim 3, wherein the weighting scores are further based on one or more factors of other tenants. 8. A system comprising:
a distributed database; a search core; and an indexing core executable on one or more processors, the indexing core comprising:
a plurality of different index adapters, each index adapter corresponding to a different document type of a different client application;
an index builder;
an index manager configured to receive first primary data and first auxiliary data relating to the first primary data from a first client application of a first tenant, parse the first primary data and first auxiliary data using the index adapter corresponding to the first client application, and send a request to the index builder to build an index for the first primary data and first auxiliary data; and
the index builder configured to create a first shardlet for the first primary data and the first auxiliary data and store the first shardlet with other shardlets in a shard group for the first tenant, the index builder further configured to pack the shard group along with other shard groups in a first shard in an organization that is dynamically determined. 9. The system of claim 8, wherein the packing is performed dynamically in response to one or more updates to the first primary or first auxiliary data. 10. The system of claim 8, wherein the packing is performed dynamically based on weighting scores assigned to each of one or more shards, the weighting scores dynamically assigned to each of the one or more shards based on one or more factors of the first tenant. 11. The system of claim 10, wherein the one or more factors include size of data of the first tenant. 12. The system of claim 10, wherein the one or more factors include a weight applied to a size of the first tenant. 13. The system of claim 10, wherein the one or more factors include number of replicas for the first tenant. 14. The system of claim 10, wherein the weighting scores are further based on one or more factors of other tenants. 15. A non-transitory machine-readable storage medium comprising instructions, which when implemented by one or more machines, cause the one or more machines to perform operations comprising:
receiving primary data from a first tenant in a computer network; receiving auxiliary data relating to the primary data from the first tenant; creating a first index for the primary data and the auxiliary data from the first tenant; storing the first index as a first shardlet; bundling the first shardlet with one or more other shardlets for the tenant in a shard group; packing the shard group with one or more other shard groups in a first shard; and storing the first shard in a first instance of a distributed database, the distributed database comprising a plurality of instances, each instance operating on a different logical or physical device. 16. The non-transitory machine-readable storage medium of claim 15, wherein the packing is performed dynamically in response to one or more updates to the primary or auxiliary data. 17. The non-transitory machine-readable storage medium of claim 15, wherein the packing is performed dynamically based on weighting scores assigned to each of one or more shards, the weighting scores dynamically assigned to each of the one or more shards based on one or more factors of the first tenant. 18. The non-transitory machine-readable storage medium of claim 17, wherein the one or more factors include size of data of the first tenant. 19. The non-transitory machine-readable storage medium of claim 17, wherein the one or more factors include a weight applied to a size of the first tenant. 20. The non-transitory machine-readable storage medium of claim 17, wherein the one or more factors include number of replicas for the first tenant. | In an example embodiment, primary data is received from a first tenant in a computer network. Then auxiliary data relating to the primary data is received from the first tenant. A first index is created for the primary data and the auxiliary data from the first tenant. Then the first index is stored as a first shardlet. The first shardlet is bundled with one or more other shardlets for the tenant in a shard group. The shard group is packed with one or more other shard groups in a first shard. Then the first shard is stored in a first instance of a distributed database, the distributed database comprising a plurality of instances, each instance operating on a different logical or physical device.1. A method comprising:
receiving primary data from a first tenant in a computer network; receiving auxiliary data relating to the primary data from the first tenant; creating a first index for the primary data and the auxiliary data from the first tenant; storing the first index as a first shardlet; bundling the first shardlet with one or more other shardlets for the tenant in a shard group; packing the shard group with one or more other shard groups in a first shard; and storing the first shard in a first instance of a distributed database, the distributed database comprising a plurality of instances, each instance operating on a different logical or physical device. 2. The method of claim 1, wherein the packing is performed dynamically in response to one or more updates to the primary or auxiliary data. 3. The method of claim 1, wherein the packing is performed dynamically based on weighting scores assigned to each of one or more shards, the weighting scores dynamically assigned to each of the one or more shards based on one or more factors of the first tenant. 4. The method of claim 3, wherein the one or more factors include size of data of the first tenant. 5. The method of claim 3, wherein the one or more factors include a weight applied to a size of the first tenant. 6. The method of claim 3, wherein the one or more factors include number of replicas for the first tenant. 7. The method of claim 3, wherein the weighting scores are further based on one or more factors of other tenants. 8. A system comprising:
a distributed database; a search core; and an indexing core executable on one or more processors, the indexing core comprising:
a plurality of different index adapters, each index adapter corresponding to a different document type of a different client application;
an index builder;
an index manager configured to receive first primary data and first auxiliary data relating to the first primary data from a first client application of a first tenant, parse the first primary data and first auxiliary data using the index adapter corresponding to the first client application, and send a request to the index builder to build an index for the first primary data and first auxiliary data; and
the index builder configured to create a first shardlet for the first primary data and the first auxiliary data and store the first shardlet with other shardlets in a shard group for the first tenant, the index builder further configured to pack the shard group along with other shard groups in a first shard in an organization that is dynamically determined. 9. The system of claim 8, wherein the packing is performed dynamically in response to one or more updates to the first primary or first auxiliary data. 10. The system of claim 8, wherein the packing is performed dynamically based on weighting scores assigned to each of one or more shards, the weighting scores dynamically assigned to each of the one or more shards based on one or more factors of the first tenant. 11. The system of claim 10, wherein the one or more factors include size of data of the first tenant. 12. The system of claim 10, wherein the one or more factors include a weight applied to a size of the first tenant. 13. The system of claim 10, wherein the one or more factors include number of replicas for the first tenant. 14. The system of claim 10, wherein the weighting scores are further based on one or more factors of other tenants. 15. A non-transitory machine-readable storage medium comprising instructions, which when implemented by one or more machines, cause the one or more machines to perform operations comprising:
receiving primary data from a first tenant in a computer network; receiving auxiliary data relating to the primary data from the first tenant; creating a first index for the primary data and the auxiliary data from the first tenant; storing the first index as a first shardlet; bundling the first shardlet with one or more other shardlets for the tenant in a shard group; packing the shard group with one or more other shard groups in a first shard; and storing the first shard in a first instance of a distributed database, the distributed database comprising a plurality of instances, each instance operating on a different logical or physical device. 16. The non-transitory machine-readable storage medium of claim 15, wherein the packing is performed dynamically in response to one or more updates to the primary or auxiliary data. 17. The non-transitory machine-readable storage medium of claim 15, wherein the packing is performed dynamically based on weighting scores assigned to each of one or more shards, the weighting scores dynamically assigned to each of the one or more shards based on one or more factors of the first tenant. 18. The non-transitory machine-readable storage medium of claim 17, wherein the one or more factors include size of data of the first tenant. 19. The non-transitory machine-readable storage medium of claim 17, wherein the one or more factors include a weight applied to a size of the first tenant. 20. The non-transitory machine-readable storage medium of claim 17, wherein the one or more factors include number of replicas for the first tenant. | 2,100 |
5,378 | 5,378 | 14,199,712 | 2,144 | Embodiments described herein relate to designing a customizable website by using a custom design application. The custom design application generally provides a site master template, a homepage template, a plurality of sub templates, and a 404 error template. The templates may be customized with input provided by a user. The method also provides a manner of customizing a website by utilizing a hierarchical relationship between the templates in order to easily and efficiently custom design a website. | 1. A method of designing a customizable website, comprising:
providing a customizable website from a server comprising a plurality of web page templates adhering to a hierarchical relationship, further comprising:
providing a site master template, wherein the site master template is customizable with input received from a user and the site master template is the most superior web page template in the hierarchical relationship;
providing a homepage template, wherein the homepage template is customizable with input received from the user and is inferior to the site master template in the hierarchical relationship;
providing a plurality of sub-templates, wherein the plurality of sub-templates are customizable with input received from the user and the plurality of sub-templates are inferior to the site master template in the hierarchical relationship; and
receiving localized input from the user customizing the plurality of web page templates in a manner not subject to the hierarchical relationship. 2. The method of claim 1, wherein the hierarchical relationship causes content provided to a superior template in the hierarchical relationship to be displayed on a template inferior to the superior template in the hierarchical relationship. 3. The method of claim 1, wherein the hierarchical relationship between the plurality of web page templates is customizable. 4. The method of claim 1, wherein input provided to the site master template is displayed on each of the plurality of web page templates inferior to the site master template in the hierarchical relationship via a global content effect. 5. The method of claim 1, wherein the plurality of sub-templates may be arranged in a cascading hierarchy with input provided by the user. 6. The method of claim 1, further comprising providing a 404 error template, wherein the 404 error template is customizable with input received from the user and is inferior to the site master template in the hierarchical relationship. 7. A non-transitory computer-readable storage medium, storing instructions that when executed by a processor, cause the processor to design a customizable website, by performing the steps of:
providing a customizable website from a server comprising a plurality of web page templates adhering to a hierarchical relationship, further comprising:
providing a site master template, wherein the site master template is customizable with input received from a user and the site master template is the most superior web page template in the hierarchical relationship;
providing a homepage template, wherein the homepage template is customizable with input received from the user and is inferior to the site master template in the hierarchical relationship;
providing a plurality of sub-templates, wherein the plurality of sub-templates are customizable with input received from the user and the plurality of sub-templates are inferior to the site master template in the hierarchical relationship; and
receiving localized input from the user customizing the plurality of web page templates in a manner not subject to the hierarchical relationship. 8. The non-transitory computer-readable storage medium of claim 7, wherein the hierarchical relationship causes content provided to a superior template in the hierarchical relationship to be displayed on a template inferior to the superior template in the hierarchical relationship. 9. The non-transitory computer-readable storage medium of claim 7, wherein the hierarchical relationship between the plurality of web page templates is customizable. 10. The non-transitory computer-readable storage medium of claim 7, wherein input provided to the site master template is displayed on each of the plurality of web page templates inferior to the site master template in the hierarchical relationship via a global content effect. 11. The non-transitory computer-readable storage medium of claim 7, wherein the plurality of sub-templates may be arranged in a cascading hierarchy with input provided by the user. 12. The non-transitory computer-readable storage medium of claim 7, further comprising providing a 404 error template, wherein the 404 error template is customizable with input received from the user and is inferior to the site master template in the hierarchical relationship. 13. A computer system for designing a customizable website, comprising:
a processor; and a memory storing instructions that, when executed by the processor, cause the computer system to:
provide a customizable website from a server comprising a plurality of web page templates adhering to a hierarchical relationship, further comprising:
provide a site master template, wherein the site master template is customizable with input received from a user and the site master template is the most superior web page template in the hierarchical relationship;
provide a homepage template, wherein the homepage template is customizable with input received from the user and is inferior to the site master template in the hierarchical relationship;
provide a plurality of sub-templates, wherein the plurality of sub-templates are customizable with input received from the user and the plurality of sub-templates are inferior to the site master template in the hierarchical relationship; and
receive localized input from the user customizing the plurality of web page templates in a manner not subject to the hierarchical relationship. 14. The computer system of claim 13, wherein the hierarchical relationship causes content provided to a superior template in the hierarchical relationship to be displayed on a template inferior to the superior template in the hierarchical relationship. 15. The computer system of claim 13, wherein the hierarchical relationship between the plurality of web page templates is customizable. 16. The computer system of claim 13, wherein input provided to the site master template is displayed on each of the plurality of web page templates inferior to the site master template in the hierarchical relationship via a global content effect. 17. The computer system of claim 13, wherein the plurality of sub-templates may be arranged in a cascading hierarchy with input provided by the user. 18. The computer system of claim 13, further comprising providing a 404 error template, wherein the 404 error template is customizable with input received from the user and is inferior to the site master template in the hierarchical relationship. | Embodiments described herein relate to designing a customizable website by using a custom design application. The custom design application generally provides a site master template, a homepage template, a plurality of sub templates, and a 404 error template. The templates may be customized with input provided by a user. The method also provides a manner of customizing a website by utilizing a hierarchical relationship between the templates in order to easily and efficiently custom design a website.1. A method of designing a customizable website, comprising:
providing a customizable website from a server comprising a plurality of web page templates adhering to a hierarchical relationship, further comprising:
providing a site master template, wherein the site master template is customizable with input received from a user and the site master template is the most superior web page template in the hierarchical relationship;
providing a homepage template, wherein the homepage template is customizable with input received from the user and is inferior to the site master template in the hierarchical relationship;
providing a plurality of sub-templates, wherein the plurality of sub-templates are customizable with input received from the user and the plurality of sub-templates are inferior to the site master template in the hierarchical relationship; and
receiving localized input from the user customizing the plurality of web page templates in a manner not subject to the hierarchical relationship. 2. The method of claim 1, wherein the hierarchical relationship causes content provided to a superior template in the hierarchical relationship to be displayed on a template inferior to the superior template in the hierarchical relationship. 3. The method of claim 1, wherein the hierarchical relationship between the plurality of web page templates is customizable. 4. The method of claim 1, wherein input provided to the site master template is displayed on each of the plurality of web page templates inferior to the site master template in the hierarchical relationship via a global content effect. 5. The method of claim 1, wherein the plurality of sub-templates may be arranged in a cascading hierarchy with input provided by the user. 6. The method of claim 1, further comprising providing a 404 error template, wherein the 404 error template is customizable with input received from the user and is inferior to the site master template in the hierarchical relationship. 7. A non-transitory computer-readable storage medium, storing instructions that when executed by a processor, cause the processor to design a customizable website, by performing the steps of:
providing a customizable website from a server comprising a plurality of web page templates adhering to a hierarchical relationship, further comprising:
providing a site master template, wherein the site master template is customizable with input received from a user and the site master template is the most superior web page template in the hierarchical relationship;
providing a homepage template, wherein the homepage template is customizable with input received from the user and is inferior to the site master template in the hierarchical relationship;
providing a plurality of sub-templates, wherein the plurality of sub-templates are customizable with input received from the user and the plurality of sub-templates are inferior to the site master template in the hierarchical relationship; and
receiving localized input from the user customizing the plurality of web page templates in a manner not subject to the hierarchical relationship. 8. The non-transitory computer-readable storage medium of claim 7, wherein the hierarchical relationship causes content provided to a superior template in the hierarchical relationship to be displayed on a template inferior to the superior template in the hierarchical relationship. 9. The non-transitory computer-readable storage medium of claim 7, wherein the hierarchical relationship between the plurality of web page templates is customizable. 10. The non-transitory computer-readable storage medium of claim 7, wherein input provided to the site master template is displayed on each of the plurality of web page templates inferior to the site master template in the hierarchical relationship via a global content effect. 11. The non-transitory computer-readable storage medium of claim 7, wherein the plurality of sub-templates may be arranged in a cascading hierarchy with input provided by the user. 12. The non-transitory computer-readable storage medium of claim 7, further comprising providing a 404 error template, wherein the 404 error template is customizable with input received from the user and is inferior to the site master template in the hierarchical relationship. 13. A computer system for designing a customizable website, comprising:
a processor; and a memory storing instructions that, when executed by the processor, cause the computer system to:
provide a customizable website from a server comprising a plurality of web page templates adhering to a hierarchical relationship, further comprising:
provide a site master template, wherein the site master template is customizable with input received from a user and the site master template is the most superior web page template in the hierarchical relationship;
provide a homepage template, wherein the homepage template is customizable with input received from the user and is inferior to the site master template in the hierarchical relationship;
provide a plurality of sub-templates, wherein the plurality of sub-templates are customizable with input received from the user and the plurality of sub-templates are inferior to the site master template in the hierarchical relationship; and
receive localized input from the user customizing the plurality of web page templates in a manner not subject to the hierarchical relationship. 14. The computer system of claim 13, wherein the hierarchical relationship causes content provided to a superior template in the hierarchical relationship to be displayed on a template inferior to the superior template in the hierarchical relationship. 15. The computer system of claim 13, wherein the hierarchical relationship between the plurality of web page templates is customizable. 16. The computer system of claim 13, wherein input provided to the site master template is displayed on each of the plurality of web page templates inferior to the site master template in the hierarchical relationship via a global content effect. 17. The computer system of claim 13, wherein the plurality of sub-templates may be arranged in a cascading hierarchy with input provided by the user. 18. The computer system of claim 13, further comprising providing a 404 error template, wherein the 404 error template is customizable with input received from the user and is inferior to the site master template in the hierarchical relationship. | 2,100 |
5,379 | 5,379 | 14,304,596 | 2,153 | In one embodiment, a method includes receiving a query from a first user of an online social network and identifying a set of objects associated with the online social network that substantially match the query. The method also includes calculating, for each identified object, multiple scores corresponding to multiple scoring axes, respectively, each scoring axis having a threshold score that is statistically determined for the scoring axis. The method further includes filtering one or more of the identified objects from the set of objects based on the calculated scores, where each filtered object is associated with one or more scores for one or more scoring axes, respectively, below the threshold score of the respective scoring axis. The method also includes generating one or more search results corresponding to one or more of the identified objects remaining in the set of objects, respectively. | 1. A method comprising, by one or more computing devices:
receiving a query from a first user of an online social network; identifying a set of objects associated with the online social network that substantially match the query; calculating, for each identified object, a plurality of scores corresponding to a plurality of scoring axes, respectively, each scoring axis having a threshold score that is statistically determined for the scoring axis; filtering one or more of the identified objects from the set of objects based on the calculated scores, wherein each filtered object is associated with one or more scores for one or more scoring axes, respectively, below the threshold score of the respective scoring axis; generating one or more search results corresponding to one or more of the identified objects remaining in the set of objects, respectively, each search result comprising a reference to a corresponding identified object; and sending, responsive to the query, one or more search results for display to the first user. 2. The method of claim 1, further comprising:
accessing a social graph comprising a plurality of nodes and a plurality of edges connecting the nodes, each of the edges between two of the nodes representing a single degree of separation between them, the nodes comprising:
a first node corresponding to the first user associated with the online social network; and
a plurality of second nodes that each correspond to an object associated with the online social network. 3. The method of claim 2, wherein, for each identified object, the score corresponding to a scoring axis is based at least in part on a degree of separation between the first node and a second node corresponding to the identified object. 4. The method of claim 1, wherein, for each identified object, the score corresponding to a scoring axis is based at least in part on a social-graph affinity of the first user with respect to the identified object. 5. The method of claim 1, wherein, for each identified object, the score corresponding to a scoring axis is based at least in part on a recency value associated with the identified object. 6. The method of claim 1, wherein, for each identified object, the score corresponding to a scoring axis is based at least in part on a calculated topic relevance for the identified object with respect to the query. 7. The method of claim 1, wherein, for each identified object, the score corresponding to a scoring axis is based at least in part on a calculated author quality associated with the identified object. 8. The method of claim 1, wherein, for each identified object, the score corresponding to a scoring axis is based at least in part on a calculated text similarity between the identified object and the query. 9. The method of claim 1, wherein the threshold score associated with a scoring axis is a number of standard deviations below a mean of scores associated with the scoring axis. 10. The method of claim 1, wherein the threshold score associated with a scoring axis is greater than a percentage of scores associated with the scoring axis. 11. The method of claim 1, wherein the threshold score associated with a scoring axis is greater than a number of scores associated with the scoring axis. 12. The method of claim 1, wherein an identified object is filtered from the set of objects if it is associated with two or more scores for two or more scoring axes, respectively, below the threshold scores of the scoring axes. 13. The method of claim 1, wherein the threshold score associated with a scoring axis is based on a step function associated with the scores for the scoring axis. 14. The method of claim 1, further comprising retaining in the set of objects one or more of the identified objects whose scores associated with one or more scoring axes are above one or more respective upper-threshold scores. 15. The method of claim 14, wherein the upper-threshold score associated with a scoring axis is greater than a percentage of scores associated with the scoring axis. 16. The method of claim 14, wherein the upper-threshold score associated with a scoring axis is less than a number of scores associated with the scoring axis. 17. The method of claim 14, wherein an identified object is retained in the set of objects if it is associated with two or more scores for two or more scoring axes, respectively, above the upper-threshold scores of the scoring axes. 18. The method of claim 1, further comprising determining, for each scoring axis, a threshold score, the threshold score based at least in part on the calculated scores associated with the scoring axis. 19. One or more computer-readable non-transitory storage media embodying software that is operable when executed to:
receive a query from a first user of an online social network; identify a set of objects associated with the online social network that substantially match the query; calculate, for each identified object, a plurality of scores corresponding to a plurality of scoring axes, respectively, each scoring axis having a threshold score that is statistically determined for the scoring axis; filter one or more of the identified objects from the set of objects based on the calculated scores, wherein each filtered object is associated with one or more scores for one or more scoring axes, respectively, below the threshold score of the respective scoring axis; generate one or more search results corresponding to one or more of the identified objects remaining in the set of objects, respectively, each search result comprising a reference to a corresponding identified object; and send, responsive to the query, one or more search results for display to the first user. 20. A system comprising: one or more processors; and a memory coupled to the processors comprising instructions executable by the processors, the processors operable when executing the instructions to:
receive a query from a first user of an online social network; identify a set of objects associated with the online social network that substantially match the query; calculate, for each identified object, a plurality of scores corresponding to a plurality of scoring axes, respectively, each scoring axis having a threshold score that is statistically determined for the scoring axis; filter one or more of the identified objects from the set of objects based on the calculated scores, wherein each filtered object is associated with one or more scores for one or more scoring axes, respectively, below the threshold score of the respective scoring axis; generate one or more search results corresponding to one or more of the identified objects remaining in the set of objects, respectively, each search result comprising a reference to a corresponding identified object; and send, responsive to the query, one or more search results for display to the first user. | In one embodiment, a method includes receiving a query from a first user of an online social network and identifying a set of objects associated with the online social network that substantially match the query. The method also includes calculating, for each identified object, multiple scores corresponding to multiple scoring axes, respectively, each scoring axis having a threshold score that is statistically determined for the scoring axis. The method further includes filtering one or more of the identified objects from the set of objects based on the calculated scores, where each filtered object is associated with one or more scores for one or more scoring axes, respectively, below the threshold score of the respective scoring axis. The method also includes generating one or more search results corresponding to one or more of the identified objects remaining in the set of objects, respectively.1. A method comprising, by one or more computing devices:
receiving a query from a first user of an online social network; identifying a set of objects associated with the online social network that substantially match the query; calculating, for each identified object, a plurality of scores corresponding to a plurality of scoring axes, respectively, each scoring axis having a threshold score that is statistically determined for the scoring axis; filtering one or more of the identified objects from the set of objects based on the calculated scores, wherein each filtered object is associated with one or more scores for one or more scoring axes, respectively, below the threshold score of the respective scoring axis; generating one or more search results corresponding to one or more of the identified objects remaining in the set of objects, respectively, each search result comprising a reference to a corresponding identified object; and sending, responsive to the query, one or more search results for display to the first user. 2. The method of claim 1, further comprising:
accessing a social graph comprising a plurality of nodes and a plurality of edges connecting the nodes, each of the edges between two of the nodes representing a single degree of separation between them, the nodes comprising:
a first node corresponding to the first user associated with the online social network; and
a plurality of second nodes that each correspond to an object associated with the online social network. 3. The method of claim 2, wherein, for each identified object, the score corresponding to a scoring axis is based at least in part on a degree of separation between the first node and a second node corresponding to the identified object. 4. The method of claim 1, wherein, for each identified object, the score corresponding to a scoring axis is based at least in part on a social-graph affinity of the first user with respect to the identified object. 5. The method of claim 1, wherein, for each identified object, the score corresponding to a scoring axis is based at least in part on a recency value associated with the identified object. 6. The method of claim 1, wherein, for each identified object, the score corresponding to a scoring axis is based at least in part on a calculated topic relevance for the identified object with respect to the query. 7. The method of claim 1, wherein, for each identified object, the score corresponding to a scoring axis is based at least in part on a calculated author quality associated with the identified object. 8. The method of claim 1, wherein, for each identified object, the score corresponding to a scoring axis is based at least in part on a calculated text similarity between the identified object and the query. 9. The method of claim 1, wherein the threshold score associated with a scoring axis is a number of standard deviations below a mean of scores associated with the scoring axis. 10. The method of claim 1, wherein the threshold score associated with a scoring axis is greater than a percentage of scores associated with the scoring axis. 11. The method of claim 1, wherein the threshold score associated with a scoring axis is greater than a number of scores associated with the scoring axis. 12. The method of claim 1, wherein an identified object is filtered from the set of objects if it is associated with two or more scores for two or more scoring axes, respectively, below the threshold scores of the scoring axes. 13. The method of claim 1, wherein the threshold score associated with a scoring axis is based on a step function associated with the scores for the scoring axis. 14. The method of claim 1, further comprising retaining in the set of objects one or more of the identified objects whose scores associated with one or more scoring axes are above one or more respective upper-threshold scores. 15. The method of claim 14, wherein the upper-threshold score associated with a scoring axis is greater than a percentage of scores associated with the scoring axis. 16. The method of claim 14, wherein the upper-threshold score associated with a scoring axis is less than a number of scores associated with the scoring axis. 17. The method of claim 14, wherein an identified object is retained in the set of objects if it is associated with two or more scores for two or more scoring axes, respectively, above the upper-threshold scores of the scoring axes. 18. The method of claim 1, further comprising determining, for each scoring axis, a threshold score, the threshold score based at least in part on the calculated scores associated with the scoring axis. 19. One or more computer-readable non-transitory storage media embodying software that is operable when executed to:
receive a query from a first user of an online social network; identify a set of objects associated with the online social network that substantially match the query; calculate, for each identified object, a plurality of scores corresponding to a plurality of scoring axes, respectively, each scoring axis having a threshold score that is statistically determined for the scoring axis; filter one or more of the identified objects from the set of objects based on the calculated scores, wherein each filtered object is associated with one or more scores for one or more scoring axes, respectively, below the threshold score of the respective scoring axis; generate one or more search results corresponding to one or more of the identified objects remaining in the set of objects, respectively, each search result comprising a reference to a corresponding identified object; and send, responsive to the query, one or more search results for display to the first user. 20. A system comprising: one or more processors; and a memory coupled to the processors comprising instructions executable by the processors, the processors operable when executing the instructions to:
receive a query from a first user of an online social network; identify a set of objects associated with the online social network that substantially match the query; calculate, for each identified object, a plurality of scores corresponding to a plurality of scoring axes, respectively, each scoring axis having a threshold score that is statistically determined for the scoring axis; filter one or more of the identified objects from the set of objects based on the calculated scores, wherein each filtered object is associated with one or more scores for one or more scoring axes, respectively, below the threshold score of the respective scoring axis; generate one or more search results corresponding to one or more of the identified objects remaining in the set of objects, respectively, each search result comprising a reference to a corresponding identified object; and send, responsive to the query, one or more search results for display to the first user. | 2,100 |
5,380 | 5,380 | 13,370,488 | 2,194 | Disclosed are systems, methods, and non-transitory computer-readable storage media for analyzing an event via social media. A system configured to practice the method segments a document associated with an event based on a plurality of inferred topics to yield a plurality of segments. Next, the system assigns each message in a corpus of messages associated with the event to one of the inferred topics to yield assigned topics. The messages can include at least one of a status update, a tweet, a blog post, a tag, a chat message, a comment, and a check-in. Moreover, the messages can originate from different social networks. Based on the assigned topics, the system then associates each message in the corpus of messages with at least one of the document, a segment from the plurality of segments, and a segment of the event. | 1. A method comprising:
segmenting, via a processor, a document associated with an event based on a plurality of inferred topics to yield a plurality of segments; assigning each message in a corpus of messages associated with the event to one of the inferred topics to yield assigned topics; and based on the assigned topics, associating each message in the corpus of messages with at least one of the document, a segment from the plurality of segments, and a segment of the event. 2. The method of claim 1, wherein associating each message in the corpus of messages with at least one of the document, the segment from the plurality of segments, and the segment of the event is also based on a joint statistical model of the corpus of messages and at least one of the document and the event. 3. The method of claim 1, wherein segmenting the document is based on a Latent Dirichlet Allocation analysis. 4. The method of claim 1, wherein assigning each message in the corpus of messages to one of the inferred topics is based on a Latent Dirichlet Allocation analysis. 5. The method of claim 1, further comprising:
ranking the plurality of segments based on how many messages in the corpus of messages are associated with each of the plurality of segments. 6. The method of claim 1, wherein each message in the corpus of messages comprises at least one of a status update, a tweet, a blog post, a tag, a chat message, a comment, and a check-in. 7. The method of claim 1, wherein associating each message in the corpus of messages to at least one of the document, the segment from the plurality of segments, and the segment of the event further comprises:
calculating a term-vector similarity for each message in the corpus of messages to each of the plurality of segments. 8. The method of claim 1, further comprising filtering out noisy terms above a noise threshold from a respective message in the corpus of messages. 9. The method of claim 1, further comprising associating words in each message in the corpus of messages with at least one of a specific topic in the event and a general topic in the event. 10. The method of claim 1, wherein a message from the corpus of messages is associated with more than one of the plurality of segments. 11. The method of claim 1, wherein the corpus of messages comprises a combination of data from a plurality of social networks. 12. The method of claim 1, wherein the plurality of segments comprises at least one segment from a second document associated with the event. 13. The method of claim 1, wherein associating each message in the corpus of messages to at least one of the document, the segment from the plurality of segments, and the segment of the event further comprises inferring topical associations between the corpus of messages and at least one of the document and the event. 14. The method of claim 1, further comprising:
adding external information to a message from the corpus of messages; and using at least part of the external information to assign the message to one of the inferred topics in the plurality of inferred topics. 15. The method of claim 1, further comprising:
identifying a topic of a message; identifying additional information related to the topic; and expanding the message based on the additional information. 16. A system comprising:
a processor; and a computer-readable medium having stored therein instructions which, when executed by the processor, cause the processor to perform a method comprising:
segmenting a document associated with an event based on a plurality of inferred topics to yield a plurality of segments, wherein a number of inferred topics in the plurality of inferred topics is based on a tuning threshold;
assigning each message in a corpus of messages associated with the event to one of the inferred topics to yield assigned topics; and
based on the assigned topics, associating each message in the corpus of messages with at least one of the document, a segment from the plurality of segments, and a segment of the event. 17. The system of claim 15, wherein the corpus of messages comprises a combination of data from a plurality of social networks. 18. The system of claim 15, the computer-readable medium storing further instructions which, when executed by the processor, cause the processor to perform a method further comprising:
receiving a plurality of messages; filtering the plurality of messages to yield a set of messages that are descriptive of the event; and identifying episodal topics in the event based on the set of messages. 19. A non-transitory computer-readable storage medium storing instructions which, when executed by a computing device, cause the computing device to perform steps comprising:
segmenting a document associated with an event based on a plurality of inferred topics to yield a plurality of segments; assigning each message in a corpus of messages associated with the event to one of the inferred topics to yield assigned topics; based on the assigned topics, associating each message in the corpus of messages with at least one of the document, a segment from the plurality of segments, and a segment of the event; and playing an augmented version of the event, wherein the augmented version of the event comprises at least part of the event and a topically related message from the corpus of messages. 20. The non-transitory computer-readable storage medium of claim 18, wherein the augmented version of the event comprises at least one of a time-based display and a topic-based display. | Disclosed are systems, methods, and non-transitory computer-readable storage media for analyzing an event via social media. A system configured to practice the method segments a document associated with an event based on a plurality of inferred topics to yield a plurality of segments. Next, the system assigns each message in a corpus of messages associated with the event to one of the inferred topics to yield assigned topics. The messages can include at least one of a status update, a tweet, a blog post, a tag, a chat message, a comment, and a check-in. Moreover, the messages can originate from different social networks. Based on the assigned topics, the system then associates each message in the corpus of messages with at least one of the document, a segment from the plurality of segments, and a segment of the event.1. A method comprising:
segmenting, via a processor, a document associated with an event based on a plurality of inferred topics to yield a plurality of segments; assigning each message in a corpus of messages associated with the event to one of the inferred topics to yield assigned topics; and based on the assigned topics, associating each message in the corpus of messages with at least one of the document, a segment from the plurality of segments, and a segment of the event. 2. The method of claim 1, wherein associating each message in the corpus of messages with at least one of the document, the segment from the plurality of segments, and the segment of the event is also based on a joint statistical model of the corpus of messages and at least one of the document and the event. 3. The method of claim 1, wherein segmenting the document is based on a Latent Dirichlet Allocation analysis. 4. The method of claim 1, wherein assigning each message in the corpus of messages to one of the inferred topics is based on a Latent Dirichlet Allocation analysis. 5. The method of claim 1, further comprising:
ranking the plurality of segments based on how many messages in the corpus of messages are associated with each of the plurality of segments. 6. The method of claim 1, wherein each message in the corpus of messages comprises at least one of a status update, a tweet, a blog post, a tag, a chat message, a comment, and a check-in. 7. The method of claim 1, wherein associating each message in the corpus of messages to at least one of the document, the segment from the plurality of segments, and the segment of the event further comprises:
calculating a term-vector similarity for each message in the corpus of messages to each of the plurality of segments. 8. The method of claim 1, further comprising filtering out noisy terms above a noise threshold from a respective message in the corpus of messages. 9. The method of claim 1, further comprising associating words in each message in the corpus of messages with at least one of a specific topic in the event and a general topic in the event. 10. The method of claim 1, wherein a message from the corpus of messages is associated with more than one of the plurality of segments. 11. The method of claim 1, wherein the corpus of messages comprises a combination of data from a plurality of social networks. 12. The method of claim 1, wherein the plurality of segments comprises at least one segment from a second document associated with the event. 13. The method of claim 1, wherein associating each message in the corpus of messages to at least one of the document, the segment from the plurality of segments, and the segment of the event further comprises inferring topical associations between the corpus of messages and at least one of the document and the event. 14. The method of claim 1, further comprising:
adding external information to a message from the corpus of messages; and using at least part of the external information to assign the message to one of the inferred topics in the plurality of inferred topics. 15. The method of claim 1, further comprising:
identifying a topic of a message; identifying additional information related to the topic; and expanding the message based on the additional information. 16. A system comprising:
a processor; and a computer-readable medium having stored therein instructions which, when executed by the processor, cause the processor to perform a method comprising:
segmenting a document associated with an event based on a plurality of inferred topics to yield a plurality of segments, wherein a number of inferred topics in the plurality of inferred topics is based on a tuning threshold;
assigning each message in a corpus of messages associated with the event to one of the inferred topics to yield assigned topics; and
based on the assigned topics, associating each message in the corpus of messages with at least one of the document, a segment from the plurality of segments, and a segment of the event. 17. The system of claim 15, wherein the corpus of messages comprises a combination of data from a plurality of social networks. 18. The system of claim 15, the computer-readable medium storing further instructions which, when executed by the processor, cause the processor to perform a method further comprising:
receiving a plurality of messages; filtering the plurality of messages to yield a set of messages that are descriptive of the event; and identifying episodal topics in the event based on the set of messages. 19. A non-transitory computer-readable storage medium storing instructions which, when executed by a computing device, cause the computing device to perform steps comprising:
segmenting a document associated with an event based on a plurality of inferred topics to yield a plurality of segments; assigning each message in a corpus of messages associated with the event to one of the inferred topics to yield assigned topics; based on the assigned topics, associating each message in the corpus of messages with at least one of the document, a segment from the plurality of segments, and a segment of the event; and playing an augmented version of the event, wherein the augmented version of the event comprises at least part of the event and a topically related message from the corpus of messages. 20. The non-transitory computer-readable storage medium of claim 18, wherein the augmented version of the event comprises at least one of a time-based display and a topic-based display. | 2,100 |
5,381 | 5,381 | 14,532,289 | 2,166 | Systems, methods, and software described herein facilitate interfacing between processing nodes and a plurality of data repositories. In one example, a method of interfacing between a processing node and a plurality of data repositories includes identifying, for the processing node, a data access request using a first data access format, wherein the data access request includes a data connector identifier. The method further includes translating the access request to a second data access format based on the data connector identifier, and identifying a data repository in the plurality of data repositories to service the data access request based on the data connector identifier. The method also provides accessing data for the data access request in the data repository via the second data access format. | 1. A method of interfacing between a processing node and a plurality of data repositories, the method comprising:
identifying, for the processing node, a data access request using a first data access format, wherein the data access request includes a data connector identifier; translating the data access request to a second data access format based on the data connector identifier; identifying a data repository in the plurality of data repositories to service the data access request based on the data connector identifier; and accessing data for the data access request in the data repository via the second data access format. 2. The method of claim 1 wherein the processing node comprises a large scale processing format (LSPF) node. 3. The method of claim 2 wherein the LSPF node comprises a virtual LSPF node executing via a host computing system. 4. The method of claim 2 wherein the LSPF node comprises a physical computing system. 5. The method of claim 1 wherein the first data access format comprises a first file system format. 6. The method of claim 1 wherein the first data access format cannot access any of the plurality of data repositories without translation to an alternative data access format. 7. The method of claim 1 wherein the second data access format comprises one of Hadoop Distributed File System (HDFS) format, Gluster File System format, Swift object storage system, or network file system format. 8. The method of claim 1 wherein identifying the data repository in the plurality of data repositories to service the data access request based on the data connector identifier comprises identifying a data repository Internet Protocol (IP) address to service the data access request based on the data connector identifier. 9. A computer apparatus to interface between a processing node and a plurality of data repositories, the computer apparatus comprising:
processing instructions that direct a retrieval layer computing system, when executed by the retrieval layer computing system, to:
identify, for the processing node, a data access request using a first data access format, wherein the data access request includes a data connector identifier;
translate the data access request to a second data access format based on the data connector identifier;
identify a data repository in the plurality of data repositories to service the data access request based on the data connector identifier; and
access data for the data access request in the data repository via the second access format; and
one or more non-transitory computer readable media to store the processing instructions. 10. The computer apparatus of claim 9 wherein the processing node comprises a large scale processing format (LSPF) node. 11. The computer apparatus of claim 10 wherein the LSPF node comprises a virtual LSPF node executing via a host computing system. 12. The computer apparatus of claim 10 wherein the LSPF node comprises a physical computing system. 13. The computer apparatus of claim 9 wherein the first data access format comprises a first file system format. 14. The computer apparatus of claim 9 wherein the first data access format cannot access any of the plurality of data repositories without translation to an alternative data access format. 15. The computer apparatus of claim 9 the second data access format comprises one of Hadoop Distributed File System (HDFS) format, Gluster File System format, Swift object storage system, or network file system format. 16. The computer apparatus of claim 9 wherein the processing instructions to identify the data repository in the plurality of data repositories to service the data access request based on the data connector identifier direct the retrieval layer computing system to identify a data repository Internet Protocol (IP) address to service the data access request based on the data connector identifier. 17. A computer apparatus to generate data connectors between at least one processing node and a plurality of data repositories, the computer apparatus comprising:
processing instructions that direct an administration computing system, when executed by the administration computing system, to:
identify data connector information associated with a data repository;
generate a data connector configuration based on the data connector information; and
implement the data connector configuration in a retrieval layer configured to access data for the at least one processing node; and
one or more non-transitory computer readable media to store the processing instructions. 18. The computer apparatus of claim 17 wherein the data connector information comprises at least a data connector identifier for the data repository, an Internet Protocol (IP) address associated with the data repository, and a type identifier associated with the data repository. 19. The computer apparatus of claim 18 wherein the data connector configuration comprises a translation configuration to translate data access requests with the data connector identifier from a first data access format to a second data access format. 20. The computer apparatus of claim 17 wherein the processing instructions to identify the data connector information associated with the data repository direct the administration computing system to receive user input indicating the data connector information associated with the data repository. | Systems, methods, and software described herein facilitate interfacing between processing nodes and a plurality of data repositories. In one example, a method of interfacing between a processing node and a plurality of data repositories includes identifying, for the processing node, a data access request using a first data access format, wherein the data access request includes a data connector identifier. The method further includes translating the access request to a second data access format based on the data connector identifier, and identifying a data repository in the plurality of data repositories to service the data access request based on the data connector identifier. The method also provides accessing data for the data access request in the data repository via the second data access format.1. A method of interfacing between a processing node and a plurality of data repositories, the method comprising:
identifying, for the processing node, a data access request using a first data access format, wherein the data access request includes a data connector identifier; translating the data access request to a second data access format based on the data connector identifier; identifying a data repository in the plurality of data repositories to service the data access request based on the data connector identifier; and accessing data for the data access request in the data repository via the second data access format. 2. The method of claim 1 wherein the processing node comprises a large scale processing format (LSPF) node. 3. The method of claim 2 wherein the LSPF node comprises a virtual LSPF node executing via a host computing system. 4. The method of claim 2 wherein the LSPF node comprises a physical computing system. 5. The method of claim 1 wherein the first data access format comprises a first file system format. 6. The method of claim 1 wherein the first data access format cannot access any of the plurality of data repositories without translation to an alternative data access format. 7. The method of claim 1 wherein the second data access format comprises one of Hadoop Distributed File System (HDFS) format, Gluster File System format, Swift object storage system, or network file system format. 8. The method of claim 1 wherein identifying the data repository in the plurality of data repositories to service the data access request based on the data connector identifier comprises identifying a data repository Internet Protocol (IP) address to service the data access request based on the data connector identifier. 9. A computer apparatus to interface between a processing node and a plurality of data repositories, the computer apparatus comprising:
processing instructions that direct a retrieval layer computing system, when executed by the retrieval layer computing system, to:
identify, for the processing node, a data access request using a first data access format, wherein the data access request includes a data connector identifier;
translate the data access request to a second data access format based on the data connector identifier;
identify a data repository in the plurality of data repositories to service the data access request based on the data connector identifier; and
access data for the data access request in the data repository via the second access format; and
one or more non-transitory computer readable media to store the processing instructions. 10. The computer apparatus of claim 9 wherein the processing node comprises a large scale processing format (LSPF) node. 11. The computer apparatus of claim 10 wherein the LSPF node comprises a virtual LSPF node executing via a host computing system. 12. The computer apparatus of claim 10 wherein the LSPF node comprises a physical computing system. 13. The computer apparatus of claim 9 wherein the first data access format comprises a first file system format. 14. The computer apparatus of claim 9 wherein the first data access format cannot access any of the plurality of data repositories without translation to an alternative data access format. 15. The computer apparatus of claim 9 the second data access format comprises one of Hadoop Distributed File System (HDFS) format, Gluster File System format, Swift object storage system, or network file system format. 16. The computer apparatus of claim 9 wherein the processing instructions to identify the data repository in the plurality of data repositories to service the data access request based on the data connector identifier direct the retrieval layer computing system to identify a data repository Internet Protocol (IP) address to service the data access request based on the data connector identifier. 17. A computer apparatus to generate data connectors between at least one processing node and a plurality of data repositories, the computer apparatus comprising:
processing instructions that direct an administration computing system, when executed by the administration computing system, to:
identify data connector information associated with a data repository;
generate a data connector configuration based on the data connector information; and
implement the data connector configuration in a retrieval layer configured to access data for the at least one processing node; and
one or more non-transitory computer readable media to store the processing instructions. 18. The computer apparatus of claim 17 wherein the data connector information comprises at least a data connector identifier for the data repository, an Internet Protocol (IP) address associated with the data repository, and a type identifier associated with the data repository. 19. The computer apparatus of claim 18 wherein the data connector configuration comprises a translation configuration to translate data access requests with the data connector identifier from a first data access format to a second data access format. 20. The computer apparatus of claim 17 wherein the processing instructions to identify the data connector information associated with the data repository direct the administration computing system to receive user input indicating the data connector information associated with the data repository. | 2,100 |
5,382 | 5,382 | 14,660,113 | 2,157 | Disclosed are systems, methods, and non-transitory computer-readable storage media for migrating content items from a source user account to a target user account. A user can specify content items in the source user account to be migrated to an existing or new target user account. A new content entry including an account identifier of the target account and a pointer to the content item can be created for each migrated content item. Further, a determination can be made as to whether a sharing link to each content item exists, and if so, the content pointer of the old content entry is modified to forward or redirect to the new content entry. An active flag associated with the old content entry can be set to false or 0 to indicate that the old content entry is no longer active. | 1. A method comprising:
receiving a request to migrate a content item from a source user account to a target user account, the content item being assigned a sharing link used to access the content item from a content storage, and being associated with an original content entry including an original content pointer pointing to a location of the content item in the content storage; creating a new content entry for the content item, the new content entry including:
an account identifier identifying the target user account; and
a new content pointer pointing to the location of the content item in the content storage; and
modifying the original content pointer to point to the new content entry. 2. The method of claim 1, further comprising:
presenting a migration interface displaying the content items of the source user account, wherein the migration interface is configured to:
receive input identifying the target user account; and
receive input identifying the content item to be migrated. 3. The method of claim 1, further comprising:
creating a new user account, wherein the new user account is the target user account. 4. The method of claim 1, further comprising:
determining if a sharing link has been previously created to access the content item. 5. The method of claim 2, wherein the migration interface is further configured to:
receive a content path for the content item, the content path indicating a file hierarchy for the content item in the target user account. 6. The method of claim 5, wherein the new content entry further includes the received content path. 7. The method of claim 4, further comprising:
checking a link flag of the original content entry to determine whether a sharing link has been previously created to access the content item, wherein the link flag is a Boolean value indicating whether a sharing link has been previously created to access the content item. 8. The method of claim 1, further comprising:
setting an active flag of the original content entry to indicate that the old content entry is no longer active. 9. A system comprising:
a processor; and memory containing instructions that, when executed, cause the processor to:
receive a request to migrate a content item from a source user account to a target user account, the content item being assigned a sharing link used to access the content item from a content storage, and being associated with an original content entry including an original content pointer identifying a location in the content storage containing the content item;
create a new content entry for the content item, the new content entry including:
an account identifier identifying the target user account; and
a new content pointer identifying the location in the content storage containing the content item; and
modify the original content pointer to identify the location of the new content entry. 10. The system of claim 9, wherein the instructions further cause the processor to:
present a migration interface displaying the content items of the source user account, wherein the migration interface is configured to:
receive input identifying the target user account; and
receive input identifying the content item to be migrated. 11. The system of claim 9, wherein the instructions further cause the processor to:
create a new user account, wherein the new user account is the target user account. 12. The system of claim 9, wherein the instructions further cause the processor to:
determine if a sharing link has been previously created to access the content item. 13. The system of claim 10, wherein the migration interface is further configured to:
receive a content path for the content item, the content path indicating a file hierarchy for the content item in the target user account. 14. The system of claim 13, wherein the new content entry further includes the received content path. 15. The system of claim 12, wherein the instructions further cause the processor to:
check a link flag of the original content entry to determine whether a sharing link has been previously created to access the content item, wherein the link flag is a Boolean value indicating whether a sharing link has been previously created to access the content item. 16. The system of claim 9, wherein the instructions further cause the processor to:
set an active flag of the original content entry to indicate that the old content entry is no longer active. 17. A non-transitory computer-readable medium containing instructions that, when executed by a computing device, cause the computing device to:
receive a request to migrate a content item from a source user account to a target user account, the content item being assigned a sharing link used to access the content item from a content storage, and being associated with an original content entry including an original content pointer identifying a location in the content storage containing the content item; move the content item from the location identified by the original content pointer to a new location in the content storage; create a new content entry for the content item, the new content entry including:
an account identifier identifying the target user account; and
a new content pointer identifying the new location in the content storage to which the content item was moved; and
modify the original content pointer to identify the location of the new content entry. 18. The non-transitory computer-readable medium of claim 17, wherein the instructions further cause the computing device to:
present a migration interface displaying the content items of the source user account, wherein the migration interface is configured to:
receive input identifying the target user account; and
receive input identifying the content item to be migrated. 19. The non-transitory computer-readable medium of claim 17, wherein the instructions further cause the computing device to:
create a new user account, wherein the new user account is the target user account. 20. The non-transitory computer-readable medium of claim 17, wherein the instructions further cause the computing device to:
determine if a sharing link has been previously created to access the content item. 21. The non-transitory computer-readable medium of claim 18, wherein the migration interface is further configured to:
receive a content path for the content item, the content path indicating a file hierarchy for the content item in the target user account. 22. The non-transitory computer-readable medium of claim 21, wherein the new content entry further includes the received content path. 23. The non-transitory computer-readable medium of claim 20, wherein the instructions further cause the computing device to:
check a link flag of the original content entry to determine whether a sharing link has been previously created to access the content item, wherein the link flag is a Boolean value indicating whether a sharing link has been previously created to access the content item. 24. The non-transitory computer-readable medium of claim 17, wherein the instructions further cause the computing device to:
set an active flag of the original content entry to indicate that the old content entry is no longer active. | Disclosed are systems, methods, and non-transitory computer-readable storage media for migrating content items from a source user account to a target user account. A user can specify content items in the source user account to be migrated to an existing or new target user account. A new content entry including an account identifier of the target account and a pointer to the content item can be created for each migrated content item. Further, a determination can be made as to whether a sharing link to each content item exists, and if so, the content pointer of the old content entry is modified to forward or redirect to the new content entry. An active flag associated with the old content entry can be set to false or 0 to indicate that the old content entry is no longer active.1. A method comprising:
receiving a request to migrate a content item from a source user account to a target user account, the content item being assigned a sharing link used to access the content item from a content storage, and being associated with an original content entry including an original content pointer pointing to a location of the content item in the content storage; creating a new content entry for the content item, the new content entry including:
an account identifier identifying the target user account; and
a new content pointer pointing to the location of the content item in the content storage; and
modifying the original content pointer to point to the new content entry. 2. The method of claim 1, further comprising:
presenting a migration interface displaying the content items of the source user account, wherein the migration interface is configured to:
receive input identifying the target user account; and
receive input identifying the content item to be migrated. 3. The method of claim 1, further comprising:
creating a new user account, wherein the new user account is the target user account. 4. The method of claim 1, further comprising:
determining if a sharing link has been previously created to access the content item. 5. The method of claim 2, wherein the migration interface is further configured to:
receive a content path for the content item, the content path indicating a file hierarchy for the content item in the target user account. 6. The method of claim 5, wherein the new content entry further includes the received content path. 7. The method of claim 4, further comprising:
checking a link flag of the original content entry to determine whether a sharing link has been previously created to access the content item, wherein the link flag is a Boolean value indicating whether a sharing link has been previously created to access the content item. 8. The method of claim 1, further comprising:
setting an active flag of the original content entry to indicate that the old content entry is no longer active. 9. A system comprising:
a processor; and memory containing instructions that, when executed, cause the processor to:
receive a request to migrate a content item from a source user account to a target user account, the content item being assigned a sharing link used to access the content item from a content storage, and being associated with an original content entry including an original content pointer identifying a location in the content storage containing the content item;
create a new content entry for the content item, the new content entry including:
an account identifier identifying the target user account; and
a new content pointer identifying the location in the content storage containing the content item; and
modify the original content pointer to identify the location of the new content entry. 10. The system of claim 9, wherein the instructions further cause the processor to:
present a migration interface displaying the content items of the source user account, wherein the migration interface is configured to:
receive input identifying the target user account; and
receive input identifying the content item to be migrated. 11. The system of claim 9, wherein the instructions further cause the processor to:
create a new user account, wherein the new user account is the target user account. 12. The system of claim 9, wherein the instructions further cause the processor to:
determine if a sharing link has been previously created to access the content item. 13. The system of claim 10, wherein the migration interface is further configured to:
receive a content path for the content item, the content path indicating a file hierarchy for the content item in the target user account. 14. The system of claim 13, wherein the new content entry further includes the received content path. 15. The system of claim 12, wherein the instructions further cause the processor to:
check a link flag of the original content entry to determine whether a sharing link has been previously created to access the content item, wherein the link flag is a Boolean value indicating whether a sharing link has been previously created to access the content item. 16. The system of claim 9, wherein the instructions further cause the processor to:
set an active flag of the original content entry to indicate that the old content entry is no longer active. 17. A non-transitory computer-readable medium containing instructions that, when executed by a computing device, cause the computing device to:
receive a request to migrate a content item from a source user account to a target user account, the content item being assigned a sharing link used to access the content item from a content storage, and being associated with an original content entry including an original content pointer identifying a location in the content storage containing the content item; move the content item from the location identified by the original content pointer to a new location in the content storage; create a new content entry for the content item, the new content entry including:
an account identifier identifying the target user account; and
a new content pointer identifying the new location in the content storage to which the content item was moved; and
modify the original content pointer to identify the location of the new content entry. 18. The non-transitory computer-readable medium of claim 17, wherein the instructions further cause the computing device to:
present a migration interface displaying the content items of the source user account, wherein the migration interface is configured to:
receive input identifying the target user account; and
receive input identifying the content item to be migrated. 19. The non-transitory computer-readable medium of claim 17, wherein the instructions further cause the computing device to:
create a new user account, wherein the new user account is the target user account. 20. The non-transitory computer-readable medium of claim 17, wherein the instructions further cause the computing device to:
determine if a sharing link has been previously created to access the content item. 21. The non-transitory computer-readable medium of claim 18, wherein the migration interface is further configured to:
receive a content path for the content item, the content path indicating a file hierarchy for the content item in the target user account. 22. The non-transitory computer-readable medium of claim 21, wherein the new content entry further includes the received content path. 23. The non-transitory computer-readable medium of claim 20, wherein the instructions further cause the computing device to:
check a link flag of the original content entry to determine whether a sharing link has been previously created to access the content item, wherein the link flag is a Boolean value indicating whether a sharing link has been previously created to access the content item. 24. The non-transitory computer-readable medium of claim 17, wherein the instructions further cause the computing device to:
set an active flag of the original content entry to indicate that the old content entry is no longer active. | 2,100 |
5,383 | 5,383 | 14,374,841 | 2,191 | A processor implemented method to deploy a code change in a software application. The code change is assigned to a deployment pipeline based on a filtering rule. The code change is deployed after the code change passes a set of test criteria associated with the deployment pipeline. | 1. A processor implemented method to deploy a code change in a software application, the method comprising:
assigning the code change to a deployment pipeline based on a filtering rule; and deploying the code change after the code change passes a set of test criteria associated with the deployment pipeline. 2. The method of claim 1, further comprising defining the filtering rule using a predefined set of business criteria associated with the code change. 3. The method of claim 1, further comprising testing the code change in the deployment pipeline to determine when the code change passes the set of test criteria. 4. The method of claim 3, wherein testing the code change further comprises:
running a set of tests in an application under test environment using the code change, and determining when the code change passes the set of test criteria based on results of the set of tests. 5. The method of claim 1, further comprising moving the code change through the deployment pipeline based on results of the set of tests. 6. A computer readable medium having stored thereon instructions that, when executed by a processor, cause the processor to perform a method to deploy a code change in a software application, the method comprising:
assigning the code change to a deployment pipeline according to a filtering rule; testing the code change in the deployment pipeline to determine when the code change passes a set of test criteria associated with the deployment pipeline; and deploying the code change after the code change passes the set of test criteria. 7. The computer readable medium of claim 6, further comprising evaluating the code change using data associated with the code change. 8. The computer readable medium of claim 6, further comprising defining the filtering rule using at least one predefined set of business criteria associated with the code change. 9. The computer readable medium of claim 6, further comprising maintaining a plurality of deployment pipelines. 10. A system to deploy a code change in a software application, the system comprising:
an assignment engine to assign the code change to a deployment pipeline based on a filtering rule; and a deployment engine to deploy the code change after the code change passes a set of test criteria associated with the deployment pipeline. 11. The system of claim 10, further comprising a filter engine to sort the code change based on the filtering rule. 12. The system of claim 11, wherein the filter engine sorts the code change using a predefined set of business criteria associated with the code change. 13. The system of claim 10, wherein the deployment engine maintains a plurality of deployment pipelines. 14. The system of claim 10, further comprising a test device that includes a test engine to run a set of tests on the code change in an application under test environment. 15. The system claim 13, further comprising a data store to store the set of tests. | A processor implemented method to deploy a code change in a software application. The code change is assigned to a deployment pipeline based on a filtering rule. The code change is deployed after the code change passes a set of test criteria associated with the deployment pipeline.1. A processor implemented method to deploy a code change in a software application, the method comprising:
assigning the code change to a deployment pipeline based on a filtering rule; and deploying the code change after the code change passes a set of test criteria associated with the deployment pipeline. 2. The method of claim 1, further comprising defining the filtering rule using a predefined set of business criteria associated with the code change. 3. The method of claim 1, further comprising testing the code change in the deployment pipeline to determine when the code change passes the set of test criteria. 4. The method of claim 3, wherein testing the code change further comprises:
running a set of tests in an application under test environment using the code change, and determining when the code change passes the set of test criteria based on results of the set of tests. 5. The method of claim 1, further comprising moving the code change through the deployment pipeline based on results of the set of tests. 6. A computer readable medium having stored thereon instructions that, when executed by a processor, cause the processor to perform a method to deploy a code change in a software application, the method comprising:
assigning the code change to a deployment pipeline according to a filtering rule; testing the code change in the deployment pipeline to determine when the code change passes a set of test criteria associated with the deployment pipeline; and deploying the code change after the code change passes the set of test criteria. 7. The computer readable medium of claim 6, further comprising evaluating the code change using data associated with the code change. 8. The computer readable medium of claim 6, further comprising defining the filtering rule using at least one predefined set of business criteria associated with the code change. 9. The computer readable medium of claim 6, further comprising maintaining a plurality of deployment pipelines. 10. A system to deploy a code change in a software application, the system comprising:
an assignment engine to assign the code change to a deployment pipeline based on a filtering rule; and a deployment engine to deploy the code change after the code change passes a set of test criteria associated with the deployment pipeline. 11. The system of claim 10, further comprising a filter engine to sort the code change based on the filtering rule. 12. The system of claim 11, wherein the filter engine sorts the code change using a predefined set of business criteria associated with the code change. 13. The system of claim 10, wherein the deployment engine maintains a plurality of deployment pipelines. 14. The system of claim 10, further comprising a test device that includes a test engine to run a set of tests on the code change in an application under test environment. 15. The system claim 13, further comprising a data store to store the set of tests. | 2,100 |
5,384 | 5,384 | 13,336,087 | 2,168 | A patent Examiner information accessing system is disclosed for accessing patent Examiner information from a Patent and Trademark Office, or other, database. A search system is provided so that a user can search information aggregated by the Examiner information accessing system. | 1. A computer implemented method performed by a computer with a processor, the method comprising:
receiving, at the processor, an assignee name input; accessing, with the processor, an examiner data system based on the assignee name; identifying, with the processor, a set of patent examiners in the examiner data system that examine patent applications assigned to an assignee represented by the assignee name; calculating patent prosecution statistics for the identified set of patent examiners based only on patent applications assigned to the assignee; and automatically displaying, on a user interface display, the patent prosecution statistics along with a list of the identified set of patent examiners on a user interface display, each displayed patent examiner in the identified set being displayed with a corresponding actuable user input which when actuated, causes the processor to automatically display patent prosecution statistics for the patent examiner corresponding to the actuated user input. 2. The computer implemented method of claim 1 wherein automatically displaying the patent prosecution statistics comprises:
displaying a plurality of actuable scope selector input mechanisms, each corresponding to a scope unit associated with a subset of the patent applications assigned to the assignee;
receiving actuation of a selected one of the scope selector input mechanisms;
calculating scoped patent prosecution statistics based only on the subset of patent applications corresponding to the selected scope selector input mechanism; and
displaying the scoped patent prosecution statistics. 3. The computer implemented method of claim 1 and further comprising:
identifying a set of legal representatives that prosecute the patent applications assigned to the assignee; and
displaying a list of the set of legal representatives, each legal representative in the set having a corresponding actuable user input mechanism which when actuated, causes the processor to display legal representative patent prosecution statistics for only the corresponding legal representative and based only on patent applications assigned to the assignee and prosecuted by the corresponding legal representative. 4. The computer implemented method of claim 3 and further comprising:
displaying an actuable legal representative compare mechanism which, when actuated, causes the processor to compare the legal representative patent prosecution statistics for the corresponding legal representative with legal representative statistics for another selected legal representative. 5. The computer implemented method of claim 4 wherein actuation of the legal representative compare mechanism causes the processor to generate a selection user interface that receives a user input selecting a set of statistics to be compared with the legal representative patent prosecution statistics for the corresponding legal representative. 6. The computer implemented method of claim 2 and further comprising:
generating a predicted prosecution volume for a scope unit corresponding to the selected scope selector input mechanism; and
displaying the predicted prosecution volume for the scope unit. 7. The computer implemented method of claim 6 wherein the predicted prosecution volume comprises:
an indication of an estimated number of office actions that will be required before allowance of a patent application associated with the scope unit. 8. The computer implemented method of claim 6 wherein the predicted prosecution volume comprises:
an indicator of an estimated financial cost for prosecuting the patent application to allowance. 9. The computer implemented method of claim 6 wherein each scope unit represented by one of the scope selector user input mechanisms comprises:
a business unit of the assignee. 10. The computer implemented method of claim 6 wherein each scope unit represented by one of the scope selectors user input mechanisms comprises:
a product line of the assignee. 11. The computer implemented method of claim 6 wherein each scope unit represented by one of the scope selector user input mechanisms comprises another assignee. 12. The computer implemented method of claim 6 wherein displaying the predicted prosecution volume comprises:
displaying an actuable compare mechanism which when actuated, generates a predicted prosecution volume for another entity, other than the scope unit corresponding to the selected scope selector input mechanism; and
displaying the predicted prosecution volume for the other entity in juxtaposed relation to the predicted prosecution volume for the scope unit. 13. The computer implemented method of claim 12 wherein the other entity comprises another scope unit. 14. The computer implemented method of claim 12 wherein the other entity comprises another assignee. | A patent Examiner information accessing system is disclosed for accessing patent Examiner information from a Patent and Trademark Office, or other, database. A search system is provided so that a user can search information aggregated by the Examiner information accessing system.1. A computer implemented method performed by a computer with a processor, the method comprising:
receiving, at the processor, an assignee name input; accessing, with the processor, an examiner data system based on the assignee name; identifying, with the processor, a set of patent examiners in the examiner data system that examine patent applications assigned to an assignee represented by the assignee name; calculating patent prosecution statistics for the identified set of patent examiners based only on patent applications assigned to the assignee; and automatically displaying, on a user interface display, the patent prosecution statistics along with a list of the identified set of patent examiners on a user interface display, each displayed patent examiner in the identified set being displayed with a corresponding actuable user input which when actuated, causes the processor to automatically display patent prosecution statistics for the patent examiner corresponding to the actuated user input. 2. The computer implemented method of claim 1 wherein automatically displaying the patent prosecution statistics comprises:
displaying a plurality of actuable scope selector input mechanisms, each corresponding to a scope unit associated with a subset of the patent applications assigned to the assignee;
receiving actuation of a selected one of the scope selector input mechanisms;
calculating scoped patent prosecution statistics based only on the subset of patent applications corresponding to the selected scope selector input mechanism; and
displaying the scoped patent prosecution statistics. 3. The computer implemented method of claim 1 and further comprising:
identifying a set of legal representatives that prosecute the patent applications assigned to the assignee; and
displaying a list of the set of legal representatives, each legal representative in the set having a corresponding actuable user input mechanism which when actuated, causes the processor to display legal representative patent prosecution statistics for only the corresponding legal representative and based only on patent applications assigned to the assignee and prosecuted by the corresponding legal representative. 4. The computer implemented method of claim 3 and further comprising:
displaying an actuable legal representative compare mechanism which, when actuated, causes the processor to compare the legal representative patent prosecution statistics for the corresponding legal representative with legal representative statistics for another selected legal representative. 5. The computer implemented method of claim 4 wherein actuation of the legal representative compare mechanism causes the processor to generate a selection user interface that receives a user input selecting a set of statistics to be compared with the legal representative patent prosecution statistics for the corresponding legal representative. 6. The computer implemented method of claim 2 and further comprising:
generating a predicted prosecution volume for a scope unit corresponding to the selected scope selector input mechanism; and
displaying the predicted prosecution volume for the scope unit. 7. The computer implemented method of claim 6 wherein the predicted prosecution volume comprises:
an indication of an estimated number of office actions that will be required before allowance of a patent application associated with the scope unit. 8. The computer implemented method of claim 6 wherein the predicted prosecution volume comprises:
an indicator of an estimated financial cost for prosecuting the patent application to allowance. 9. The computer implemented method of claim 6 wherein each scope unit represented by one of the scope selector user input mechanisms comprises:
a business unit of the assignee. 10. The computer implemented method of claim 6 wherein each scope unit represented by one of the scope selectors user input mechanisms comprises:
a product line of the assignee. 11. The computer implemented method of claim 6 wherein each scope unit represented by one of the scope selector user input mechanisms comprises another assignee. 12. The computer implemented method of claim 6 wherein displaying the predicted prosecution volume comprises:
displaying an actuable compare mechanism which when actuated, generates a predicted prosecution volume for another entity, other than the scope unit corresponding to the selected scope selector input mechanism; and
displaying the predicted prosecution volume for the other entity in juxtaposed relation to the predicted prosecution volume for the scope unit. 13. The computer implemented method of claim 12 wherein the other entity comprises another scope unit. 14. The computer implemented method of claim 12 wherein the other entity comprises another assignee. | 2,100 |
5,385 | 5,385 | 14,530,266 | 2,185 | The Multicore Bus Architecture (MBA) protocol includes a novel technique of sharing the same physical channel for all transaction types. Two channels, the Transaction Attribute Channel (TAC) and the Transaction Data Channel (TDC) are used. The attribute channel transmits bus transaction attribute information optionally including a transaction type signal, a transaction ID, a valid signal, a bus agent ID signal, an address signal, a transaction size signal, a credit spend signal and a credit return signal. The data channel connected a data subset of the signal lines of the bus separate from the attribute subset of signal lines the bus. The data channel optionally transmits a data valid signal, a transaction ID signal, a bus agent ID signal and a last data signal to mark the last data of a current bus transaction. | 1. A bus agent operable to exchange information on a bus, comprising:
an attribute channel connected to an attribute subset of signal lines the bus, said attribute channel operable to transmit bus transaction attribute information via the attribute subset of signal lines; and a data channel connected a data subset of the signal lines of the bus separate from the attribute subset of signal lines the bus, said data channel operable to transmit data via the signal lines of the bus. 2. The bus agent of claim 1, wherein:
said transaction attribute information includes a transaction type signal indicative of a bus transaction type. 3. The bus agent of claim 1, wherein:
said transaction attribute information includes a transaction ID indicative of an identification of the bus transaction. 4. The bus agent of claim 1, wherein:
said transaction attribute information includes a valid signal indicative of whether other signals on the attribute subset of signal lines the bus are valid. 5. The bus agent of claim 1, wherein:
said transaction attribute information includes a bus agent ID signal indicative of indicative of an identification of the bus agent. 6. The bus agent of claim 1, wherein:
said transaction attribute information includes an address signal indicative of a transaction address. 7. The bus agent of claim 5, wherein:
said transaction attribute information further includes a transaction size signal indicative of a transaction data size. 8. The bus agent of claim 1, wherein:
said transaction attribute information includes a credit spend signal indicative of a credit spend type. 9. The bus agent of claim 1, wherein:
said transaction attribute information includes a credit return signal indicative of a credit return type. 10. The bus agent of claim 1, wherein:
said data channel is operable to transmit on the data subset of the signal lines of the bus a data valid signal indicative of whether other signals on the data subset of signal lines the bus are valid. 11. The bus agent of claim 1, wherein:
said data channel is operable to transmit on the data subset of the signal lines of the bus a transaction ID signal indicative of an identification of a current data transmission. 12. The bus agent of claim 1, wherein:
said data channel is operable to transmit on the data subset of the signal lines of the bus a bus agent ID signal indicative of an identification of the bus agent. 13. The bus agent of claim 1, wherein:
said data channel is operable
to transmit data on the data subset of the signal lines of the bus in a plurality of data transfers, and
to transmit on the data subset of the signal lines of the bus a last data signal indicative of whether data of a current transfer is the last data of a current bus transaction. | The Multicore Bus Architecture (MBA) protocol includes a novel technique of sharing the same physical channel for all transaction types. Two channels, the Transaction Attribute Channel (TAC) and the Transaction Data Channel (TDC) are used. The attribute channel transmits bus transaction attribute information optionally including a transaction type signal, a transaction ID, a valid signal, a bus agent ID signal, an address signal, a transaction size signal, a credit spend signal and a credit return signal. The data channel connected a data subset of the signal lines of the bus separate from the attribute subset of signal lines the bus. The data channel optionally transmits a data valid signal, a transaction ID signal, a bus agent ID signal and a last data signal to mark the last data of a current bus transaction.1. A bus agent operable to exchange information on a bus, comprising:
an attribute channel connected to an attribute subset of signal lines the bus, said attribute channel operable to transmit bus transaction attribute information via the attribute subset of signal lines; and a data channel connected a data subset of the signal lines of the bus separate from the attribute subset of signal lines the bus, said data channel operable to transmit data via the signal lines of the bus. 2. The bus agent of claim 1, wherein:
said transaction attribute information includes a transaction type signal indicative of a bus transaction type. 3. The bus agent of claim 1, wherein:
said transaction attribute information includes a transaction ID indicative of an identification of the bus transaction. 4. The bus agent of claim 1, wherein:
said transaction attribute information includes a valid signal indicative of whether other signals on the attribute subset of signal lines the bus are valid. 5. The bus agent of claim 1, wherein:
said transaction attribute information includes a bus agent ID signal indicative of indicative of an identification of the bus agent. 6. The bus agent of claim 1, wherein:
said transaction attribute information includes an address signal indicative of a transaction address. 7. The bus agent of claim 5, wherein:
said transaction attribute information further includes a transaction size signal indicative of a transaction data size. 8. The bus agent of claim 1, wherein:
said transaction attribute information includes a credit spend signal indicative of a credit spend type. 9. The bus agent of claim 1, wherein:
said transaction attribute information includes a credit return signal indicative of a credit return type. 10. The bus agent of claim 1, wherein:
said data channel is operable to transmit on the data subset of the signal lines of the bus a data valid signal indicative of whether other signals on the data subset of signal lines the bus are valid. 11. The bus agent of claim 1, wherein:
said data channel is operable to transmit on the data subset of the signal lines of the bus a transaction ID signal indicative of an identification of a current data transmission. 12. The bus agent of claim 1, wherein:
said data channel is operable to transmit on the data subset of the signal lines of the bus a bus agent ID signal indicative of an identification of the bus agent. 13. The bus agent of claim 1, wherein:
said data channel is operable
to transmit data on the data subset of the signal lines of the bus in a plurality of data transfers, and
to transmit on the data subset of the signal lines of the bus a last data signal indicative of whether data of a current transfer is the last data of a current bus transaction. | 2,100 |
5,386 | 5,386 | 15,241,461 | 2,184 | An interconnect circuit, and method of operation of such an interconnect circuit, are provided. The interconnect circuitry has a first interface for coupling to a master device and a second interface for coupling to a slave device. Transactions are performed between the master device and the slave device, where each transaction comprises or more transfers, and each transfer comprises a request and a response. A first connection path between the first interface and the second interface is provided that comprises a first plurality of pipeline stages. The first connection path forms a default path for propagation of the requests and responses of the transfers. A second connection path is also provided between the first interface and the second interface that comprises a second plurality of pipeline stages, where the second plurality is less than the first plurality. Path selection circuitry is then used to determine presence of a fast path condition. In the presence of the fast path condition, the path selection circuitry causes at least one of the request and the response for one or more transfers to be propagated via the second connection path. This can significantly reduce the latency associated with the handling of transfers within the interconnect circuitry, and hence improves the overall performance of the interconnect circuitry. | 1. Interconnect circuitry comprising:
a first interface to couple to a master device; a second interface to couple to a slave device, transactions being performed between the master device and the slave device, where each transaction comprises one or more transfers, each transfer comprising a request and a response; a first connection path between the first interface and the second interface comprising a first plurality of pipeline stages, the first connection path forming a default path for propagation of the requests and responses of the transfers; a second connection path between the first interface and the second interface comprising a second plurality of pipeline stages, where the second plurality is less than the first plurality; and path selection circuitry to determine presence of a fast path condition, in the presence of the fast path condition the path selection circuitry causing at least one of the request and the response for one or more transfers to be propagated via the second connection path. 2. Interconnect circuitry as claimed in claim 1, further comprising:
processing circuitry to initiate an analysis operation for a transfer that produces an analysis response that influences usability of a response generated by the slave device for that transfer, the processing circuitry being located within the first connection path. 3. Interconnect circuitry as claimed in claim 2, wherein said path selection circuitry is arranged to determine the presence of said fast path condition for a current transfer when the current transfer has no requirement for said analysis operation to be performed. 4. Interconnect circuitry as claimed in claim 2, wherein the path selection circuitry is responsive to a current transfer requiring said analysis operation to be performed, to evaluate specified criteria to determine whether said fast path condition is present and, in the presence of said fast path condition, to cause both the first connection path and the second connection path to be used for the current transfer. 5. Interconnect circuitry as claimed in claim 4, wherein the path selection circuitry is arranged to cause the request of the current transfer to be propagated via the first connection path and the response of the current transfer from the slave device to be propagated via the second connection path. 6. Interconnect circuitry as claimed in claim 4, wherein the path selection circuitry is arranged to cause the request of the current transfer to be propagated via the first connection path to the processing circuitry and via the second connection path to the second interface, and the response of the current transfer from the slave device to be propagated via the second connection path. 7. Interconnect circuitry as claimed in claim 4, wherein the master device is prevented from making use of the response of the current transfer from the slave device before the analysis response is provided by the processing circuitry. 8. Interconnect circuitry as claimed in claim 1, wherein at least one of the first interface and the second connection path includes buffer circuitry to buffer the response of the current transfer from the slave device until a predetermined condition is met. 9. Interconnect circuitry as claimed in claim 1, wherein:
the first connection path comprises multiple asynchronous bridge components, each asynchronous bridge component comprising multiple pipeline stages; and the second connection path comprises less asynchronous bridge components than are provided within the first connection path. 10. Interconnect circuitry as claimed in claim 2, wherein the processing circuitry comprises snoop circuitry to perform, as the analysis operation, a coherency operation amongst multiple master devices coupled to the interconnect circuitry, and the analysis response comprises a snoop response. 11. Interconnect circuitry as claimed in claim 10, wherein for a current transfer, the snoop response identifies whether data within a response generated by the slave device for the current transfer is to be disregarded in favour of data associated with the snoop response. 12. Interconnect circuitry as claimed in claim 2, wherein the processing circuitry comprises security checking circuitry to perform, as the analysis operation, a security operation, and the analysis response includes information controlling use of the response generated by the slave device. 13. Interconnect circuitry as claimed in claim 12, wherein the analysis response identifies whether the master device is allowed to perform the transfer. 14. Interconnect circuitry as claimed in claim 12, wherein the analysis response provides a decryption key to be used to decrypt data provided in the response generated by the slave device. 15. Interconnect circuitry as claimed in claim 4, wherein said specified criteria identify one or more properties which the transfer is to have in order to trigger the fast path condition. 16. Interconnect circuitry as claimed in claim 4, wherein when evaluating said specified criteria the path selection circuitry is arranged to reference history data maintained about previous transfers routed between the first and second interfaces. 17. Interconnect circuitry as claimed in claim 1, wherein the path selection circuitry is arranged to provide control information for at least one of the request and the response of a transfer to identify which of the first connection path and the second connection path is to be used. 18. Interconnect circuitry as claimed in claim 1, wherein the path selection circuitry is provided in association with at least one of the first interface and the second interface. 19. A master device for coupling to interconnect circuitry as claimed in claim 1, the master device comprising:
buffer circuitry to buffer the response of a current transfer from the slave device until a predetermined condition is met. 20. A master device as claimed in claim 19, wherein the master device is prevented from using the response of the current transfer whilst it is buffered in the buffer circuitry. 21. A master device as claimed in claim 19, wherein the buffer circuitry is implemented within a cache of the master device, the cache providing state information in association with each cache line to identify whether the data in that cache line is buffered data awaiting said predetermined condition. 22. A method of operating interconnect circuitry having a first interface to couple to a master device, and a second interface to couple to a slave device, transactions being performed between the master device and the slave device, where each transaction comprises one or more transfers, each transfer comprising a request and a response, the method comprising:
providing a first connection path between the first interface and the second interface comprising a first plurality of pipeline stages, the first connection path forming a default path for propagation of the requests and responses of the transfers; providing a second connection path between the first interface and the second interface comprising a second plurality of pipeline stages, where the second plurality is less than the first plurality; and determining presence of a fast path condition, and in the presence of the fast path condition propagating at least one of the request and the response for one or more transfers via the second connection path. | An interconnect circuit, and method of operation of such an interconnect circuit, are provided. The interconnect circuitry has a first interface for coupling to a master device and a second interface for coupling to a slave device. Transactions are performed between the master device and the slave device, where each transaction comprises or more transfers, and each transfer comprises a request and a response. A first connection path between the first interface and the second interface is provided that comprises a first plurality of pipeline stages. The first connection path forms a default path for propagation of the requests and responses of the transfers. A second connection path is also provided between the first interface and the second interface that comprises a second plurality of pipeline stages, where the second plurality is less than the first plurality. Path selection circuitry is then used to determine presence of a fast path condition. In the presence of the fast path condition, the path selection circuitry causes at least one of the request and the response for one or more transfers to be propagated via the second connection path. This can significantly reduce the latency associated with the handling of transfers within the interconnect circuitry, and hence improves the overall performance of the interconnect circuitry.1. Interconnect circuitry comprising:
a first interface to couple to a master device; a second interface to couple to a slave device, transactions being performed between the master device and the slave device, where each transaction comprises one or more transfers, each transfer comprising a request and a response; a first connection path between the first interface and the second interface comprising a first plurality of pipeline stages, the first connection path forming a default path for propagation of the requests and responses of the transfers; a second connection path between the first interface and the second interface comprising a second plurality of pipeline stages, where the second plurality is less than the first plurality; and path selection circuitry to determine presence of a fast path condition, in the presence of the fast path condition the path selection circuitry causing at least one of the request and the response for one or more transfers to be propagated via the second connection path. 2. Interconnect circuitry as claimed in claim 1, further comprising:
processing circuitry to initiate an analysis operation for a transfer that produces an analysis response that influences usability of a response generated by the slave device for that transfer, the processing circuitry being located within the first connection path. 3. Interconnect circuitry as claimed in claim 2, wherein said path selection circuitry is arranged to determine the presence of said fast path condition for a current transfer when the current transfer has no requirement for said analysis operation to be performed. 4. Interconnect circuitry as claimed in claim 2, wherein the path selection circuitry is responsive to a current transfer requiring said analysis operation to be performed, to evaluate specified criteria to determine whether said fast path condition is present and, in the presence of said fast path condition, to cause both the first connection path and the second connection path to be used for the current transfer. 5. Interconnect circuitry as claimed in claim 4, wherein the path selection circuitry is arranged to cause the request of the current transfer to be propagated via the first connection path and the response of the current transfer from the slave device to be propagated via the second connection path. 6. Interconnect circuitry as claimed in claim 4, wherein the path selection circuitry is arranged to cause the request of the current transfer to be propagated via the first connection path to the processing circuitry and via the second connection path to the second interface, and the response of the current transfer from the slave device to be propagated via the second connection path. 7. Interconnect circuitry as claimed in claim 4, wherein the master device is prevented from making use of the response of the current transfer from the slave device before the analysis response is provided by the processing circuitry. 8. Interconnect circuitry as claimed in claim 1, wherein at least one of the first interface and the second connection path includes buffer circuitry to buffer the response of the current transfer from the slave device until a predetermined condition is met. 9. Interconnect circuitry as claimed in claim 1, wherein:
the first connection path comprises multiple asynchronous bridge components, each asynchronous bridge component comprising multiple pipeline stages; and the second connection path comprises less asynchronous bridge components than are provided within the first connection path. 10. Interconnect circuitry as claimed in claim 2, wherein the processing circuitry comprises snoop circuitry to perform, as the analysis operation, a coherency operation amongst multiple master devices coupled to the interconnect circuitry, and the analysis response comprises a snoop response. 11. Interconnect circuitry as claimed in claim 10, wherein for a current transfer, the snoop response identifies whether data within a response generated by the slave device for the current transfer is to be disregarded in favour of data associated with the snoop response. 12. Interconnect circuitry as claimed in claim 2, wherein the processing circuitry comprises security checking circuitry to perform, as the analysis operation, a security operation, and the analysis response includes information controlling use of the response generated by the slave device. 13. Interconnect circuitry as claimed in claim 12, wherein the analysis response identifies whether the master device is allowed to perform the transfer. 14. Interconnect circuitry as claimed in claim 12, wherein the analysis response provides a decryption key to be used to decrypt data provided in the response generated by the slave device. 15. Interconnect circuitry as claimed in claim 4, wherein said specified criteria identify one or more properties which the transfer is to have in order to trigger the fast path condition. 16. Interconnect circuitry as claimed in claim 4, wherein when evaluating said specified criteria the path selection circuitry is arranged to reference history data maintained about previous transfers routed between the first and second interfaces. 17. Interconnect circuitry as claimed in claim 1, wherein the path selection circuitry is arranged to provide control information for at least one of the request and the response of a transfer to identify which of the first connection path and the second connection path is to be used. 18. Interconnect circuitry as claimed in claim 1, wherein the path selection circuitry is provided in association with at least one of the first interface and the second interface. 19. A master device for coupling to interconnect circuitry as claimed in claim 1, the master device comprising:
buffer circuitry to buffer the response of a current transfer from the slave device until a predetermined condition is met. 20. A master device as claimed in claim 19, wherein the master device is prevented from using the response of the current transfer whilst it is buffered in the buffer circuitry. 21. A master device as claimed in claim 19, wherein the buffer circuitry is implemented within a cache of the master device, the cache providing state information in association with each cache line to identify whether the data in that cache line is buffered data awaiting said predetermined condition. 22. A method of operating interconnect circuitry having a first interface to couple to a master device, and a second interface to couple to a slave device, transactions being performed between the master device and the slave device, where each transaction comprises one or more transfers, each transfer comprising a request and a response, the method comprising:
providing a first connection path between the first interface and the second interface comprising a first plurality of pipeline stages, the first connection path forming a default path for propagation of the requests and responses of the transfers; providing a second connection path between the first interface and the second interface comprising a second plurality of pipeline stages, where the second plurality is less than the first plurality; and determining presence of a fast path condition, and in the presence of the fast path condition propagating at least one of the request and the response for one or more transfers via the second connection path. | 2,100 |
5,387 | 5,387 | 15,245,466 | 2,136 | A dispersed storage network (DSN) computing device detects that an accelerated backup scheduling event has occurred, e.g., detecting signs of a likely memory device failure, limited bandwidth or connectivity, expensive bandwidth, and/or dwindling power reserves. A first subset of data objects from among a set of data objects to be backed up is identified and these are backed up first. Such subset of data objects may be the smallest data objects, data objects that are most frequently accessed, data objects that have gone the longest since being backed up, or data objects that are new or modified since a last back up. The accelerated backup of the subset of data may be scheduled immediately or scheduled based upon urgency. The computing device may also pre-load other data objects subsequent to detecting an accelerated backup scheduling event has occurred. | 1. A method of scheduling an accelerated backup of data objects in a dispersed storage network, the dispersed storage network including a computing device having a dispersed storage memory client and a memory containing a set of data objects to be backed up, the method comprising:
detecting by the dispersed storage memory client of the computing device that an accelerated backup scheduling event has occurred; identifying by the dispersed storage memory client of the computing device a first subset of data objects from among the set of data objects to be backed up; and scheduling by the dispersed storage memory client of the computing device an accelerated backup of the first subset of data objects that is earlier than a previously scheduled backup of the set of data objects to be backed up. 2. The method of claim 1, wherein detecting by the dispersed storage memory client of the computing device that an accelerated backup scheduling event has occurred includes detecting that the memory containing the set of data objects to be backed up is likely to fail. 3. The method of claim 1, wherein detecting by the dispersed storage memory client of the computing device that an accelerated backup scheduling event has occurred includes detecting that the computing device is likely to run out of power. 4. The method of claim 1, wherein detecting by the dispersed storage memory client of the computing device that an accelerated backup scheduling event has occurred includes detecting that the computing device is likely to experience a reduction in network services. 5. The method of claim 4, wherein detecting that the computing device is likely to experience a reduction in network services is based upon historical data relating to available network services. 6. The method of claim 4, wherein detecting that the computing device is likely to experience a reduction in network services is based upon a scheduled future event. 7. The method of claim 4, wherein detecting that the computing device is likely to experience a reduction in network services is based upon one or more of directional and location information. 8. The method of claim 1, wherein identifying by the dispersed storage memory client of the computing device a first subset of data objects from among the set of data objects to be backed up includes one or more of:
identifying the smallest data objects from among the set of data objects to backed up; identifying the most frequently accessed data objects from among the set of data objects to backed up; or identifying the data objects from among the set of data objects to backed up that have gone the longest amount of time since being backed up. 9. The method of claim 1, wherein identifying by the dispersed storage memory client of the computing device a first subset of data objects from among the set of data objects to be backed up includes identifying the data objects from among the set of data objects to backed up that are new or modified since a last backup. 10. The method of claim 1, further including pre-loading second data objects from at least one dispersed storage unit in the dispersed storage network to the memory of the computing device having a dispersed storage network client subsequent to detecting the accelerated backup scheduling event. 11. A computing device having a dispersed storage memory client for use in a dispersed storage network the computing device including:
a communications interface; memory containing the dispersed storage memory client and a set of data objects to be backed up; and a processor; where the dispersed storage memory client includes instructions for causing the processor to:
detect that an accelerated backup scheduling event has occurred;
identifying a first subset of data objects from among the set of data objects to be backed up; and
scheduling a backup of the first subset of data objects that is earlier than a previously scheduled backup of the set of data objects to be backed up. 12. The computing device of claim 11, wherein the dispersed storage memory client further includes instructions for causing the processor to detect that an accelerated backup scheduling event has occurred when:
the memory containing the set of data objects to be backed up is likely to fail; the computing device is likely to run out of power; or the computing device is likely to experience a reduction in network services. 13. The computing device of claim 11, wherein, the dispersed storage memory client further includes instructions for causing the processor to detect that an accelerated backup scheduling event has occurred when the computing device is likely to experience a reduction in network services based upon historical data relating to available network services. 14. The computing device of claim 11, wherein the dispersed storage memory client further includes instructions for causing the processor to detect that an accelerated backup scheduling event has occurred when the computing device is likely to experience a reduction in network services based upon a scheduled future event. 15. The computing device of claim 11, wherein the dispersed storage memory client further includes instructions causing the processor to detect that an accelerated backup scheduling event has occurred when the computing device is likely to experience a reduction in network services based upon one or more of directional and location information. 16. The computing device of claim 11, wherein the dispersed storage memory client further includes instructions causing the processor to identify the first subset of data objects from among the set of data objects to be backed up by identifying the smallest data objects from among the set of data objects to be backed up. 17. The computing device of claim 11, wherein the dispersed storage memory client further includes instructions causing the processor to identify the first subset of data objects from among the set of data objects to be backed up by identifying the most frequently accessed data objects from among the set of data objects to be backed up. 18. The computing device of claim 11, wherein the dispersed storage memory client further includes instructions causing the processor to identify the first subset of data objects from among the set of data objects to be backed up by identifying the data objects from among the set of data objects to be backed up that have gone the longest amount of time since being backed up. 19. The computing device of claim 11, wherein the dispersed storage memory client further includes instructions causing the processor to identify the first subset of data objects from among the set of data objects to be backed up by identifying the data objects from among the set of data objects to be backed up that are new or modified since a last back up. 20. The computing device of claim 11, wherein the dispersed storage memory client further includes instructions causing the processor to pre-load second data objects from at least one dispersed storage unit in the dispersed storage network to the memory of the computing device subsequent to detecting an accelerated backup scheduling event. | A dispersed storage network (DSN) computing device detects that an accelerated backup scheduling event has occurred, e.g., detecting signs of a likely memory device failure, limited bandwidth or connectivity, expensive bandwidth, and/or dwindling power reserves. A first subset of data objects from among a set of data objects to be backed up is identified and these are backed up first. Such subset of data objects may be the smallest data objects, data objects that are most frequently accessed, data objects that have gone the longest since being backed up, or data objects that are new or modified since a last back up. The accelerated backup of the subset of data may be scheduled immediately or scheduled based upon urgency. The computing device may also pre-load other data objects subsequent to detecting an accelerated backup scheduling event has occurred.1. A method of scheduling an accelerated backup of data objects in a dispersed storage network, the dispersed storage network including a computing device having a dispersed storage memory client and a memory containing a set of data objects to be backed up, the method comprising:
detecting by the dispersed storage memory client of the computing device that an accelerated backup scheduling event has occurred; identifying by the dispersed storage memory client of the computing device a first subset of data objects from among the set of data objects to be backed up; and scheduling by the dispersed storage memory client of the computing device an accelerated backup of the first subset of data objects that is earlier than a previously scheduled backup of the set of data objects to be backed up. 2. The method of claim 1, wherein detecting by the dispersed storage memory client of the computing device that an accelerated backup scheduling event has occurred includes detecting that the memory containing the set of data objects to be backed up is likely to fail. 3. The method of claim 1, wherein detecting by the dispersed storage memory client of the computing device that an accelerated backup scheduling event has occurred includes detecting that the computing device is likely to run out of power. 4. The method of claim 1, wherein detecting by the dispersed storage memory client of the computing device that an accelerated backup scheduling event has occurred includes detecting that the computing device is likely to experience a reduction in network services. 5. The method of claim 4, wherein detecting that the computing device is likely to experience a reduction in network services is based upon historical data relating to available network services. 6. The method of claim 4, wherein detecting that the computing device is likely to experience a reduction in network services is based upon a scheduled future event. 7. The method of claim 4, wherein detecting that the computing device is likely to experience a reduction in network services is based upon one or more of directional and location information. 8. The method of claim 1, wherein identifying by the dispersed storage memory client of the computing device a first subset of data objects from among the set of data objects to be backed up includes one or more of:
identifying the smallest data objects from among the set of data objects to backed up; identifying the most frequently accessed data objects from among the set of data objects to backed up; or identifying the data objects from among the set of data objects to backed up that have gone the longest amount of time since being backed up. 9. The method of claim 1, wherein identifying by the dispersed storage memory client of the computing device a first subset of data objects from among the set of data objects to be backed up includes identifying the data objects from among the set of data objects to backed up that are new or modified since a last backup. 10. The method of claim 1, further including pre-loading second data objects from at least one dispersed storage unit in the dispersed storage network to the memory of the computing device having a dispersed storage network client subsequent to detecting the accelerated backup scheduling event. 11. A computing device having a dispersed storage memory client for use in a dispersed storage network the computing device including:
a communications interface; memory containing the dispersed storage memory client and a set of data objects to be backed up; and a processor; where the dispersed storage memory client includes instructions for causing the processor to:
detect that an accelerated backup scheduling event has occurred;
identifying a first subset of data objects from among the set of data objects to be backed up; and
scheduling a backup of the first subset of data objects that is earlier than a previously scheduled backup of the set of data objects to be backed up. 12. The computing device of claim 11, wherein the dispersed storage memory client further includes instructions for causing the processor to detect that an accelerated backup scheduling event has occurred when:
the memory containing the set of data objects to be backed up is likely to fail; the computing device is likely to run out of power; or the computing device is likely to experience a reduction in network services. 13. The computing device of claim 11, wherein, the dispersed storage memory client further includes instructions for causing the processor to detect that an accelerated backup scheduling event has occurred when the computing device is likely to experience a reduction in network services based upon historical data relating to available network services. 14. The computing device of claim 11, wherein the dispersed storage memory client further includes instructions for causing the processor to detect that an accelerated backup scheduling event has occurred when the computing device is likely to experience a reduction in network services based upon a scheduled future event. 15. The computing device of claim 11, wherein the dispersed storage memory client further includes instructions causing the processor to detect that an accelerated backup scheduling event has occurred when the computing device is likely to experience a reduction in network services based upon one or more of directional and location information. 16. The computing device of claim 11, wherein the dispersed storage memory client further includes instructions causing the processor to identify the first subset of data objects from among the set of data objects to be backed up by identifying the smallest data objects from among the set of data objects to be backed up. 17. The computing device of claim 11, wherein the dispersed storage memory client further includes instructions causing the processor to identify the first subset of data objects from among the set of data objects to be backed up by identifying the most frequently accessed data objects from among the set of data objects to be backed up. 18. The computing device of claim 11, wherein the dispersed storage memory client further includes instructions causing the processor to identify the first subset of data objects from among the set of data objects to be backed up by identifying the data objects from among the set of data objects to be backed up that have gone the longest amount of time since being backed up. 19. The computing device of claim 11, wherein the dispersed storage memory client further includes instructions causing the processor to identify the first subset of data objects from among the set of data objects to be backed up by identifying the data objects from among the set of data objects to be backed up that are new or modified since a last back up. 20. The computing device of claim 11, wherein the dispersed storage memory client further includes instructions causing the processor to pre-load second data objects from at least one dispersed storage unit in the dispersed storage network to the memory of the computing device subsequent to detecting an accelerated backup scheduling event. | 2,100 |
5,388 | 5,388 | 13,837,888 | 2,142 | A digital checklist system includes an electronic calibration and measurement device and a computer-readable medium having computer-executable instructions stored thereon that, if executed by one or more processors of a computing device, cause the computing device to perform actions for managing a digital checklist The actions include creating a digital checklist having at least one unique prompt, selecting the digital checklist for uploading onto the electronic calibration and measurement device, and downloading data input into the electronic calibration and measurement device in response to the at least one unique prompt. The system further includes a network location for facilitating communication between the electronic calibration and measurement device and the computing device. | 1. A digital checklist system, comprising:
(a) an electronic calibration and measurement device; (b) a computer-readable medium having computer-executable instructions stored thereon that, if executed by one or more processors of a computing device, cause the computing device to perform actions for managing a digital checklist, the actions comprising:
(i) creating a digital checklist having at least one unique prompt; and
(ii) selecting the digital checklist for uploading onto the electronic calibration and measurement device; and
(iii) downloading data input into the electronic calibration and measurement device in response to the at least one unique prompt; and
(c) a network location for facilitating communication between the electronic calibration and measurement device and the computing device. 2. The system of claim 1, wherein the actions further comprise retrieving a digital checklist from a database. 3. The system of claim 1, wherein the actions further comprise accessing a database to retrieve information about the electronic calibration and measurement device. 4. The system of claim 3, wherein the actions further comprise modifying the digital checklist to include information about the electronic calibration and measurement device. 5. The system of claim 1, wherein the actions further comprise accessing a database to retrieve a template for creating the digital checklist. 6. The system of claim 1, wherein the electronic calibration and measurement device is a documenting process calibrator. 7. The system of claim 1, wherein the electronic calibration and measurement device is configured to display the at least one unique prompt of the digital checklist. 8. The system of claim 7, wherein the electronic calibration and measurement device includes an input assembly for inputting data in response to the at least one unique prompt. 9. The system of claim 7, wherein the digital checklist includes at least first, second, and third unique prompts, and wherein the actions further comprise configuring the digital checklist such that, when uploaded onto the electronic calibration and measurement device, the user's input in response to the first unique prompt causes the electronic calibration and measurement device to display one of either the second and third prompts. 10. The system of claim 7, wherein the actions further comprise storing the downloaded data input into the electronic calibration and measurement device in response to the at least one unique prompt in a database. 11. A method for implementing a digital checklist on an electronic calibration and measurement device, the method comprising:
(a) creating a digital checklist having at least one unique prompt; (b) selecting the digital checklist for uploading onto an electronic calibration and measurement device; (c) displaying the at least one unique prompt on the electronic calibration and measurement device; (d) inputting data into the electronic calibration and measurement device in response to the at least one unique prompt; and (e) downloading the data the electronic calibration and measurement device. 12. The method of claim 11, further comprising retrieving a digital checklist from a database. 13. The method of claim 11, further comprising accessing a database to retrieve information about the electronic calibration and measurement device. 14. The method of claim 13, further comprising modifying the digital checklist to include information about the electronic calibration and measurement device 15. The method of claim 11, further comprising accessing a database to retrieve a template for creating the digital checklist. 16. The method of claim 11, wherein the electronic calibration and measurement device is a documenting process calibrator. 17. The method of claim 11, wherein the electronic calibration and measurement device includes an input assembly for inputting data in response to the at least one unique prompt. 18. The method of claim 11, further comprising creating at least first, second, and third unique prompts for the digital checklist, and configuring the digital checklist such that, when uploaded onto the electronic calibration and measurement device, the user's input in response to the first unique prompt causes the electronic calibration and measurement device to display one of either the second and third prompts. 19. The method of claim 11, further comprising storing the downloaded data input into the electronic calibration and measurement device in response to the at least one unique prompt in a database. 20. A digital checklist system, comprising:
(a) an electronic calibration and measurement device; (b) a first computing device configured to be communicatively coupled to the electronic calibration and measurement device, the first computing device configured to:
(i) select a digital checklist for uploading onto the electronic calibration and measurement device, the digital checklist having at least one unique prompt; and
(ii) download data input into the electronic calibration and measurement device in response to the at least one unique prompt. | A digital checklist system includes an electronic calibration and measurement device and a computer-readable medium having computer-executable instructions stored thereon that, if executed by one or more processors of a computing device, cause the computing device to perform actions for managing a digital checklist The actions include creating a digital checklist having at least one unique prompt, selecting the digital checklist for uploading onto the electronic calibration and measurement device, and downloading data input into the electronic calibration and measurement device in response to the at least one unique prompt. The system further includes a network location for facilitating communication between the electronic calibration and measurement device and the computing device.1. A digital checklist system, comprising:
(a) an electronic calibration and measurement device; (b) a computer-readable medium having computer-executable instructions stored thereon that, if executed by one or more processors of a computing device, cause the computing device to perform actions for managing a digital checklist, the actions comprising:
(i) creating a digital checklist having at least one unique prompt; and
(ii) selecting the digital checklist for uploading onto the electronic calibration and measurement device; and
(iii) downloading data input into the electronic calibration and measurement device in response to the at least one unique prompt; and
(c) a network location for facilitating communication between the electronic calibration and measurement device and the computing device. 2. The system of claim 1, wherein the actions further comprise retrieving a digital checklist from a database. 3. The system of claim 1, wherein the actions further comprise accessing a database to retrieve information about the electronic calibration and measurement device. 4. The system of claim 3, wherein the actions further comprise modifying the digital checklist to include information about the electronic calibration and measurement device. 5. The system of claim 1, wherein the actions further comprise accessing a database to retrieve a template for creating the digital checklist. 6. The system of claim 1, wherein the electronic calibration and measurement device is a documenting process calibrator. 7. The system of claim 1, wherein the electronic calibration and measurement device is configured to display the at least one unique prompt of the digital checklist. 8. The system of claim 7, wherein the electronic calibration and measurement device includes an input assembly for inputting data in response to the at least one unique prompt. 9. The system of claim 7, wherein the digital checklist includes at least first, second, and third unique prompts, and wherein the actions further comprise configuring the digital checklist such that, when uploaded onto the electronic calibration and measurement device, the user's input in response to the first unique prompt causes the electronic calibration and measurement device to display one of either the second and third prompts. 10. The system of claim 7, wherein the actions further comprise storing the downloaded data input into the electronic calibration and measurement device in response to the at least one unique prompt in a database. 11. A method for implementing a digital checklist on an electronic calibration and measurement device, the method comprising:
(a) creating a digital checklist having at least one unique prompt; (b) selecting the digital checklist for uploading onto an electronic calibration and measurement device; (c) displaying the at least one unique prompt on the electronic calibration and measurement device; (d) inputting data into the electronic calibration and measurement device in response to the at least one unique prompt; and (e) downloading the data the electronic calibration and measurement device. 12. The method of claim 11, further comprising retrieving a digital checklist from a database. 13. The method of claim 11, further comprising accessing a database to retrieve information about the electronic calibration and measurement device. 14. The method of claim 13, further comprising modifying the digital checklist to include information about the electronic calibration and measurement device 15. The method of claim 11, further comprising accessing a database to retrieve a template for creating the digital checklist. 16. The method of claim 11, wherein the electronic calibration and measurement device is a documenting process calibrator. 17. The method of claim 11, wherein the electronic calibration and measurement device includes an input assembly for inputting data in response to the at least one unique prompt. 18. The method of claim 11, further comprising creating at least first, second, and third unique prompts for the digital checklist, and configuring the digital checklist such that, when uploaded onto the electronic calibration and measurement device, the user's input in response to the first unique prompt causes the electronic calibration and measurement device to display one of either the second and third prompts. 19. The method of claim 11, further comprising storing the downloaded data input into the electronic calibration and measurement device in response to the at least one unique prompt in a database. 20. A digital checklist system, comprising:
(a) an electronic calibration and measurement device; (b) a first computing device configured to be communicatively coupled to the electronic calibration and measurement device, the first computing device configured to:
(i) select a digital checklist for uploading onto the electronic calibration and measurement device, the digital checklist having at least one unique prompt; and
(ii) download data input into the electronic calibration and measurement device in response to the at least one unique prompt. | 2,100 |
5,389 | 5,389 | 13,803,727 | 2,176 | Systems, methods, and other embodiments associated with customizing a timeline for displaying account information about an entity are described. In one embodiment, a method includes configuring a timeline of tax account information by consolidating a history of the tax account information in a display of the timeline. Elements in the history are selected based on parameters that have been customized for a revenue authority. The elements include display properties of the timeline and tax account information. The example method may also include dynamically rendering the timeline as one of multiple display zones on a display screen based, at least in part, on the parameters. Rendering the display includes determining how to display each of the elements on the timeline. The processor configures the timeline and dynamically renders the timeline in response to receiving a request to display the timeline about an entity. | 1. A non-transitory computer-readable medium storing computer-executable instructions that when executed by a computer cause the computer to perform a method, the method comprising:
generating, by a processor in the computer, an interface for generating and customizing a timeline, wherein the interface exposes parameters for modifying elements of the timeline, and wherein the elements include display properties of the timeline; receiving input through the interface to modify the parameters, wherein the input includes input that selects which of the elements to include on the timeline and how to display the elements; upon receiving a request to display the timeline with tax account information for an entity:
configuring the timeline by retrieving and consolidating a history of tax account information for the entity in a single display of the timeline, wherein elements in the history are selected based on the parameters; and
dynamically rendering the timeline as one of multiple display zones on a display screen based on the parameters, wherein rendering the timeline includes determining how to display each of the elements on the timeline based, at least in part, on the parameters, and wherein the multiple zones display tax information about the entity from a tax authority. 2. The non-transitory computer-readable medium of claim 1, further comprising:
screening elements from being displayed on the timeline based, at least in part, on the parameters and a security level of a user. 3. The non-transitory computer-readable medium of claim 1, wherein the interface exposes the parameters that are embedded in logic of the computer and are protected from being modified without the interface. 4. The non-transitory computer-readable medium of claim 1, wherein retrieving the tax information includes retrieving data associated with collection cases, audit cases, appeal cases, statuses of cases, tax forms, tax form statuses, payment plan information, tax transactions for the entity, and tax activities for the entity. 5. The non-transitory computer-readable medium of claim 1, wherein the elements include configurable algorithms for customizing display of the tax information on the timeline, and wherein the configurable algorithms each include a plurality of selectable options that are displayed on the interface. 6. The non-transitory computer-readable medium of claim 1, wherein configuring the timeline by consolidating the history of tax account information includes consolidating the history of tax account information for a selected time period. 7. The non-transitory computer-readable medium of claim 1, wherein the parameters include parameters that control which icons are displayed on the timeline to represent different events in the tax account information and parameters that control which colors are displayed on the timeline. 8. A computing system, comprising:
interface logic configured to generate an interface for customizing a timeline, wherein the interface exposes parameters for modifying elements of the timeline, and wherein the elements include display properties of the timeline and tax account information, wherein the interface logic is configured to receive input through the interface to modify the parameters, wherein the input includes input that selects which elements to include on the timeline and how to display the elements; timeline logic configured to:
upon receiving a request to display the timeline with tax account information for an entity:
configure the timeline by consolidating a history of tax account information for the entity in a single display of the timeline, wherein elements in the history are selected based, at least in part, on the parameters; and
dynamically rendering the timeline as one of multiple display zones on a display screen based on the parameters, wherein rendering the timeline includes determining how to display each of the elements on the timeline, and wherein the multiple zones display tax account information about the entity from a tax authority. 9. The computing system of claim 8, wherein the timeline logic is configured to screen elements from being displayed on the timeline based, at least in part, on the parameters and a security level of a user. 10. The computing system of claim 8, wherein the interface logic is configured to generate the interface to expose the parameters that are embedded in logic of the computing system and are protected from being modified without the interface. 11. The computing system of claim 8, wherein the tax information includes collection cases, audit cases, appeal cases, statuses of cases, tax forms, tax form statuses, and payment plan information, tax transactions for the entity, and tax activities for the entity. 12. The computing system of claim 8, wherein the elements include configurable algorithms for customizing display of the tax information on the timeline, and wherein the configurable algorithms each include a plurality of selectable options that are displayed on the interface. 13. The computing system of claim 8, wherein the timeline logic is configured to configure the timeline by consolidating the history of tax account information for a selected time period defined by the parameters. 14. The computing system of claim 8, wherein the parameters include parameters that control which icons are displayed on the timeline and parameters that control which colors displayed on the timeline. 15. A method, comprising:
configuring, by at least a processor, a timeline of tax account information for an entity by consolidating a history of the tax account information for the entity in a display of the timeline, wherein elements in the history are selected based on parameters that have been customized for a revenue authority, wherein the elements include display properties of the timeline and tax account information; and dynamically rendering, by the processor, the timeline as one of multiple display zones on a display screen based, at least in part, on the parameters, wherein rendering the display includes determining how to display each of the elements on the timeline, wherein the processor configures the timeline and dynamically renders the timeline in response to receiving a request to display the timeline about the entity, and wherein the multiple zones display tax account information about the entity from a tax authority. 16. The method of claim 15, further comprising:
prior to configuring the timeline, generating an interface for customizing the timeline, wherein the interface exposes parameters for modifying the elements of the timeline. 17. The method of claim 16, further comprising:
prior to configuring the timeline, receiving input through the interface to modify the parameters, wherein the input includes input that selects which elements to include on the timeline and how to display the elements. 18. The method of claim 16, wherein the interface exposes the parameters that are embedded in logic of the timeline and are protected from being modified without the interface. 19. The method of claim 16, wherein the elements include configurable algorithms for customizing display of the tax information on the timeline. 20. The method of claim 19, wherein the configurable algorithms each include a plurality of selectable options that are displayed on the interface. | Systems, methods, and other embodiments associated with customizing a timeline for displaying account information about an entity are described. In one embodiment, a method includes configuring a timeline of tax account information by consolidating a history of the tax account information in a display of the timeline. Elements in the history are selected based on parameters that have been customized for a revenue authority. The elements include display properties of the timeline and tax account information. The example method may also include dynamically rendering the timeline as one of multiple display zones on a display screen based, at least in part, on the parameters. Rendering the display includes determining how to display each of the elements on the timeline. The processor configures the timeline and dynamically renders the timeline in response to receiving a request to display the timeline about an entity.1. A non-transitory computer-readable medium storing computer-executable instructions that when executed by a computer cause the computer to perform a method, the method comprising:
generating, by a processor in the computer, an interface for generating and customizing a timeline, wherein the interface exposes parameters for modifying elements of the timeline, and wherein the elements include display properties of the timeline; receiving input through the interface to modify the parameters, wherein the input includes input that selects which of the elements to include on the timeline and how to display the elements; upon receiving a request to display the timeline with tax account information for an entity:
configuring the timeline by retrieving and consolidating a history of tax account information for the entity in a single display of the timeline, wherein elements in the history are selected based on the parameters; and
dynamically rendering the timeline as one of multiple display zones on a display screen based on the parameters, wherein rendering the timeline includes determining how to display each of the elements on the timeline based, at least in part, on the parameters, and wherein the multiple zones display tax information about the entity from a tax authority. 2. The non-transitory computer-readable medium of claim 1, further comprising:
screening elements from being displayed on the timeline based, at least in part, on the parameters and a security level of a user. 3. The non-transitory computer-readable medium of claim 1, wherein the interface exposes the parameters that are embedded in logic of the computer and are protected from being modified without the interface. 4. The non-transitory computer-readable medium of claim 1, wherein retrieving the tax information includes retrieving data associated with collection cases, audit cases, appeal cases, statuses of cases, tax forms, tax form statuses, payment plan information, tax transactions for the entity, and tax activities for the entity. 5. The non-transitory computer-readable medium of claim 1, wherein the elements include configurable algorithms for customizing display of the tax information on the timeline, and wherein the configurable algorithms each include a plurality of selectable options that are displayed on the interface. 6. The non-transitory computer-readable medium of claim 1, wherein configuring the timeline by consolidating the history of tax account information includes consolidating the history of tax account information for a selected time period. 7. The non-transitory computer-readable medium of claim 1, wherein the parameters include parameters that control which icons are displayed on the timeline to represent different events in the tax account information and parameters that control which colors are displayed on the timeline. 8. A computing system, comprising:
interface logic configured to generate an interface for customizing a timeline, wherein the interface exposes parameters for modifying elements of the timeline, and wherein the elements include display properties of the timeline and tax account information, wherein the interface logic is configured to receive input through the interface to modify the parameters, wherein the input includes input that selects which elements to include on the timeline and how to display the elements; timeline logic configured to:
upon receiving a request to display the timeline with tax account information for an entity:
configure the timeline by consolidating a history of tax account information for the entity in a single display of the timeline, wherein elements in the history are selected based, at least in part, on the parameters; and
dynamically rendering the timeline as one of multiple display zones on a display screen based on the parameters, wherein rendering the timeline includes determining how to display each of the elements on the timeline, and wherein the multiple zones display tax account information about the entity from a tax authority. 9. The computing system of claim 8, wherein the timeline logic is configured to screen elements from being displayed on the timeline based, at least in part, on the parameters and a security level of a user. 10. The computing system of claim 8, wherein the interface logic is configured to generate the interface to expose the parameters that are embedded in logic of the computing system and are protected from being modified without the interface. 11. The computing system of claim 8, wherein the tax information includes collection cases, audit cases, appeal cases, statuses of cases, tax forms, tax form statuses, and payment plan information, tax transactions for the entity, and tax activities for the entity. 12. The computing system of claim 8, wherein the elements include configurable algorithms for customizing display of the tax information on the timeline, and wherein the configurable algorithms each include a plurality of selectable options that are displayed on the interface. 13. The computing system of claim 8, wherein the timeline logic is configured to configure the timeline by consolidating the history of tax account information for a selected time period defined by the parameters. 14. The computing system of claim 8, wherein the parameters include parameters that control which icons are displayed on the timeline and parameters that control which colors displayed on the timeline. 15. A method, comprising:
configuring, by at least a processor, a timeline of tax account information for an entity by consolidating a history of the tax account information for the entity in a display of the timeline, wherein elements in the history are selected based on parameters that have been customized for a revenue authority, wherein the elements include display properties of the timeline and tax account information; and dynamically rendering, by the processor, the timeline as one of multiple display zones on a display screen based, at least in part, on the parameters, wherein rendering the display includes determining how to display each of the elements on the timeline, wherein the processor configures the timeline and dynamically renders the timeline in response to receiving a request to display the timeline about the entity, and wherein the multiple zones display tax account information about the entity from a tax authority. 16. The method of claim 15, further comprising:
prior to configuring the timeline, generating an interface for customizing the timeline, wherein the interface exposes parameters for modifying the elements of the timeline. 17. The method of claim 16, further comprising:
prior to configuring the timeline, receiving input through the interface to modify the parameters, wherein the input includes input that selects which elements to include on the timeline and how to display the elements. 18. The method of claim 16, wherein the interface exposes the parameters that are embedded in logic of the timeline and are protected from being modified without the interface. 19. The method of claim 16, wherein the elements include configurable algorithms for customizing display of the tax information on the timeline. 20. The method of claim 19, wherein the configurable algorithms each include a plurality of selectable options that are displayed on the interface. | 2,100 |
5,390 | 5,390 | 14,528,276 | 2,139 | To create a backup of a live (running) virtual machine, a backup agent may take a snapshot of the virtual machine, backup the virtual machine from the snapshot disk, and delete the snapshot. Deleting the snapshot initiates a snapshot consolidation process where delta disks of the virtual machine are collapsed. A virtual disk layer sets up a mirror driver between a current virtual disk and a target virtual disk. Data sectors of the delta disk are copied over to the target virtual disk in a single pass, while the mirror driver mirrors write request for the current virtual disk to the target virtual disk. | 1. A method for consolidating snapshots of a virtual machine, comprising:
creating a mirror driver between a current disk handle representing a disk chain comprising a base disk and a delta disk and a target disk handle representing a target disk in the disk chain into which the delta disk is to be consolidated; copying sectors from the delta disk to the target disk in a single iteration while the virtual machine is running; and responsive to receiving a first disk request from the virtual machine to write data to the current disk handle, while the sectors are being copied, replicating the first disk request to create a second disk request to write the data to the target disk handle. 2. The method of claim 1, wherein the target disk is the base disk. 3. The method of claim 1, wherein the target disk is a second delta disk in the disk chain that is a parent of the delta disk to be consolidated. 4. The method of claim 1, further comprising:
responsive to determining that the target disk is a second delta disk in the disk chain, generating the target disk handle comprising a copy-on-write device node representing a subset of the disk chain comprising the base disk and the second delta disk and not the delta disk to be consolidated. 5. The method of claim 1, where the current disk handle comprises a copy-on-write device node representing the disk chain comprising the base disk and the delta disk. 6. The method of claim 1, further comprising:
prior to creating the mirror driver, stunning a virtual disk of the virtual machine comprised of the disk chain. 7. The method of claim 1, further comprising:
responsive to completing the sectors of the delta disk to the target disk, deleting the delta disk to be consolidated in response to completing copying the sectors from the delta disk to the target disk. 8. The method of claim 1, wherein replicating the first disk request to create the second disk request to write the data to the target disk handle further comprises:
executing the first disk request using the current disk handle and the second disk request using the target disk handle. 9. The method of claim 1, wherein copying the sectors from the delta disk to the target disk is performed without creating an additional helper delta disk. 10. A non-transitory computer readable storage medium having stored thereon computer software executable by a processor, the computer software embodying a method for consolidating snapshots of a virtual machine, the method comprising:
creating a mirror driver between a current disk handle representing a disk chain comprising a base disk and a delta disk and a target disk handle representing a target disk in the disk chain into which the delta disk is to be consolidated; copying sectors from the delta disk to the target disk in a single iteration while the virtual machine is running; and responsive to receiving a first disk request from the virtual machine to write data to the current disk handle, while the sectors are being copied, replicating the first disk request to create a second disk request to write the data to the target disk handle. 11. The non-transitory computer readable storage medium of claim 10, wherein the target disk is the base disk. 12. The non-transitory computer readable storage medium of claim 10, wherein the target disk is a second delta disk in the disk chain that is a parent of the delta disk to be consolidated. 13. The non-transitory computer readable storage medium of claim 10, wherein the method further comprises:
responsive to determining that the target disk is a second delta disk in the disk chain, generating the target disk handle comprising a copy-on-write device node representing a subset of the disk chain comprising the base disk and the second delta disk and not the delta disk to be consolidated. 14. The non-transitory computer readable storage medium of claim 10, where the current disk handle comprises a copy-on-write device node representing the disk chain comprising the base disk and the delta disk. 15. The non-transitory computer readable storage medium of claim 10, wherein the method further comprises:
prior to creating the mirror driver, stunning a virtual disk of the virtual machine comprised of the disk chain. 16. The non-transitory computer readable storage medium of claim 10, wherein the method further comprises:
responsive to completing the sectors of the delta disk to the target disk, deleting the delta disk to be consolidated in response to completing copying the sectors from the delta disk to the target disk. 17. The non-transitory computer readable storage medium of claim 10, wherein copying the sectors from the delta disk to the target disk is performed without creating an additional helper delta disk. 18. A computer system for consolidating snapshots of a virtual machine, the computer system comprising:
a storage device storing a disk chain comprising a base disk and a delta disk associated with a virtual machine; a processor programmed to carry out the steps of:
creating a mirror driver between a current disk handle representing the disk chain and a target disk handle representing a target disk in the disk chain into which the delta disk is to be consolidated;
copying sectors from the delta disk to the target disk in a single iteration while the virtual machine is running; and
responsive to receiving a first disk request from the virtual machine to write data to the current disk handle, while the sectors are being copied, replicating the first disk request to create a second disk request to write the data to the target disk handle. 19. The computer system of claim 18, wherein the processor is further programmed to carry out the steps of:
prior to creating the mirror driver, stunning a virtual disk of the virtual machine comprised of the disk chain; and responsive to determining that the target disk is a second delta disk in the disk chain, generating the target disk handle comprising a copy-on-write device node representing a subset of the disk chain comprising the base disk and the second delta disk and not the delta disk to be consolidated. 20. The computer system of claim 18, wherein copying the sectors from the delta disk to the target disk is performed without creating an additional helper delta disk. | To create a backup of a live (running) virtual machine, a backup agent may take a snapshot of the virtual machine, backup the virtual machine from the snapshot disk, and delete the snapshot. Deleting the snapshot initiates a snapshot consolidation process where delta disks of the virtual machine are collapsed. A virtual disk layer sets up a mirror driver between a current virtual disk and a target virtual disk. Data sectors of the delta disk are copied over to the target virtual disk in a single pass, while the mirror driver mirrors write request for the current virtual disk to the target virtual disk.1. A method for consolidating snapshots of a virtual machine, comprising:
creating a mirror driver between a current disk handle representing a disk chain comprising a base disk and a delta disk and a target disk handle representing a target disk in the disk chain into which the delta disk is to be consolidated; copying sectors from the delta disk to the target disk in a single iteration while the virtual machine is running; and responsive to receiving a first disk request from the virtual machine to write data to the current disk handle, while the sectors are being copied, replicating the first disk request to create a second disk request to write the data to the target disk handle. 2. The method of claim 1, wherein the target disk is the base disk. 3. The method of claim 1, wherein the target disk is a second delta disk in the disk chain that is a parent of the delta disk to be consolidated. 4. The method of claim 1, further comprising:
responsive to determining that the target disk is a second delta disk in the disk chain, generating the target disk handle comprising a copy-on-write device node representing a subset of the disk chain comprising the base disk and the second delta disk and not the delta disk to be consolidated. 5. The method of claim 1, where the current disk handle comprises a copy-on-write device node representing the disk chain comprising the base disk and the delta disk. 6. The method of claim 1, further comprising:
prior to creating the mirror driver, stunning a virtual disk of the virtual machine comprised of the disk chain. 7. The method of claim 1, further comprising:
responsive to completing the sectors of the delta disk to the target disk, deleting the delta disk to be consolidated in response to completing copying the sectors from the delta disk to the target disk. 8. The method of claim 1, wherein replicating the first disk request to create the second disk request to write the data to the target disk handle further comprises:
executing the first disk request using the current disk handle and the second disk request using the target disk handle. 9. The method of claim 1, wherein copying the sectors from the delta disk to the target disk is performed without creating an additional helper delta disk. 10. A non-transitory computer readable storage medium having stored thereon computer software executable by a processor, the computer software embodying a method for consolidating snapshots of a virtual machine, the method comprising:
creating a mirror driver between a current disk handle representing a disk chain comprising a base disk and a delta disk and a target disk handle representing a target disk in the disk chain into which the delta disk is to be consolidated; copying sectors from the delta disk to the target disk in a single iteration while the virtual machine is running; and responsive to receiving a first disk request from the virtual machine to write data to the current disk handle, while the sectors are being copied, replicating the first disk request to create a second disk request to write the data to the target disk handle. 11. The non-transitory computer readable storage medium of claim 10, wherein the target disk is the base disk. 12. The non-transitory computer readable storage medium of claim 10, wherein the target disk is a second delta disk in the disk chain that is a parent of the delta disk to be consolidated. 13. The non-transitory computer readable storage medium of claim 10, wherein the method further comprises:
responsive to determining that the target disk is a second delta disk in the disk chain, generating the target disk handle comprising a copy-on-write device node representing a subset of the disk chain comprising the base disk and the second delta disk and not the delta disk to be consolidated. 14. The non-transitory computer readable storage medium of claim 10, where the current disk handle comprises a copy-on-write device node representing the disk chain comprising the base disk and the delta disk. 15. The non-transitory computer readable storage medium of claim 10, wherein the method further comprises:
prior to creating the mirror driver, stunning a virtual disk of the virtual machine comprised of the disk chain. 16. The non-transitory computer readable storage medium of claim 10, wherein the method further comprises:
responsive to completing the sectors of the delta disk to the target disk, deleting the delta disk to be consolidated in response to completing copying the sectors from the delta disk to the target disk. 17. The non-transitory computer readable storage medium of claim 10, wherein copying the sectors from the delta disk to the target disk is performed without creating an additional helper delta disk. 18. A computer system for consolidating snapshots of a virtual machine, the computer system comprising:
a storage device storing a disk chain comprising a base disk and a delta disk associated with a virtual machine; a processor programmed to carry out the steps of:
creating a mirror driver between a current disk handle representing the disk chain and a target disk handle representing a target disk in the disk chain into which the delta disk is to be consolidated;
copying sectors from the delta disk to the target disk in a single iteration while the virtual machine is running; and
responsive to receiving a first disk request from the virtual machine to write data to the current disk handle, while the sectors are being copied, replicating the first disk request to create a second disk request to write the data to the target disk handle. 19. The computer system of claim 18, wherein the processor is further programmed to carry out the steps of:
prior to creating the mirror driver, stunning a virtual disk of the virtual machine comprised of the disk chain; and responsive to determining that the target disk is a second delta disk in the disk chain, generating the target disk handle comprising a copy-on-write device node representing a subset of the disk chain comprising the base disk and the second delta disk and not the delta disk to be consolidated. 20. The computer system of claim 18, wherein copying the sectors from the delta disk to the target disk is performed without creating an additional helper delta disk. | 2,100 |
5,391 | 5,391 | 14,992,252 | 2,193 | Techniques for modifying an application are described herein. In some examples, a method includes generating, via a processor, a representation of an application and detecting a flow of data in the representation of the application based on static analysis. The method can also include detecting a predetermined property to be verified, the predetermined property comprising a source point in the representation of the application and a sink point in the representation of the application. In addition, the method can include detecting that the flow of data violates the predetermined property. Furthermore, the method can include selecting a set of changes to the representation of the application that prevents the violation of the predetermined property and modifying the application based on the selected set of changes. | 1. A system for modifying an application comprising:
a processor, programmed with instructions, to: generate a representation of an application; detect a flow of data in the representation of the application based on static analysis; detect a predetermined property to be verified, the predetermined property comprising a source point in the representation of the application and a sink point in the representation of the application; detect that the flow of data violates the predetermined property; select a set of changes to the representation of the application that prevents the violation of the predetermined property, the set of changes to the representation of the application being selected from a plurality of sets of changes to the representation of the application based upon the set of changes that prevents violation of the predetermined property with a lowest number of modifications to the representation of the application; and modify the application based on the selected set of changes. 2. The system of claim 1, wherein the representation of the application is an interprocedural call graph. 3. The system of claim 1, wherein the static analysis comprises data slicing. 4. The system of claim 1, wherein the static analysis comprises taint analysis. 5. The system of claim 1, wherein the processor is to select the set of changes from a list of potential sets of changes that prevent the violation of the predetermined property. 6. The system of claim 1, wherein the processor is to generate a set of warnings based on a comparison of the application and the modified application. 7. The system of claim 6, wherein the set of warnings indicate a break line between the source point and the sink point. 8. The system of claim 1, wherein the modification to the application comprises removing a function call to prevent the flow of data from reaching the sink point. 9. (canceled) 10. A method for modifying an application comprising:
generating, via a processor, a representation of an application; detecting, via the processor, a flow of data in the representation of the application based on static analysis; detecting, via the processor, a predetermined property to be verified, the predetermined property comprising a source point in the representation of the application and a sink point in the representation of the application; detecting, via the processor, that the flow of data violates the predetermined property; selecting, via the processor, a set of changes to the representation of the application that prevents the violation of the predetermined property, the set of changes to the representation of the application being selected from a plurality of sets of changes to the representation of the application based upon the set of changes that prevents violation of the predetermined property with a lowest number of modifications to the representation of the application; and modifying, via the processor, the application based on the selected set of changes. 11. The method of claim 10, wherein the representation of the application is an interprocedural call graph. 12. The method of claim 10, wherein the static analysis comprises data slicing. 13. The method of claim 10, wherein the static analysis comprises taint analysis. 14. (canceled) 15. The method of claim 10, comprising generating a set of warnings based on a comparison of the application and the modified application. 16. The method of claim 15, wherein the set of warnings indicate a break line between the source point and the sink point. 17. A computer program product for modifying an application, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, wherein the computer readable storage medium is not a transitory signal per se, the program instructions executable by a processor to cause the processor to:
generate, via the processor, a representation of an application; detect, via the processor, a flow of data in the representation of the application based on static analysis; detect, via the processor, a predetermined property to be verified, the predetermined property comprising a source point in the representation of the application and a sink point in the representation of the application; detect, via the processor, that the flow of data violates the predetermined property; select, via the processor, a set of changes to the representation of the application that prevents the violation of the predetermined property, the set of changes to the representation of the application being selected from a plurality of sets of changes to the representation of the application based upon the set of changes that prevents violation of the predetermined property with a lowest number of modifications to the representation of the application; and modify, via the processor, the application based on the selected set of changes. 18. The computer program product of claim 17, wherein the representation of the application is an interprocedural call graph. 19. The computer program product of claim 17, wherein the static analysis comprises data slicing. 20. The computer program product of claim 17, wherein the static analysis comprises taint analysis. | Techniques for modifying an application are described herein. In some examples, a method includes generating, via a processor, a representation of an application and detecting a flow of data in the representation of the application based on static analysis. The method can also include detecting a predetermined property to be verified, the predetermined property comprising a source point in the representation of the application and a sink point in the representation of the application. In addition, the method can include detecting that the flow of data violates the predetermined property. Furthermore, the method can include selecting a set of changes to the representation of the application that prevents the violation of the predetermined property and modifying the application based on the selected set of changes.1. A system for modifying an application comprising:
a processor, programmed with instructions, to: generate a representation of an application; detect a flow of data in the representation of the application based on static analysis; detect a predetermined property to be verified, the predetermined property comprising a source point in the representation of the application and a sink point in the representation of the application; detect that the flow of data violates the predetermined property; select a set of changes to the representation of the application that prevents the violation of the predetermined property, the set of changes to the representation of the application being selected from a plurality of sets of changes to the representation of the application based upon the set of changes that prevents violation of the predetermined property with a lowest number of modifications to the representation of the application; and modify the application based on the selected set of changes. 2. The system of claim 1, wherein the representation of the application is an interprocedural call graph. 3. The system of claim 1, wherein the static analysis comprises data slicing. 4. The system of claim 1, wherein the static analysis comprises taint analysis. 5. The system of claim 1, wherein the processor is to select the set of changes from a list of potential sets of changes that prevent the violation of the predetermined property. 6. The system of claim 1, wherein the processor is to generate a set of warnings based on a comparison of the application and the modified application. 7. The system of claim 6, wherein the set of warnings indicate a break line between the source point and the sink point. 8. The system of claim 1, wherein the modification to the application comprises removing a function call to prevent the flow of data from reaching the sink point. 9. (canceled) 10. A method for modifying an application comprising:
generating, via a processor, a representation of an application; detecting, via the processor, a flow of data in the representation of the application based on static analysis; detecting, via the processor, a predetermined property to be verified, the predetermined property comprising a source point in the representation of the application and a sink point in the representation of the application; detecting, via the processor, that the flow of data violates the predetermined property; selecting, via the processor, a set of changes to the representation of the application that prevents the violation of the predetermined property, the set of changes to the representation of the application being selected from a plurality of sets of changes to the representation of the application based upon the set of changes that prevents violation of the predetermined property with a lowest number of modifications to the representation of the application; and modifying, via the processor, the application based on the selected set of changes. 11. The method of claim 10, wherein the representation of the application is an interprocedural call graph. 12. The method of claim 10, wherein the static analysis comprises data slicing. 13. The method of claim 10, wherein the static analysis comprises taint analysis. 14. (canceled) 15. The method of claim 10, comprising generating a set of warnings based on a comparison of the application and the modified application. 16. The method of claim 15, wherein the set of warnings indicate a break line between the source point and the sink point. 17. A computer program product for modifying an application, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, wherein the computer readable storage medium is not a transitory signal per se, the program instructions executable by a processor to cause the processor to:
generate, via the processor, a representation of an application; detect, via the processor, a flow of data in the representation of the application based on static analysis; detect, via the processor, a predetermined property to be verified, the predetermined property comprising a source point in the representation of the application and a sink point in the representation of the application; detect, via the processor, that the flow of data violates the predetermined property; select, via the processor, a set of changes to the representation of the application that prevents the violation of the predetermined property, the set of changes to the representation of the application being selected from a plurality of sets of changes to the representation of the application based upon the set of changes that prevents violation of the predetermined property with a lowest number of modifications to the representation of the application; and modify, via the processor, the application based on the selected set of changes. 18. The computer program product of claim 17, wherein the representation of the application is an interprocedural call graph. 19. The computer program product of claim 17, wherein the static analysis comprises data slicing. 20. The computer program product of claim 17, wherein the static analysis comprises taint analysis. | 2,100 |
5,392 | 5,392 | 15,399,913 | 2,191 | A system for a vehicle includes a controller, and a telematics control unit configured to, in response to receiving instructions indicating transfer and installation techniques supported by the controller to update the controller with a software update, transfer the software update to the controller responsive to vehicle state being compatible with the transfer technique, and install the software update to the controller responsive to vehicle state being compatible with the installation technique. | 1. A system for a vehicle comprising:
a controller; and a telematics control unit configured to, in response to receiving instructions that indicate transfer and installation techniques supported by the controller to update the controller with a software update, transfer the software update to the controller responsive to vehicle state being compatible with the transfer technique, and install the software update to the controller responsive to vehicle state being compatible with the installation technique. 2. The system of claim 1, wherein the transfer technique includes one of erase replace, erase replace with external storage, or AB swap. 3. The system of claim 1, wherein the transfer technique is based on a hardware configuration of the controller. 4. The system of claim 1, wherein the transfer and installation of the software updates is further in response to detecting a vehicle state change. 5. The system of claim 1, wherein the vehicle state is defined by an operating parameter associated with one of an ignition, a transmission gear, a brake pedal, an accelerator pedal, or wheels of the vehicle. 6. The system of claim 1, wherein the vehicle state compatible with the transfer technique and the vehicle state compatible with the installation technique are different. 7. The system of claim 1, further comprising a second controller, wherein the telematics control unit is further configured to, in response to receiving the instructions, transfer the software updates to the first and second controllers in response to vehicle state being compatible with the transfer techniques supported by the first and second controllers. 8. The system of claim 7, wherein the telematics control unit is further configured to install the software updates to the second controller in response to detecting a vehicle state change. 9. A method for a vehicle comprising:
in response to receiving, by a telematics control unit, instructions indicating transfer and installation techniques supported by a controller to update the controller with a software update, transferring the software update to the controller responsive to vehicle state being compatible with the transfer technique, and installing the software update to the controller responsive to vehicle state being compatible with the installation technique. 10. The method of claim 9, wherein the transfer technique includes one of erase replace, erase replace with external storage, or AB swap. 11. The method of claim 9, wherein the transfer technique is based on a hardware configuration of the controller. 12. The method of claim 9, wherein the transferring and installing of the software updates is further in response to detecting a vehicle state change. 13. The method of claim 9, wherein the vehicle state is defined by an operating parameter associated with one of an ignition, a transmission gear, a brake pedal, an accelerator pedal, or wheels of the vehicle. 14. The method of claim 9, wherein the vehicle state compatible with the transfer technique and the vehicle state compatible with the installation technique are different vehicle states. 15. The method of claim 9, further comprising, in response to receiving the instructions to update a pair of controllers, transferring the software updates to both controllers prior to vehicle state change and in response to current vehicle state being compatible with the transfer techniques supported by each of the controllers. 16. The method of claim 15, further comprising installing the software updates to one of the pair of controllers in response to detecting a vehicle state change. 17. A method comprising:
receiving instructions to update first and second controllers, the instructions indicating different transfer and installation techniques supported by the respective controllers; transferring a first software update to the first controller responsive to vehicle state being compatible with a first transfer technique; transferring a second software update to the second controller responsive to vehicle state being compatible with a second transfer technique; and installing the first software update to the first controller and the second software update to the second controller responsive to vehicle state being compatible with the installation techniques for both the first and second controllers. 18. The method of claim 17, wherein the transfer techniques include one of erase replace, erase replace with external storage, or AB swap. 19. The method of claim 17, wherein the transfer and installation techniques are based on hardware configurations of each of the controllers. 20. The method of claim 17, wherein the installing of the software updates is in response to detecting a vehicle state change. | A system for a vehicle includes a controller, and a telematics control unit configured to, in response to receiving instructions indicating transfer and installation techniques supported by the controller to update the controller with a software update, transfer the software update to the controller responsive to vehicle state being compatible with the transfer technique, and install the software update to the controller responsive to vehicle state being compatible with the installation technique.1. A system for a vehicle comprising:
a controller; and a telematics control unit configured to, in response to receiving instructions that indicate transfer and installation techniques supported by the controller to update the controller with a software update, transfer the software update to the controller responsive to vehicle state being compatible with the transfer technique, and install the software update to the controller responsive to vehicle state being compatible with the installation technique. 2. The system of claim 1, wherein the transfer technique includes one of erase replace, erase replace with external storage, or AB swap. 3. The system of claim 1, wherein the transfer technique is based on a hardware configuration of the controller. 4. The system of claim 1, wherein the transfer and installation of the software updates is further in response to detecting a vehicle state change. 5. The system of claim 1, wherein the vehicle state is defined by an operating parameter associated with one of an ignition, a transmission gear, a brake pedal, an accelerator pedal, or wheels of the vehicle. 6. The system of claim 1, wherein the vehicle state compatible with the transfer technique and the vehicle state compatible with the installation technique are different. 7. The system of claim 1, further comprising a second controller, wherein the telematics control unit is further configured to, in response to receiving the instructions, transfer the software updates to the first and second controllers in response to vehicle state being compatible with the transfer techniques supported by the first and second controllers. 8. The system of claim 7, wherein the telematics control unit is further configured to install the software updates to the second controller in response to detecting a vehicle state change. 9. A method for a vehicle comprising:
in response to receiving, by a telematics control unit, instructions indicating transfer and installation techniques supported by a controller to update the controller with a software update, transferring the software update to the controller responsive to vehicle state being compatible with the transfer technique, and installing the software update to the controller responsive to vehicle state being compatible with the installation technique. 10. The method of claim 9, wherein the transfer technique includes one of erase replace, erase replace with external storage, or AB swap. 11. The method of claim 9, wherein the transfer technique is based on a hardware configuration of the controller. 12. The method of claim 9, wherein the transferring and installing of the software updates is further in response to detecting a vehicle state change. 13. The method of claim 9, wherein the vehicle state is defined by an operating parameter associated with one of an ignition, a transmission gear, a brake pedal, an accelerator pedal, or wheels of the vehicle. 14. The method of claim 9, wherein the vehicle state compatible with the transfer technique and the vehicle state compatible with the installation technique are different vehicle states. 15. The method of claim 9, further comprising, in response to receiving the instructions to update a pair of controllers, transferring the software updates to both controllers prior to vehicle state change and in response to current vehicle state being compatible with the transfer techniques supported by each of the controllers. 16. The method of claim 15, further comprising installing the software updates to one of the pair of controllers in response to detecting a vehicle state change. 17. A method comprising:
receiving instructions to update first and second controllers, the instructions indicating different transfer and installation techniques supported by the respective controllers; transferring a first software update to the first controller responsive to vehicle state being compatible with a first transfer technique; transferring a second software update to the second controller responsive to vehicle state being compatible with a second transfer technique; and installing the first software update to the first controller and the second software update to the second controller responsive to vehicle state being compatible with the installation techniques for both the first and second controllers. 18. The method of claim 17, wherein the transfer techniques include one of erase replace, erase replace with external storage, or AB swap. 19. The method of claim 17, wherein the transfer and installation techniques are based on hardware configurations of each of the controllers. 20. The method of claim 17, wherein the installing of the software updates is in response to detecting a vehicle state change. | 2,100 |
5,393 | 5,393 | 14,754,496 | 2,176 | A facility for authoring a document is described. The facility receives first user input that identifies content to be included in the document. The identified content is in a first form. The facility also receives second user input that specifies a transformation operation to be performed on the identified content in order to transform the identified content from the first form into a second form. The facility applies the specified transformation operation to transform the identified content from the first form into the second form for display. | 1. A computing system for authoring a document, comprising:
a user input subsystem configured to (1) receive first user input identifying content to be included in the document, the identified content being in a first form, and (2) receive second user input specifying a transformation operation to be performed on the identified content in order to transform the identified content from the first form into a second form; and a materialization subsystem configured to apply the specified transformation operation to transform the identified content from the first form into the second form for display. 2. The computing system of claim 1 wherein the first user input received by the user input subsystem identifies a data structure external to the document from which the identified content is available for retrieval. 3. The computing system of claim 1 wherein the first user input received by the user input subsystem literally conveys the identified content. 4. The computing system of claim 1 wherein the user input subsystem is configured to receive second user input specifying a plurality of transformation operations to be performed on the identified content. 5. The computing system of claim 4 wherein the user input subsystem is configured to receive third user input specifying an order among the plurality of transformation operations in which the plurality of transformation operations is to be performed. 6. The computing system of claim 4, further comprising a precedence inference subsystem configured to infer an order among the plurality of transformation operations in which the plurality of transformation operations is to be performed. 7. The computing system of claim 1 wherein the user input subsystem is configured to receive the second user input relative to a displayed literal representation of the content identified by the first user input received by the user input subsystem. 8. The computing system of claim 1 wherein the user input subsystem is configured to receive the second user input relative to a displayed structural representation of the content identified by the first user input received by the user input subsystem. 9. The computing system of claim 1 wherein the user input subsystem is further configured to receive third user input specifying at least one edit to the identified content in the second form,
the computer system further comprising:
a revision subsystem configured to edit the identified content in the second form for display in accordance with the at least one edit specified by the third user input received by the user input subsystem. 10. The computing system of claim 9, further comprising:
a storage subsystem causing the identified content as edited by the revision subsystem to be stored in the first form. 11. A computer-readable medium having contents configured to cause a computing system to, in order to materialize a document:
retrieve information specifying contents of the document, the retrieved information including a transformation specification, the transformation specification both (1) identifying content within the document that is to be the subject of a transformation operation and (2) specifying a transformation operation that is to be performed upon the identified content; cause the transformation operation specified by the transformation specification to be applied to the content identified by the transformation specification in order to transform the content identified by the transformation specification; and cause to be displayed contents of the document including the content identified by the transformation specification as transformed by the transformation operation specified by the transformation specification. 12. The computer-readable medium of claim 11 having contents further configured to cause the computing system to cause to be displayed in connection with the content identified by the transformation specification as transformed by the transformation operation specified by the transformation specification an indication of the transformation operation. 13. The computer-readable medium of claim 12 having contents further configured to cause the computing system to, in response to a user interaction with the displayed indication of the transformation operation, removing the transformation specification from the information specifying contents of the document. 14. The computer-readable medium of claim 12 having contents further configured to cause the computing system to, in response to a user interaction with the displayed indication of the transformation operation, altering the transformation specification to specify a different transformation operation. 15. A computer-readable medium storing a document data structure representing a document, the data structure comprising:
first information specifying native content of the document; and second information constituting a content incorporation reference specifying incorporation into the document of content stored separately from the document, the second information comprising:
a reference usable to retrieve the content stored separately from the document, and
third information specifying at least one transformation function to be performed on the content stored separately from the document as part of its incorporation into the document,
such that the contents of the data structure are usable to materialize the document to contain both the native content of the document and the content stored separately from the document as transformed by the at least one transformation function. 16. The computer-readable medium of claim 15 wherein the reference among the second information is a document fragment identifier usable to retrieve the content stored separately from the document from a geographically-distributed online service. 17. The computer-readable medium of claim 16 wherein the data structure is a document fragment that can be retrieved from the online service using a document fragment identifier different from the document fragment identifier among the second information. 18. The computer-readable medium of claim 15 wherein the third information specifies a plurality of transformation functions, and wherein the third information further indicates a human-specified order among the plurality of transformation functions. 19. The computer-readable medium of claim 15 wherein the third information specifies a plurality of transformation functions, and wherein the third information further indicates an automatically-inferred order among the plurality of transformation functions. 20. The computer-readable medium of claim 15 wherein the third information specifies a transformation function selected from among a data charting transformation function, a natural language summarization transformation function, and a natural language translation transformation function. | A facility for authoring a document is described. The facility receives first user input that identifies content to be included in the document. The identified content is in a first form. The facility also receives second user input that specifies a transformation operation to be performed on the identified content in order to transform the identified content from the first form into a second form. The facility applies the specified transformation operation to transform the identified content from the first form into the second form for display.1. A computing system for authoring a document, comprising:
a user input subsystem configured to (1) receive first user input identifying content to be included in the document, the identified content being in a first form, and (2) receive second user input specifying a transformation operation to be performed on the identified content in order to transform the identified content from the first form into a second form; and a materialization subsystem configured to apply the specified transformation operation to transform the identified content from the first form into the second form for display. 2. The computing system of claim 1 wherein the first user input received by the user input subsystem identifies a data structure external to the document from which the identified content is available for retrieval. 3. The computing system of claim 1 wherein the first user input received by the user input subsystem literally conveys the identified content. 4. The computing system of claim 1 wherein the user input subsystem is configured to receive second user input specifying a plurality of transformation operations to be performed on the identified content. 5. The computing system of claim 4 wherein the user input subsystem is configured to receive third user input specifying an order among the plurality of transformation operations in which the plurality of transformation operations is to be performed. 6. The computing system of claim 4, further comprising a precedence inference subsystem configured to infer an order among the plurality of transformation operations in which the plurality of transformation operations is to be performed. 7. The computing system of claim 1 wherein the user input subsystem is configured to receive the second user input relative to a displayed literal representation of the content identified by the first user input received by the user input subsystem. 8. The computing system of claim 1 wherein the user input subsystem is configured to receive the second user input relative to a displayed structural representation of the content identified by the first user input received by the user input subsystem. 9. The computing system of claim 1 wherein the user input subsystem is further configured to receive third user input specifying at least one edit to the identified content in the second form,
the computer system further comprising:
a revision subsystem configured to edit the identified content in the second form for display in accordance with the at least one edit specified by the third user input received by the user input subsystem. 10. The computing system of claim 9, further comprising:
a storage subsystem causing the identified content as edited by the revision subsystem to be stored in the first form. 11. A computer-readable medium having contents configured to cause a computing system to, in order to materialize a document:
retrieve information specifying contents of the document, the retrieved information including a transformation specification, the transformation specification both (1) identifying content within the document that is to be the subject of a transformation operation and (2) specifying a transformation operation that is to be performed upon the identified content; cause the transformation operation specified by the transformation specification to be applied to the content identified by the transformation specification in order to transform the content identified by the transformation specification; and cause to be displayed contents of the document including the content identified by the transformation specification as transformed by the transformation operation specified by the transformation specification. 12. The computer-readable medium of claim 11 having contents further configured to cause the computing system to cause to be displayed in connection with the content identified by the transformation specification as transformed by the transformation operation specified by the transformation specification an indication of the transformation operation. 13. The computer-readable medium of claim 12 having contents further configured to cause the computing system to, in response to a user interaction with the displayed indication of the transformation operation, removing the transformation specification from the information specifying contents of the document. 14. The computer-readable medium of claim 12 having contents further configured to cause the computing system to, in response to a user interaction with the displayed indication of the transformation operation, altering the transformation specification to specify a different transformation operation. 15. A computer-readable medium storing a document data structure representing a document, the data structure comprising:
first information specifying native content of the document; and second information constituting a content incorporation reference specifying incorporation into the document of content stored separately from the document, the second information comprising:
a reference usable to retrieve the content stored separately from the document, and
third information specifying at least one transformation function to be performed on the content stored separately from the document as part of its incorporation into the document,
such that the contents of the data structure are usable to materialize the document to contain both the native content of the document and the content stored separately from the document as transformed by the at least one transformation function. 16. The computer-readable medium of claim 15 wherein the reference among the second information is a document fragment identifier usable to retrieve the content stored separately from the document from a geographically-distributed online service. 17. The computer-readable medium of claim 16 wherein the data structure is a document fragment that can be retrieved from the online service using a document fragment identifier different from the document fragment identifier among the second information. 18. The computer-readable medium of claim 15 wherein the third information specifies a plurality of transformation functions, and wherein the third information further indicates a human-specified order among the plurality of transformation functions. 19. The computer-readable medium of claim 15 wherein the third information specifies a plurality of transformation functions, and wherein the third information further indicates an automatically-inferred order among the plurality of transformation functions. 20. The computer-readable medium of claim 15 wherein the third information specifies a transformation function selected from among a data charting transformation function, a natural language summarization transformation function, and a natural language translation transformation function. | 2,100 |
5,394 | 5,394 | 15,849,870 | 2,182 | A computing device computes a plurality of quantile regression solvers for a dataset at a plurality of quantile levels. Each observation vector includes an explanatory vector of a plurality of explanatory variable values and a response variable value. The read dataset is recursively divided into subsets of the plurality of observation vectors, a lower counterweight vector and an upper counterweight vector are computed for each of the subsets, and a quantile regression solver is fit to each of the subsets using the associated, computed lower counterweight vector and the associated, computed upper counterweight vector to describe a quantile function of the response variable values for a selected quantile level of the identified plurality of quantile level values. For each selected quantile level, a parameter estimate vector and a dual solution vector that describe the quantile function are output in association with the selected quantile level. | 1. A non-transitory computer-readable medium having stored thereon computer-readable instructions that when executed by a computing device cause the computing device to:
read a dataset that includes a plurality of observation vectors, wherein each observation vector includes an explanatory vector of a plurality of explanatory variable values and a response variable value; identify a plurality of quantile level values; recursively divide the read dataset into subsets of the plurality of observation vectors, compute a lower counterweight vector and an upper counterweight vector for each of the subsets, and fit a quantile regression solver to each of the subsets using the associated, computed lower counterweight vector and the associated, computed upper counterweight vector to describe a quantile function for the response variable values for a selected quantile level of the identified plurality of quantile level values; and for each selected quantile level, output a parameter estimate vector and a dual solution vector that describe the quantile function in association with the selected quantile level for use in predicting a new quantile value of a response variable for a new explanatory vector not read from the dataset. 2. The non-transitory computer-readable medium of claim 1, wherein the quantile regression solver is selected from the group consisting of a simplex algorithm, an interior-point algorithm, a smoothing algorithm, a randomized algorithm, a majorization-minimization algorithm. 3. The non-transitory computer-readable medium of claim 1, wherein the plurality of quantile level values is a list of quantile level values. 4. The non-transitory computer-readable medium of claim 3, wherein the list of quantile level values is received as a user input through a user interface. 5. The non-transitory computer-readable medium of claim 1, wherein the plurality of quantile level values is computed from a resolution level received as a user input through a user interface. 6. The non-transitory computer-readable medium of claim 1, wherein the lower counterweight vector is computed using (yL,xL)=Σj∈L(yj,xj), where L is a lower subset defined by assigning the plurality of observation vectors into the lower subset based on yj<x1β(τ) where yj is the response variable value of the associated observation vector, xj is the explanatory vector of the associated observation vector, and β(τ) is the parameter estimate vector. 7. The non-transitory computer-readable medium of claim 6, wherein the upper counterweight vector is computed using (yU,xU)=Σj∈U(yj,xj), where U is an upper subset assigned based on yj>xjβ(τ). 8. The non-transitory computer-readable medium of claim 7, wherein D={j:j∉L and j∉U for j=1, . . . , n} is a next subset of the recursive fit, where n is a number of observation vectors included in the read dataset. 9. The non-transitory computer-readable medium of claim 1, wherein the quantile regression solver is fit using maximize Σj∈Dajyj subject to Σj∈Dajxj=(1−τ)(xL+Σj∈Dxj)−τxU 0≤aj≤1 for j∈D, where aj is the dual solution vector of the associated observation vector of the subset of observation vectors D, yj is the response variable value of the associated observation vector of the subset, xj is the explanatory vector of the associated observation vector of the subset, and τ is the selected quantile level, based on âj=1 for the subset of observation vectors that satisfy yj>xj{circumflex over (β)}(τ), âj=0 the subset of observation vectors that satisfy yj<xj{circumflex over (β)}(τ), and 0≤âj≤1 for the subset of observation vectors that satisfy yj=xj{circumflex over (β)}(τ), where β(τ) is the parameter estimate vector of the associated observation vector of the subset, where {âj:j∈D} denote the fit {aj:j∈D}. 10. The non-transitory computer-readable medium of claim 1, wherein recursively dividing, computing, and fitting the quantile regression solver comprise computer-readable instructions that cause the computing device to:
define the read dataset as a set of observation vectors D1; initialize a first counter value i, a second counter value t, the upper counterweight vector (y1 U,x1 U), the lower counterweight vector (y1 L,x1 L), a minimum quantile level value τ1 L, and a maximum quantile level value τ1 U; define a set of quantile level values G1 as the identified plurality of quantile level values; (a) select a quantile level value τi* from Gi that has a closest quantile level value to (τi L+τi U)/2; (b) fit the quantile regression solver to the set of observation vectors Di, the lower counterweight vector, and the upper counterweight vector to describe the quantile function of the response variable at the selected quantile level value τi*, (c) output the parameter estimate vector and the dual solution vector that describe the quantile function in association with the selected quantile level value τi*, (d) partition Gi into a lower sub grid G2i that includes zero or more quantile level values that are strictly less than τi* and an upper sub grid G2i+1 that includes zero or more quantile level values that are strictly greater than τi U; (e) update τ2i L=τi L, τ2i U=τ2i+1 L=τi*, and τ2i+1 U=τi U; (f) assign observation vectors of Di into D2i={j:âji<1,j∈Di} and D2i+1={j:âji>0,j∈Di}, where âji is the dual solution vector for a respective observation vector; (g) compute (y2i L,x2i L)=(yi L,xi L), (y2i U,x2i U)=(yi U,xi U)+Σ{j:â jt =1,j∈D i }(yj,xj), (y2i+1 L,x2i+1 L)=(yi L,xi L)+Σ{j:â jt =1,j∈D i }(yj,xj), and (y2i+1 U,x2i+1 U)=(yi U,xi U); (h) increment the first counter value i; (i) when Gi is an empty set, repeat (h) to (i); and (j) when Gi is not an empty set, increment the second counter value t, and repeat (a) to (j) until t=q, where q is a number of quantile level values included in the identified plurality of quantile level values. 11. The non-transitory computer-readable medium of claim 1, wherein the quantile regression solver is fit using a plurality of computing devices recursively. 12. The non-transitory computer-readable medium of claim 11, wherein recursively dividing, computing, and fitting comprises computer-readable instructions that cause the computing device to:
define the read dataset as a set of observation vectors D; define a set of quantile level values G as the identified plurality of quantile level values; identify a set of computing devices to C={c1, c2, . . . , cw}, where w is a number of computing devices; initialize the upper counterweight vector (yU,xU), the lower counterweight vector (yL,xL), a minimum quantile level value τL, and a maximum quantile level value τU, and call a regression fit function with D, G, C, {(yj,xj):j∈D}, (yL,xL), (yU,xU), τL, and τU. 13. The non-transitory computer-readable medium of claim 12, wherein the regression fit function comprises computer-readable instructions that cause the computing device to:
initialize Dc, Gc, Cc, {(yj,xj):j∈Dc}, (yc L,xc L), (yc U,xc U), τc L, and τc U from the calling parameters; select the quantile level value τc* from Gc that has a closest quantile level value to (τc L+τc U)/2; fit the quantile regression solver to the set of observation vectors {(yj,xj):j∈Dc}, the lower counterweight vector (yc L,xc L), and the upper counterweight vector (yc U,xc U) to describe the quantile function of the response variable at the selected quantile level value τc*, output the parameter estimate vector {circumflex over (β)}(τc*) and the dual solution vector {aj:j∈Dc} that describe the quantile function of the response variable in association with τc*, partition Gc into a lower sub grid G1 that includes zero or more quantile level values that are strictly less than τc* and an upper sub grid G2 that includes zero or more quantile level values that are strictly greater than τc*, update τ1 L=τc L, τ1 U=τ2 L=τc*, and τ2 U=τc U; assign observation vectors of Dc into D1={j∈Dc:âj<1} and D2={j∈Dc:âj>0}, where âj is an element of the dual solution vector for a respective observation vector; partition Cc into a first set of computing devices C1 and a second set of computing device C2; compute (y1 L,x1 L)=(yc L,xc L), (y1 U,x1 U)=(yc U,xc U)+Σ{j∈D c :â j =1}(yj,xj), (y2 L,x2 L)=(yc L,xc L)+Σ{j∈D c :â j =1}(yj,xj), and (y2 U,x2 U)=(yc U,xc U); when G1 is not an empty set, recursively call the regression fit function with D1, G1, C1, {(yj,xj):j∈D1}, (y1 L,x1 L), (y1 U,x1 U), τ1 L, and τ1 U; when G2 is not an empty set, recursively call the regression fit function with D2, G2, C2, {(yj,xj):j∈D2}, (y2 L,x2 L), (y2 U,x2 U), τ2 L, and τ2 U; and return control to the calling function. 14. A computing device comprising:
a processor; and a non-transitory computer-readable medium operably coupled to the processor, the computer-readable medium having computer-readable instructions stored thereon that, when executed by the processor, cause the computing device to
read a dataset that includes a plurality of observation vectors, wherein each observation vector includes an explanatory vector of a plurality of explanatory variable values and a response variable value;
identify a plurality of quantile level values;
recursively divide the read dataset into subsets of the plurality of observation vectors, compute a lower counterweight vector and an upper counterweight vector for each of the subsets, and fit a quantile regression solver to each of the subsets using the associated, computed lower counterweight vector and the associated, computed upper counterweight vector to describe a quantile function of the response variable values for a selected quantile level of the identified plurality of quantile level values; and
for each selected quantile level, output a parameter estimate vector and a dual solution vector that describe the quantile function in association with the selected quantile level for use in predicting a new quantile value of a response variable for a new explanatory vector not read from the dataset. 15. The computing device of claim 14, wherein the lower counterweight vector is computed using (yL,xL)=Σj∈L(yj,xj), where L is a lower subset defined by assigning the plurality of observation vectors into the lower subset based on yj<xjβ(τ) where yj is the response variable value of the associated observation vector, xj is the explanatory vector of the associated observation vector, and β(τ) is the parameter estimate vector. 16. The computing device of claim 15, wherein the upper counterweight vector is computed using (yU,xU)=Σj∈U(yj,xj), where U is an upper subset assigned based on yj>xjβ(τ). 17. The computing device of claim 14, wherein recursively dividing, computing, and fitting the quantile regression solver comprise computer-readable instructions that cause the computing device to:
define the read dataset as a set of observation vectors D1; initialize a first counter value i, a second counter value t, the upper counterweight vector (y1 U,x1 U), the lower counterweight vector (y1 L,x1 L), a minimum quantile level value τ1 L, and a maximum quantile level value τ1 U; define a set of quantile level values G1 as the identified plurality of quantile level values; (a) select a quantile level value τi* from Gi that has a closest quantile level value to (τi L+τi U)/2; (b) fit the quantile regression solver to the set of observation vectors Di, the lower counterweight vector, and the upper counterweight vector to describe the quantile function of the response variable at the selected quantile level value τi*; (c) output the parameter estimate vector and the dual solution vector that describe the quantile function in association with the selected quantile level value τi*; (d) partition Gi into a lower sub grid G2i that includes zero or more quantile level values that are strictly less than it and an upper sub grid G2i+1 that includes zero or more quantile level values that are strictly greater than τi*; (e) update τ2i L=τi L, τ2i U=τ2i+1 L=τi*, and τ2i+1 U=τi U; (f) assign observation vectors of Di into D2i={j:âji<1,j∈Di} and D2i+1={j:âji>0,j∈Di}, where âji is the dual solution vector for a respective observation vector; (g) compute (y2i L,x2i L)=(yi L,xi L), (y2i U,y2i U)=(yi U,xi U)+Σ{j:â ji =1,j∈D i }(yj,xj), (y2i+1 L,x2i+1 L)=(yi L,xi L)+Σ{j:â ji =0;j∈D i }(yj,xj), and (y2i+1 U,x2i+1 U)=(yi U,xi U); (h) increment the first counter value i; (i) when Gi is an empty set, repeat (h) to (i); and (j) when Gi is not an empty set, increment the second counter value t, and repeat (a) to (j) until t=q, where q is a number of quantile level values included in the identified plurality of quantile level values. 18. A method of computing a plurality of quantile regression solvers for a dataset at a plurality of quantile levels, the method comprising:
reading, by a computing device, a dataset that includes a plurality of observation vectors, wherein each observation vector includes an explanatory vector of a plurality of explanatory variable values and a response variable value; identifying, by the computing device, a plurality of quantile level values; recursively dividing, by a computing device, the read dataset into subsets of the plurality of observation vectors, computing, by the computing device, a lower counterweight vector and an upper counterweight vector for each of the subsets, and fitting, by the computing device, a quantile regression solver to each of the subsets using the associated, computed lower counterweight vector and the associated, computed upper counterweight vector to describe a quantile function of the response variable values for a selected quantile level of the identified plurality of quantile level values; and for each selected quantile level, outputting, by the computing device, a parameter estimate vector and a dual solution vector that describe the quantile function in association with the selected quantile level for use in predicting a new quantile value of a response variable for a new explanatory vector not read from the dataset. 19. The method of claim 18, wherein the quantile regression solver is selected from the group consisting of a simplex algorithm, an interior-point algorithm, a smoothing algorithm, a randomized algorithm, a majorization-minimization algorithm. 20. The method of claim 18, wherein the plurality of quantile level values is a list of quantile level values. 21. The method of claim 20, wherein the list of quantile level values is received as a user input through a user interface. 22. The method of claim 18, wherein the plurality of quantile level values is computed from a resolution level received as a user input through a user interface. 23. The method of claim 18, wherein the lower counterweight vector is computed using (yL,xL)=Σj∈L(yj,xj), where L is a lower subset defined by assigning the plurality of observation vectors into the lower subset based on yj<xjβ(τ) where yj is the response variable value of the associated observation vector, xj is the explanatory vector of the associated observation vector, and β(τ) is the parameter estimate vector. 24. The method of claim 23, wherein the upper counterweight vector is computed using (yU,xU)=Σj∈U(yj,xj), where U is an upper subset assigned based on yj>xjβ(τ). 25. The method of claim 24, wherein D={j:j∉L and j∉U for j=1, . . . , n} is a next subset of the observation vectors, where n is a number of observation vectors included in the read dataset. 26. The method of claim 18, wherein the quantile regression solver is fit using maximize Σj∈Dajyj subject to Σj∈Dajxj=(1−τ)(xL+Σj∈Dxj)−τxU 0≤aj≤1 for j∈D, where a1 is the dual solution vector of the associated observation vector of the subset of observation vectors D, yj is the response variable value of the associated observation vector of the subset, xj is the explanatory vector of the associated observation vector of the subset, and τ is the selected quantile level, based on âj=1 for the subset of observation vectors that satisfy yj>xj{circumflex over (β)}(τ), âj=0 the subset of observation vectors that satisfy yj<xj{circumflex over (β)}(τ), and 0≤âj≤1 for the subset of observation vectors that satisfy yj=xj{circumflex over (β)}(τ), where β(τ) is the parameter estimate vector of the associated observation vector of the subset, where {âj:j∈D} denote the fit {aj:j∈D}. 27. The method of claim 18, wherein recursively dividing, computing, and fitting the quantile regression solver comprises:
defining, by the computing device, the read dataset as a set of observation vectors D1; initializing, by the computing device, a first counter value i, a second counter value t, the upper counterweight vector (y1 U,x1 U), the lower counterweight vector (y1 L,x1 L), a minimum quantile level value τ1 L, and a maximum quantile level value τ1 U; defining, by the computing device, a set of quantile level values G1 as the identified plurality of quantile level values; (a) selecting, by the computing device, a quantile level value τi* from Gi that has a closest quantile level value to (τi L+τi U)/2; (b) fitting, by the computing device, the quantile regression solver to the set of observation vectors Di, the lower counterweight vector, and the upper counterweight vector to describe the quantile function of the response variable at the selected quantile level value τi*; (c) outputting, by the computing device, the parameter estimate vector and the dual solution vector that describe the quantile function in association with the selected quantile level value τi*; (d) partitioning, by the computing device, Gi into a lower sub grid G2i that includes zero or more quantile level values that are less than or equal to τi* and an upper sub grid G2i+1 that includes zero or more quantile level values that are greater than or equal to τi*, (e) updating, by the computing device, τ2i L=τi L, τ2i U=τ2i+1 L=τi*, and τ2i+1 U=τi U; (f) assigning, by the computing device, observation vectors of Di into D2i={j:âji<1, j∈Di} and D2i+1={j:âji>0, j∈Di}, where âji is the dual solution vector for a respective observation vector; (g) computing, by the computing device, (y2i L,x2i L)=(yi L,xi L), (y2i U,y2i U)=(yi U,xi U)+Σ{j:â ji =1,j∈D i }(yj,xj), (y2i+1 L,x2i+1 L)=(yi L,xi L)+Σ{j:â ji =0,j∈D i }(yj,xj), and (y2i+1 U,x2i+1 U)=(yi U,xi U); (h) incrementing, by the computing device, the first counter value i; (i) when Gi is an empty set, repeating, by the computing device, (h) to (i); and (j) when Gi is not an empty set, incrementing, by the computing device, the second counter value t, and repeating, by the computing device, (a) to (j) until t=q, where q is a number of quantile level values included in the identified plurality of quantile level values. 28. The method of claim 18, wherein the quantile regression solver is fit using a plurality of computing devices recursively. 29. The method of claim 28, wherein recursively dividing, computing, and fitting comprises:
defining, by the computing device, the read dataset as a set of observation vectors D; defining, by the computing device, a set of quantile level values G as the identified plurality of quantile level values; identifying, by the computing device, a set of computing devices to C={c1, c2, . . . , cw}, where w is a number of computing devices; initializing, by the computing device, the upper counterweight vector (yU,xU), the lower counterweight vector (yL,xL), a minimum quantile level value τL, and a maximum quantile level value τU; and calling, by the computing device, a regression fit function with D, G, C, {(yj,xj):j∈D}, (yL,xL), (yU,xU), τL, and τU. 30. The method of claim 29, wherein the regression fit function comprises computer-readable instructions that cause the computing device to:
initialize Dc, Gc, Cc, {(yj,xj):j∈Dc}, (yc L,xc L), (yc U,xc U), τc L, and τc U from the calling parameters; select the quantile level value τc* from Gc that has a closest quantile level value to (τc L+τc U)/2; fit the quantile regression solver to the set of observation vectors {(yj,xj):j∈Dc}, the lower counterweight vector (yc L,xc L), and the upper counterweight vector (yc U,xc U) to describe the quantile function of the response variable at the selected quantile level value τc*, output the parameter estimate vector {circumflex over (β)}(τc*) and the dual solution vector {âj:j∈Dc} that describe the quantile function of the response variable in association with τc*; partition Gc into a lower sub grid G1 that includes zero or more quantile level values that are strictly less than τc* and an upper sub grid G2 that includes zero or more quantile level values that are strictly greater than τc*; update τ1 L=τc L, τ1 U=τ2 L=τc*, and τ2 U=τc U; assign observation vectors of Dc into D1={j∈Dc:âj<1} and D2={j∈Dc:âj>0}, where âj is an element of the dual solution vector for a respective observation vector; partition Cc into a first set of computing devices C1 and a second set of computing device C2; compute (y1 L,x1 L)=(yc L,xc L), (y1 U,x1 U)=(yc U,xc U)+Σ{j∈D c :â j =1}(yj,xj), (y2 L,x2 L)=(yc L,xc L)+Σ{j∈D c :â j =0}(yj,xj), and (y2 U,x2 U)=(yc U,xc U); when G1 is not an empty set, recursively call the regression fit function with D1, G1, C1, {(yj,xj):j∈D1}, (y1 L,x1 L), (y1 U,x1 U), τ1 L, and τ1 U; when G2 is not an empty set, recursively call the regression fit function with D2, G2, C2, {(yj,xj):j∈D2}, (y2 L,x2 L), (y2 U,x2 U), τ2 L, and τ2 U; and return control to the calling function. | A computing device computes a plurality of quantile regression solvers for a dataset at a plurality of quantile levels. Each observation vector includes an explanatory vector of a plurality of explanatory variable values and a response variable value. The read dataset is recursively divided into subsets of the plurality of observation vectors, a lower counterweight vector and an upper counterweight vector are computed for each of the subsets, and a quantile regression solver is fit to each of the subsets using the associated, computed lower counterweight vector and the associated, computed upper counterweight vector to describe a quantile function of the response variable values for a selected quantile level of the identified plurality of quantile level values. For each selected quantile level, a parameter estimate vector and a dual solution vector that describe the quantile function are output in association with the selected quantile level.1. A non-transitory computer-readable medium having stored thereon computer-readable instructions that when executed by a computing device cause the computing device to:
read a dataset that includes a plurality of observation vectors, wherein each observation vector includes an explanatory vector of a plurality of explanatory variable values and a response variable value; identify a plurality of quantile level values; recursively divide the read dataset into subsets of the plurality of observation vectors, compute a lower counterweight vector and an upper counterweight vector for each of the subsets, and fit a quantile regression solver to each of the subsets using the associated, computed lower counterweight vector and the associated, computed upper counterweight vector to describe a quantile function for the response variable values for a selected quantile level of the identified plurality of quantile level values; and for each selected quantile level, output a parameter estimate vector and a dual solution vector that describe the quantile function in association with the selected quantile level for use in predicting a new quantile value of a response variable for a new explanatory vector not read from the dataset. 2. The non-transitory computer-readable medium of claim 1, wherein the quantile regression solver is selected from the group consisting of a simplex algorithm, an interior-point algorithm, a smoothing algorithm, a randomized algorithm, a majorization-minimization algorithm. 3. The non-transitory computer-readable medium of claim 1, wherein the plurality of quantile level values is a list of quantile level values. 4. The non-transitory computer-readable medium of claim 3, wherein the list of quantile level values is received as a user input through a user interface. 5. The non-transitory computer-readable medium of claim 1, wherein the plurality of quantile level values is computed from a resolution level received as a user input through a user interface. 6. The non-transitory computer-readable medium of claim 1, wherein the lower counterweight vector is computed using (yL,xL)=Σj∈L(yj,xj), where L is a lower subset defined by assigning the plurality of observation vectors into the lower subset based on yj<x1β(τ) where yj is the response variable value of the associated observation vector, xj is the explanatory vector of the associated observation vector, and β(τ) is the parameter estimate vector. 7. The non-transitory computer-readable medium of claim 6, wherein the upper counterweight vector is computed using (yU,xU)=Σj∈U(yj,xj), where U is an upper subset assigned based on yj>xjβ(τ). 8. The non-transitory computer-readable medium of claim 7, wherein D={j:j∉L and j∉U for j=1, . . . , n} is a next subset of the recursive fit, where n is a number of observation vectors included in the read dataset. 9. The non-transitory computer-readable medium of claim 1, wherein the quantile regression solver is fit using maximize Σj∈Dajyj subject to Σj∈Dajxj=(1−τ)(xL+Σj∈Dxj)−τxU 0≤aj≤1 for j∈D, where aj is the dual solution vector of the associated observation vector of the subset of observation vectors D, yj is the response variable value of the associated observation vector of the subset, xj is the explanatory vector of the associated observation vector of the subset, and τ is the selected quantile level, based on âj=1 for the subset of observation vectors that satisfy yj>xj{circumflex over (β)}(τ), âj=0 the subset of observation vectors that satisfy yj<xj{circumflex over (β)}(τ), and 0≤âj≤1 for the subset of observation vectors that satisfy yj=xj{circumflex over (β)}(τ), where β(τ) is the parameter estimate vector of the associated observation vector of the subset, where {âj:j∈D} denote the fit {aj:j∈D}. 10. The non-transitory computer-readable medium of claim 1, wherein recursively dividing, computing, and fitting the quantile regression solver comprise computer-readable instructions that cause the computing device to:
define the read dataset as a set of observation vectors D1; initialize a first counter value i, a second counter value t, the upper counterweight vector (y1 U,x1 U), the lower counterweight vector (y1 L,x1 L), a minimum quantile level value τ1 L, and a maximum quantile level value τ1 U; define a set of quantile level values G1 as the identified plurality of quantile level values; (a) select a quantile level value τi* from Gi that has a closest quantile level value to (τi L+τi U)/2; (b) fit the quantile regression solver to the set of observation vectors Di, the lower counterweight vector, and the upper counterweight vector to describe the quantile function of the response variable at the selected quantile level value τi*, (c) output the parameter estimate vector and the dual solution vector that describe the quantile function in association with the selected quantile level value τi*, (d) partition Gi into a lower sub grid G2i that includes zero or more quantile level values that are strictly less than τi* and an upper sub grid G2i+1 that includes zero or more quantile level values that are strictly greater than τi U; (e) update τ2i L=τi L, τ2i U=τ2i+1 L=τi*, and τ2i+1 U=τi U; (f) assign observation vectors of Di into D2i={j:âji<1,j∈Di} and D2i+1={j:âji>0,j∈Di}, where âji is the dual solution vector for a respective observation vector; (g) compute (y2i L,x2i L)=(yi L,xi L), (y2i U,x2i U)=(yi U,xi U)+Σ{j:â jt =1,j∈D i }(yj,xj), (y2i+1 L,x2i+1 L)=(yi L,xi L)+Σ{j:â jt =1,j∈D i }(yj,xj), and (y2i+1 U,x2i+1 U)=(yi U,xi U); (h) increment the first counter value i; (i) when Gi is an empty set, repeat (h) to (i); and (j) when Gi is not an empty set, increment the second counter value t, and repeat (a) to (j) until t=q, where q is a number of quantile level values included in the identified plurality of quantile level values. 11. The non-transitory computer-readable medium of claim 1, wherein the quantile regression solver is fit using a plurality of computing devices recursively. 12. The non-transitory computer-readable medium of claim 11, wherein recursively dividing, computing, and fitting comprises computer-readable instructions that cause the computing device to:
define the read dataset as a set of observation vectors D; define a set of quantile level values G as the identified plurality of quantile level values; identify a set of computing devices to C={c1, c2, . . . , cw}, where w is a number of computing devices; initialize the upper counterweight vector (yU,xU), the lower counterweight vector (yL,xL), a minimum quantile level value τL, and a maximum quantile level value τU, and call a regression fit function with D, G, C, {(yj,xj):j∈D}, (yL,xL), (yU,xU), τL, and τU. 13. The non-transitory computer-readable medium of claim 12, wherein the regression fit function comprises computer-readable instructions that cause the computing device to:
initialize Dc, Gc, Cc, {(yj,xj):j∈Dc}, (yc L,xc L), (yc U,xc U), τc L, and τc U from the calling parameters; select the quantile level value τc* from Gc that has a closest quantile level value to (τc L+τc U)/2; fit the quantile regression solver to the set of observation vectors {(yj,xj):j∈Dc}, the lower counterweight vector (yc L,xc L), and the upper counterweight vector (yc U,xc U) to describe the quantile function of the response variable at the selected quantile level value τc*, output the parameter estimate vector {circumflex over (β)}(τc*) and the dual solution vector {aj:j∈Dc} that describe the quantile function of the response variable in association with τc*, partition Gc into a lower sub grid G1 that includes zero or more quantile level values that are strictly less than τc* and an upper sub grid G2 that includes zero or more quantile level values that are strictly greater than τc*, update τ1 L=τc L, τ1 U=τ2 L=τc*, and τ2 U=τc U; assign observation vectors of Dc into D1={j∈Dc:âj<1} and D2={j∈Dc:âj>0}, where âj is an element of the dual solution vector for a respective observation vector; partition Cc into a first set of computing devices C1 and a second set of computing device C2; compute (y1 L,x1 L)=(yc L,xc L), (y1 U,x1 U)=(yc U,xc U)+Σ{j∈D c :â j =1}(yj,xj), (y2 L,x2 L)=(yc L,xc L)+Σ{j∈D c :â j =1}(yj,xj), and (y2 U,x2 U)=(yc U,xc U); when G1 is not an empty set, recursively call the regression fit function with D1, G1, C1, {(yj,xj):j∈D1}, (y1 L,x1 L), (y1 U,x1 U), τ1 L, and τ1 U; when G2 is not an empty set, recursively call the regression fit function with D2, G2, C2, {(yj,xj):j∈D2}, (y2 L,x2 L), (y2 U,x2 U), τ2 L, and τ2 U; and return control to the calling function. 14. A computing device comprising:
a processor; and a non-transitory computer-readable medium operably coupled to the processor, the computer-readable medium having computer-readable instructions stored thereon that, when executed by the processor, cause the computing device to
read a dataset that includes a plurality of observation vectors, wherein each observation vector includes an explanatory vector of a plurality of explanatory variable values and a response variable value;
identify a plurality of quantile level values;
recursively divide the read dataset into subsets of the plurality of observation vectors, compute a lower counterweight vector and an upper counterweight vector for each of the subsets, and fit a quantile regression solver to each of the subsets using the associated, computed lower counterweight vector and the associated, computed upper counterweight vector to describe a quantile function of the response variable values for a selected quantile level of the identified plurality of quantile level values; and
for each selected quantile level, output a parameter estimate vector and a dual solution vector that describe the quantile function in association with the selected quantile level for use in predicting a new quantile value of a response variable for a new explanatory vector not read from the dataset. 15. The computing device of claim 14, wherein the lower counterweight vector is computed using (yL,xL)=Σj∈L(yj,xj), where L is a lower subset defined by assigning the plurality of observation vectors into the lower subset based on yj<xjβ(τ) where yj is the response variable value of the associated observation vector, xj is the explanatory vector of the associated observation vector, and β(τ) is the parameter estimate vector. 16. The computing device of claim 15, wherein the upper counterweight vector is computed using (yU,xU)=Σj∈U(yj,xj), where U is an upper subset assigned based on yj>xjβ(τ). 17. The computing device of claim 14, wherein recursively dividing, computing, and fitting the quantile regression solver comprise computer-readable instructions that cause the computing device to:
define the read dataset as a set of observation vectors D1; initialize a first counter value i, a second counter value t, the upper counterweight vector (y1 U,x1 U), the lower counterweight vector (y1 L,x1 L), a minimum quantile level value τ1 L, and a maximum quantile level value τ1 U; define a set of quantile level values G1 as the identified plurality of quantile level values; (a) select a quantile level value τi* from Gi that has a closest quantile level value to (τi L+τi U)/2; (b) fit the quantile regression solver to the set of observation vectors Di, the lower counterweight vector, and the upper counterweight vector to describe the quantile function of the response variable at the selected quantile level value τi*; (c) output the parameter estimate vector and the dual solution vector that describe the quantile function in association with the selected quantile level value τi*; (d) partition Gi into a lower sub grid G2i that includes zero or more quantile level values that are strictly less than it and an upper sub grid G2i+1 that includes zero or more quantile level values that are strictly greater than τi*; (e) update τ2i L=τi L, τ2i U=τ2i+1 L=τi*, and τ2i+1 U=τi U; (f) assign observation vectors of Di into D2i={j:âji<1,j∈Di} and D2i+1={j:âji>0,j∈Di}, where âji is the dual solution vector for a respective observation vector; (g) compute (y2i L,x2i L)=(yi L,xi L), (y2i U,y2i U)=(yi U,xi U)+Σ{j:â ji =1,j∈D i }(yj,xj), (y2i+1 L,x2i+1 L)=(yi L,xi L)+Σ{j:â ji =0;j∈D i }(yj,xj), and (y2i+1 U,x2i+1 U)=(yi U,xi U); (h) increment the first counter value i; (i) when Gi is an empty set, repeat (h) to (i); and (j) when Gi is not an empty set, increment the second counter value t, and repeat (a) to (j) until t=q, where q is a number of quantile level values included in the identified plurality of quantile level values. 18. A method of computing a plurality of quantile regression solvers for a dataset at a plurality of quantile levels, the method comprising:
reading, by a computing device, a dataset that includes a plurality of observation vectors, wherein each observation vector includes an explanatory vector of a plurality of explanatory variable values and a response variable value; identifying, by the computing device, a plurality of quantile level values; recursively dividing, by a computing device, the read dataset into subsets of the plurality of observation vectors, computing, by the computing device, a lower counterweight vector and an upper counterweight vector for each of the subsets, and fitting, by the computing device, a quantile regression solver to each of the subsets using the associated, computed lower counterweight vector and the associated, computed upper counterweight vector to describe a quantile function of the response variable values for a selected quantile level of the identified plurality of quantile level values; and for each selected quantile level, outputting, by the computing device, a parameter estimate vector and a dual solution vector that describe the quantile function in association with the selected quantile level for use in predicting a new quantile value of a response variable for a new explanatory vector not read from the dataset. 19. The method of claim 18, wherein the quantile regression solver is selected from the group consisting of a simplex algorithm, an interior-point algorithm, a smoothing algorithm, a randomized algorithm, a majorization-minimization algorithm. 20. The method of claim 18, wherein the plurality of quantile level values is a list of quantile level values. 21. The method of claim 20, wherein the list of quantile level values is received as a user input through a user interface. 22. The method of claim 18, wherein the plurality of quantile level values is computed from a resolution level received as a user input through a user interface. 23. The method of claim 18, wherein the lower counterweight vector is computed using (yL,xL)=Σj∈L(yj,xj), where L is a lower subset defined by assigning the plurality of observation vectors into the lower subset based on yj<xjβ(τ) where yj is the response variable value of the associated observation vector, xj is the explanatory vector of the associated observation vector, and β(τ) is the parameter estimate vector. 24. The method of claim 23, wherein the upper counterweight vector is computed using (yU,xU)=Σj∈U(yj,xj), where U is an upper subset assigned based on yj>xjβ(τ). 25. The method of claim 24, wherein D={j:j∉L and j∉U for j=1, . . . , n} is a next subset of the observation vectors, where n is a number of observation vectors included in the read dataset. 26. The method of claim 18, wherein the quantile regression solver is fit using maximize Σj∈Dajyj subject to Σj∈Dajxj=(1−τ)(xL+Σj∈Dxj)−τxU 0≤aj≤1 for j∈D, where a1 is the dual solution vector of the associated observation vector of the subset of observation vectors D, yj is the response variable value of the associated observation vector of the subset, xj is the explanatory vector of the associated observation vector of the subset, and τ is the selected quantile level, based on âj=1 for the subset of observation vectors that satisfy yj>xj{circumflex over (β)}(τ), âj=0 the subset of observation vectors that satisfy yj<xj{circumflex over (β)}(τ), and 0≤âj≤1 for the subset of observation vectors that satisfy yj=xj{circumflex over (β)}(τ), where β(τ) is the parameter estimate vector of the associated observation vector of the subset, where {âj:j∈D} denote the fit {aj:j∈D}. 27. The method of claim 18, wherein recursively dividing, computing, and fitting the quantile regression solver comprises:
defining, by the computing device, the read dataset as a set of observation vectors D1; initializing, by the computing device, a first counter value i, a second counter value t, the upper counterweight vector (y1 U,x1 U), the lower counterweight vector (y1 L,x1 L), a minimum quantile level value τ1 L, and a maximum quantile level value τ1 U; defining, by the computing device, a set of quantile level values G1 as the identified plurality of quantile level values; (a) selecting, by the computing device, a quantile level value τi* from Gi that has a closest quantile level value to (τi L+τi U)/2; (b) fitting, by the computing device, the quantile regression solver to the set of observation vectors Di, the lower counterweight vector, and the upper counterweight vector to describe the quantile function of the response variable at the selected quantile level value τi*; (c) outputting, by the computing device, the parameter estimate vector and the dual solution vector that describe the quantile function in association with the selected quantile level value τi*; (d) partitioning, by the computing device, Gi into a lower sub grid G2i that includes zero or more quantile level values that are less than or equal to τi* and an upper sub grid G2i+1 that includes zero or more quantile level values that are greater than or equal to τi*, (e) updating, by the computing device, τ2i L=τi L, τ2i U=τ2i+1 L=τi*, and τ2i+1 U=τi U; (f) assigning, by the computing device, observation vectors of Di into D2i={j:âji<1, j∈Di} and D2i+1={j:âji>0, j∈Di}, where âji is the dual solution vector for a respective observation vector; (g) computing, by the computing device, (y2i L,x2i L)=(yi L,xi L), (y2i U,y2i U)=(yi U,xi U)+Σ{j:â ji =1,j∈D i }(yj,xj), (y2i+1 L,x2i+1 L)=(yi L,xi L)+Σ{j:â ji =0,j∈D i }(yj,xj), and (y2i+1 U,x2i+1 U)=(yi U,xi U); (h) incrementing, by the computing device, the first counter value i; (i) when Gi is an empty set, repeating, by the computing device, (h) to (i); and (j) when Gi is not an empty set, incrementing, by the computing device, the second counter value t, and repeating, by the computing device, (a) to (j) until t=q, where q is a number of quantile level values included in the identified plurality of quantile level values. 28. The method of claim 18, wherein the quantile regression solver is fit using a plurality of computing devices recursively. 29. The method of claim 28, wherein recursively dividing, computing, and fitting comprises:
defining, by the computing device, the read dataset as a set of observation vectors D; defining, by the computing device, a set of quantile level values G as the identified plurality of quantile level values; identifying, by the computing device, a set of computing devices to C={c1, c2, . . . , cw}, where w is a number of computing devices; initializing, by the computing device, the upper counterweight vector (yU,xU), the lower counterweight vector (yL,xL), a minimum quantile level value τL, and a maximum quantile level value τU; and calling, by the computing device, a regression fit function with D, G, C, {(yj,xj):j∈D}, (yL,xL), (yU,xU), τL, and τU. 30. The method of claim 29, wherein the regression fit function comprises computer-readable instructions that cause the computing device to:
initialize Dc, Gc, Cc, {(yj,xj):j∈Dc}, (yc L,xc L), (yc U,xc U), τc L, and τc U from the calling parameters; select the quantile level value τc* from Gc that has a closest quantile level value to (τc L+τc U)/2; fit the quantile regression solver to the set of observation vectors {(yj,xj):j∈Dc}, the lower counterweight vector (yc L,xc L), and the upper counterweight vector (yc U,xc U) to describe the quantile function of the response variable at the selected quantile level value τc*, output the parameter estimate vector {circumflex over (β)}(τc*) and the dual solution vector {âj:j∈Dc} that describe the quantile function of the response variable in association with τc*; partition Gc into a lower sub grid G1 that includes zero or more quantile level values that are strictly less than τc* and an upper sub grid G2 that includes zero or more quantile level values that are strictly greater than τc*; update τ1 L=τc L, τ1 U=τ2 L=τc*, and τ2 U=τc U; assign observation vectors of Dc into D1={j∈Dc:âj<1} and D2={j∈Dc:âj>0}, where âj is an element of the dual solution vector for a respective observation vector; partition Cc into a first set of computing devices C1 and a second set of computing device C2; compute (y1 L,x1 L)=(yc L,xc L), (y1 U,x1 U)=(yc U,xc U)+Σ{j∈D c :â j =1}(yj,xj), (y2 L,x2 L)=(yc L,xc L)+Σ{j∈D c :â j =0}(yj,xj), and (y2 U,x2 U)=(yc U,xc U); when G1 is not an empty set, recursively call the regression fit function with D1, G1, C1, {(yj,xj):j∈D1}, (y1 L,x1 L), (y1 U,x1 U), τ1 L, and τ1 U; when G2 is not an empty set, recursively call the regression fit function with D2, G2, C2, {(yj,xj):j∈D2}, (y2 L,x2 L), (y2 U,x2 U), τ2 L, and τ2 U; and return control to the calling function. | 2,100 |
5,395 | 5,395 | 15,261,952 | 2,135 | A method includes monitoring a sequence of transactions in one or more volumes. The transactions are transferred to a primary storage ( 112 ) in a given order, and are replicated to a secondary storage ( 114 ). The volumes belong to a volume group ( 204 ) for which the transactions are guaranteed to be replicated while retaining the given order. Artificial write transactions ( 228 ) are periodically issued to a protection application field, which is predefined in a given volume ( 212 ) belonging to the volume group. Records indicative of the transactions, including the artificial transactions, are stored in a disaster-proof storage unit ( 144 ). Upon verifying that a given artificial transaction has been successfully replicated in the secondary storage, the records corresponding to the given artificial write transaction and the transactions that precede it in the sequence are deleted from the disaster-proof storage unit. | 1. Apparatus for data protection, comprising:
a data storage device; and a protection appliance, which comprises:
a communication interface, which is coupled to communicate via a storage area network (SAN) with a first group of primary storage volumes, to which data storage transactions are applied via the SAN by local servers, and to communicate via a wide area network (WAN) with a second group of backup storage volumes, to which ordered series of the data storage transactions are replicated; and
a processor, which is configured to periodically write, via the SAN, a sequence of indexed transactions to one of the primary storage volumes, whereby the indexed transactions are replicated within the ordered series of the data storage transactions to a corresponding one of the backup storage volumes, and to store respective records of the transactions in the ordered series in the data storage device while maintaining order of the series,
wherein the processor is configured to periodically read, via the WAN, the indexed transactions from the corresponding one of the backup storage volumes and, upon reading a given indexed transaction, to erase from the data storage device all of the records of the transactions that preceded the given indexed transaction in the ordered series. 2. The apparatus according to claim 1, wherein the one of the primary storage volumes, which is written to and read from by the processor, is dedicated for access by the protection appliance. 3. The apparatus according to claim 1, wherein the first group of primary storage volumes comprises a consistency group. 4. The apparatus according to claim 1, wherein the processor is configured to modify, in real time, a period of time between consecutive reading operations of the indexed transactions from the one of the backup storage volumes. 5. The apparatus according to claim 1, wherein the processor is configured to modify, in real time, a period of time between consecutive writing operations of the indexed transactions to the one of the primary storage volumes. 6. The apparatus according to claim 1, wherein the processor is configured to index the transactions in the sequence with respective serial indices or time stamps. 7. The apparatus according to claim 1, wherein, upon reading the given indexed transaction, the processor is configured to verify that an index of the given indexed transaction differs from the index of a previously-read indexed transaction. 8. The apparatus according to claim 1, wherein the processor is configured to write and read the indexed transactions independently of any coordination with a replication scheme used for replicating the ordered sequence. 9. The apparatus according to claim 1, wherein the processor is configured to write and read the indexed transactions independently of applications running on the local servers that generate the data storage transactions. 10. The apparatus according to claim 1, wherein the data storage device is disaster-proof. 11. A method for data protection, comprising:
using a protection appliance, communicating via a storage area network (SAN) with a first group of primary storage volumes, to which data storage transactions are applied via the SAN by local servers, and communicating via a wide area network (WAN) with a second group of backup storage volumes, to which ordered series of the data storage transactions are replicated; periodically writing, by the protection appliance, via the SAN, a sequence of indexed transactions to one of the primary storage volumes, whereby the indexed transactions are replicated within the ordered series of the data storage transactions to a corresponding one of the backup storage volumes; storing, by the protection appliance, respective records of the transactions in the ordered series in a data storage device while maintaining order of the series; periodically reading, by the protection appliance, via the WAN, the indexed transactions from the corresponding one of the backup storage volumes; and upon reading a given indexed transaction, erasing, by the protection appliance, from the data storage device all of the records of the transactions that preceded the given indexed transaction in the ordered series. 12. The method according to claim 11, wherein the one of the primary storage volumes, which is written to and read from by the protection appliance, is dedicated for access by the protection appliance. 13. The method according to claim 11, wherein the first group of primary storage volumes comprises a consistency group. 14. The method according to claim 11, wherein reading the indexed transactions comprises modifying, in real time, a period of time between consecutive reading operations of the indexed transactions from the one of the backup storage volumes. 15. The method according to claim 11, wherein writing the indexed transactions comprises modifying, in real time, a period of time between consecutive writing operations of the indexed transactions to the one of the primary storage volumes. 16. The method according to claim 11, wherein writing the sequence comprises indexing the transactions in the sequence with respective serial indices or time stamps. 17. The method according to claim 11, and comprising, upon reading the given indexed transaction, verifying that an index of the given indexed transaction differs from the index of a previously-read indexed transaction. 18. The method according to claim 11, wherein writing and reading the indexed transactions are performed independently of any coordination with a replication scheme used for replicating the ordered sequence. 19. The method according to claim 11, wherein writing and reading the indexed transactions are performed independently of applications running on the local servers that generate the data storage transactions. 20. The method according to claim 11, wherein the data storage device is disaster-proof. | A method includes monitoring a sequence of transactions in one or more volumes. The transactions are transferred to a primary storage ( 112 ) in a given order, and are replicated to a secondary storage ( 114 ). The volumes belong to a volume group ( 204 ) for which the transactions are guaranteed to be replicated while retaining the given order. Artificial write transactions ( 228 ) are periodically issued to a protection application field, which is predefined in a given volume ( 212 ) belonging to the volume group. Records indicative of the transactions, including the artificial transactions, are stored in a disaster-proof storage unit ( 144 ). Upon verifying that a given artificial transaction has been successfully replicated in the secondary storage, the records corresponding to the given artificial write transaction and the transactions that precede it in the sequence are deleted from the disaster-proof storage unit.1. Apparatus for data protection, comprising:
a data storage device; and a protection appliance, which comprises:
a communication interface, which is coupled to communicate via a storage area network (SAN) with a first group of primary storage volumes, to which data storage transactions are applied via the SAN by local servers, and to communicate via a wide area network (WAN) with a second group of backup storage volumes, to which ordered series of the data storage transactions are replicated; and
a processor, which is configured to periodically write, via the SAN, a sequence of indexed transactions to one of the primary storage volumes, whereby the indexed transactions are replicated within the ordered series of the data storage transactions to a corresponding one of the backup storage volumes, and to store respective records of the transactions in the ordered series in the data storage device while maintaining order of the series,
wherein the processor is configured to periodically read, via the WAN, the indexed transactions from the corresponding one of the backup storage volumes and, upon reading a given indexed transaction, to erase from the data storage device all of the records of the transactions that preceded the given indexed transaction in the ordered series. 2. The apparatus according to claim 1, wherein the one of the primary storage volumes, which is written to and read from by the processor, is dedicated for access by the protection appliance. 3. The apparatus according to claim 1, wherein the first group of primary storage volumes comprises a consistency group. 4. The apparatus according to claim 1, wherein the processor is configured to modify, in real time, a period of time between consecutive reading operations of the indexed transactions from the one of the backup storage volumes. 5. The apparatus according to claim 1, wherein the processor is configured to modify, in real time, a period of time between consecutive writing operations of the indexed transactions to the one of the primary storage volumes. 6. The apparatus according to claim 1, wherein the processor is configured to index the transactions in the sequence with respective serial indices or time stamps. 7. The apparatus according to claim 1, wherein, upon reading the given indexed transaction, the processor is configured to verify that an index of the given indexed transaction differs from the index of a previously-read indexed transaction. 8. The apparatus according to claim 1, wherein the processor is configured to write and read the indexed transactions independently of any coordination with a replication scheme used for replicating the ordered sequence. 9. The apparatus according to claim 1, wherein the processor is configured to write and read the indexed transactions independently of applications running on the local servers that generate the data storage transactions. 10. The apparatus according to claim 1, wherein the data storage device is disaster-proof. 11. A method for data protection, comprising:
using a protection appliance, communicating via a storage area network (SAN) with a first group of primary storage volumes, to which data storage transactions are applied via the SAN by local servers, and communicating via a wide area network (WAN) with a second group of backup storage volumes, to which ordered series of the data storage transactions are replicated; periodically writing, by the protection appliance, via the SAN, a sequence of indexed transactions to one of the primary storage volumes, whereby the indexed transactions are replicated within the ordered series of the data storage transactions to a corresponding one of the backup storage volumes; storing, by the protection appliance, respective records of the transactions in the ordered series in a data storage device while maintaining order of the series; periodically reading, by the protection appliance, via the WAN, the indexed transactions from the corresponding one of the backup storage volumes; and upon reading a given indexed transaction, erasing, by the protection appliance, from the data storage device all of the records of the transactions that preceded the given indexed transaction in the ordered series. 12. The method according to claim 11, wherein the one of the primary storage volumes, which is written to and read from by the protection appliance, is dedicated for access by the protection appliance. 13. The method according to claim 11, wherein the first group of primary storage volumes comprises a consistency group. 14. The method according to claim 11, wherein reading the indexed transactions comprises modifying, in real time, a period of time between consecutive reading operations of the indexed transactions from the one of the backup storage volumes. 15. The method according to claim 11, wherein writing the indexed transactions comprises modifying, in real time, a period of time between consecutive writing operations of the indexed transactions to the one of the primary storage volumes. 16. The method according to claim 11, wherein writing the sequence comprises indexing the transactions in the sequence with respective serial indices or time stamps. 17. The method according to claim 11, and comprising, upon reading the given indexed transaction, verifying that an index of the given indexed transaction differs from the index of a previously-read indexed transaction. 18. The method according to claim 11, wherein writing and reading the indexed transactions are performed independently of any coordination with a replication scheme used for replicating the ordered sequence. 19. The method according to claim 11, wherein writing and reading the indexed transactions are performed independently of applications running on the local servers that generate the data storage transactions. 20. The method according to claim 11, wherein the data storage device is disaster-proof. | 2,100 |
5,396 | 5,396 | 15,272,382 | 2,177 | In some embodiments, an electronic device displays a playback user interface that is configured to playback content on the electronic device. While displaying the playback user interface that is configured to playback the content on the electronic device, the electronic device displays a scrubber bar for navigating through the content, wherein the scrubber bar includes: a visual indication of a current playback position within the content; and one or more playback time indications that include time values based on the current playback position within the content. A respective playback time indication of the one or more playback time indications is based on a time of day at the electronic device, and an amount of time that it will take to play the content from the current playback position to an end of the content at a respective content playback speed. | 1. A method comprising:
at an electronic device that is in communication with a display and one or more input devices:
displaying, on the display, a playback user interface that is configured to playback content on the electronic device; and
while displaying the playback user interface that is configured to playback the content on the electronic device, displaying, on the display, a scrubber bar for navigating through the content, wherein the scrubber bar includes:
a visual indication of a current playback position within the content; and
one or more playback time indications that include time values based on the current playback position within the content, wherein a respective playback time indication of the one or more playback time indications is based on:
a time of day at the electronic device, and
an amount of time that it will take to play the content from the current playback position to an end of the content at a respective content playback speed. 2. The method of claim 1, wherein the respective content playback speed that is used to determine the amount of time it will take to play the content from the current playback position is selected based on a playback state of the content. 3. The method of claim 1, wherein the respective playback time indication is expressed as a future time of day at which the end of the content will be reached at the respective content playback speed. 4. The method of claim 1, further comprising:
prior to displaying the scrubber bar on the display, receiving an input, at the one or more input devices, to display the scrubber bar while the playback user interface is displayed on the display; and in response to receiving the input, displaying the scrubber bar on the display. 5. The method of claim 1, wherein the one or more playback time indications include a second respective playback time indication displayed at the visual indication of the current playback position within the content, the second respective playback time indication displaying a current time of day at the electronic device. 6. The method of claim 5, further comprising:
while displaying the scrubber bar and the second respective playback time indication on the display, receiving an input, at the one or more input devices, for scrubbing through the content; and in response to receiving the input for scrubbing through the content:
updating the current playback position within the content, including updating a location of the visual indication of the current playback position within the scrubber bar, in accordance with the input for scrubbing through the content; and
updating the second respective playback time indication in accordance with an advance of the time of day at the electronic device. 7. The method of claim 5, further comprising:
while displaying the scrubber bar and the second respective playback time indication on the display, playing the content at a second respective content playback speed; and while playing the content at the second respective content playback speed:
updating the current playback position within the content, including updating a location of the visual indication of the current playback position within the scrubber bar, in accordance with playback progression through the content at the second respective content playback speed; and
updating the second respective playback time indication in accordance with an advance of the time of day at the electronic device. 8. The method of claim 5, wherein a location of the second respective playback time indication on the display moves in accordance with movement of the visual indication of the current playback position within the content as the current playback position within the content is changed. 9. The method of claim 1, wherein the respective playback time indication is displayed at an end of the scrubber bar that corresponds to the end of the content, and the respective playback time indication displays a time of day at the electronic device at which the playback of the content will end at the respective content playback speed. 10. The method of claim 9, further comprising:
while displaying the scrubber bar and the respective playback time indication on the display, receiving an input, at the one or more input devices, for scrubbing through the content; and in response to receiving the input for scrubbing through the content:
updating the current playback position within the content, including updating a location of the visual indication of the current playback position within the scrubber bar, in accordance with the input for scrubbing through the content; and
updating the respective playback time indication in accordance with the updated current playback position within the content, the updated respective playback time indication displaying an updated time of day at the electronic device at which the playback of the content will end, starting from the updated current playback position within the content, at the respective content playback speed. 11. The method of claim 9, further comprising:
while displaying the scrubber bar and the respective playback time indication on the display, playing the content at a second respective content playback speed; and while playing the content at the second respective content playback speed:
updating the current playback position within the content, including updating a location of the visual indication of the current playback position within the scrubber bar, in accordance with playback progression through the content at the second respective content playback speed; and
maintaining the respective playback time indication while the content is played back at the second respective content playback speed. 12. The method of claim 1, further comprising:
while displaying the one or more playback time indications in the scrubber bar, determining that one or more relative time criteria for displaying one or more second playback time indications in the scrubber bar are satisfied, wherein the one or more second playback time indications include time values based on relative content time; and in response to determining that the one or more relative time criteria are satisfied, displaying, in the scrubber bar, the one or more second playback time indications. 13. The method of claim 12, wherein:
the one or more second playback time indications are relative to a start position in the content. 14. The method of claim 12, wherein the one or more relative time criteria are satisfied when a predetermined amount of time has elapsed since the scrubber bar was displayed on the display. 15. The method of claim 12, wherein the one or more relative time criteria are satisfied when, while displaying the scrubber bar and the one or more playback time indications on the display, an input for initiating a scrubbing mode on the electronic device is received, the method further comprising:
while displaying the one or more second playback time indications in the scrubber bar and while the electronic device is in the scrubbing mode, receiving an input for scrubbing through the content; and in response to receiving the input for scrubbing through the content, updating the one or more second playback time indications in accordance with the input for scrubbing through the content. 16. The method of claim 15, wherein the scrubber bar, while the electronic device is in the scrubbing mode, concurrently includes:
the one or more playback time indications, and the one or more second playback time indications. 17. The method of claim 15, wherein the scrubber bar, while the electronic device is in the scrubbing mode, includes the one or more second playback time indications, but not the one or more playback time indications. 18. The method of claim 15, further comprising:
while the electronic device is in the scrubbing mode, receiving an input, at the one or more input devices, for exiting from the scrubbing mode; and in response to receiving the input for exiting the scrubbing mode, displaying, on the display, the scrubber bar with the one or more playback time indications, and without the one or more second playback time indications. 19. The method of claim 1, further comprising:
while the content is paused on the electronic device and the scrubber bar and the respective playback time indication are displayed on the display, updating the respective playback time indication in accordance with an advance of the time of day at the electronic device. 20. The method of claim 1, further comprising:
while playing the content on the electronic device and while displaying the scrubber bar and the respective playback time indication on the display, detecting a change in content playback speed of the content; and in response to detecting the change in the content playback speed of the content, updating the respective playback time indication by an amount that is larger than an amount of content that has been played through at the changed content playback speed. 21. The method of claim 1, further comprising:
while displaying the scrubber bar on the display, detecting an input, at a touch-sensitive surface of the one or more input devices, that corresponds to a request to display a plurality of visual indications of different actions accessible from the touch-sensitive surface; in response to detecting the input that corresponds to the request to display the plurality of visual indications of the different actions accessible from the touch-sensitive surface, displaying, on the display, the plurality of visual indications; while displaying the plurality of visual indications that correspond to the different actions accessible from the touch-sensitive surface, detecting further input on the touch-sensitive surface that indicates potential selection of a respective visual indication of the plurality of visual indications, the visual indication corresponding to a respective action of the different actions; and in response to detecting the further input, altering an appearance of the respective visual indication with respect to appearances of others of the plurality of visual indications. 22. The method of claim 21, further comprising:
while the potential selection of the respective visual indication is indicated, receiving an input, at the touch-sensitive surface of the one or more input devices, selecting the visual indication; and in response to receiving the input selecting the visual indication, performing the respective action corresponding to the respective visual indication at the electronic device. 23. An electronic device, comprising:
one or more processors in communication with a display and one or more input devices; 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: displaying, on the display, a playback user interface that is configured to playback content on the electronic device; and while displaying the playback user interface that is configured to playback the content on the electronic device, displaying, on the display, a scrubber bar for navigating through the content, wherein the scrubber bar includes:
a visual indication of a current playback position within the content; and
one or more playback time indications that include time values based on the current playback position within the content, wherein a respective playback time indication of the one or more playback time indications is based on:
a time of day at the electronic device, and
an amount of time that it will take to play the content from the current playback position to an end of the content at a respective content playback speed. 24. A non-transitory computer readable storage medium storing one or more programs, the one or more programs comprising instructions, which when executed by one or more processors of an electronic device in communication with a display device and one or more input devices, cause the electronic device to:
display, on the display, a playback user interface that is configured to playback content on the electronic device; and while displaying the playback user interface that is configured to playback the content on the electronic device, display, on the display, a scrubber bar for navigating through the content, wherein the scrubber bar includes:
a visual indication of a current playback position within the content; and
one or more playback time indications that include time values based on the current playback position within the content, wherein a respective playback time indication of the one or more playback time indications is based on:
a time of day at the electronic device, and
an amount of time that it will take to play the content from the current playback position to an end of the content at a respective content playback speed. | In some embodiments, an electronic device displays a playback user interface that is configured to playback content on the electronic device. While displaying the playback user interface that is configured to playback the content on the electronic device, the electronic device displays a scrubber bar for navigating through the content, wherein the scrubber bar includes: a visual indication of a current playback position within the content; and one or more playback time indications that include time values based on the current playback position within the content. A respective playback time indication of the one or more playback time indications is based on a time of day at the electronic device, and an amount of time that it will take to play the content from the current playback position to an end of the content at a respective content playback speed.1. A method comprising:
at an electronic device that is in communication with a display and one or more input devices:
displaying, on the display, a playback user interface that is configured to playback content on the electronic device; and
while displaying the playback user interface that is configured to playback the content on the electronic device, displaying, on the display, a scrubber bar for navigating through the content, wherein the scrubber bar includes:
a visual indication of a current playback position within the content; and
one or more playback time indications that include time values based on the current playback position within the content, wherein a respective playback time indication of the one or more playback time indications is based on:
a time of day at the electronic device, and
an amount of time that it will take to play the content from the current playback position to an end of the content at a respective content playback speed. 2. The method of claim 1, wherein the respective content playback speed that is used to determine the amount of time it will take to play the content from the current playback position is selected based on a playback state of the content. 3. The method of claim 1, wherein the respective playback time indication is expressed as a future time of day at which the end of the content will be reached at the respective content playback speed. 4. The method of claim 1, further comprising:
prior to displaying the scrubber bar on the display, receiving an input, at the one or more input devices, to display the scrubber bar while the playback user interface is displayed on the display; and in response to receiving the input, displaying the scrubber bar on the display. 5. The method of claim 1, wherein the one or more playback time indications include a second respective playback time indication displayed at the visual indication of the current playback position within the content, the second respective playback time indication displaying a current time of day at the electronic device. 6. The method of claim 5, further comprising:
while displaying the scrubber bar and the second respective playback time indication on the display, receiving an input, at the one or more input devices, for scrubbing through the content; and in response to receiving the input for scrubbing through the content:
updating the current playback position within the content, including updating a location of the visual indication of the current playback position within the scrubber bar, in accordance with the input for scrubbing through the content; and
updating the second respective playback time indication in accordance with an advance of the time of day at the electronic device. 7. The method of claim 5, further comprising:
while displaying the scrubber bar and the second respective playback time indication on the display, playing the content at a second respective content playback speed; and while playing the content at the second respective content playback speed:
updating the current playback position within the content, including updating a location of the visual indication of the current playback position within the scrubber bar, in accordance with playback progression through the content at the second respective content playback speed; and
updating the second respective playback time indication in accordance with an advance of the time of day at the electronic device. 8. The method of claim 5, wherein a location of the second respective playback time indication on the display moves in accordance with movement of the visual indication of the current playback position within the content as the current playback position within the content is changed. 9. The method of claim 1, wherein the respective playback time indication is displayed at an end of the scrubber bar that corresponds to the end of the content, and the respective playback time indication displays a time of day at the electronic device at which the playback of the content will end at the respective content playback speed. 10. The method of claim 9, further comprising:
while displaying the scrubber bar and the respective playback time indication on the display, receiving an input, at the one or more input devices, for scrubbing through the content; and in response to receiving the input for scrubbing through the content:
updating the current playback position within the content, including updating a location of the visual indication of the current playback position within the scrubber bar, in accordance with the input for scrubbing through the content; and
updating the respective playback time indication in accordance with the updated current playback position within the content, the updated respective playback time indication displaying an updated time of day at the electronic device at which the playback of the content will end, starting from the updated current playback position within the content, at the respective content playback speed. 11. The method of claim 9, further comprising:
while displaying the scrubber bar and the respective playback time indication on the display, playing the content at a second respective content playback speed; and while playing the content at the second respective content playback speed:
updating the current playback position within the content, including updating a location of the visual indication of the current playback position within the scrubber bar, in accordance with playback progression through the content at the second respective content playback speed; and
maintaining the respective playback time indication while the content is played back at the second respective content playback speed. 12. The method of claim 1, further comprising:
while displaying the one or more playback time indications in the scrubber bar, determining that one or more relative time criteria for displaying one or more second playback time indications in the scrubber bar are satisfied, wherein the one or more second playback time indications include time values based on relative content time; and in response to determining that the one or more relative time criteria are satisfied, displaying, in the scrubber bar, the one or more second playback time indications. 13. The method of claim 12, wherein:
the one or more second playback time indications are relative to a start position in the content. 14. The method of claim 12, wherein the one or more relative time criteria are satisfied when a predetermined amount of time has elapsed since the scrubber bar was displayed on the display. 15. The method of claim 12, wherein the one or more relative time criteria are satisfied when, while displaying the scrubber bar and the one or more playback time indications on the display, an input for initiating a scrubbing mode on the electronic device is received, the method further comprising:
while displaying the one or more second playback time indications in the scrubber bar and while the electronic device is in the scrubbing mode, receiving an input for scrubbing through the content; and in response to receiving the input for scrubbing through the content, updating the one or more second playback time indications in accordance with the input for scrubbing through the content. 16. The method of claim 15, wherein the scrubber bar, while the electronic device is in the scrubbing mode, concurrently includes:
the one or more playback time indications, and the one or more second playback time indications. 17. The method of claim 15, wherein the scrubber bar, while the electronic device is in the scrubbing mode, includes the one or more second playback time indications, but not the one or more playback time indications. 18. The method of claim 15, further comprising:
while the electronic device is in the scrubbing mode, receiving an input, at the one or more input devices, for exiting from the scrubbing mode; and in response to receiving the input for exiting the scrubbing mode, displaying, on the display, the scrubber bar with the one or more playback time indications, and without the one or more second playback time indications. 19. The method of claim 1, further comprising:
while the content is paused on the electronic device and the scrubber bar and the respective playback time indication are displayed on the display, updating the respective playback time indication in accordance with an advance of the time of day at the electronic device. 20. The method of claim 1, further comprising:
while playing the content on the electronic device and while displaying the scrubber bar and the respective playback time indication on the display, detecting a change in content playback speed of the content; and in response to detecting the change in the content playback speed of the content, updating the respective playback time indication by an amount that is larger than an amount of content that has been played through at the changed content playback speed. 21. The method of claim 1, further comprising:
while displaying the scrubber bar on the display, detecting an input, at a touch-sensitive surface of the one or more input devices, that corresponds to a request to display a plurality of visual indications of different actions accessible from the touch-sensitive surface; in response to detecting the input that corresponds to the request to display the plurality of visual indications of the different actions accessible from the touch-sensitive surface, displaying, on the display, the plurality of visual indications; while displaying the plurality of visual indications that correspond to the different actions accessible from the touch-sensitive surface, detecting further input on the touch-sensitive surface that indicates potential selection of a respective visual indication of the plurality of visual indications, the visual indication corresponding to a respective action of the different actions; and in response to detecting the further input, altering an appearance of the respective visual indication with respect to appearances of others of the plurality of visual indications. 22. The method of claim 21, further comprising:
while the potential selection of the respective visual indication is indicated, receiving an input, at the touch-sensitive surface of the one or more input devices, selecting the visual indication; and in response to receiving the input selecting the visual indication, performing the respective action corresponding to the respective visual indication at the electronic device. 23. An electronic device, comprising:
one or more processors in communication with a display and one or more input devices; 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: displaying, on the display, a playback user interface that is configured to playback content on the electronic device; and while displaying the playback user interface that is configured to playback the content on the electronic device, displaying, on the display, a scrubber bar for navigating through the content, wherein the scrubber bar includes:
a visual indication of a current playback position within the content; and
one or more playback time indications that include time values based on the current playback position within the content, wherein a respective playback time indication of the one or more playback time indications is based on:
a time of day at the electronic device, and
an amount of time that it will take to play the content from the current playback position to an end of the content at a respective content playback speed. 24. A non-transitory computer readable storage medium storing one or more programs, the one or more programs comprising instructions, which when executed by one or more processors of an electronic device in communication with a display device and one or more input devices, cause the electronic device to:
display, on the display, a playback user interface that is configured to playback content on the electronic device; and while displaying the playback user interface that is configured to playback the content on the electronic device, display, on the display, a scrubber bar for navigating through the content, wherein the scrubber bar includes:
a visual indication of a current playback position within the content; and
one or more playback time indications that include time values based on the current playback position within the content, wherein a respective playback time indication of the one or more playback time indications is based on:
a time of day at the electronic device, and
an amount of time that it will take to play the content from the current playback position to an end of the content at a respective content playback speed. | 2,100 |
5,397 | 5,397 | 14,475,463 | 2,144 | Document tags are rapidly indexed using a text based index and a graph index. A tag signal is received. A tag and a type of the tag that are located in the tag signal are stored in a data store. The tag is indexed as a tag document in the text based index. One or more relationships between the tag and a content document are managed in the graph index. | 1. A method executed on a computing device to rapidly index document tags, the method comprising:
receiving a tag signal; storing a tag and a type of the tag that are located in the tag signal, in a data store; indexing the tag as a tag document; and managing one or more relationships between the tag and a content document. 2. The method of claim 1, further comprising:
retrieving the tag from the data store in response to one or more from a set of: a corruption of an index associated with the tag, a maintenance event that prevented indexing of the tag, and the content document referenced in the tag signal appearing in a full text index; and re-indexing the tag as the tag document. 3. The method of claim 1, further comprising:
in response to a detection that the type is an add type, initiating an action to add the tag into a text based index and a graph index. 4. The method of claim 1, further comprising:
in response to a detection that the type is a delete type, initiating an action to delete the tag from a text based index and a graph index. 5. The method of claim 1, further comprising:
executing a text query to locate the tag in a text based index. 6. The method of claim 6, further comprising:
in response to a detection of the tag in the text based index, searching the text based index for the content document associated with the tag. 7. The method of claim 6, further comprising:
in response to a failure to detect the tag in the text based index, storing the tag as the tag document in the text based index. 8. The method of claim 1, further comprising:
searching a text based index for the content document associated with the tag. 9. The method of claim 8, further comprising:
in response to a detection of the content document in the text based index, storing a relationship between the tag and the content document as an edge in a graph index for the tag type that is an add type. 10. The method of claim 8, further comprising:
in response to a detection of the content document in the text based index, removing a relationship between the tag and the content document as an edge in a graph index for the tag type that is a delete type. 11. The method of claim 1, further comprising:
in response to a failure to detect the content document in the text based index, waiting for the content document to appear in the text based index. 12. A computing device to rapidly index document tags, the computing device comprising:
a memory; a processor coupled to the memory, the processor executing a search service in conjunction with instructions stored in the memory, wherein the search service is configured to:
receive a tag signal;
store a tag and a type of the tag that are located in the tag signal, in a data store;
index the tag as a tag document in a text based index; and
manage one or more relationships between the tag and a content document. 13. The computing device of claim 12, wherein the search service is further configured to:
retrieve a unique identifier for the tag from the text based index; and construct a tag uniform resource locator (URL) for the tag using the unique identifier. 14. The computing device of claim 13, wherein the search service is further configured to:
store the tag document with the tag URL in the text based index to distinguish the tag document from the content document. 15. The computing device of claim 12, wherein the search service is further configured to:
detect the tag type as an add tag type; and add a “taggeddoc” edge into a graph index to establish a relationship describing the tag used to tag the document. 16. The computing device of claim 12, wherein the search service is further configured to:
detect the tag type as a delete tag type; and delete a “taggeddoc” edge from a graph index to remove a relationship describing the tag used to tag the document. 17. The computing device of claim 12, wherein the search service is further configured to:
in response to a detection that the tag type is an add tag type, add a “taggedwith” edge into a graph index to establish a relationship describing the document as tagged with the tag; and in response to a detection that the tag type is a delete tag type, delete another “taggedwith” edge from a graph index to remove another relationship describing the document as tagged with the tag. 18. A computer-readable memory device with instructions stored thereon to rapidly index document tags, the instructions comprising:
receiving a tag signal; storing a tag and a type of the tag that are located in the tag signal, in a data store, wherein the tag type is one from a set of: an add tag type and a delete tag type; indexing the tag as a tag document in a text based index; and managing one or more relationships between the tag and a content document. 19. The computer-readable memory device of claim 18, wherein the instructions further comprise:
retrieving a unique identifier for the tag from the text based index; constructing a tag uniform resource locator (URL) for the tag using the unique identifier; and storing the tag document with the tag URL in the text based index to distinguish the tag document from the content document. 20. The computer-readable memory device of claim 18, wherein the instructions further comprise:
detecting the tag type as the add tag type; adding a “taggeddoc” edge into a graph index to establish a relationship describing the tag used to tag the document; and adding a “taggedwith” edge into the graph index to establish another relationship describing the document as tagged with the tag. | Document tags are rapidly indexed using a text based index and a graph index. A tag signal is received. A tag and a type of the tag that are located in the tag signal are stored in a data store. The tag is indexed as a tag document in the text based index. One or more relationships between the tag and a content document are managed in the graph index.1. A method executed on a computing device to rapidly index document tags, the method comprising:
receiving a tag signal; storing a tag and a type of the tag that are located in the tag signal, in a data store; indexing the tag as a tag document; and managing one or more relationships between the tag and a content document. 2. The method of claim 1, further comprising:
retrieving the tag from the data store in response to one or more from a set of: a corruption of an index associated with the tag, a maintenance event that prevented indexing of the tag, and the content document referenced in the tag signal appearing in a full text index; and re-indexing the tag as the tag document. 3. The method of claim 1, further comprising:
in response to a detection that the type is an add type, initiating an action to add the tag into a text based index and a graph index. 4. The method of claim 1, further comprising:
in response to a detection that the type is a delete type, initiating an action to delete the tag from a text based index and a graph index. 5. The method of claim 1, further comprising:
executing a text query to locate the tag in a text based index. 6. The method of claim 6, further comprising:
in response to a detection of the tag in the text based index, searching the text based index for the content document associated with the tag. 7. The method of claim 6, further comprising:
in response to a failure to detect the tag in the text based index, storing the tag as the tag document in the text based index. 8. The method of claim 1, further comprising:
searching a text based index for the content document associated with the tag. 9. The method of claim 8, further comprising:
in response to a detection of the content document in the text based index, storing a relationship between the tag and the content document as an edge in a graph index for the tag type that is an add type. 10. The method of claim 8, further comprising:
in response to a detection of the content document in the text based index, removing a relationship between the tag and the content document as an edge in a graph index for the tag type that is a delete type. 11. The method of claim 1, further comprising:
in response to a failure to detect the content document in the text based index, waiting for the content document to appear in the text based index. 12. A computing device to rapidly index document tags, the computing device comprising:
a memory; a processor coupled to the memory, the processor executing a search service in conjunction with instructions stored in the memory, wherein the search service is configured to:
receive a tag signal;
store a tag and a type of the tag that are located in the tag signal, in a data store;
index the tag as a tag document in a text based index; and
manage one or more relationships between the tag and a content document. 13. The computing device of claim 12, wherein the search service is further configured to:
retrieve a unique identifier for the tag from the text based index; and construct a tag uniform resource locator (URL) for the tag using the unique identifier. 14. The computing device of claim 13, wherein the search service is further configured to:
store the tag document with the tag URL in the text based index to distinguish the tag document from the content document. 15. The computing device of claim 12, wherein the search service is further configured to:
detect the tag type as an add tag type; and add a “taggeddoc” edge into a graph index to establish a relationship describing the tag used to tag the document. 16. The computing device of claim 12, wherein the search service is further configured to:
detect the tag type as a delete tag type; and delete a “taggeddoc” edge from a graph index to remove a relationship describing the tag used to tag the document. 17. The computing device of claim 12, wherein the search service is further configured to:
in response to a detection that the tag type is an add tag type, add a “taggedwith” edge into a graph index to establish a relationship describing the document as tagged with the tag; and in response to a detection that the tag type is a delete tag type, delete another “taggedwith” edge from a graph index to remove another relationship describing the document as tagged with the tag. 18. A computer-readable memory device with instructions stored thereon to rapidly index document tags, the instructions comprising:
receiving a tag signal; storing a tag and a type of the tag that are located in the tag signal, in a data store, wherein the tag type is one from a set of: an add tag type and a delete tag type; indexing the tag as a tag document in a text based index; and managing one or more relationships between the tag and a content document. 19. The computer-readable memory device of claim 18, wherein the instructions further comprise:
retrieving a unique identifier for the tag from the text based index; constructing a tag uniform resource locator (URL) for the tag using the unique identifier; and storing the tag document with the tag URL in the text based index to distinguish the tag document from the content document. 20. The computer-readable memory device of claim 18, wherein the instructions further comprise:
detecting the tag type as the add tag type; adding a “taggeddoc” edge into a graph index to establish a relationship describing the tag used to tag the document; and adding a “taggedwith” edge into the graph index to establish another relationship describing the document as tagged with the tag. | 2,100 |
5,398 | 5,398 | 13,308,456 | 2,174 | Multiple applications may execute on a computing device and the computing system may monitor the multiple applications, identify a set e applications generating sound and determine whether at least one sound related criterion is satisfied. If at least one sound related criterion is satisfied, the computing system displays sound indicators for the set of applications generating sound. | 1. A computer-implemented method comprising:
monitoring, by a processor, a plurality of applications executing on a computing system; monitoring a set of the plurality of applications which are generating sound; determining whether at least one sound-related criterion is satisfied; and if at least one sound related criterion is satisfied, displaying sound indicators for the applications in the set, each sound indicator allowing a user to control sound generated by a corresponding application. 2. The computer-implemented of claim 1, wherein the sound indicators are displayed in one or more of:
one or more windows associated with the set of the plurality of applications; one or more minimized windows associated with the set of the plurality of applications, wherein the one or more minimized windows are displayed in a taskbar; an application menu listing the set of the plurality of applications; an application group listing the set of the plurality of applications; an entry in a list of virtual machines; one or more workspaces containing set of the plurality of applications; and an application switcher listing the set of the plurality of applications. 3. The computer-implemented method of claim 1, wherein the sound indicator comprises at least one of an image and an animation. 4. The computer-implemented method of claim 1, wherein the at least one sound-related criterion is satisfied if user input for sound related controls is received. 5. The computer-implemented method of claim 4, wherein the sound related controls comprise a volume controller for the computing system. 6. The computer-implemented method of claim 1, wherein the at least one sound-related criterion is satisfied if a volume level of the computing system is not on mute. 7. The computer-implemented method of claim 2, wherein the taskbar displays one or more window previews associated with the set of the plurality of applications, and wherein the sound indicators are also displayed in the one or more window previews. 8. The computer-implemented method of claim 2, wherein the application switcher displays one or more window previews associated with the set of the plurality of applications, and wherein the sound indicators are also displayed in the one or more window previews. 9. The computer-implemented method of claim 1, wherein the monitoring is performed by an operating system. 10. The computer-implemented method of claim 2, wherein at least one of the one or more windows associated with the set of the plurality of applications comprises one or more tabs, and wherein at least one sound indicator is displayed in at least one of the one or more tabs. 11. An apparatus comprising:
a memory to store data; a processor coupled to the memory; a sound monitoring tool, executable by the processor, to monitor a plurality of applications executing on a computing system; an application identification tool, coupled to the sound monitoring tool and executable by the processor, to monitor a set of the plurality of applications which are generating sound; a sound criteria tool, coupled to the application identification tool and executable by the processor, to determine whether at least one sound-related criterion is satisfied; and a sound indicator generator, coupled to the sound criteria tool and executable by the processor, to display sound indicators for the applications in the set if at least one sound related criterion is satisfied, each sound indicator allowing a user to control sound generated by a corresponding application. 12. The apparatus of claim 11, wherein the sound indicators are displayed in one or more of:
one or more windows associated with the set of the plurality of the applications; one or more minimized windows associated with the set of the plurality of applications, wherein the one or more minimized windows are displayed in a taskbar; an application menu listing the set of the plurality of applications; an application group listing the set of the plurality of applications; an entry in a list of virtual machines; one or more workspaces containing the set of the plurality of applications; and an application switcher listing the set of the plurality of applications. 13. The apparatus of claim 11, wherein the sound indicator comprises at least one of an image and an animation. 14. The apparatus of claim 11, wherein the at least one sound-related criterion is satisfied if user input for sound related controls is received. 15. The apparatus of claim 14, wherein the sound related controls comprise a volume controller for the computing system. 16. The apparatus of claim 11, wherein the at least one sound-related criterion is satisfied if a volume level of the computing system is not on mute. 17. The apparatus of claim 12, wherein the taskbar displays one or more window previews associated with set of the plurality of applications, and wherein the sound indicators are also displayed in the one or more window previews. 18. The apparatus of claim 12, wherein the application switcher displays one or more window previews associated with set of the plurality of applications, and wherein the sound indicators are also displayed in the one or more window previews. 19. The apparatus of claim 11, wherein one or more of the sound monitoring tool, the application identification tool, the sound criteria tool, and the sound indicator generator is part of an operating system. 20. The apparatus of claim 12, wherein at least one of the one or more windows associated with the set of the plurality of applications comprises one or more tabs, and wherein at least one sound indicator is displayed in at least one of the one or more tabs. 21. A non-transitory computer readable storage medium including instructions that, when executed by a processor, cause the processor to perform a method comprising:
monitoring, by a processor, a plurality of applications executing on a computing system; monitoring a set of the plurality of applications which are generating sound; determining whether at least one sound-related criterion is satisfied; and if at least one sound related criterion is satisfied, displaying sound indicators for the applications in the set, each sound indicator allowing a user to control sound generated by a corresponding application. 22. The non-transitory computer readable storage medium of claim 21, wherein the sound indicators are displayed in one or more of:
one or more windows associated with the set of the plurality of applications; one or more minimized windows associated with set of the plurality of applications, wherein the one or more minimized windows are displayed in a taskbar; an application menu listing the set of the plurality of applications; an application group listing the set of the plurality of applications; an entry in a list of virtual machines; one or more workspaces containing the set of the plurality of applications; and an application switcher listing the set of the plurality of applications. 23. The non-transitory computer readable storage medium of claim 21, wherein the sound indicator comprises at least one of an image and an animation. 24. The non-transitory computer readable storage medium of claim 21, wherein the at least one sound-related criterion is satisfied if user input for sound related controls is received. 25. The non-transitory computer readable storage medium of claim 24, wherein the sound related controls comprise a volume controller for the computing system. 26. The non-transitory computer readable storage medium of claim 21, wherein the at least one sound-related criterion is satisfied if a volume level of the computing system is not on mute. 27. The non-transitory computer readable storage medium of claim 22, wherein the taskbar displays one or more window previews associated with the set of the plurality of applications, and wherein the sound indicators are also displayed in the one or more window previews. 28. The non-transitory computer readable storage medium of claim 22, wherein the application switcher displays one or more window previews associated with the set of the plurality of applications, and wherein the sound indicators are also displayed in the one or more window previews. 29. The non-transitory computer readable storage medium of claim 21, wherein the monitoring is performed by an operating system. 30. The non-transitory computer readable storage medium of claim 22, wherein at least one of the one or more windows associated with set of the plurality of applications comprises one or more tabs, and wherein at least one sound indicator is displayed in at least one of the one or more tabs. | Multiple applications may execute on a computing device and the computing system may monitor the multiple applications, identify a set e applications generating sound and determine whether at least one sound related criterion is satisfied. If at least one sound related criterion is satisfied, the computing system displays sound indicators for the set of applications generating sound.1. A computer-implemented method comprising:
monitoring, by a processor, a plurality of applications executing on a computing system; monitoring a set of the plurality of applications which are generating sound; determining whether at least one sound-related criterion is satisfied; and if at least one sound related criterion is satisfied, displaying sound indicators for the applications in the set, each sound indicator allowing a user to control sound generated by a corresponding application. 2. The computer-implemented of claim 1, wherein the sound indicators are displayed in one or more of:
one or more windows associated with the set of the plurality of applications; one or more minimized windows associated with the set of the plurality of applications, wherein the one or more minimized windows are displayed in a taskbar; an application menu listing the set of the plurality of applications; an application group listing the set of the plurality of applications; an entry in a list of virtual machines; one or more workspaces containing set of the plurality of applications; and an application switcher listing the set of the plurality of applications. 3. The computer-implemented method of claim 1, wherein the sound indicator comprises at least one of an image and an animation. 4. The computer-implemented method of claim 1, wherein the at least one sound-related criterion is satisfied if user input for sound related controls is received. 5. The computer-implemented method of claim 4, wherein the sound related controls comprise a volume controller for the computing system. 6. The computer-implemented method of claim 1, wherein the at least one sound-related criterion is satisfied if a volume level of the computing system is not on mute. 7. The computer-implemented method of claim 2, wherein the taskbar displays one or more window previews associated with the set of the plurality of applications, and wherein the sound indicators are also displayed in the one or more window previews. 8. The computer-implemented method of claim 2, wherein the application switcher displays one or more window previews associated with the set of the plurality of applications, and wherein the sound indicators are also displayed in the one or more window previews. 9. The computer-implemented method of claim 1, wherein the monitoring is performed by an operating system. 10. The computer-implemented method of claim 2, wherein at least one of the one or more windows associated with the set of the plurality of applications comprises one or more tabs, and wherein at least one sound indicator is displayed in at least one of the one or more tabs. 11. An apparatus comprising:
a memory to store data; a processor coupled to the memory; a sound monitoring tool, executable by the processor, to monitor a plurality of applications executing on a computing system; an application identification tool, coupled to the sound monitoring tool and executable by the processor, to monitor a set of the plurality of applications which are generating sound; a sound criteria tool, coupled to the application identification tool and executable by the processor, to determine whether at least one sound-related criterion is satisfied; and a sound indicator generator, coupled to the sound criteria tool and executable by the processor, to display sound indicators for the applications in the set if at least one sound related criterion is satisfied, each sound indicator allowing a user to control sound generated by a corresponding application. 12. The apparatus of claim 11, wherein the sound indicators are displayed in one or more of:
one or more windows associated with the set of the plurality of the applications; one or more minimized windows associated with the set of the plurality of applications, wherein the one or more minimized windows are displayed in a taskbar; an application menu listing the set of the plurality of applications; an application group listing the set of the plurality of applications; an entry in a list of virtual machines; one or more workspaces containing the set of the plurality of applications; and an application switcher listing the set of the plurality of applications. 13. The apparatus of claim 11, wherein the sound indicator comprises at least one of an image and an animation. 14. The apparatus of claim 11, wherein the at least one sound-related criterion is satisfied if user input for sound related controls is received. 15. The apparatus of claim 14, wherein the sound related controls comprise a volume controller for the computing system. 16. The apparatus of claim 11, wherein the at least one sound-related criterion is satisfied if a volume level of the computing system is not on mute. 17. The apparatus of claim 12, wherein the taskbar displays one or more window previews associated with set of the plurality of applications, and wherein the sound indicators are also displayed in the one or more window previews. 18. The apparatus of claim 12, wherein the application switcher displays one or more window previews associated with set of the plurality of applications, and wherein the sound indicators are also displayed in the one or more window previews. 19. The apparatus of claim 11, wherein one or more of the sound monitoring tool, the application identification tool, the sound criteria tool, and the sound indicator generator is part of an operating system. 20. The apparatus of claim 12, wherein at least one of the one or more windows associated with the set of the plurality of applications comprises one or more tabs, and wherein at least one sound indicator is displayed in at least one of the one or more tabs. 21. A non-transitory computer readable storage medium including instructions that, when executed by a processor, cause the processor to perform a method comprising:
monitoring, by a processor, a plurality of applications executing on a computing system; monitoring a set of the plurality of applications which are generating sound; determining whether at least one sound-related criterion is satisfied; and if at least one sound related criterion is satisfied, displaying sound indicators for the applications in the set, each sound indicator allowing a user to control sound generated by a corresponding application. 22. The non-transitory computer readable storage medium of claim 21, wherein the sound indicators are displayed in one or more of:
one or more windows associated with the set of the plurality of applications; one or more minimized windows associated with set of the plurality of applications, wherein the one or more minimized windows are displayed in a taskbar; an application menu listing the set of the plurality of applications; an application group listing the set of the plurality of applications; an entry in a list of virtual machines; one or more workspaces containing the set of the plurality of applications; and an application switcher listing the set of the plurality of applications. 23. The non-transitory computer readable storage medium of claim 21, wherein the sound indicator comprises at least one of an image and an animation. 24. The non-transitory computer readable storage medium of claim 21, wherein the at least one sound-related criterion is satisfied if user input for sound related controls is received. 25. The non-transitory computer readable storage medium of claim 24, wherein the sound related controls comprise a volume controller for the computing system. 26. The non-transitory computer readable storage medium of claim 21, wherein the at least one sound-related criterion is satisfied if a volume level of the computing system is not on mute. 27. The non-transitory computer readable storage medium of claim 22, wherein the taskbar displays one or more window previews associated with the set of the plurality of applications, and wherein the sound indicators are also displayed in the one or more window previews. 28. The non-transitory computer readable storage medium of claim 22, wherein the application switcher displays one or more window previews associated with the set of the plurality of applications, and wherein the sound indicators are also displayed in the one or more window previews. 29. The non-transitory computer readable storage medium of claim 21, wherein the monitoring is performed by an operating system. 30. The non-transitory computer readable storage medium of claim 22, wherein at least one of the one or more windows associated with set of the plurality of applications comprises one or more tabs, and wherein at least one sound indicator is displayed in at least one of the one or more tabs. | 2,100 |
5,399 | 5,399 | 14,449,517 | 2,153 | Certain example embodiments relate to a computer system for performing a map reduce sequence. Nodes therein include at least one processor and memory and are divided into at least mapper and reducer nodes. Each mapper node executes a map function on input to generate intermediate output elements. Each said intermediate output element includes a first key-value pair. Each element key includes associated map and reduce task identifiers. Each element value includes substantive data, organized as another key-value pair. The intermediate output elements are stored to memory. Each reducer node: retrieves at least intermediate output element values from the memory of a given mapper node, using specified map and reduce task identifiers; stores the retrieved element values to its memory; executes a reduce function on the retrieved element values, in order; and outputs a result from the reduce function for the map reduce sequence. Disk operations advantageously are reduced or eliminated. | 1. A method of performing a map reduce sequence in connection with a plurality of computer nodes in a distributed network system, each said node including at least one processor and a transitory computer readable storage medium, wherein the nodes are divided into at least mapper nodes and reducer nodes, the method comprising:
at each said mapper node,
executing, using the at least one processor of the respective mapper node, a map function on input to generate intermediate output elements, each said intermediate output element including a first key-value pair, each intermediate output element key including an associated map task identifier and an associated reduce task identifier, and each intermediate output element value including substantive data generated from the input by the map function, and
storing the intermediate output elements to the transitory computer readable storage medium of the respective mapper node;
wherein each said reducer node is configured to, upon receipt of electronic instructions:
retrieve at least intermediate output element values from the transitory computer readable storage media of a given mapper node, based on map task and reduce task identifiers specified by the electronic instructions,
store the retrieved intermediate output element values to the transitory computer readable storage medium of the respective reducer node,
execute a reduce function, using the at least one processor of the respective reducer node, on the retrieved intermediate output element values, in order, and
output a result from the reduce function for the map reduce sequence. 2. The method of claim 1, wherein the substantive data of each intermediate output element is organized as a second key-value pair. 3. The method of claim 1, wherein the transitory computer readable storage medium of each said node is controlled by an in-memory data grid (IMDG) client. 4. The method of claim 3, further comprising replicating intermediate output elements at an in-memory data grid (IMDG) server. 5. The method of claim 4, wherein the reducer nodes are further configured to retrieve intermediate output element values from the IMDG server in response to the given node from which the intermediate output element values are to be retrieved being inaccessible. 6. The method of claim 1, wherein the map task identifiers and reduce task identifiers are serialized. 7. The method of claim 1, further comprising:
holding the intermediate output elements in memory of the mapper nodes on which they reside; and preventing the intermediate output elements from spilling to non-transitory computer readable storage media. 8. The method of claim 7, wherein the memory is off-heap memory. 9. The method of claim 1, wherein the reducer nodes are further configured to execute reduce functions once all intermediate output element values have been retrieved. 10. The method of claim 1, wherein the reducer nodes are further configured to execute reduce functions once intermediate output element values have been retrieved and sorted. 11. The method of claim 10, wherein the output element values are sortable via a merge sort. 12. The method of claim 1, wherein shuffle and sort map reduce operations are performed on reducer nodes. 13. A method of performing a map reduce sequence in connection with a plurality of computer nodes in a distributed network system, each said node including at least one processor and both transitory and non-transitory computer readable storage media, wherein the nodes are divided into at least mapper nodes and reducer nodes, the method comprising at each said mapper node:
executing, using the at least one processor of the respective mapper node, a map function on input to generate intermediate output elements, each said intermediate output element including a first key-value pair, each intermediate output element key including an associated map task identifier and an associated reduce task identifier, and each intermediate output element value including substantive data generated from the input by the map function, wherein the substantive data of each intermediate output element is organized as a second key-value pair; storing the intermediate output elements to the transitory computer readable storage medium of the respective mapper node; holding the intermediate output elements in memory of the respective mapper node; and preventing the intermediate output elements from spilling to the non-transitory computer readable storage media of the respective mapper node. 14. The method of claim 13, wherein key objects are serializable. 15. A method of performing a map reduce sequence in connection with a plurality of computer nodes in a distributed network system, each said node including at least one processor and both transitory and non-transitory computer readable storage media, wherein the nodes are divided into at least mapper nodes and reducer nodes, the method comprising at each said reducer node:
retrieving at least intermediate output element values from the transitory computer readable storage media of a given mapper node, based on map task and reduce task identifiers specified by electronic instructions received at the respective reducer node; storing the retrieved intermediate output element values to the transitory computer readable storage medium of the respective reducer node; ordering the retrieved intermediate output element values; executing a reduce function, using the at least one processor of the respective reducer node, on the retrieved and ordered intermediate output element values; and outputting a result from the reduce function for the map reduce sequence, wherein each said intermediate output element includes a first key-value pair, each intermediate output element key includes an associated map task identifier and an associated reduce task identifier, and each intermediate output element value includes substantive data that is generated by a map reduce function and organized as a second key-value pair. 16. A computer system configured to perform a map reduce sequence, comprising:
a plurality of computer nodes, each said node including at least one processor and a transitory computer readable storage medium, wherein the nodes are divided into at least mapper nodes and reducer nodes; wherein each said mapper node is configured to:
execute, using the at least one processor of the respective mapper node, a map function on input to generate intermediate output elements, each said intermediate output element including a first key-value pair, each intermediate output element key including an associated map task identifier and an associated reduce task identifier, and each intermediate output element value including substantive data generated from the input by the map function, and
store the intermediate output elements to the transitory computer readable storage medium of the respective mapper node; and
wherein each said reducer node is configured to, upon receipt of electronic instructions:
retrieve at least intermediate output element values from the transitory computer readable storage media of a given mapper node, based on map task and reduce task identifiers specified by the electronic instructions,
store the retrieved intermediate output element values to the transitory computer readable storage medium of the respective reducer node,
execute a reduce function, using the at least one processor of the respective reducer node, on the retrieved intermediate output element values, in order, and
output a result from the reduce function for the map reduce sequence. 17. The system of claim 16, wherein the substantive data of each intermediate output element is organized as a second key-value pair. 18. The system of claim 17, wherein key objects are serializable. 19. The system of claim 16, wherein the transitory computer readable storage medium of each said node is controlled by an in-memory data grid (IMDG) client. 20. The system of claim 19, wherein:
each said mapper node is further configured to replicate intermediate output elements to an in-memory data grid (IMDG) server; and the reducer nodes are further configured to retrieve intermediate output element values from the IMDG server in response to the given node from which the intermediate output element values are to be retrieved being inaccessible. 21. The system of claim 16, wherein the mapper nodes are further configured to:
hold the intermediate output elements in memory; and prevent the intermediate output elements from spilling to non-transitory computer readable storage media. 22. The system of claim 21, wherein the memory is direct off-heap memory. 23. The system of claim 16, wherein the reducer nodes are further configured to execute reduce functions once intermediate output element values have been retrieved and sorted. 24. A non-transitory computer readable storage medium tangibly storing instructions that, when executed, perform the method of claim 13. 25. A non-transitory computer readable storage medium tangibly storing instructions that, when executed, perform the method of claim 15. | Certain example embodiments relate to a computer system for performing a map reduce sequence. Nodes therein include at least one processor and memory and are divided into at least mapper and reducer nodes. Each mapper node executes a map function on input to generate intermediate output elements. Each said intermediate output element includes a first key-value pair. Each element key includes associated map and reduce task identifiers. Each element value includes substantive data, organized as another key-value pair. The intermediate output elements are stored to memory. Each reducer node: retrieves at least intermediate output element values from the memory of a given mapper node, using specified map and reduce task identifiers; stores the retrieved element values to its memory; executes a reduce function on the retrieved element values, in order; and outputs a result from the reduce function for the map reduce sequence. Disk operations advantageously are reduced or eliminated.1. A method of performing a map reduce sequence in connection with a plurality of computer nodes in a distributed network system, each said node including at least one processor and a transitory computer readable storage medium, wherein the nodes are divided into at least mapper nodes and reducer nodes, the method comprising:
at each said mapper node,
executing, using the at least one processor of the respective mapper node, a map function on input to generate intermediate output elements, each said intermediate output element including a first key-value pair, each intermediate output element key including an associated map task identifier and an associated reduce task identifier, and each intermediate output element value including substantive data generated from the input by the map function, and
storing the intermediate output elements to the transitory computer readable storage medium of the respective mapper node;
wherein each said reducer node is configured to, upon receipt of electronic instructions:
retrieve at least intermediate output element values from the transitory computer readable storage media of a given mapper node, based on map task and reduce task identifiers specified by the electronic instructions,
store the retrieved intermediate output element values to the transitory computer readable storage medium of the respective reducer node,
execute a reduce function, using the at least one processor of the respective reducer node, on the retrieved intermediate output element values, in order, and
output a result from the reduce function for the map reduce sequence. 2. The method of claim 1, wherein the substantive data of each intermediate output element is organized as a second key-value pair. 3. The method of claim 1, wherein the transitory computer readable storage medium of each said node is controlled by an in-memory data grid (IMDG) client. 4. The method of claim 3, further comprising replicating intermediate output elements at an in-memory data grid (IMDG) server. 5. The method of claim 4, wherein the reducer nodes are further configured to retrieve intermediate output element values from the IMDG server in response to the given node from which the intermediate output element values are to be retrieved being inaccessible. 6. The method of claim 1, wherein the map task identifiers and reduce task identifiers are serialized. 7. The method of claim 1, further comprising:
holding the intermediate output elements in memory of the mapper nodes on which they reside; and preventing the intermediate output elements from spilling to non-transitory computer readable storage media. 8. The method of claim 7, wherein the memory is off-heap memory. 9. The method of claim 1, wherein the reducer nodes are further configured to execute reduce functions once all intermediate output element values have been retrieved. 10. The method of claim 1, wherein the reducer nodes are further configured to execute reduce functions once intermediate output element values have been retrieved and sorted. 11. The method of claim 10, wherein the output element values are sortable via a merge sort. 12. The method of claim 1, wherein shuffle and sort map reduce operations are performed on reducer nodes. 13. A method of performing a map reduce sequence in connection with a plurality of computer nodes in a distributed network system, each said node including at least one processor and both transitory and non-transitory computer readable storage media, wherein the nodes are divided into at least mapper nodes and reducer nodes, the method comprising at each said mapper node:
executing, using the at least one processor of the respective mapper node, a map function on input to generate intermediate output elements, each said intermediate output element including a first key-value pair, each intermediate output element key including an associated map task identifier and an associated reduce task identifier, and each intermediate output element value including substantive data generated from the input by the map function, wherein the substantive data of each intermediate output element is organized as a second key-value pair; storing the intermediate output elements to the transitory computer readable storage medium of the respective mapper node; holding the intermediate output elements in memory of the respective mapper node; and preventing the intermediate output elements from spilling to the non-transitory computer readable storage media of the respective mapper node. 14. The method of claim 13, wherein key objects are serializable. 15. A method of performing a map reduce sequence in connection with a plurality of computer nodes in a distributed network system, each said node including at least one processor and both transitory and non-transitory computer readable storage media, wherein the nodes are divided into at least mapper nodes and reducer nodes, the method comprising at each said reducer node:
retrieving at least intermediate output element values from the transitory computer readable storage media of a given mapper node, based on map task and reduce task identifiers specified by electronic instructions received at the respective reducer node; storing the retrieved intermediate output element values to the transitory computer readable storage medium of the respective reducer node; ordering the retrieved intermediate output element values; executing a reduce function, using the at least one processor of the respective reducer node, on the retrieved and ordered intermediate output element values; and outputting a result from the reduce function for the map reduce sequence, wherein each said intermediate output element includes a first key-value pair, each intermediate output element key includes an associated map task identifier and an associated reduce task identifier, and each intermediate output element value includes substantive data that is generated by a map reduce function and organized as a second key-value pair. 16. A computer system configured to perform a map reduce sequence, comprising:
a plurality of computer nodes, each said node including at least one processor and a transitory computer readable storage medium, wherein the nodes are divided into at least mapper nodes and reducer nodes; wherein each said mapper node is configured to:
execute, using the at least one processor of the respective mapper node, a map function on input to generate intermediate output elements, each said intermediate output element including a first key-value pair, each intermediate output element key including an associated map task identifier and an associated reduce task identifier, and each intermediate output element value including substantive data generated from the input by the map function, and
store the intermediate output elements to the transitory computer readable storage medium of the respective mapper node; and
wherein each said reducer node is configured to, upon receipt of electronic instructions:
retrieve at least intermediate output element values from the transitory computer readable storage media of a given mapper node, based on map task and reduce task identifiers specified by the electronic instructions,
store the retrieved intermediate output element values to the transitory computer readable storage medium of the respective reducer node,
execute a reduce function, using the at least one processor of the respective reducer node, on the retrieved intermediate output element values, in order, and
output a result from the reduce function for the map reduce sequence. 17. The system of claim 16, wherein the substantive data of each intermediate output element is organized as a second key-value pair. 18. The system of claim 17, wherein key objects are serializable. 19. The system of claim 16, wherein the transitory computer readable storage medium of each said node is controlled by an in-memory data grid (IMDG) client. 20. The system of claim 19, wherein:
each said mapper node is further configured to replicate intermediate output elements to an in-memory data grid (IMDG) server; and the reducer nodes are further configured to retrieve intermediate output element values from the IMDG server in response to the given node from which the intermediate output element values are to be retrieved being inaccessible. 21. The system of claim 16, wherein the mapper nodes are further configured to:
hold the intermediate output elements in memory; and prevent the intermediate output elements from spilling to non-transitory computer readable storage media. 22. The system of claim 21, wherein the memory is direct off-heap memory. 23. The system of claim 16, wherein the reducer nodes are further configured to execute reduce functions once intermediate output element values have been retrieved and sorted. 24. A non-transitory computer readable storage medium tangibly storing instructions that, when executed, perform the method of claim 13. 25. A non-transitory computer readable storage medium tangibly storing instructions that, when executed, perform the method of claim 15. | 2,100 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.